./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/reducercommutativity/avg_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/reducercommutativity/avg_true-unreach-call_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 704389633f786b8f459e07240134137dbbeaeb7e .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: program execution has not yet been computed --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:54:25,650 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:54:25,652 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:54:25,672 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:54:25,673 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:54:25,674 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:54:25,675 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:54:25,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:54:25,679 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:54:25,680 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:54:25,681 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:54:25,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:54:25,683 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:54:25,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:54:25,689 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:54:25,689 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:54:25,690 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:54:25,695 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:54:25,699 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:54:25,701 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:54:25,705 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:54:25,706 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:54:25,713 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:54:25,714 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:54:25,714 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:54:25,715 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:54:25,716 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:54:25,716 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:54:25,717 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:54:25,718 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:54:25,718 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:54:25,719 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:54:25,719 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:54:25,719 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:54:25,720 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:54:25,721 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:54:25,721 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:54:25,737 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:54:25,737 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:54:25,738 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:54:25,738 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:54:25,738 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:54:25,739 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:54:25,739 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:54:25,739 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:54:25,739 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:54:25,739 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:54:25,740 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:54:25,740 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:54:25,740 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:54:25,740 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:54:25,740 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:54:25,740 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:54:25,741 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:54:25,741 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:54:25,741 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:54:25,741 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:54:25,741 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:54:25,742 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:54:25,742 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:54:25,742 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:54:25,742 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:54:25,742 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:54:25,742 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:54:25,743 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:54:25,744 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:54:25,744 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:54:25,745 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:54:25,746 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:54:25,746 INFO L133 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 704389633f786b8f459e07240134137dbbeaeb7e [2019-01-14 04:54:25,812 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:54:25,828 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:54:25,832 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:54:25,834 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:54:25,834 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:54:25,835 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/reducercommutativity/avg_true-unreach-call_true-termination.i [2019-01-14 04:54:25,897 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/093fd74fe/acf1189dec6742b58fce22924f689eb0/FLAG5afca0b7c [2019-01-14 04:54:26,392 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:54:26,393 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/reducercommutativity/avg_true-unreach-call_true-termination.i [2019-01-14 04:54:26,399 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/093fd74fe/acf1189dec6742b58fce22924f689eb0/FLAG5afca0b7c [2019-01-14 04:54:26,734 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/093fd74fe/acf1189dec6742b58fce22924f689eb0 [2019-01-14 04:54:26,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:54:26,741 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:54:26,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:54:26,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:54:26,746 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:54:26,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:54:26" (1/1) ... [2019-01-14 04:54:26,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6339f23e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:26, skipping insertion in model container [2019-01-14 04:54:26,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:54:26" (1/1) ... [2019-01-14 04:54:26,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:54:26,784 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:54:26,976 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:54:26,994 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:54:27,031 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:54:27,048 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:54:27,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:27 WrapperNode [2019-01-14 04:54:27,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:54:27,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:54:27,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:54:27,050 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:54:27,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:27" (1/1) ... [2019-01-14 04:54:27,067 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:27" (1/1) ... [2019-01-14 04:54:27,099 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:54:27,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:54:27,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:54:27,099 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:54:27,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:27" (1/1) ... [2019-01-14 04:54:27,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:27" (1/1) ... [2019-01-14 04:54:27,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:27" (1/1) ... [2019-01-14 04:54:27,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:27" (1/1) ... [2019-01-14 04:54:27,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:27" (1/1) ... [2019-01-14 04:54:27,200 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:27" (1/1) ... [2019-01-14 04:54:27,202 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:27" (1/1) ... [2019-01-14 04:54:27,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:54:27,212 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:54:27,213 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:54:27,213 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:54:27,214 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:27" (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-01-14 04:54:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:54:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:54:27,268 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:54:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:54:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:54:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:54:27,719 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:54:27,719 INFO L286 CfgBuilder]: Removed 14 assue(true) statements. [2019-01-14 04:54:27,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:54:27 BoogieIcfgContainer [2019-01-14 04:54:27,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:54:27,721 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:54:27,721 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:54:27,725 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:54:27,726 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:54:27,726 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:54:26" (1/3) ... [2019-01-14 04:54:27,727 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f0a5bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:54:27, skipping insertion in model container [2019-01-14 04:54:27,727 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:54:27,727 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:54:27" (2/3) ... [2019-01-14 04:54:27,728 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6f0a5bc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:54:27, skipping insertion in model container [2019-01-14 04:54:27,728 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:54:27,728 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:54:27" (3/3) ... [2019-01-14 04:54:27,730 INFO L375 chiAutomizerObserver]: Analyzing ICFG avg_true-unreach-call_true-termination.i [2019-01-14 04:54:27,788 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:54:27,789 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:54:27,789 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:54:27,790 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:54:27,790 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:54:27,790 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:54:27,790 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:54:27,790 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:54:27,791 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:54:27,807 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-01-14 04:54:27,831 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 04:54:27,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:27,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:27,839 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 04:54:27,840 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:54:27,840 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:54:27,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2019-01-14 04:54:27,843 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-01-14 04:54:27,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:27,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:27,843 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 04:54:27,844 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:54:27,852 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 14#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 13#L20true assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 9#L11-3true [2019-01-14 04:54:27,853 INFO L796 eck$LassoCheckResult]: Loop: 9#L11-3true assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 12#L11-2true avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 9#L11-3true [2019-01-14 04:54:27,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:27,860 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-01-14 04:54:27,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:27,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:27,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:27,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:27,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:28,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:28,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1379, now seen corresponding path program 1 times [2019-01-14 04:54:28,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:28,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:28,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:28,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:28,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:28,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:28,044 INFO L82 PathProgramCache]: Analyzing trace with hash 28693956, now seen corresponding path program 1 times [2019-01-14 04:54:28,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:28,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:28,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:28,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:28,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:28,491 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-01-14 04:54:28,606 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:54:28,607 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:54:28,607 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:54:28,608 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:54:28,609 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:54:28,610 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:54:28,610 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:54:28,610 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:54:28,610 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration1_Lasso [2019-01-14 04:54:28,610 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:54:28,611 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:54:28,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:28,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:28,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:28,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:28,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:28,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:28,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:28,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:28,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:28,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:28,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:28,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:28,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:28,938 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-01-14 04:54:29,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:29,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:29,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:29,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:29,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:29,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:29,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:29,079 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:29,867 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:54:29,872 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:54:29,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:29,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:29,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:29,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:29,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:29,878 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:29,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:29,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:29,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:29,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:29,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:29,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:29,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:29,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:29,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:29,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:29,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:29,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:29,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:29,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:29,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:29,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:29,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:29,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:29,898 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:29,898 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:29,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:29,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:29,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:29,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:29,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:29,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:29,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:29,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:29,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:29,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:29,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:29,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:29,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:29,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:29,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:29,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:29,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:29,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:29,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:29,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:29,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:29,908 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:29,908 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:29,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:29,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:29,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:29,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:29,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:29,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:29,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:29,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:29,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:29,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:29,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:29,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:29,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:29,930 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:29,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:29,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:29,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:29,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:29,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:29,935 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:29,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:29,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:29,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:29,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:29,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:29,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:29,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:29,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:29,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:29,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:29,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:29,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:29,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:29,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:29,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:29,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:29,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:29,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:29,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:29,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:29,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:29,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:29,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:29,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:29,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:29,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:29,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:29,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:29,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:29,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:29,960 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:29,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:29,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:29,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:29,962 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:29,962 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:29,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:29,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:29,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:29,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:29,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:29,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:29,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:29,979 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:29,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:29,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:29,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:29,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:29,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:29,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:29,995 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:29,995 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:30,062 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:54:30,133 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 04:54:30,136 INFO L444 ModelExtractionUtils]: 17 out of 25 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-01-14 04:54:30,138 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:54:30,141 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:54:30,142 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:54:30,143 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_avg_~x.offset, ULTIMATE.start_avg_~i~0, v_rep(select #length ULTIMATE.start_avg_~x.base)_1) = -1*ULTIMATE.start_avg_~x.offset - 4*ULTIMATE.start_avg_~i~0 + 1*v_rep(select #length ULTIMATE.start_avg_~x.base)_1 Supporting invariants [] [2019-01-14 04:54:30,205 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-14 04:54:30,217 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:54:30,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:30,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:30,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:30,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:30,355 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:54:30,356 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2019-01-14 04:54:30,422 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 51 states and 69 transitions. Complement of second has 8 states. [2019-01-14 04:54:30,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:54:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:54:30,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2019-01-14 04:54:30,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 04:54:30,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:30,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 04:54:30,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:30,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 37 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-14 04:54:30,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:30,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 69 transitions. [2019-01-14 04:54:30,440 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 04:54:30,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 17 states and 23 transitions. [2019-01-14 04:54:30,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-01-14 04:54:30,446 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 04:54:30,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-01-14 04:54:30,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:30,447 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-14 04:54:30,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-01-14 04:54:30,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-14 04:54:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 04:54:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 23 transitions. [2019-01-14 04:54:30,471 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-14 04:54:30,471 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-01-14 04:54:30,471 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:54:30,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 23 transitions. [2019-01-14 04:54:30,472 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 04:54:30,472 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:30,472 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:30,473 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-14 04:54:30,473 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:54:30,474 INFO L794 eck$LassoCheckResult]: Stem: 142#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 141#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 140#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 136#L11-3 assume !(avg_~i~0 < ~N~0); 132#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 133#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 145#L11-8 [2019-01-14 04:54:30,474 INFO L796 eck$LassoCheckResult]: Loop: 145#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 146#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 145#L11-8 [2019-01-14 04:54:30,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:30,474 INFO L82 PathProgramCache]: Analyzing trace with hash 889510859, now seen corresponding path program 1 times [2019-01-14 04:54:30,474 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:30,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:30,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:30,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:30,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:30,482 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:54:30,482 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:54:30,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-01-14 04:54:30,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:30,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:30,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:30,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:54:30,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 04:54:30,631 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:30,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:30,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 1 times [2019-01-14 04:54:30,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:30,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:30,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:30,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:30,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:30,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:30,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 04:54:30,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 04:54:30,726 INFO L87 Difference]: Start difference. First operand 17 states and 23 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-01-14 04:54:31,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:31,030 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-01-14 04:54:31,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 04:54:31,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2019-01-14 04:54:31,033 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 04:54:31,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2019-01-14 04:54:31,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-14 04:54:31,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 04:54:31,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2019-01-14 04:54:31,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:31,035 INFO L706 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-01-14 04:54:31,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2019-01-14 04:54:31,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2019-01-14 04:54:31,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 04:54:31,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2019-01-14 04:54:31,038 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-14 04:54:31,038 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2019-01-14 04:54:31,038 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:54:31,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2019-01-14 04:54:31,039 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 04:54:31,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:31,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:31,040 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:54:31,040 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:54:31,040 INFO L794 eck$LassoCheckResult]: Stem: 198#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 197#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 196#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 192#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 193#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 194#L11-3 assume !(avg_~i~0 < ~N~0); 188#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 189#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 201#L11-8 [2019-01-14 04:54:31,040 INFO L796 eck$LassoCheckResult]: Loop: 201#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 202#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 201#L11-8 [2019-01-14 04:54:31,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:31,040 INFO L82 PathProgramCache]: Analyzing trace with hash 123162473, now seen corresponding path program 1 times [2019-01-14 04:54:31,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:31,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:31,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:31,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:31,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:31,049 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:54:31,050 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:54:31,050 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-01-14 04:54:31,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:31,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:31,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:31,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 04:54:31,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-01-14 04:54:31,235 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:31,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:31,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 2 times [2019-01-14 04:54:31,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:31,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:31,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:31,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:31,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:31,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:31,365 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 04:54:31,542 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 04:54:31,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:54:31,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:54:31,543 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-14 04:54:31,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:31,630 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-01-14 04:54:31,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:54:31,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2019-01-14 04:54:31,633 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 04:54:31,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2019-01-14 04:54:31,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-01-14 04:54:31,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-01-14 04:54:31,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2019-01-14 04:54:31,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:31,634 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-14 04:54:31,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2019-01-14 04:54:31,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-01-14 04:54:31,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-14 04:54:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2019-01-14 04:54:31,637 INFO L729 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-14 04:54:31,637 INFO L609 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2019-01-14 04:54:31,637 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 04:54:31,637 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2019-01-14 04:54:31,638 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-01-14 04:54:31,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:31,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:31,639 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2019-01-14 04:54:31,639 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:54:31,639 INFO L794 eck$LassoCheckResult]: Stem: 264#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 263#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 262#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 257#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 258#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 259#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 260#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 269#L11-3 assume !(avg_~i~0 < ~N~0); 253#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 254#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 267#L11-8 [2019-01-14 04:54:31,640 INFO L796 eck$LassoCheckResult]: Loop: 267#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 268#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 267#L11-8 [2019-01-14 04:54:31,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:31,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1898228857, now seen corresponding path program 2 times [2019-01-14 04:54:31,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:31,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:31,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:31,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:31,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:31,648 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:54:31,649 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:54:31,649 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 04:54:31,669 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:54:31,697 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:54:31,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 04:54:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:31,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:31,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1891, now seen corresponding path program 3 times [2019-01-14 04:54:31,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:31,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:31,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:31,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:31,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:31,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:31,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1163170153, now seen corresponding path program 1 times [2019-01-14 04:54:31,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:31,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:31,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:31,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:31,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:31,821 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:54:31,821 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:54:31,821 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 04:54:31,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:32,156 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 04:54:33,054 WARN L181 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 118 [2019-01-14 04:54:37,513 WARN L181 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 105 DAG size of output: 86 [2019-01-14 04:54:37,519 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:54:37,519 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:54:37,519 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:54:37,520 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:54:37,520 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:54:37,520 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:54:37,520 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:54:37,520 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:54:37,520 INFO L131 ssoRankerPreferences]: Filename of dumped script: avg_true-unreach-call_true-termination.i_Iteration4_Lasso [2019-01-14 04:54:37,520 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:54:37,520 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:54:37,523 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 04:54:37,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:37,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:37,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:37,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:37,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:37,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:37,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:37,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:37,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:37,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:37,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:37,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:37,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:37,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:37,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:37,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:37,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:37,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:37,662 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 29 [2019-01-14 04:54:39,149 WARN L181 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-01-14 04:54:39,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 04:54:39,213 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2019-01-14 04:54:40,931 WARN L181 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 180 DAG size of output: 109 [2019-01-14 04:54:40,978 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2019-01-14 04:54:45,698 WARN L181 SmtUtils]: Spent 4.59 s on a formula simplification. DAG size of input: 142 DAG size of output: 104 [2019-01-14 04:54:45,753 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:54:45,753 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:54:45,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:45,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:45,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:45,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:45,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:45,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:45,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:45,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:45,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:45,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:45,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:45,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:45,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:45,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:45,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:45,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:45,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:45,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:45,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:45,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:45,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:45,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:45,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:45,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:45,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:45,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:45,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:45,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:45,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:45,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:45,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:45,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:45,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:45,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:45,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:45,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:45,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:45,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:45,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:45,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:45,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:45,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:45,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:45,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:45,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:45,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:45,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:45,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:45,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:45,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:45,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:45,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:45,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:45,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:45,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:45,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:45,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:45,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:45,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:45,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:45,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:45,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:45,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:45,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:45,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:45,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:45,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:45,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:45,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:45,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:45,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:45,801 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:45,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:45,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:45,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:45,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:45,802 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:54:45,803 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:45,807 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:45,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:45,808 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:45,808 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:45,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:45,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:45,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:45,809 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:45,809 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:45,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:45,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:45,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:45,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:45,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:45,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:45,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:45,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:45,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:45,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:45,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:45,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:45,822 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:45,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:45,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:45,822 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:45,822 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:45,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:45,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:45,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:45,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:45,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:45,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:45,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:45,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:45,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:45,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:45,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:45,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:45,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:45,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:45,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:45,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:45,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:45,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:45,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:45,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:45,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:45,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:45,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:45,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:45,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:45,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:45,842 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:45,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:45,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:45,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:45,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:45,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:45,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:45,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:45,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:45,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:45,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:45,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:45,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:45,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:45,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:54:45,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:54:45,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:45,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:45,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:54:45,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:54:45,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:54:45,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:54:45,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:54:45,860 INFO L205 nArgumentSynthesizer]: 12 stem disjuncts [2019-01-14 04:54:45,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:54:45,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:54:45,879 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2019-01-14 04:54:45,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:54:46,086 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:54:46,271 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-14 04:54:46,273 INFO L444 ModelExtractionUtils]: 33 out of 43 variables were initially zero. Simplification set additionally 7 variables to zero. [2019-01-14 04:54:46,273 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:54:46,275 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:54:46,277 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:54:46,278 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(~N~0, ULTIMATE.start_avg_~i~0) = 1*~N~0 - 1*ULTIMATE.start_avg_~i~0 Supporting invariants [] [2019-01-14 04:54:46,387 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-01-14 04:54:46,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:46,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:46,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 04:54:46,869 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 04:54:46,869 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-14 04:54:47,165 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 26 states and 33 transitions. Complement of second has 7 states. [2019-01-14 04:54:47,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-14 04:54:47,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:54:47,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-14 04:54:47,170 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-14 04:54:47,170 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:47,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-14 04:54:47,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:47,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-14 04:54:47,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:54:47,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 33 transitions. [2019-01-14 04:54:47,177 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 04:54:47,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 20 states and 24 transitions. [2019-01-14 04:54:47,184 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-14 04:54:47,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2019-01-14 04:54:47,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 24 transitions. [2019-01-14 04:54:47,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:47,184 INFO L706 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-01-14 04:54:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 24 transitions. [2019-01-14 04:54:47,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-14 04:54:47,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 04:54:47,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2019-01-14 04:54:47,193 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-01-14 04:54:47,193 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 24 transitions. [2019-01-14 04:54:47,194 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 04:54:47,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 24 transitions. [2019-01-14 04:54:47,198 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 04:54:47,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:47,199 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:47,199 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:54:47,200 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:54:47,203 INFO L794 eck$LassoCheckResult]: Stem: 385#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 384#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 383#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 378#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 379#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 380#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 381#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 391#L11-3 assume !(avg_~i~0 < ~N~0); 374#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 375#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 388#L11-8 assume !(avg_~i~0 < ~N~0); 386#L11-9 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 387#L14-1 main_#t~ret6 := avg_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 376#L32-3 [2019-01-14 04:54:47,204 INFO L796 eck$LassoCheckResult]: Loop: 376#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 377#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 376#L32-3 [2019-01-14 04:54:47,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:47,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1698534614, now seen corresponding path program 1 times [2019-01-14 04:54:47,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:47,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:47,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:47,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:47,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:47,230 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:54:47,231 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:54:47,231 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 04:54:47,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:47,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 04:54:47,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 04:54:47,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 04:54:47,496 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:47,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:47,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 1 times [2019-01-14 04:54:47,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:47,500 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:47,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:47,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:47,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:47,883 WARN L181 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-14 04:54:48,047 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-14 04:54:48,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 04:54:48,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-14 04:54:48,048 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-14 04:54:48,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:48,242 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-01-14 04:54:48,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 04:54:48,244 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 26 transitions. [2019-01-14 04:54:48,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 04:54:48,248 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 26 transitions. [2019-01-14 04:54:48,248 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-01-14 04:54:48,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-01-14 04:54:48,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 26 transitions. [2019-01-14 04:54:48,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:48,248 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-01-14 04:54:48,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 26 transitions. [2019-01-14 04:54:48,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-01-14 04:54:48,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 04:54:48,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2019-01-14 04:54:48,252 INFO L729 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-14 04:54:48,253 INFO L609 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2019-01-14 04:54:48,255 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 04:54:48,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2019-01-14 04:54:48,256 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 04:54:48,256 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:48,256 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:48,256 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:54:48,256 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:54:48,257 INFO L794 eck$LassoCheckResult]: Stem: 471#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 470#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 469#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 464#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 465#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 466#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 467#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 477#L11-3 assume !(avg_~i~0 < ~N~0); 460#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 461#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 474#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 475#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 476#L11-8 assume !(avg_~i~0 < ~N~0); 472#L11-9 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 473#L14-1 main_#t~ret6 := avg_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 462#L32-3 [2019-01-14 04:54:48,257 INFO L796 eck$LassoCheckResult]: Loop: 462#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 463#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 462#L32-3 [2019-01-14 04:54:48,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:48,257 INFO L82 PathProgramCache]: Analyzing trace with hash 205910964, now seen corresponding path program 1 times [2019-01-14 04:54:48,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:48,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:48,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:48,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:48,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:48,264 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:54:48,264 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:54:48,264 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 04:54:48,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:54:48,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:54:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-14 04:54:48,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-01-14 04:54:48,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-01-14 04:54:48,540 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 04:54:48,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:48,540 INFO L82 PathProgramCache]: Analyzing trace with hash 2403, now seen corresponding path program 2 times [2019-01-14 04:54:48,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:48,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:48,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:48,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:54:48,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:54:48,695 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-14 04:54:48,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 04:54:48,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 04:54:48,711 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. cyclomatic complexity: 7 Second operand 5 states. [2019-01-14 04:54:48,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 04:54:48,775 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2019-01-14 04:54:48,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 04:54:48,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2019-01-14 04:54:48,778 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 04:54:48,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 28 states and 31 transitions. [2019-01-14 04:54:48,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-14 04:54:48,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2019-01-14 04:54:48,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2019-01-14 04:54:48,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:54:48,781 INFO L706 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-01-14 04:54:48,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2019-01-14 04:54:48,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 22. [2019-01-14 04:54:48,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 04:54:48,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-01-14 04:54:48,784 INFO L729 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-01-14 04:54:48,785 INFO L609 BuchiCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-01-14 04:54:48,785 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-14 04:54:48,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 25 transitions. [2019-01-14 04:54:48,785 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 04:54:48,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:54:48,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:54:48,786 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:54:48,786 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:54:48,786 INFO L794 eck$LassoCheckResult]: Stem: 569#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~N~0 := 0; 568#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_#t~mem4, main_#t~mem5, main_#t~ret6, main_#t~mem7, main_#t~mem9, main_#t~post8, main_~i~1, main_#t~ret10, main_~#x~0.base, main_~#x~0.offset, main_~temp~0, main_~ret~1, main_~ret2~0, main_~ret5~0;~N~0 := main_#t~nondet2;havoc main_#t~nondet2; 567#L20 assume ~N~0 > 1;call main_~#x~0.base, main_~#x~0.offset := #Ultimate.allocOnStack(4 * ~N~0);havoc main_~temp~0;havoc main_~ret~1;havoc main_~ret2~0;havoc main_~ret5~0;avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 562#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 563#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 564#L11-3 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 565#L11-2 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 576#L11-3 assume !(avg_~i~0 < ~N~0); 558#L11-4 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 559#L14 main_#t~ret3 := avg_#res;main_~ret~1 := main_#t~ret3;havoc main_#t~ret3;call main_#t~mem4 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem4;havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~#x~0.base, 4 + main_~#x~0.offset, 4);call write~int(main_#t~mem5, main_~#x~0.base, main_~#x~0.offset, 4);havoc main_#t~mem5;call write~int(main_~temp~0, main_~#x~0.base, 4 + main_~#x~0.offset, 4);avg_#in~x.base, avg_#in~x.offset := main_~#x~0.base, main_~#x~0.offset;havoc avg_#res;havoc avg_#t~mem1, avg_#t~post0, avg_~x.base, avg_~x.offset, avg_~i~0, avg_~ret~0;avg_~x.base, avg_~x.offset := avg_#in~x.base, avg_#in~x.offset;havoc avg_~i~0;havoc avg_~ret~0;avg_~ret~0 := 0;avg_~i~0 := 0; 572#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 573#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 574#L11-8 assume !!(avg_~i~0 < ~N~0);call avg_#t~mem1 := read~int(avg_~x.base, avg_~x.offset + 4 * avg_~i~0, 4);avg_~ret~0 := avg_~ret~0 + avg_#t~mem1;havoc avg_#t~mem1; 575#L11-7 avg_#t~post0 := avg_~i~0;avg_~i~0 := 1 + avg_#t~post0;havoc avg_#t~post0; 577#L11-8 assume !(avg_~i~0 < ~N~0); 570#L11-9 avg_#res := (if (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 <= 2147483647 then (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 else (if avg_~ret~0 < 0 && 0 != avg_~ret~0 % ~N~0 then (if ~N~0 < 0 then avg_~ret~0 / ~N~0 - 1 else 1 + avg_~ret~0 / ~N~0) else avg_~ret~0 / ~N~0) % 4294967296 - 4294967296); 571#L14-1 main_#t~ret6 := avg_#res;main_~ret2~0 := main_#t~ret6;havoc main_#t~ret6;call main_#t~mem7 := read~int(main_~#x~0.base, main_~#x~0.offset, 4);main_~temp~0 := main_#t~mem7;havoc main_#t~mem7;main_~i~1 := 0; 560#L32-3 [2019-01-14 04:54:48,787 INFO L796 eck$LassoCheckResult]: Loop: 560#L32-3 assume !!(main_~i~1 < ~N~0 - 1);call main_#t~mem9 := read~int(main_~#x~0.base, main_~#x~0.offset + 4 * (1 + main_~i~1), 4);call write~int(main_#t~mem9, main_~#x~0.base, main_~#x~0.offset + 4 * main_~i~1, 4);havoc main_#t~mem9; 561#L32-2 main_#t~post8 := main_~i~1;main_~i~1 := 1 + main_#t~post8;havoc main_#t~post8; 560#L32-3 [2019-01-14 04:54:48,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:54:48,787 INFO L82 PathProgramCache]: Analyzing trace with hash 313660178, now seen corresponding path program 2 times [2019-01-14 04:54:48,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:54:48,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:54:48,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:48,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 04:54:48,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:54:48,792 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-01-14 04:54:48,793 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-01-14 04:54:48,793 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-01-14 04:54:48,819 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 04:54:48,855 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 04:54:48,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-01-14 04:54:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-01-14 04:54:48,978 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: program execution has not yet been computed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.getRcfgProgramExecution(TraceCheck.java:440) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.(TraceCheck.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:929) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkStemFeasibility(LassoCheck.java:883) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:797) 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:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) 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-01-14 04:54:48,984 INFO L168 Benchmark]: Toolchain (without parser) took 22244.60 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 357.6 MB). Free memory was 952.7 MB in the beginning and 1.3 GB in the end (delta: -359.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:54:48,985 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:54:48,992 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.69 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:54:48,994 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.30 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:54:48,995 INFO L168 Benchmark]: Boogie Preprocessor took 112.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-14 04:54:48,996 INFO L168 Benchmark]: RCFGBuilder took 508.03 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: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-01-14 04:54:48,997 INFO L168 Benchmark]: BuchiAutomizer took 21262.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -215.3 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2019-01-14 04:54:49,006 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 307.69 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 49.30 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 112.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 508.03 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: 25.7 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 21262.34 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 223.3 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -215.3 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: program execution has not yet been computed de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: program execution has not yet been computed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheck.getRcfgProgramExecution(TraceCheck.java:440) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...