./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 30f4e4ab 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: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:01:44,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:01:44,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:01:44,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:01:44,299 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:01:44,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:01:44,303 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:01:44,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:01:44,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:01:44,314 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:01:44,316 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:01:44,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:01:44,319 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:01:44,325 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:01:44,326 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:01:44,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:01:44,330 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:01:44,333 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:01:44,336 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:01:44,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:01:44,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:01:44,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:01:44,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:01:44,352 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:01:44,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:01:44,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:01:44,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:01:44,359 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:01:44,360 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:01:44,362 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:01:44,362 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:01:44,363 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:01:44,364 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:01:44,365 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:01:44,367 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:01:44,367 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:01:44,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:01:44,369 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:01:44,369 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:01:44,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:01:44,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:01:44,374 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 03:01:44,396 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:01:44,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:01:44,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:01:44,399 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:01:44,399 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:01:44,399 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:01:44,400 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:01:44,400 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:01:44,401 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:01:44,401 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:01:44,402 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:01:44,402 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:01:44,403 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:01:44,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:01:44,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:01:44,404 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:01:44,404 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:01:44,404 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:01:44,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:01:44,405 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:01:44,406 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:01:44,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:01:44,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:01:44,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:01:44,407 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:01:44,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:01:44,407 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:01:44,408 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:01:44,409 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:01:44,409 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 03:01:44,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:01:44,755 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:01:44,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:01:44,760 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:01:44,761 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:01:44,762 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 03:01:44,818 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca701b84/cc458d160c9f4275abe2119d526faeff/FLAG01743f0f7 [2019-11-28 03:01:45,357 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:01:45,361 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/fermat-alloca.i [2019-11-28 03:01:45,383 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca701b84/cc458d160c9f4275abe2119d526faeff/FLAG01743f0f7 [2019-11-28 03:01:45,663 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca701b84/cc458d160c9f4275abe2119d526faeff [2019-11-28 03:01:45,666 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:01:45,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:01:45,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:01:45,670 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:01:45,673 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:01:45,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:01:45" (1/1) ... [2019-11-28 03:01:45,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d2f814c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:45, skipping insertion in model container [2019-11-28 03:01:45,678 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:01:45" (1/1) ... [2019-11-28 03:01:45,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:01:45,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:01:46,166 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:01:46,180 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:01:46,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:01:46,281 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:01:46,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:46 WrapperNode [2019-11-28 03:01:46,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:01:46,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:01:46,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:01:46,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:01:46,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:46" (1/1) ... [2019-11-28 03:01:46,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:46" (1/1) ... [2019-11-28 03:01:46,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:01:46,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:01:46,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:01:46,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:01:46,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:46" (1/1) ... [2019-11-28 03:01:46,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:46" (1/1) ... [2019-11-28 03:01:46,350 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:46" (1/1) ... [2019-11-28 03:01:46,350 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:46" (1/1) ... [2019-11-28 03:01:46,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:46" (1/1) ... [2019-11-28 03:01:46,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:46" (1/1) ... [2019-11-28 03:01:46,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:46" (1/1) ... [2019-11-28 03:01:46,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:01:46,365 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:01:46,365 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:01:46,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:01:46,366 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:46" (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 03:01:46,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:01:46,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:01:46,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:01:46,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:01:46,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:01:46,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:01:46,817 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:01:46,817 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 03:01:46,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:46 BoogieIcfgContainer [2019-11-28 03:01:46,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:01:46,820 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:01:46,820 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:01:46,824 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:01:46,825 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:01:46,825 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:01:45" (1/3) ... [2019-11-28 03:01:46,826 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ab992a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:01:46, skipping insertion in model container [2019-11-28 03:01:46,826 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:01:46,827 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:46" (2/3) ... [2019-11-28 03:01:46,827 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5ab992a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:01:46, skipping insertion in model container [2019-11-28 03:01:46,827 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:01:46,828 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:46" (3/3) ... [2019-11-28 03:01:46,829 INFO L371 chiAutomizerObserver]: Analyzing ICFG fermat-alloca.i [2019-11-28 03:01:46,869 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:01:46,869 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:01:46,869 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:01:46,869 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:01:46,870 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:01:46,870 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:01:46,870 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:01:46,870 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:01:46,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-28 03:01:46,902 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 03:01:46,902 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:01:46,902 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:01:46,908 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:01:46,908 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:01:46,908 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:01:46,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-28 03:01:46,910 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-28 03:01:46,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:01:46,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:01:46,911 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:01:46,911 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:01:46,919 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 03:01:46,920 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~mem10;havoc main_#t~mem13;havoc main_#t~mem6;havoc main_#t~mem9;havoc main_#t~mem11;havoc main_#t~mem14;havoc main_#t~mem8;havoc main_#t~mem12;havoc main_#t~mem7;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~post20;havoc main_#t~mem19; 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~mem23;havoc main_#t~post24; 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 03:01:46,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:46,927 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-28 03:01:46,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:46,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779719023] [2019-11-28 03:01:46,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:47,207 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:47,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:47,209 INFO L82 PathProgramCache]: Analyzing trace with hash -903226603, now seen corresponding path program 1 times [2019-11-28 03:01:47,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:47,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841210121] [2019-11-28 03:01:47,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:47,233 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 03:01:47,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1522351504] [2019-11-28 03:01:47,242 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 03:01:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:47,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:01:47,387 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:01:47,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:01:47,389 INFO L82 PathProgramCache]: Analyzing trace with hash 643070227, now seen corresponding path program 1 times [2019-11-28 03:01:47,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:01:47,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664716513] [2019-11-28 03:01:47,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:01:47,415 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-28 03:01:47,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [83782021] [2019-11-28 03:01:47,416 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 03:01:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:01:47,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-28 03:01:47,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:01:47,597 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 03:01:47,599 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:01:47,650 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:01:47,772 INFO L343 Elim1Store]: treesize reduction 53, result has 50.0 percent of original size [2019-11-28 03:01:47,773 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 03:01:47,774 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:01:47,858 INFO L588 ElimStorePlain]: treesize reduction 24, result has 71.4 percent of original size [2019-11-28 03:01:47,860 INFO L508 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 03:01:47,860 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:150, output treesize:52 [2019-11-28 03:01:47,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:01:47,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:01:48,043 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:01:48,044 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 03:01:48,049 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:01:48,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:01:48,118 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:01:48,119 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 03:01:48,121 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:01:48,181 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:01:48,181 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 03:01:48,184 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 03:01:48,505 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-11-28 03:01:48,506 INFO L588 ElimStorePlain]: treesize reduction 172, result has 44.9 percent of original size [2019-11-28 03:01:48,508 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-28 03:01:48,508 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:179, output treesize:140 [2019-11-28 03:01:48,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 03:01:48,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:48,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:48,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:48,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:48,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:48,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:48,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:48,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:48,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:48,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:48,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:48,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:48,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:48,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:48,691 INFO L404 ElimStorePlain]: Different costs {12=[v_prenex_2], 18=[v_prenex_1], 28=[|v_#memory_int_19|]} [2019-11-28 03:01:48,703 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 03:01:48,704 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 03:01:48,705 WARN L213 Elim1Store]: Array PQE input equivalent to false [2019-11-28 03:01:48,706 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:01:48,843 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 03:01:48,868 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 03:01:48,893 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 03:01:48,946 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 03:01:48,946 INFO L508 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 03:01:48,954 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:01:48,954 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:01:48,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:01:49,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:01:49,058 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 03:01:49,059 INFO L508 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-28 03:01:49,077 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 03:01:49,146 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:01:49,147 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 03:01:49,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:01:49,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 03:01:49,472 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 03:01:49,475 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 03:01:49,486 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:303) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:565) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:478) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:928) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkConcatFeasibility(LassoCheck.java:899) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:832) 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 03:01:49,494 INFO L168 Benchmark]: Toolchain (without parser) took 3824.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 957.7 MB in the beginning and 764.8 MB in the end (delta: 192.9 MB). Peak memory consumption was 294.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:01:49,495 INFO L168 Benchmark]: CDTParser took 0.29 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 03:01:49,497 INFO L168 Benchmark]: CACSL2BoogieTranslator took 614.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -124.4 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2019-11-28 03:01:49,498 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:01:49,499 INFO L168 Benchmark]: Boogie Preprocessor took 27.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-28 03:01:49,503 INFO L168 Benchmark]: RCFGBuilder took 454.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:01:49,506 INFO L168 Benchmark]: BuchiAutomizer took 2671.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 764.8 MB in the end (delta: 286.5 MB). Peak memory consumption was 286.5 MB. Max. memory is 11.5 GB. [2019-11-28 03:01:49,509 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.29 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 614.33 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -124.4 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.41 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 454.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2671.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 764.8 MB in the end (delta: 286.5 MB). Peak memory consumption was 286.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...