./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i --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_d350c857-7e63-4037-a01d-897f0c2ab253/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/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 27142e71f3089c5c3b5bf4f358882e993f701ffc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:59:41,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:59:41,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:59:41,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:59:41,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:59:41,166 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:59:41,167 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:59:41,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:59:41,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:59:41,170 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:59:41,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:59:41,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:59:41,172 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:59:41,173 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:59:41,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:59:41,174 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:59:41,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:59:41,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:59:41,177 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:59:41,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:59:41,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:59:41,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:59:41,180 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:59:41,181 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:59:41,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:59:41,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:59:41,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:59:41,183 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:59:41,183 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:59:41,184 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:59:41,184 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:59:41,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:59:41,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:59:41,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:59:41,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:59:41,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:59:41,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:59:41,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:59:41,187 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:59:41,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:59:41,187 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:59:41,188 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:59:41,197 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:59:41,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:59:41,198 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:59:41,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:59:41,198 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:59:41,198 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:59:41,198 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:59:41,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:59:41,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:59:41,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:59:41,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:59:41,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:59:41,199 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:59:41,199 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:59:41,199 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:59:41,199 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:59:41,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:59:41,199 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:59:41,199 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:59:41,199 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:59:41,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:59:41,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:59:41,200 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:59:41,200 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:59:41,200 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:59:41,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:59:41,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:59:41,200 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:59:41,200 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:59:41,201 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_d350c857-7e63-4037-a01d-897f0c2ab253/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 -> 27142e71f3089c5c3b5bf4f358882e993f701ffc [2019-12-07 17:59:41,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:59:41,308 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:59:41,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:59:41,311 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:59:41,312 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:59:41,312 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/bin/uautomizer/../../sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2019-12-07 17:59:41,352 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/bin/uautomizer/data/82bab20c8/79552d78dc0c4bae956b2c320fd684ff/FLAGd7a8e5859 [2019-12-07 17:59:41,727 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:59:41,728 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/sv-benchmarks/c/list-ext3-properties/sll_nondet_insert-1.i [2019-12-07 17:59:41,737 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/bin/uautomizer/data/82bab20c8/79552d78dc0c4bae956b2c320fd684ff/FLAGd7a8e5859 [2019-12-07 17:59:42,121 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/bin/uautomizer/data/82bab20c8/79552d78dc0c4bae956b2c320fd684ff [2019-12-07 17:59:42,123 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:59:42,125 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:59:42,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:59:42,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:59:42,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:59:42,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:59:42" (1/1) ... [2019-12-07 17:59:42,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7559db5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:59:42, skipping insertion in model container [2019-12-07 17:59:42,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:59:42" (1/1) ... [2019-12-07 17:59:42,141 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:59:42,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:59:42,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:59:42,385 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:59:42,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:59:42,449 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:59:42,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:59:42 WrapperNode [2019-12-07 17:59:42,449 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:59:42,450 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:59:42,450 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:59:42,450 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:59:42,455 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:59:42" (1/1) ... [2019-12-07 17:59:42,465 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:59:42" (1/1) ... [2019-12-07 17:59:42,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:59:42,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:59:42,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:59:42,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:59:42,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:59:42" (1/1) ... [2019-12-07 17:59:42,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:59:42" (1/1) ... [2019-12-07 17:59:42,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:59:42" (1/1) ... [2019-12-07 17:59:42,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:59:42" (1/1) ... [2019-12-07 17:59:42,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:59:42" (1/1) ... [2019-12-07 17:59:42,501 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:59:42" (1/1) ... [2019-12-07 17:59:42,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:59:42" (1/1) ... [2019-12-07 17:59:42,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:59:42,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:59:42,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:59:42,506 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:59:42,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:59:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:59:42,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:59:42,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:59:42,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:59:42,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:59:42,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:59:42,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-07 17:59:42,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:59:42,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:59:42,772 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:59:42,773 INFO L287 CfgBuilder]: Removed 30 assume(true) statements. [2019-12-07 17:59:42,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:59:42 BoogieIcfgContainer [2019-12-07 17:59:42,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:59:42,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:59:42,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:59:42,776 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:59:42,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:59:42" (1/3) ... [2019-12-07 17:59:42,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf180e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:59:42, skipping insertion in model container [2019-12-07 17:59:42,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:59:42" (2/3) ... [2019-12-07 17:59:42,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cf180e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:59:42, skipping insertion in model container [2019-12-07 17:59:42,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:59:42" (3/3) ... [2019-12-07 17:59:42,778 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_nondet_insert-1.i [2019-12-07 17:59:42,784 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:59:42,788 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:59:42,796 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:59:42,810 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:59:42,810 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:59:42,810 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:59:42,810 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:59:42,810 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:59:42,811 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:59:42,811 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:59:42,811 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:59:42,820 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-12-07 17:59:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:59:42,824 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:42,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:59:42,825 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:42,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:42,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1240059524, now seen corresponding path program 1 times [2019-12-07 17:59:42,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:59:42,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026620118] [2019-12-07 17:59:42,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:59:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:42,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026620118] [2019-12-07 17:59:42,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:42,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:59:42,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585063309] [2019-12-07 17:59:42,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 17:59:42,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:59:42,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 17:59:42,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 17:59:42,930 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-12-07 17:59:42,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:42,944 INFO L93 Difference]: Finished difference Result 89 states and 132 transitions. [2019-12-07 17:59:42,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 17:59:42,945 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-12-07 17:59:42,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:42,951 INFO L225 Difference]: With dead ends: 89 [2019-12-07 17:59:42,952 INFO L226 Difference]: Without dead ends: 40 [2019-12-07 17:59:42,954 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 17:59:42,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-12-07 17:59:42,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-12-07 17:59:42,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 17:59:42,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2019-12-07 17:59:42,977 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 18 [2019-12-07 17:59:42,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:42,977 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-12-07 17:59:42,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 17:59:42,977 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2019-12-07 17:59:42,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:59:42,978 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:42,978 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] [2019-12-07 17:59:42,978 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:42,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:42,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1466688541, now seen corresponding path program 1 times [2019-12-07 17:59:42,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:59:42,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591300948] [2019-12-07 17:59:42,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:59:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:43,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:43,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591300948] [2019-12-07 17:59:43,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:43,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:59:43,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796439546] [2019-12-07 17:59:43,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:59:43,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:59:43,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:59:43,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:59:43,055 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand 6 states. [2019-12-07 17:59:43,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:43,130 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2019-12-07 17:59:43,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:59:43,130 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-07 17:59:43,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:43,131 INFO L225 Difference]: With dead ends: 82 [2019-12-07 17:59:43,131 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 17:59:43,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:59:43,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 17:59:43,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2019-12-07 17:59:43,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 17:59:43,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2019-12-07 17:59:43,137 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 25 [2019-12-07 17:59:43,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:43,138 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-12-07 17:59:43,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:59:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2019-12-07 17:59:43,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:59:43,138 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:43,139 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] [2019-12-07 17:59:43,139 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:43,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:43,139 INFO L82 PathProgramCache]: Analyzing trace with hash -395195180, now seen corresponding path program 1 times [2019-12-07 17:59:43,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:59:43,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039689724] [2019-12-07 17:59:43,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:59:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:43,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:43,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039689724] [2019-12-07 17:59:43,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519272441] [2019-12-07 17:59:43,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:59:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:43,256 INFO L264 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:59:43,260 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:43,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:59:43,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2019-12-07 17:59:43,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067751944] [2019-12-07 17:59:43,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:59:43,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:59:43,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:59:43,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:59:43,285 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 7 states. [2019-12-07 17:59:43,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:43,355 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2019-12-07 17:59:43,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:59:43,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-12-07 17:59:43,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:43,357 INFO L225 Difference]: With dead ends: 84 [2019-12-07 17:59:43,357 INFO L226 Difference]: Without dead ends: 55 [2019-12-07 17:59:43,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:59:43,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-12-07 17:59:43,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-12-07 17:59:43,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 17:59:43,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 53 transitions. [2019-12-07 17:59:43,362 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 53 transitions. Word has length 28 [2019-12-07 17:59:43,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:43,362 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 53 transitions. [2019-12-07 17:59:43,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:59:43,362 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 53 transitions. [2019-12-07 17:59:43,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 17:59:43,363 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:43,363 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:59:43,564 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:59:43,564 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:43,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:43,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1510946244, now seen corresponding path program 1 times [2019-12-07 17:59:43,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:59:43,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10787989] [2019-12-07 17:59:43,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:59:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:43,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:43,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10787989] [2019-12-07 17:59:43,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:43,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:59:43,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311692929] [2019-12-07 17:59:43,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:59:43,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:59:43,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:59:43,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:59:43,670 INFO L87 Difference]: Start difference. First operand 42 states and 53 transitions. Second operand 8 states. [2019-12-07 17:59:43,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:43,763 INFO L93 Difference]: Finished difference Result 70 states and 86 transitions. [2019-12-07 17:59:43,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:59:43,763 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-07 17:59:43,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:43,764 INFO L225 Difference]: With dead ends: 70 [2019-12-07 17:59:43,764 INFO L226 Difference]: Without dead ends: 65 [2019-12-07 17:59:43,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:59:43,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-12-07 17:59:43,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 47. [2019-12-07 17:59:43,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 17:59:43,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 60 transitions. [2019-12-07 17:59:43,771 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 60 transitions. Word has length 29 [2019-12-07 17:59:43,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:43,771 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 60 transitions. [2019-12-07 17:59:43,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:59:43,771 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2019-12-07 17:59:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 17:59:43,772 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:43,772 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:59:43,772 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:43,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:43,772 INFO L82 PathProgramCache]: Analyzing trace with hash -353652332, now seen corresponding path program 1 times [2019-12-07 17:59:43,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:59:43,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785502270] [2019-12-07 17:59:43,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:59:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:43,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:59:43,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785502270] [2019-12-07 17:59:43,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701812046] [2019-12-07 17:59:43,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:59:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:43,870 INFO L264 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 17:59:43,872 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:43,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:59:43,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:59:43,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-12-07 17:59:43,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626763212] [2019-12-07 17:59:43,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:59:43,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:59:43,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:59:43,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:59:43,891 INFO L87 Difference]: Start difference. First operand 47 states and 60 transitions. Second operand 8 states. [2019-12-07 17:59:44,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:44,011 INFO L93 Difference]: Finished difference Result 102 states and 130 transitions. [2019-12-07 17:59:44,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:59:44,011 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-12-07 17:59:44,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:44,012 INFO L225 Difference]: With dead ends: 102 [2019-12-07 17:59:44,012 INFO L226 Difference]: Without dead ends: 68 [2019-12-07 17:59:44,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:59:44,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-12-07 17:59:44,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 51. [2019-12-07 17:59:44,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-12-07 17:59:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 64 transitions. [2019-12-07 17:59:44,018 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 64 transitions. Word has length 30 [2019-12-07 17:59:44,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:44,018 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-12-07 17:59:44,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:59:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 64 transitions. [2019-12-07 17:59:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:59:44,019 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:44,019 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:59:44,220 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:59:44,221 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:44,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:44,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1806454861, now seen corresponding path program 2 times [2019-12-07 17:59:44,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:59:44,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224774859] [2019-12-07 17:59:44,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:59:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:44,339 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:44,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224774859] [2019-12-07 17:59:44,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605206048] [2019-12-07 17:59:44,339 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:59:44,390 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 17:59:44,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:59:44,391 INFO L264 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 17:59:44,393 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:44,417 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 11 treesize of output 7 [2019-12-07 17:59:44,418 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:44,422 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:44,423 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 17:59:44,423 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-12-07 17:59:44,429 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 24 treesize of output 16 [2019-12-07 17:59:44,430 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:44,433 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:44,434 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 17:59:44,434 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2019-12-07 17:59:44,460 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:44,461 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2019-12-07 17:59:44,461 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:44,462 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:44,462 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:44,463 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:24, output treesize:4 [2019-12-07 17:59:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:44,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:59:44,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-12-07 17:59:44,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994302704] [2019-12-07 17:59:44,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:59:44,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:59:44,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:59:44,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:59:44,466 INFO L87 Difference]: Start difference. First operand 51 states and 64 transitions. Second operand 11 states. [2019-12-07 17:59:44,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:44,678 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2019-12-07 17:59:44,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:59:44,678 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2019-12-07 17:59:44,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:44,679 INFO L225 Difference]: With dead ends: 75 [2019-12-07 17:59:44,679 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 17:59:44,679 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:59:44,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 17:59:44,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2019-12-07 17:59:44,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-12-07 17:59:44,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2019-12-07 17:59:44,685 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 34 [2019-12-07 17:59:44,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:44,686 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-12-07 17:59:44,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:59:44,686 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2019-12-07 17:59:44,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:59:44,686 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:44,686 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:59:44,887 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:59:44,888 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:44,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:44,889 INFO L82 PathProgramCache]: Analyzing trace with hash 217180203, now seen corresponding path program 3 times [2019-12-07 17:59:44,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:59:44,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489002117] [2019-12-07 17:59:44,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:59:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:45,114 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 17:59:45,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489002117] [2019-12-07 17:59:45,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734371525] [2019-12-07 17:59:45,115 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:59:45,154 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-12-07 17:59:45,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:59:45,155 INFO L264 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 17:59:45,157 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:45,226 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-12-07 17:59:45,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:59:45,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2019-12-07 17:59:45,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396322604] [2019-12-07 17:59:45,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 17:59:45,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:59:45,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 17:59:45,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-12-07 17:59:45,227 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand 17 states. [2019-12-07 17:59:45,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:45,533 INFO L93 Difference]: Finished difference Result 213 states and 262 transitions. [2019-12-07 17:59:45,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 17:59:45,534 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2019-12-07 17:59:45,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:45,535 INFO L225 Difference]: With dead ends: 213 [2019-12-07 17:59:45,535 INFO L226 Difference]: Without dead ends: 205 [2019-12-07 17:59:45,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-12-07 17:59:45,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2019-12-07 17:59:45,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 97. [2019-12-07 17:59:45,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 17:59:45,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2019-12-07 17:59:45,549 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 35 [2019-12-07 17:59:45,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:45,549 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2019-12-07 17:59:45,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 17:59:45,549 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2019-12-07 17:59:45,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 17:59:45,550 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:45,551 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:59:45,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:59:45,752 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:45,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:45,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1805693939, now seen corresponding path program 4 times [2019-12-07 17:59:45,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:59:45,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810566449] [2019-12-07 17:59:45,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:59:45,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:45,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810566449] [2019-12-07 17:59:45,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969988037] [2019-12-07 17:59:45,991 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:59:46,031 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 17:59:46,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 17:59:46,033 INFO L264 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 60 conjunts are in the unsatisfiable core [2019-12-07 17:59:46,035 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:46,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 17:59:46,040 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:46,046 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:46,047 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:46,047 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-12-07 17:59:46,069 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 11 treesize of output 7 [2019-12-07 17:59:46,070 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:46,076 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:46,079 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 11 treesize of output 7 [2019-12-07 17:59:46,079 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:46,085 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:46,085 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:46,085 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2019-12-07 17:59:46,116 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:46,116 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 11 treesize of output 15 [2019-12-07 17:59:46,117 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:46,123 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:46,123 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:46,123 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-12-07 17:59:46,149 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 19 treesize of output 18 [2019-12-07 17:59:46,149 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:46,167 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:46,169 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 19 treesize of output 18 [2019-12-07 17:59:46,170 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:46,178 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:46,179 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:46,179 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:41 [2019-12-07 17:59:46,410 INFO L343 Elim1Store]: treesize reduction 8, result has 92.9 percent of original size [2019-12-07 17:59:46,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 120 treesize of output 163 [2019-12-07 17:59:46,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:46,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,717 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 17:59:46,771 INFO L614 ElimStorePlain]: treesize reduction 92, result has 45.6 percent of original size [2019-12-07 17:59:46,800 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:46,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 104 [2019-12-07 17:59:46,801 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:46,825 INFO L614 ElimStorePlain]: treesize reduction 12, result has 72.7 percent of original size [2019-12-07 17:59:46,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:59:46,827 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:46,827 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:127, output treesize:7 [2019-12-07 17:59:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:46,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:59:46,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 20 [2019-12-07 17:59:46,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849852623] [2019-12-07 17:59:46,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-07 17:59:46,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:59:46,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-07 17:59:46,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-12-07 17:59:46,836 INFO L87 Difference]: Start difference. First operand 97 states and 125 transitions. Second operand 20 states. [2019-12-07 17:59:47,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:47,246 INFO L93 Difference]: Finished difference Result 168 states and 212 transitions. [2019-12-07 17:59:47,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:59:47,246 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2019-12-07 17:59:47,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:47,247 INFO L225 Difference]: With dead ends: 168 [2019-12-07 17:59:47,248 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 17:59:47,248 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2019-12-07 17:59:47,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 17:59:47,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 129. [2019-12-07 17:59:47,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 17:59:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 166 transitions. [2019-12-07 17:59:47,261 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 166 transitions. Word has length 36 [2019-12-07 17:59:47,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:47,262 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 166 transitions. [2019-12-07 17:59:47,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-07 17:59:47,262 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 166 transitions. [2019-12-07 17:59:47,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 17:59:47,263 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:47,263 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:59:47,463 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:59:47,464 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:47,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:47,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1169066102, now seen corresponding path program 1 times [2019-12-07 17:59:47,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:59:47,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377432420] [2019-12-07 17:59:47,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:59:47,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:47,519 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:59:47,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377432420] [2019-12-07 17:59:47,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9241606] [2019-12-07 17:59:47,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:59:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:47,567 INFO L264 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 17:59:47,569 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:47,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:59:47,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:59:47,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-12-07 17:59:47,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800972825] [2019-12-07 17:59:47,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:59:47,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:59:47,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:59:47,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:59:47,600 INFO L87 Difference]: Start difference. First operand 129 states and 166 transitions. Second operand 11 states. [2019-12-07 17:59:47,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:47,823 INFO L93 Difference]: Finished difference Result 375 states and 494 transitions. [2019-12-07 17:59:47,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 17:59:47,823 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-12-07 17:59:47,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:47,826 INFO L225 Difference]: With dead ends: 375 [2019-12-07 17:59:47,826 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 17:59:47,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2019-12-07 17:59:47,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 17:59:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 141. [2019-12-07 17:59:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-12-07 17:59:47,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 178 transitions. [2019-12-07 17:59:47,846 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 178 transitions. Word has length 38 [2019-12-07 17:59:47,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:47,846 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 178 transitions. [2019-12-07 17:59:47,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:59:47,846 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 178 transitions. [2019-12-07 17:59:47,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 17:59:47,847 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:47,847 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:59:48,047 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:59:48,047 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:48,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:48,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1846037516, now seen corresponding path program 1 times [2019-12-07 17:59:48,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:59:48,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581200091] [2019-12-07 17:59:48,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:59:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:48,095 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:59:48,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581200091] [2019-12-07 17:59:48,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118491784] [2019-12-07 17:59:48,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:59:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:48,138 INFO L264 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 17:59:48,140 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:48,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:59:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:59:48,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:59:48,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2019-12-07 17:59:48,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840284509] [2019-12-07 17:59:48,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:59:48,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:59:48,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:59:48,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:59:48,160 INFO L87 Difference]: Start difference. First operand 141 states and 178 transitions. Second operand 7 states. [2019-12-07 17:59:48,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:48,294 INFO L93 Difference]: Finished difference Result 273 states and 348 transitions. [2019-12-07 17:59:48,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:59:48,295 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-12-07 17:59:48,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:48,296 INFO L225 Difference]: With dead ends: 273 [2019-12-07 17:59:48,296 INFO L226 Difference]: Without dead ends: 241 [2019-12-07 17:59:48,297 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:59:48,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-12-07 17:59:48,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 157. [2019-12-07 17:59:48,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-12-07 17:59:48,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 198 transitions. [2019-12-07 17:59:48,308 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 198 transitions. Word has length 38 [2019-12-07 17:59:48,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:48,308 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 198 transitions. [2019-12-07 17:59:48,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:59:48,308 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 198 transitions. [2019-12-07 17:59:48,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 17:59:48,309 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:48,309 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:59:48,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:59:48,510 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:48,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:48,510 INFO L82 PathProgramCache]: Analyzing trace with hash -2055902770, now seen corresponding path program 1 times [2019-12-07 17:59:48,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:59:48,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938943031] [2019-12-07 17:59:48,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:59:48,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:59:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:59:48,550 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:59:48,550 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:59:48,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:59:48 BoogieIcfgContainer [2019-12-07 17:59:48,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:59:48,582 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:59:48,582 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:59:48,582 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:59:48,582 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:59:42" (3/4) ... [2019-12-07 17:59:48,584 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:59:48,620 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d350c857-7e63-4037-a01d-897f0c2ab253/bin/uautomizer/witness.graphml [2019-12-07 17:59:48,620 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:59:48,621 INFO L168 Benchmark]: Toolchain (without parser) took 6496.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 175.6 MB). Free memory was 939.4 MB in the beginning and 860.8 MB in the end (delta: 78.6 MB). Peak memory consumption was 254.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:59:48,621 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:59:48,622 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -165.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:59:48,622 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.48 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:59:48,622 INFO L168 Benchmark]: Boogie Preprocessor took 22.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:59:48,628 INFO L168 Benchmark]: RCFGBuilder took 267.76 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: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:59:48,628 INFO L168 Benchmark]: TraceAbstraction took 5807.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 861.2 MB in the end (delta: 204.0 MB). Peak memory consumption was 251.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:59:48,628 INFO L168 Benchmark]: Witness Printer took 38.04 ms. Allocated memory is still 1.2 GB. Free memory was 861.2 MB in the beginning and 860.8 MB in the end (delta: 391.1 kB). Peak memory consumption was 391.1 kB. Max. memory is 11.5 GB. [2019-12-07 17:59:48,630 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 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -165.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.48 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 267.76 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: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5807.60 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 861.2 MB in the end (delta: 204.0 MB). Peak memory consumption was 251.7 MB. Max. memory is 11.5 GB. * Witness Printer took 38.04 ms. Allocated memory is still 1.2 GB. Free memory was 861.2 MB in the beginning and 860.8 MB in the end (delta: 391.1 kB). Peak memory consumption was 391.1 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 630]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L609] int len = from; [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; [L616] const int len = _get_nondet_int(2, 5); [L617] SLL s = sll_create(len); [L564] SLL head = ((void *)0); [L565] EXPR len-- [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] new_head->next = head [L571] head = new_head [L565] EXPR len-- [L565] COND TRUE len-- > 0 [L566] SLL new_head = (SLL) malloc(sizeof(struct node)); [L567] COND FALSE !(((void *)0) == new_head) [L570] new_head->next = head [L571] head = new_head [L565] EXPR len-- [L565] COND FALSE !(len-- > 0) [L573] return head; [L617] SLL s = sll_create(len); [L609] int len = from; [L610] len < until && __VERIFIER_nondet_int() [L610] len < until && __VERIFIER_nondet_int() [L610] COND TRUE len < until && __VERIFIER_nondet_int() [L611] len++ [L610] len < until && __VERIFIER_nondet_int() [L610] COND FALSE !(len < until && __VERIFIER_nondet_int()) [L613] return len; [L618] const int k = _get_nondet_int(0, len - 1); [L619] int i = 0; [L620] i < k && __VERIFIER_nondet_int() [L620] i < k && __VERIFIER_nondet_int() [L620] COND FALSE !(i < k && __VERIFIER_nondet_int()) [L625] EXPR \read(s) [L576] int len = 0; [L577] COND TRUE \read(head) [L578] len++ [L579] EXPR head->next [L579] head = head->next [L577] COND TRUE \read(head) [L578] len++ [L579] EXPR head->next [L579] head = head->next [L577] COND FALSE !(\read(head)) [L581] return len; [L625] COND TRUE k + len != sll_length(s) [L630] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 1 error locations. Result: UNSAFE, OverallTime: 5.7s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 504 SDtfs, 1527 SDslu, 2484 SDs, 0 SdLazy, 1177 SolverSat, 157 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 382 GetRequests, 234 SyntacticMatches, 2 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=157occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 441 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 588 NumberOfCodeBlocks, 584 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 533 ConstructedInterpolants, 3 QuantifiedInterpolants, 123694 SizeOfPredicates, 78 NumberOfNonLiveVariables, 1122 ConjunctsInSsa, 170 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 87/138 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...