./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash fe0bb53bbd87104e98f495a7bffebf6530e8ec16 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: SMTManager must not be locked at the beginning of synthesis --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:34:13,491 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:34:13,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:34:13,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:34:13,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:34:13,517 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:34:13,519 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:34:13,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:34:13,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:34:13,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:34:13,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:34:13,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:34:13,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:34:13,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:34:13,541 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:34:13,543 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:34:13,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:34:13,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:34:13,549 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:34:13,555 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:34:13,559 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:34:13,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:34:13,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:34:13,564 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:34:13,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:34:13,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:34:13,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:34:13,569 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:34:13,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:34:13,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:34:13,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:34:13,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:34:13,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:34:13,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:34:13,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:34:13,576 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:34:13,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:34:13,577 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:34:13,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:34:13,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:34:13,584 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:34:13,585 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 20:34:13,625 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:34:13,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:34:13,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:34:13,629 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:34:13,629 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:34:13,629 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 20:34:13,630 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 20:34:13,630 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 20:34:13,630 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 20:34:13,630 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 20:34:13,630 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 20:34:13,634 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:34:13,634 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:34:13,634 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:34:13,635 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:34:13,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 20:34:13,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 20:34:13,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 20:34:13,636 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 20:34:13,636 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 20:34:13,636 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:34:13,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 20:34:13,638 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:34:13,638 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:34:13,639 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 20:34:13,639 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:34:13,639 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:34:13,639 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:34:13,640 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 20:34:13,641 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 20:34:13,641 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(F end) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fe0bb53bbd87104e98f495a7bffebf6530e8ec16 [2019-11-28 20:34:13,959 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:34:13,971 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:34:13,974 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:34:13,976 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:34:13,977 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:34:13,977 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2019-11-28 20:34:14,040 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3397b6324/83aec1f89a044ddbb89323c079881789/FLAG5150e24c7 [2019-11-28 20:34:14,506 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:34:14,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2019-11-28 20:34:14,520 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3397b6324/83aec1f89a044ddbb89323c079881789/FLAG5150e24c7 [2019-11-28 20:34:14,889 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3397b6324/83aec1f89a044ddbb89323c079881789 [2019-11-28 20:34:14,893 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:34:14,895 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 20:34:14,896 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:34:14,896 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:34:14,900 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:34:14,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:34:14" (1/1) ... [2019-11-28 20:34:14,904 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7261e065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:14, skipping insertion in model container [2019-11-28 20:34:14,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:34:14" (1/1) ... [2019-11-28 20:34:14,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:34:14,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:34:15,370 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:34:15,381 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:34:15,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:34:15,499 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:34:15,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:15 WrapperNode [2019-11-28 20:34:15,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:34:15,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 20:34:15,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 20:34:15,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 20:34:15,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:15" (1/1) ... [2019-11-28 20:34:15,529 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:15" (1/1) ... [2019-11-28 20:34:15,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 20:34:15,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:34:15,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:34:15,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:34:15,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:15" (1/1) ... [2019-11-28 20:34:15,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:15" (1/1) ... [2019-11-28 20:34:15,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:15" (1/1) ... [2019-11-28 20:34:15,566 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:15" (1/1) ... [2019-11-28 20:34:15,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:15" (1/1) ... [2019-11-28 20:34:15,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:15" (1/1) ... [2019-11-28 20:34:15,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:15" (1/1) ... [2019-11-28 20:34:15,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:34:15,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:34:15,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:34:15,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:34:15,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 20:34:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 20:34:15,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 20:34:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:34:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:34:15,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:34:15,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:34:16,026 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:34:16,026 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 20:34:16,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:34:16 BoogieIcfgContainer [2019-11-28 20:34:16,028 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:34:16,028 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 20:34:16,029 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 20:34:16,032 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 20:34:16,033 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:16,033 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 08:34:14" (1/3) ... [2019-11-28 20:34:16,035 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26f0ebc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:34:16, skipping insertion in model container [2019-11-28 20:34:16,035 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:16,035 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:34:15" (2/3) ... [2019-11-28 20:34:16,035 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26f0ebc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 08:34:16, skipping insertion in model container [2019-11-28 20:34:16,036 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 20:34:16,036 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:34:16" (3/3) ... [2019-11-28 20:34:16,037 INFO L371 chiAutomizerObserver]: Analyzing ICFG fermat-alloca.i [2019-11-28 20:34:16,091 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 20:34:16,092 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 20:34:16,092 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 20:34:16,092 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:34:16,092 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:34:16,093 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 20:34:16,093 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:34:16,093 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 20:34:16,105 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-28 20:34:16,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:34:16,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:16,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:16,132 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:34:16,133 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:34:16,133 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 20:34:16,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-28 20:34:16,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 20:34:16,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 20:34:16,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 20:34:16,135 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 20:34:16,135 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:34:16,142 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 7#L-1true havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~mem6, main_#t~mem7, main_#t~mem8, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem13, main_#t~mem14, main_#t~mem15, main_#t~post16, main_#t~mem17, main_#t~mem18, main_#t~mem19, main_#t~post20, main_#t~mem21, main_#t~mem22, main_#t~mem23, main_#t~post24, main_#t~mem25, main_#t~mem26, main_~MAX~0.base, main_~MAX~0.offset, main_~a~0.base, main_~a~0.offset, main_~b~0.base, main_~b~0.offset, main_~c~0.base, main_~c~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~MAX~0.base, main_~MAX~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~a~0.base, main_~a~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);main_~b~0.base, main_~b~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnStack(4);main_~c~0.base, main_~c~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;call write~int(1000, main_~MAX~0.base, main_~MAX~0.offset, 4);call write~int(1, main_~a~0.base, main_~a~0.offset, 4);call write~int(1, main_~b~0.base, main_~b~0.offset, 4);call write~int(1, main_~c~0.base, main_~c~0.offset, 4); 6#L556-2true [2019-11-28 20:34:16,142 INFO L796 eck$LassoCheckResult]: Loop: 6#L556-2true assume !false;call main_#t~mem6 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem7 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem8 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem9 := read~int(main_~b~0.base, main_~b~0.offset, 4);call main_#t~mem10 := read~int(main_~b~0.base, main_~b~0.offset, 4);call main_#t~mem11 := read~int(main_~b~0.base, main_~b~0.offset, 4);call main_#t~mem12 := read~int(main_~c~0.base, main_~c~0.offset, 4);call main_#t~mem13 := read~int(main_~c~0.base, main_~c~0.offset, 4);call main_#t~mem14 := read~int(main_~c~0.base, main_~c~0.offset, 4); 4#L557true assume !(main_#t~mem6 * main_#t~mem7 * main_#t~mem8 == main_#t~mem9 * main_#t~mem10 * main_#t~mem11 + main_#t~mem12 * main_#t~mem13 * main_#t~mem14);havoc main_#t~mem11;havoc main_#t~mem6;havoc main_#t~mem12;havoc main_#t~mem9;havoc main_#t~mem8;havoc main_#t~mem10;havoc main_#t~mem14;havoc main_#t~mem7;havoc main_#t~mem13;call main_#t~mem15 := read~int(main_~a~0.base, main_~a~0.offset, 4);main_#t~post16 := main_#t~mem15;call write~int(1 + main_#t~post16, main_~a~0.base, main_~a~0.offset, 4);havoc main_#t~post16;havoc main_#t~mem15;call main_#t~mem17 := read~int(main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem18 := read~int(main_~MAX~0.base, main_~MAX~0.offset, 4); 13#L561true assume main_#t~mem17 > main_#t~mem18;havoc main_#t~mem17;havoc main_#t~mem18;call write~int(1, main_~a~0.base, main_~a~0.offset, 4);call main_#t~mem19 := read~int(main_~b~0.base, main_~b~0.offset, 4);main_#t~post20 := main_#t~mem19;call write~int(1 + main_#t~post20, main_~b~0.base, main_~b~0.offset, 4);havoc main_#t~mem19;havoc main_#t~post20; 15#L561-2true call main_#t~mem21 := read~int(main_~b~0.base, main_~b~0.offset, 4);call main_#t~mem22 := read~int(main_~MAX~0.base, main_~MAX~0.offset, 4); 5#L565true assume main_#t~mem21 > main_#t~mem22;havoc main_#t~mem21;havoc main_#t~mem22;call write~int(1, main_~b~0.base, main_~b~0.offset, 4);call main_#t~mem23 := read~int(main_~c~0.base, main_~c~0.offset, 4);main_#t~post24 := main_#t~mem23;call write~int(1 + main_#t~post24, main_~c~0.base, main_~c~0.offset, 4);havoc main_#t~post24;havoc main_#t~mem23; 10#L565-2true call main_#t~mem25 := read~int(main_~c~0.base, main_~c~0.offset, 4);call main_#t~mem26 := read~int(main_~MAX~0.base, main_~MAX~0.offset, 4); 3#L569true assume !(main_#t~mem25 > main_#t~mem26);havoc main_#t~mem26;havoc main_#t~mem25; 6#L556-2true [2019-11-28 20:34:16,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:16,148 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 20:34:16,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:16,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619140786] [2019-11-28 20:34:16,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:16,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:16,389 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:16,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:16,391 INFO L82 PathProgramCache]: Analyzing trace with hash -903226603, now seen corresponding path program 1 times [2019-11-28 20:34:16,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:16,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900462947] [2019-11-28 20:34:16,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:16,403 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 20:34:16,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1562516771] [2019-11-28 20:34:16,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:34:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:34:16,542 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:34:16,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:34:16,544 INFO L82 PathProgramCache]: Analyzing trace with hash 643070227, now seen corresponding path program 1 times [2019-11-28 20:34:16,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:34:16,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668806285] [2019-11-28 20:34:16,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:34:16,564 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 20:34:16,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1586796912] [2019-11-28 20:34:16,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 20:34:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:34:16,694 INFO L264 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 20:34:16,701 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:34:16,815 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2019-11-28 20:34:16,816 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:34:16,865 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:16,996 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 27 [2019-11-28 20:34:16,997 INFO L343 Elim1Store]: treesize reduction 53, result has 50.0 percent of original size [2019-11-28 20:34:16,998 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 123 treesize of output 60 [2019-11-28 20:34:17,000 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:34:17,092 INFO L614 ElimStorePlain]: treesize reduction 24, result has 71.4 percent of original size [2019-11-28 20:34:17,094 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:34:17,094 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:150, output treesize:52 [2019-11-28 20:34:17,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:34:17,184 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:34:17,225 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:17,226 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 67 [2019-11-28 20:34:17,231 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:34:17,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:34:17,357 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:17,358 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 137 [2019-11-28 20:34:17,363 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:34:17,419 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:17,420 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 85 [2019-11-28 20:34:17,422 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 20:34:17,755 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-11-28 20:34:17,756 INFO L614 ElimStorePlain]: treesize reduction 172, result has 44.9 percent of original size [2019-11-28 20:34:17,757 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-28 20:34:17,758 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:179, output treesize:140 [2019-11-28 20:34:17,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:34:17,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:17,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:17,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:17,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:17,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:17,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:17,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:17,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:17,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:17,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:17,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:17,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:17,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:17,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:17,945 INFO L430 ElimStorePlain]: Different costs {12=[v_prenex_2], 18=[v_prenex_1], 28=[|v_#memory_int_19|]} [2019-11-28 20:34:17,953 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 20:34:17,954 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 20:34:17,956 WARN L213 Elim1Store]: Array PQE input equivalent to false [2019-11-28 20:34:17,956 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:34:18,094 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2019-11-28 20:34:18,117 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 20:34:18,143 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 20:34:18,207 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2019-11-28 20:34:18,207 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 20:34:18,217 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:18,218 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:34:18,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:34:18,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:34:18,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 23 [2019-11-28 20:34:18,329 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 20:34:18,342 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 20:34:18,438 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:34:18,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 92 treesize of output 152 [2019-11-28 20:34:18,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:34:18,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:34:18,801 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 20:34:18,803 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 20:34:18,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668806285] [2019-11-28 20:34:18,823 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-28 20:34:18,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586796912] [2019-11-28 20:34:18,823 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@349c9529 [2019-11-28 20:34:18,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:34:18,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-11-28 20:34:18,828 ERROR L206 FreeRefinementEngine]: Strategy CAMEL failed to provide any proof altough trace is infeasible [2019-11-28 20:34:23,056 WARN L192 SmtUtils]: Spent 4.22 s on a formula simplification that was a NOOP. DAG size: 123 [2019-11-28 20:34:39,814 WARN L192 SmtUtils]: Spent 16.75 s on a formula simplification that was a NOOP. DAG size: 84 [2019-11-28 20:34:41,704 WARN L192 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 115 DAG size of output: 89 [2019-11-28 20:34:42,646 WARN L192 SmtUtils]: Spent 940.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-11-28 20:34:42,647 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: SMTManager must not be locked at the beginning of synthesis at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:542) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-28 20:34:42,652 INFO L168 Benchmark]: Toolchain (without parser) took 27756.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -132.7 MB). Peak memory consumption was 308.5 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:42,652 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:34:42,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 604.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -149.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:42,654 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.10 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-11-28 20:34:42,658 INFO L168 Benchmark]: Boogie Preprocessor took 34.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:42,660 INFO L168 Benchmark]: RCFGBuilder took 441.17 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: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:42,661 INFO L168 Benchmark]: BuchiAutomizer took 26620.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.4 MB). Peak memory consumption was 302.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:34:42,667 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 604.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.8 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -149.9 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.10 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. * Boogie Preprocessor took 34.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 441.17 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: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 26620.86 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -14.4 MB). Peak memory consumption was 302.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: SMTManager must not be locked at the beginning of synthesis de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: SMTManager must not be locked at the beginning of synthesis: de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:542) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...