./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-numeric/Binomial.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-numeric/Binomial.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c204b56aba09d3ce87e17edffdff1d33aa0b4dc87a1e1140339548dffa982588 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-19 17:16:23,109 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-19 17:16:23,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-19 17:16:23,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-19 17:16:23,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-19 17:16:23,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-19 17:16:23,146 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-19 17:16:23,150 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-19 17:16:23,152 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-19 17:16:23,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-19 17:16:23,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-19 17:16:23,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-19 17:16:23,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-19 17:16:23,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-19 17:16:23,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-19 17:16:23,162 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-19 17:16:23,163 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-19 17:16:23,164 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-19 17:16:23,166 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-19 17:16:23,169 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-19 17:16:23,170 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-19 17:16:23,171 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-19 17:16:23,172 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-19 17:16:23,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-19 17:16:23,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-19 17:16:23,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-19 17:16:23,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-19 17:16:23,179 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-19 17:16:23,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-19 17:16:23,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-19 17:16:23,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-19 17:16:23,182 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-19 17:16:23,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-19 17:16:23,183 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-19 17:16:23,184 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-19 17:16:23,184 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-19 17:16:23,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-19 17:16:23,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-19 17:16:23,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-19 17:16:23,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-19 17:16:23,186 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-19 17:16:23,188 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-19 17:16:23,204 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-19 17:16:23,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-19 17:16:23,205 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-19 17:16:23,205 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-19 17:16:23,206 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-19 17:16:23,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-19 17:16:23,206 INFO L138 SettingsManager]: * Use SBE=true [2021-12-19 17:16:23,206 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-19 17:16:23,206 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-19 17:16:23,206 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-19 17:16:23,207 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-19 17:16:23,207 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-19 17:16:23,208 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-19 17:16:23,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-19 17:16:23,208 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-19 17:16:23,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-19 17:16:23,208 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-19 17:16:23,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-19 17:16:23,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-19 17:16:23,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-19 17:16:23,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-19 17:16:23,209 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-19 17:16:23,209 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-19 17:16:23,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-19 17:16:23,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-19 17:16:23,211 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-19 17:16:23,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-19 17:16:23,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-19 17:16:23,211 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-19 17:16:23,212 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-19 17:16:23,212 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c204b56aba09d3ce87e17edffdff1d33aa0b4dc87a1e1140339548dffa982588 [2021-12-19 17:16:23,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-19 17:16:23,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-19 17:16:23,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-19 17:16:23,471 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-19 17:16:23,475 INFO L275 PluginConnector]: CDTParser initialized [2021-12-19 17:16:23,476 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Binomial.c [2021-12-19 17:16:23,552 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39537ed9d/9d891dc295ff4d2b83f60e77bbd6bc1f/FLAGbdbd97e8b [2021-12-19 17:16:23,843 INFO L306 CDTParser]: Found 1 translation units. [2021-12-19 17:16:23,844 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2021-12-19 17:16:23,847 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39537ed9d/9d891dc295ff4d2b83f60e77bbd6bc1f/FLAGbdbd97e8b [2021-12-19 17:16:23,855 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39537ed9d/9d891dc295ff4d2b83f60e77bbd6bc1f [2021-12-19 17:16:23,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-19 17:16:23,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-19 17:16:23,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-19 17:16:23,858 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-19 17:16:23,860 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-19 17:16:23,861 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:16:23" (1/1) ... [2021-12-19 17:16:23,861 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2590528b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:16:23, skipping insertion in model container [2021-12-19 17:16:23,861 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:16:23" (1/1) ... [2021-12-19 17:16:23,865 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-19 17:16:23,873 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-19 17:16:23,997 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 17:16:24,000 INFO L203 MainTranslator]: Completed pre-run [2021-12-19 17:16:24,009 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-19 17:16:24,016 INFO L208 MainTranslator]: Completed translation [2021-12-19 17:16:24,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:16:24 WrapperNode [2021-12-19 17:16:24,016 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-19 17:16:24,017 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-19 17:16:24,017 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-19 17:16:24,017 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-19 17:16:24,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:16:24" (1/1) ... [2021-12-19 17:16:24,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:16:24" (1/1) ... [2021-12-19 17:16:24,039 INFO L137 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2021-12-19 17:16:24,040 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-19 17:16:24,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-19 17:16:24,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-19 17:16:24,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-19 17:16:24,045 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:16:24" (1/1) ... [2021-12-19 17:16:24,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:16:24" (1/1) ... [2021-12-19 17:16:24,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:16:24" (1/1) ... [2021-12-19 17:16:24,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:16:24" (1/1) ... [2021-12-19 17:16:24,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:16:24" (1/1) ... [2021-12-19 17:16:24,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:16:24" (1/1) ... [2021-12-19 17:16:24,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:16:24" (1/1) ... [2021-12-19 17:16:24,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-19 17:16:24,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-19 17:16:24,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-19 17:16:24,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-19 17:16:24,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:16:24" (1/1) ... [2021-12-19 17:16:24,065 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:24,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:24,089 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:24,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-19 17:16:24,132 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2021-12-19 17:16:24,132 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2021-12-19 17:16:24,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-19 17:16:24,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-19 17:16:24,169 INFO L236 CfgBuilder]: Building ICFG [2021-12-19 17:16:24,170 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-19 17:16:24,255 INFO L277 CfgBuilder]: Performing block encoding [2021-12-19 17:16:24,259 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-19 17:16:24,259 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-19 17:16:24,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:16:24 BoogieIcfgContainer [2021-12-19 17:16:24,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-19 17:16:24,261 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-19 17:16:24,261 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-19 17:16:24,265 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-19 17:16:24,265 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:16:24,265 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.12 05:16:23" (1/3) ... [2021-12-19 17:16:24,266 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@587f0e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 05:16:24, skipping insertion in model container [2021-12-19 17:16:24,266 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:16:24,266 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:16:24" (2/3) ... [2021-12-19 17:16:24,267 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@587f0e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.12 05:16:24, skipping insertion in model container [2021-12-19 17:16:24,267 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-19 17:16:24,267 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:16:24" (3/3) ... [2021-12-19 17:16:24,267 INFO L388 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2021-12-19 17:16:24,291 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-19 17:16:24,292 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-19 17:16:24,292 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-19 17:16:24,292 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-19 17:16:24,292 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-19 17:16:24,292 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-19 17:16:24,292 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-19 17:16:24,292 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-19 17:16:24,315 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-19 17:16:24,331 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-12-19 17:16:24,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:16:24,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:16:24,336 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 17:16:24,336 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:16:24,336 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-19 17:16:24,336 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-19 17:16:24,338 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-12-19 17:16:24,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:16:24,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:16:24,340 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 17:16:24,340 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:16:24,344 INFO L791 eck$LassoCheckResult]: Stem: 19#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 18#L35true assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 28#L38true assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 14#L41-3true [2021-12-19 17:16:24,344 INFO L793 eck$LassoCheckResult]: Loop: 14#L41-3true assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 23#L42-3true assume !(main_~k~0#1 <= main_~x~0#1); 15#L41-2true main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 14#L41-3true [2021-12-19 17:16:24,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:24,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2021-12-19 17:16:24,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:24,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142222856] [2021-12-19 17:16:24,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:24,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:24,415 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:24,438 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:16:24,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:24,440 INFO L85 PathProgramCache]: Analyzing trace with hash 57812, now seen corresponding path program 1 times [2021-12-19 17:16:24,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:24,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644817448] [2021-12-19 17:16:24,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:24,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:24,453 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:24,461 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:16:24,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:24,462 INFO L85 PathProgramCache]: Analyzing trace with hash 553673357, now seen corresponding path program 1 times [2021-12-19 17:16:24,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:24,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310913006] [2021-12-19 17:16:24,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:24,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:24,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:16:24,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:16:24,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310913006] [2021-12-19 17:16:24,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310913006] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:16:24,539 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:16:24,539 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 17:16:24,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924156540] [2021-12-19 17:16:24,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:16:24,595 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:16:24,596 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:16:24,596 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:16:24,596 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:16:24,596 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 17:16:24,596 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:24,597 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:16:24,597 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:16:24,597 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2021-12-19 17:16:24,597 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:16:24,603 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:16:24,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:24,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:24,681 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:16:24,681 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 17:16:24,682 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:24,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:24,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:24,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-19 17:16:24,712 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:24,712 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:24,737 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:24,738 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:24,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:24,756 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:24,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:24,757 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:24,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-19 17:16:24,759 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:24,759 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:24,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:24,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:24,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:24,797 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:24,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-19 17:16:24,806 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 17:16:24,806 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:24,970 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 17:16:24,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:24,974 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:16:24,974 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:16:24,974 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:16:24,974 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:16:24,974 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:16:24,974 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:24,974 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:16:24,974 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:16:24,974 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2021-12-19 17:16:24,974 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:16:24,974 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:16:24,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:24,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:25,044 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:16:25,047 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:16:25,048 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:25,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:25,056 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:25,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-19 17:16:25,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:25,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:25,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:25,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:25,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:25,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:25,067 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:25,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:25,077 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:25,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:25,094 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:25,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:25,096 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:25,129 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:25,149 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:25,149 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:25,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:25,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:25,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:25,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:25,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:25,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-19 17:16:25,159 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:16:25,164 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-19 17:16:25,164 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2021-12-19 17:16:25,165 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:25,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:25,168 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:25,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-19 17:16:25,213 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:16:25,214 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 17:16:25,214 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:16:25,214 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -1*ULTIMATE.start_main_~n~0#1 Supporting invariants [] [2021-12-19 17:16:25,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:25,237 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 17:16:25,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:25,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 17:16:25,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:25,281 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 17:16:25,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:25,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:16:25,363 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2021-12-19 17:16:25,364 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:16:25,413 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 28 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 19 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7). Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 73 states and 106 transitions. Complement of second has 11 states. [2021-12-19 17:16:25,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-19 17:16:25,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:16:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2021-12-19 17:16:25,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 3 letters. [2021-12-19 17:16:25,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:25,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 7 letters. Loop has 3 letters. [2021-12-19 17:16:25,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:25,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 6 letters. [2021-12-19 17:16:25,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:25,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 106 transitions. [2021-12-19 17:16:25,423 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-12-19 17:16:25,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 33 states and 48 transitions. [2021-12-19 17:16:25,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-12-19 17:16:25,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-19 17:16:25,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2021-12-19 17:16:25,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:16:25,429 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 48 transitions. [2021-12-19 17:16:25,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2021-12-19 17:16:25,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2021-12-19 17:16:25,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-19 17:16:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2021-12-19 17:16:25,446 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 42 transitions. [2021-12-19 17:16:25,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:16:25,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 17:16:25,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-19 17:16:25,449 INFO L87 Difference]: Start difference. First operand 30 states and 42 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-19 17:16:25,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:16:25,480 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-12-19 17:16:25,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 17:16:25,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2021-12-19 17:16:25,482 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2021-12-19 17:16:25,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 37 transitions. [2021-12-19 17:16:25,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-12-19 17:16:25,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-12-19 17:16:25,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2021-12-19 17:16:25,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-19 17:16:25,483 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-12-19 17:16:25,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2021-12-19 17:16:25,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2021-12-19 17:16:25,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-12-19 17:16:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2021-12-19 17:16:25,486 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2021-12-19 17:16:25,486 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2021-12-19 17:16:25,486 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-19 17:16:25,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2021-12-19 17:16:25,487 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2021-12-19 17:16:25,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:16:25,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:16:25,488 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-19 17:16:25,488 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:16:25,488 INFO L791 eck$LassoCheckResult]: Stem: 242#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 233#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 234#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 241#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 237#L41-3 [2021-12-19 17:16:25,488 INFO L793 eck$LassoCheckResult]: Loop: 237#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 238#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 243#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 224#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 220#factENTRY ~n := #in~n; 232#L25 assume ~n <= 0;#res := 1; 231#factFINAL assume true; 221#factEXIT >#68#return; 226#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 220#factENTRY ~n := #in~n; 232#L25 assume ~n <= 0;#res := 1; 231#factFINAL assume true; 221#factEXIT >#70#return; 222#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 220#factENTRY ~n := #in~n; 232#L25 assume ~n <= 0;#res := 1; 231#factFINAL assume true; 221#factEXIT >#72#return; 228#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 239#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 236#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 244#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 240#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 237#L41-3 [2021-12-19 17:16:25,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:25,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2021-12-19 17:16:25,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:25,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626906373] [2021-12-19 17:16:25,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:25,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:25,492 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:25,495 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:16:25,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:25,495 INFO L85 PathProgramCache]: Analyzing trace with hash -743603515, now seen corresponding path program 1 times [2021-12-19 17:16:25,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:25,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048487668] [2021-12-19 17:16:25,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:25,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:25,503 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:16:25,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1697911669] [2021-12-19 17:16:25,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:25,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:16:25,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:25,505 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:16:25,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-19 17:16:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:25,566 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:25,583 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:16:25,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:25,583 INFO L85 PathProgramCache]: Analyzing trace with hash 343305470, now seen corresponding path program 1 times [2021-12-19 17:16:25,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:25,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852051815] [2021-12-19 17:16:25,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:25,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:25,597 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:16:25,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [262392722] [2021-12-19 17:16:25,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:25,598 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:16:25,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:25,600 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:16:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:25,632 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:25,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-19 17:16:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:25,650 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:16:25,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-12-19 17:16:25,953 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:16:25,953 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:16:25,954 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:16:25,954 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:16:25,954 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 17:16:25,954 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:25,954 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:16:25,954 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:16:25,954 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2021-12-19 17:16:25,955 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:16:25,955 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:16:25,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:25,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:25,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:25,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:25,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:25,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:25,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:25,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:26,066 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:16:26,066 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 17:16:26,066 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:26,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:26,067 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:26,080 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:26,080 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:26,087 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:26,087 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:26,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-19 17:16:26,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:26,106 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:26,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:26,107 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:26,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-19 17:16:26,113 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:26,113 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:26,135 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:26,135 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret9#1=0} Honda state: {ULTIMATE.start_main_#t~ret9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:26,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:26,150 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:26,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:26,151 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:26,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-12-19 17:16:26,154 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:26,154 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:26,181 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:26,182 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:26,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:26,202 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:26,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:26,202 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:26,219 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:26,219 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:26,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-12-19 17:16:26,234 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:26,234 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:26,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:26,257 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:26,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:26,258 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:26,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:26,263 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:26,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-12-19 17:16:26,280 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:26,280 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:26,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:26,297 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:26,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:26,299 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:26,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-12-19 17:16:26,301 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:26,301 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:26,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2021-12-19 17:16:26,354 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:26,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:26,356 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:26,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-12-19 17:16:26,388 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 17:16:26,388 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:26,690 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 17:16:26,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:26,697 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:16:26,697 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:16:26,697 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:16:26,697 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:16:26,697 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:16:26,697 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:26,697 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:16:26,698 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:16:26,698 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2021-12-19 17:16:26,698 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:16:26,698 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:16:26,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:26,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:26,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:26,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:26,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:26,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:26,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:26,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:26,802 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:16:26,803 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:16:26,803 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:26,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:26,804 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:26,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-12-19 17:16:26,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:26,825 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:26,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:26,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:26,826 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:26,826 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:26,826 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:26,826 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:26,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:26,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:26,855 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:26,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:26,856 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:26,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-12-19 17:16:26,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:26,865 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:26,865 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:26,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:26,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:26,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:26,865 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:26,865 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:26,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:26,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:26,890 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:26,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:26,891 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:26,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-12-19 17:16:26,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:26,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:26,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:26,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:26,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:26,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:26,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:26,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:26,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:26,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:26,932 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:26,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:26,933 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:26,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-12-19 17:16:26,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:26,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:26,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:26,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:26,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:26,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:26,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:26,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:26,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:26,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:26,958 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:26,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:26,959 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:26,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2021-12-19 17:16:26,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:26,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:26,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:26,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:26,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:26,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:26,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:26,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:26,972 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:26,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:26,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:26,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:26,989 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:26,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2021-12-19 17:16:26,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:26,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:26,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:26,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:26,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:26,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:26,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:26,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:27,014 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:27,042 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:27,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:27,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:27,047 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:27,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:27,055 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:27,055 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:27,055 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:27,055 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:27,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:27,058 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:27,058 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:27,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2021-12-19 17:16:27,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:27,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:27,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:27,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:27,090 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:27,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:27,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2021-12-19 17:16:27,102 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:27,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:27,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:27,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:27,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:27,106 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:27,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:27,117 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:16:27,122 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-19 17:16:27,122 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-19 17:16:27,122 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:27,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:27,123 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:27,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2021-12-19 17:16:27,160 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:16:27,160 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 17:16:27,160 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:16:27,160 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 1 Supporting invariants [] [2021-12-19 17:16:27,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2021-12-19 17:16:27,176 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 17:16:27,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:27,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 17:16:27,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:27,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-19 17:16:27,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-19 17:16:27,343 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2021-12-19 17:16:27,343 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-19 17:16:27,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:27,546 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 35 transitions. cyclomatic complexity: 11. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Result 117 states and 182 transitions. Complement of second has 26 states. [2021-12-19 17:16:27,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2021-12-19 17:16:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2021-12-19 17:16:27,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2021-12-19 17:16:27,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 74 transitions. Stem has 4 letters. Loop has 23 letters. [2021-12-19 17:16:27,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:27,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 74 transitions. Stem has 27 letters. Loop has 23 letters. [2021-12-19 17:16:27,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:27,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 74 transitions. Stem has 4 letters. Loop has 46 letters. [2021-12-19 17:16:27,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:27,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 182 transitions. [2021-12-19 17:16:27,552 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2021-12-19 17:16:27,554 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 116 states and 181 transitions. [2021-12-19 17:16:27,555 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2021-12-19 17:16:27,555 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2021-12-19 17:16:27,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 181 transitions. [2021-12-19 17:16:27,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:16:27,555 INFO L681 BuchiCegarLoop]: Abstraction has 116 states and 181 transitions. [2021-12-19 17:16:27,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 181 transitions. [2021-12-19 17:16:27,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 105. [2021-12-19 17:16:27,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 68 states have internal predecessors, (82), 30 states have call successors, (30), 6 states have call predecessors, (30), 8 states have return successors, (42), 30 states have call predecessors, (42), 30 states have call successors, (42) [2021-12-19 17:16:27,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2021-12-19 17:16:27,565 INFO L704 BuchiCegarLoop]: Abstraction has 105 states and 154 transitions. [2021-12-19 17:16:27,565 INFO L587 BuchiCegarLoop]: Abstraction has 105 states and 154 transitions. [2021-12-19 17:16:27,565 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-19 17:16:27,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 154 transitions. [2021-12-19 17:16:27,566 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2021-12-19 17:16:27,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:16:27,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:16:27,567 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-19 17:16:27,567 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:16:27,567 INFO L791 eck$LassoCheckResult]: Stem: 556#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 536#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 537#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 555#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 565#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 546#L42-3 [2021-12-19 17:16:27,568 INFO L793 eck$LassoCheckResult]: Loop: 546#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 560#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 574#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 515#factENTRY ~n := #in~n; 580#L25 assume !(~n <= 0); 502#L26 call #t~ret0 := fact(~n - 1);< 542#factENTRY ~n := #in~n; 586#L25 assume ~n <= 0;#res := 1; 582#factFINAL assume true; 500#factEXIT >#66#return; 506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579#factFINAL assume true; 578#factEXIT >#68#return; 576#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 515#factENTRY ~n := #in~n; 580#L25 assume !(~n <= 0); 502#L26 call #t~ret0 := fact(~n - 1);< 542#factENTRY ~n := #in~n; 586#L25 assume ~n <= 0;#res := 1; 582#factFINAL assume true; 500#factEXIT >#66#return; 506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579#factFINAL assume true; 578#factEXIT >#70#return; 514#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 515#factENTRY ~n := #in~n; 580#L25 assume !(~n <= 0); 502#L26 call #t~ret0 := fact(~n - 1);< 542#factENTRY ~n := #in~n; 586#L25 assume ~n <= 0;#res := 1; 582#factFINAL assume true; 500#factEXIT >#66#return; 506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 579#factFINAL assume true; 578#factEXIT >#72#return; 571#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 569#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 567#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 566#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 553#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 545#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 546#L42-3 [2021-12-19 17:16:27,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:27,568 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 1 times [2021-12-19 17:16:27,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:27,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16031891] [2021-12-19 17:16:27,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:27,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:27,571 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:27,574 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:16:27,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:27,575 INFO L85 PathProgramCache]: Analyzing trace with hash 471779129, now seen corresponding path program 1 times [2021-12-19 17:16:27,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:27,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612249420] [2021-12-19 17:16:27,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:27,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:27,581 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:16:27,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [803385890] [2021-12-19 17:16:27,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:27,582 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:16:27,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:27,583 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:16:27,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2021-12-19 17:16:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:27,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 17:16:27,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2021-12-19 17:16:27,707 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:16:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-12-19 17:16:27,910 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:16:27,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612249420] [2021-12-19 17:16:27,910 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:16:27,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803385890] [2021-12-19 17:16:27,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803385890] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:16:27,911 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:16:27,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2021-12-19 17:16:27,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655214883] [2021-12-19 17:16:27,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:16:27,911 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:16:27,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:16:27,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-19 17:16:27,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-12-19 17:16:27,912 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. cyclomatic complexity: 54 Second operand has 13 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2021-12-19 17:16:28,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:16:28,134 INFO L93 Difference]: Finished difference Result 307 states and 482 transitions. [2021-12-19 17:16:28,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-19 17:16:28,135 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 482 transitions. [2021-12-19 17:16:28,139 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 112 [2021-12-19 17:16:28,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 307 states and 482 transitions. [2021-12-19 17:16:28,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2021-12-19 17:16:28,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2021-12-19 17:16:28,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 307 states and 482 transitions. [2021-12-19 17:16:28,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:16:28,144 INFO L681 BuchiCegarLoop]: Abstraction has 307 states and 482 transitions. [2021-12-19 17:16:28,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 482 transitions. [2021-12-19 17:16:28,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 149. [2021-12-19 17:16:28,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 87 states have (on average 1.1724137931034482) internal successors, (102), 88 states have internal predecessors, (102), 46 states have call successors, (46), 10 states have call predecessors, (46), 16 states have return successors, (116), 50 states have call predecessors, (116), 46 states have call successors, (116) [2021-12-19 17:16:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 264 transitions. [2021-12-19 17:16:28,171 INFO L704 BuchiCegarLoop]: Abstraction has 149 states and 264 transitions. [2021-12-19 17:16:28,171 INFO L587 BuchiCegarLoop]: Abstraction has 149 states and 264 transitions. [2021-12-19 17:16:28,171 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-19 17:16:28,171 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 264 transitions. [2021-12-19 17:16:28,172 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 40 [2021-12-19 17:16:28,173 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:16:28,173 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:16:28,174 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-19 17:16:28,174 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:16:28,174 INFO L791 eck$LassoCheckResult]: Stem: 1232#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1210#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1211#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1231#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 1258#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1221#L42-3 [2021-12-19 17:16:28,175 INFO L793 eck$LassoCheckResult]: Loop: 1221#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1233#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 1234#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1263#factENTRY ~n := #in~n; 1270#L25 assume !(~n <= 0); 1186#L26 call #t~ret0 := fact(~n - 1);< 1216#factENTRY ~n := #in~n; 1261#L25 assume !(~n <= 0); 1185#L26 call #t~ret0 := fact(~n - 1);< 1216#factENTRY ~n := #in~n; 1261#L25 assume ~n <= 0;#res := 1; 1200#factFINAL assume true; 1184#factEXIT >#66#return; 1188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1304#factFINAL assume true; 1302#factEXIT >#66#return; 1303#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1313#factFINAL assume true; 1274#factEXIT >#68#return; 1265#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1263#factENTRY ~n := #in~n; 1270#L25 assume ~n <= 0;#res := 1; 1254#factFINAL assume true; 1283#factEXIT >#70#return; 1267#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1263#factENTRY ~n := #in~n; 1270#L25 assume ~n <= 0;#res := 1; 1254#factFINAL assume true; 1283#factEXIT >#72#return; 1224#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 1225#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1307#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1306#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1229#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1220#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1221#L42-3 [2021-12-19 17:16:28,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:28,175 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 2 times [2021-12-19 17:16:28,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:28,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476174330] [2021-12-19 17:16:28,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:28,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:28,185 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:28,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:28,187 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:16:28,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:28,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2146445903, now seen corresponding path program 2 times [2021-12-19 17:16:28,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:28,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615487711] [2021-12-19 17:16:28,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:28,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:28,195 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:16:28,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2117733917] [2021-12-19 17:16:28,198 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 17:16:28,198 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:16:28,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:28,218 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:16:28,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2021-12-19 17:16:28,249 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 17:16:28,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:16:28,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 17:16:28,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:28,337 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-19 17:16:28,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:16:28,498 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 13 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-12-19 17:16:28,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:16:28,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615487711] [2021-12-19 17:16:28,498 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:16:28,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117733917] [2021-12-19 17:16:28,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117733917] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:16:28,499 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:16:28,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2021-12-19 17:16:28,499 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246980076] [2021-12-19 17:16:28,499 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:16:28,499 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:16:28,499 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:16:28,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-19 17:16:28,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-19 17:16:28,500 INFO L87 Difference]: Start difference. First operand 149 states and 264 transitions. cyclomatic complexity: 120 Second operand has 14 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2021-12-19 17:16:29,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:16:29,030 INFO L93 Difference]: Finished difference Result 377 states and 584 transitions. [2021-12-19 17:16:29,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-19 17:16:29,032 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 377 states and 584 transitions. [2021-12-19 17:16:29,036 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 123 [2021-12-19 17:16:29,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 377 states to 365 states and 564 transitions. [2021-12-19 17:16:29,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 178 [2021-12-19 17:16:29,042 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 178 [2021-12-19 17:16:29,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 365 states and 564 transitions. [2021-12-19 17:16:29,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:16:29,042 INFO L681 BuchiCegarLoop]: Abstraction has 365 states and 564 transitions. [2021-12-19 17:16:29,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states and 564 transitions. [2021-12-19 17:16:29,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 183. [2021-12-19 17:16:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 102 states have internal predecessors, (122), 60 states have call successors, (60), 20 states have call predecessors, (60), 16 states have return successors, (126), 60 states have call predecessors, (126), 60 states have call successors, (126) [2021-12-19 17:16:29,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 308 transitions. [2021-12-19 17:16:29,059 INFO L704 BuchiCegarLoop]: Abstraction has 183 states and 308 transitions. [2021-12-19 17:16:29,059 INFO L587 BuchiCegarLoop]: Abstraction has 183 states and 308 transitions. [2021-12-19 17:16:29,059 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-19 17:16:29,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 308 transitions. [2021-12-19 17:16:29,061 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 45 [2021-12-19 17:16:29,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:16:29,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:16:29,062 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-19 17:16:29,062 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:16:29,062 INFO L791 eck$LassoCheckResult]: Stem: 1997#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1972#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 1973#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1996#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 2034#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1987#L42-3 [2021-12-19 17:16:29,062 INFO L793 eck$LassoCheckResult]: Loop: 1987#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1998#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 2000#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2095#factENTRY ~n := #in~n; 2112#L25 assume !(~n <= 0); 1946#L26 call #t~ret0 := fact(~n - 1);< 1980#factENTRY ~n := #in~n; 2098#L25 assume !(~n <= 0); 1945#L26 call #t~ret0 := fact(~n - 1);< 1980#factENTRY ~n := #in~n; 2098#L25 assume ~n <= 0;#res := 1; 1964#factFINAL assume true; 1944#factEXIT >#66#return; 1948#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2087#factFINAL assume true; 2084#factEXIT >#66#return; 2081#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2082#factFINAL assume true; 2062#factEXIT >#74#return; 2009#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2095#factENTRY ~n := #in~n; 2112#L25 assume !(~n <= 0); 1946#L26 call #t~ret0 := fact(~n - 1);< 1980#factENTRY ~n := #in~n; 2098#L25 assume ~n <= 0;#res := 1; 1964#factFINAL assume true; 1944#factEXIT >#66#return; 1949#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2011#factFINAL assume true; 2059#factEXIT >#76#return; 2005#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2109#factENTRY ~n := #in~n; 2111#L25 assume !(~n <= 0); 1946#L26 call #t~ret0 := fact(~n - 1);< 1980#factENTRY ~n := #in~n; 2098#L25 assume ~n <= 0;#res := 1; 1964#factFINAL assume true; 1944#factEXIT >#66#return; 1949#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2011#factFINAL assume true; 2059#factEXIT >#78#return; 2060#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 2116#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 2115#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2114#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1994#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1986#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1987#L42-3 [2021-12-19 17:16:29,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:29,063 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 3 times [2021-12-19 17:16:29,063 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:29,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864996800] [2021-12-19 17:16:29,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:29,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:29,090 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:29,117 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:16:29,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:29,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1703111285, now seen corresponding path program 1 times [2021-12-19 17:16:29,117 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:29,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096084127] [2021-12-19 17:16:29,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:29,117 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:29,125 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:16:29,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [711363436] [2021-12-19 17:16:29,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:29,126 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:16:29,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:29,127 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:16:29,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2021-12-19 17:16:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:29,181 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:29,201 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:16:29,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:29,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1023536866, now seen corresponding path program 1 times [2021-12-19 17:16:29,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:29,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415925437] [2021-12-19 17:16:29,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:29,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:29,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:29,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-19 17:16:29,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:16:29,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415925437] [2021-12-19 17:16:29,229 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2021-12-19 17:16:29,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610110764] [2021-12-19 17:16:29,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:29,229 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:16:29,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:29,240 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:16:29,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2021-12-19 17:16:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:29,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-19 17:16:29,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-19 17:16:29,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 17:16:29,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610110764] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:16:29,353 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:16:29,353 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-19 17:16:29,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768241128] [2021-12-19 17:16:29,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:16:46,814 WARN L227 SmtUtils]: Spent 17.16s on a formula simplification. DAG size of input: 77 DAG size of output: 71 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:16:47,061 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:16:47,061 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:16:47,061 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:16:47,061 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:16:47,061 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 17:16:47,061 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:47,061 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:16:47,061 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:16:47,061 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2021-12-19 17:16:47,061 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:16:47,061 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:16:47,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:47,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:47,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:47,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:47,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:47,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:47,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:47,306 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:16:47,306 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 17:16:47,306 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:47,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:47,324 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:47,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2021-12-19 17:16:47,328 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:47,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:47,338 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:47,338 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:47,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:47,367 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:47,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:47,375 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:47,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2021-12-19 17:16:47,377 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:47,377 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:47,395 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:47,395 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:47,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:47,414 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:47,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:47,414 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:47,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2021-12-19 17:16:47,418 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:47,418 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:47,438 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:47,438 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:47,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:47,456 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:47,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:47,458 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:47,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2021-12-19 17:16:47,461 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:47,461 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:47,481 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:47,481 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:47,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:47,500 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:47,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:47,509 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:47,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2021-12-19 17:16:47,511 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:47,511 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:47,533 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:47,533 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:47,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:47,548 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:47,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:47,549 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:47,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2021-12-19 17:16:47,550 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:47,551 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:47,557 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:47,557 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:47,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:47,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:47,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:47,573 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:47,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2021-12-19 17:16:47,575 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:47,575 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:47,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:47,598 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:47,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:47,600 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:47,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2021-12-19 17:16:47,601 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 17:16:47,601 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:47,627 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 17:16:47,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2021-12-19 17:16:47,641 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:16:47,642 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:16:47,642 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:16:47,642 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:16:47,642 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:16:47,642 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:47,642 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:16:47,642 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:16:47,642 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2021-12-19 17:16:47,642 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:16:47,642 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:16:47,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:47,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:47,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:47,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:47,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:47,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:47,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:47,848 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:16:47,848 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:16:47,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:47,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:47,849 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:47,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2021-12-19 17:16:47,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:47,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:47,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:47,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:47,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:47,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:47,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:47,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:47,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:47,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2021-12-19 17:16:47,874 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:47,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:47,874 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:47,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2021-12-19 17:16:47,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:47,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:47,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:47,883 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:47,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:47,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:47,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:47,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:47,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:47,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:47,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:47,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:47,900 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:47,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:47,908 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:47,908 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:47,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:47,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:47,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:47,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:47,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:47,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2021-12-19 17:16:47,918 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:47,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2021-12-19 17:16:47,934 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:47,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:47,934 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:47,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-12-19 17:16:47,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:47,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:47,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:47,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:47,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:47,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:47,943 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:47,943 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:47,944 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:47,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2021-12-19 17:16:47,959 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:47,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:47,960 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:47,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-19 17:16:47,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:47,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:47,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:47,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:47,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:47,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:47,970 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:47,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:47,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:47,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2021-12-19 17:16:47,986 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:47,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:47,986 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:47,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-19 17:16:47,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:47,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:47,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:47,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:47,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:47,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:47,998 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:47,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:47,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:48,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-12-19 17:16:48,014 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:48,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:48,014 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:48,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-19 17:16:48,016 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:48,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:48,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:48,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:48,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:48,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:48,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:48,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:48,040 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:16:48,043 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-19 17:16:48,043 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-19 17:16:48,043 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:48,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:48,044 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:48,046 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:16:48,046 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 17:16:48,046 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:16:48,046 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 3 Supporting invariants [] [2021-12-19 17:16:48,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-19 17:16:48,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-12-19 17:16:48,061 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 17:16:48,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:48,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 17:16:48,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:48,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:48,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-19 17:16:48,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 1 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-19 17:16:48,390 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2021-12-19 17:16:48,390 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 183 states and 308 transitions. cyclomatic complexity: 130 Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-19 17:16:48,739 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 183 states and 308 transitions. cyclomatic complexity: 130. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Result 1103 states and 1896 transitions. Complement of second has 60 states. [2021-12-19 17:16:48,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 1 stem states 9 non-accepting loop states 1 accepting loop states [2021-12-19 17:16:48,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-19 17:16:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2021-12-19 17:16:48,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 113 transitions. Stem has 5 letters. Loop has 47 letters. [2021-12-19 17:16:48,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:48,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 113 transitions. Stem has 52 letters. Loop has 47 letters. [2021-12-19 17:16:48,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:48,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 113 transitions. Stem has 5 letters. Loop has 94 letters. [2021-12-19 17:16:48,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:48,751 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1103 states and 1896 transitions. [2021-12-19 17:16:48,764 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 95 [2021-12-19 17:16:48,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1103 states to 847 states and 1435 transitions. [2021-12-19 17:16:48,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 275 [2021-12-19 17:16:48,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 277 [2021-12-19 17:16:48,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 847 states and 1435 transitions. [2021-12-19 17:16:48,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:16:48,775 INFO L681 BuchiCegarLoop]: Abstraction has 847 states and 1435 transitions. [2021-12-19 17:16:48,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states and 1435 transitions. [2021-12-19 17:16:48,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 737. [2021-12-19 17:16:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 452 states have (on average 1.1305309734513274) internal successors, (511), 439 states have internal predecessors, (511), 194 states have call successors, (194), 92 states have call predecessors, (194), 91 states have return successors, (470), 205 states have call predecessors, (470), 194 states have call successors, (470) [2021-12-19 17:16:48,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1175 transitions. [2021-12-19 17:16:48,812 INFO L704 BuchiCegarLoop]: Abstraction has 737 states and 1175 transitions. [2021-12-19 17:16:48,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:16:48,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-19 17:16:48,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-19 17:16:48,813 INFO L87 Difference]: Start difference. First operand 737 states and 1175 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-19 17:16:48,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:16:48,854 INFO L93 Difference]: Finished difference Result 799 states and 1321 transitions. [2021-12-19 17:16:48,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-19 17:16:48,856 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 799 states and 1321 transitions. [2021-12-19 17:16:48,865 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 93 [2021-12-19 17:16:48,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 799 states to 799 states and 1321 transitions. [2021-12-19 17:16:48,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2021-12-19 17:16:48,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2021-12-19 17:16:48,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 799 states and 1321 transitions. [2021-12-19 17:16:48,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:16:48,876 INFO L681 BuchiCegarLoop]: Abstraction has 799 states and 1321 transitions. [2021-12-19 17:16:48,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states and 1321 transitions. [2021-12-19 17:16:48,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 741. [2021-12-19 17:16:48,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 456 states have (on average 1.1293859649122806) internal successors, (515), 443 states have internal predecessors, (515), 194 states have call successors, (194), 92 states have call predecessors, (194), 91 states have return successors, (470), 205 states have call predecessors, (470), 194 states have call successors, (470) [2021-12-19 17:16:48,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1179 transitions. [2021-12-19 17:16:48,939 INFO L704 BuchiCegarLoop]: Abstraction has 741 states and 1179 transitions. [2021-12-19 17:16:48,939 INFO L587 BuchiCegarLoop]: Abstraction has 741 states and 1179 transitions. [2021-12-19 17:16:48,939 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-19 17:16:48,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 741 states and 1179 transitions. [2021-12-19 17:16:48,944 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 83 [2021-12-19 17:16:48,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:16:48,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:16:48,947 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-19 17:16:48,947 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:16:48,947 INFO L791 eck$LassoCheckResult]: Stem: 5273#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5250#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 5251#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 5272#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 5294#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 5643#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 5381#L43 [2021-12-19 17:16:48,948 INFO L793 eck$LassoCheckResult]: Loop: 5381#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 5316#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 5323#factENTRY ~n := #in~n; 5386#L25 assume !(~n <= 0); 5335#L26 call #t~ret0 := fact(~n - 1);< 5356#factENTRY ~n := #in~n; 5370#L25 assume !(~n <= 0); 5331#L26 call #t~ret0 := fact(~n - 1);< 5356#factENTRY ~n := #in~n; 5370#L25 assume ~n <= 0;#res := 1; 5369#factFINAL assume true; 5360#factEXIT >#66#return; 5359#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5357#factFINAL assume true; 5353#factEXIT >#66#return; 5347#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5378#factFINAL assume true; 5380#factEXIT >#68#return; 5318#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 5323#factENTRY ~n := #in~n; 5386#L25 assume ~n <= 0;#res := 1; 5384#factFINAL assume true; 5392#factEXIT >#70#return; 5379#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 5389#factENTRY ~n := #in~n; 5387#L25 assume !(~n <= 0); 5332#L26 call #t~ret0 := fact(~n - 1);< 5257#factENTRY ~n := #in~n; 5358#L25 assume !(~n <= 0); 5331#L26 call #t~ret0 := fact(~n - 1);< 5356#factENTRY ~n := #in~n; 5370#L25 assume ~n <= 0;#res := 1; 5369#factFINAL assume true; 5360#factEXIT >#66#return; 5359#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5357#factFINAL assume true; 5353#factEXIT >#66#return; 5347#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5378#factFINAL assume true; 5380#factEXIT >#72#return; 5312#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 5303#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 5301#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 5299#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 5270#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 5263#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 5264#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 5381#L43 [2021-12-19 17:16:48,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:48,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 1 times [2021-12-19 17:16:48,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:48,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678735513] [2021-12-19 17:16:48,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:48,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:48,958 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:48,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:48,965 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:16:48,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:48,966 INFO L85 PathProgramCache]: Analyzing trace with hash 1641418453, now seen corresponding path program 3 times [2021-12-19 17:16:48,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:48,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915724661] [2021-12-19 17:16:48,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:48,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:48,981 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:16:48,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [348603853] [2021-12-19 17:16:48,982 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 17:16:48,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:16:48,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:49,004 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:16:49,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2021-12-19 17:16:49,034 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-19 17:16:49,034 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:16:49,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 17:16:49,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-19 17:16:49,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 17:16:49,123 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:16:49,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915724661] [2021-12-19 17:16:49,123 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:16:49,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348603853] [2021-12-19 17:16:49,124 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348603853] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:16:49,124 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:16:49,124 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-19 17:16:49,124 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222512933] [2021-12-19 17:16:49,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:16:49,125 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:16:49,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:16:49,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-19 17:16:49,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-19 17:16:49,127 INFO L87 Difference]: Start difference. First operand 741 states and 1179 transitions. cyclomatic complexity: 449 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:16:49,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:16:49,187 INFO L93 Difference]: Finished difference Result 884 states and 1467 transitions. [2021-12-19 17:16:49,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 17:16:49,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 884 states and 1467 transitions. [2021-12-19 17:16:49,200 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 125 [2021-12-19 17:16:49,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 884 states to 866 states and 1449 transitions. [2021-12-19 17:16:49,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 284 [2021-12-19 17:16:49,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 284 [2021-12-19 17:16:49,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 866 states and 1449 transitions. [2021-12-19 17:16:49,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:16:49,217 INFO L681 BuchiCegarLoop]: Abstraction has 866 states and 1449 transitions. [2021-12-19 17:16:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states and 1449 transitions. [2021-12-19 17:16:49,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 759. [2021-12-19 17:16:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 474 states have (on average 1.1244725738396624) internal successors, (533), 461 states have internal predecessors, (533), 194 states have call successors, (194), 92 states have call predecessors, (194), 91 states have return successors, (470), 205 states have call predecessors, (470), 194 states have call successors, (470) [2021-12-19 17:16:49,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1197 transitions. [2021-12-19 17:16:49,243 INFO L704 BuchiCegarLoop]: Abstraction has 759 states and 1197 transitions. [2021-12-19 17:16:49,243 INFO L587 BuchiCegarLoop]: Abstraction has 759 states and 1197 transitions. [2021-12-19 17:16:49,243 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-19 17:16:49,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 759 states and 1197 transitions. [2021-12-19 17:16:49,247 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 85 [2021-12-19 17:16:49,247 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:16:49,247 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:16:49,251 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-19 17:16:49,251 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [14, 14, 8, 8, 8, 8, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:16:49,251 INFO L791 eck$LassoCheckResult]: Stem: 7051#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7023#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7024#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 7050#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 7067#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 7439#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7163#L43 [2021-12-19 17:16:49,253 INFO L793 eck$LassoCheckResult]: Loop: 7163#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 7085#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7152#factENTRY ~n := #in~n; 7161#L25 assume !(~n <= 0); 7093#L26 call #t~ret0 := fact(~n - 1);< 7117#factENTRY ~n := #in~n; 7131#L25 assume !(~n <= 0); 7104#L26 call #t~ret0 := fact(~n - 1);< 7117#factENTRY ~n := #in~n; 7131#L25 assume ~n <= 0;#res := 1; 7130#factFINAL assume true; 7121#factEXIT >#66#return; 7120#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7118#factFINAL assume true; 7115#factEXIT >#66#return; 7108#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7150#factFINAL assume true; 7151#factEXIT >#68#return; 7141#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7152#factENTRY ~n := #in~n; 7161#L25 assume !(~n <= 0); 7093#L26 call #t~ret0 := fact(~n - 1);< 7117#factENTRY ~n := #in~n; 7131#L25 assume ~n <= 0;#res := 1; 7130#factFINAL assume true; 7121#factEXIT >#66#return; 7125#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7167#factFINAL assume true; 7157#factEXIT >#70#return; 7140#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7152#factENTRY ~n := #in~n; 7161#L25 assume ~n <= 0;#res := 1; 7158#factFINAL assume true; 7139#factEXIT >#72#return; 7138#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 7137#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 7136#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 7134#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7071#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 7078#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7084#factENTRY ~n := #in~n; 7165#L25 assume !(~n <= 0); 7100#L26 call #t~ret0 := fact(~n - 1);< 7117#factENTRY ~n := #in~n; 7131#L25 assume !(~n <= 0); 7104#L26 call #t~ret0 := fact(~n - 1);< 7117#factENTRY ~n := #in~n; 7131#L25 assume !(~n <= 0); 7104#L26 call #t~ret0 := fact(~n - 1);< 7117#factENTRY ~n := #in~n; 7131#L25 assume ~n <= 0;#res := 1; 7130#factFINAL assume true; 7121#factEXIT >#66#return; 7120#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7118#factFINAL assume true; 7115#factEXIT >#66#return; 7113#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7114#factFINAL assume true; 7089#factEXIT >#66#return; 7088#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7087#factFINAL assume true; 7086#factEXIT >#74#return; 7077#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7084#factENTRY ~n := #in~n; 7165#L25 assume !(~n <= 0); 7100#L26 call #t~ret0 := fact(~n - 1);< 7117#factENTRY ~n := #in~n; 7131#L25 assume ~n <= 0;#res := 1; 7130#factFINAL assume true; 7121#factEXIT >#66#return; 7126#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7148#factFINAL assume true; 7075#factEXIT >#76#return; 7076#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7133#factENTRY ~n := #in~n; 7132#L25 assume !(~n <= 0); 7100#L26 call #t~ret0 := fact(~n - 1);< 7117#factENTRY ~n := #in~n; 7131#L25 assume ~n <= 0;#res := 1; 7130#factFINAL assume true; 7121#factEXIT >#66#return; 7126#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7148#factFINAL assume true; 7075#factEXIT >#78#return; 7074#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 7073#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 7072#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 7070#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 7047#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 7037#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 7038#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7163#L43 [2021-12-19 17:16:49,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:49,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 2 times [2021-12-19 17:16:49,254 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:49,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691617209] [2021-12-19 17:16:49,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:49,254 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:49,259 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:49,271 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:16:49,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:49,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1733614270, now seen corresponding path program 1 times [2021-12-19 17:16:49,272 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:49,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083769893] [2021-12-19 17:16:49,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:49,272 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:49,282 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:16:49,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1635913333] [2021-12-19 17:16:49,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:49,284 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:16:49,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:49,292 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:16:49,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2021-12-19 17:16:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:49,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-19 17:16:49,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 241 proven. 27 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2021-12-19 17:16:49,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:16:49,856 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 19 proven. 180 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2021-12-19 17:16:49,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:16:49,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083769893] [2021-12-19 17:16:49,856 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:16:49,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635913333] [2021-12-19 17:16:49,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635913333] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:16:49,856 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:16:49,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2021-12-19 17:16:49,856 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073093653] [2021-12-19 17:16:49,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:16:49,857 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:16:49,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:16:49,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-19 17:16:49,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-12-19 17:16:49,857 INFO L87 Difference]: Start difference. First operand 759 states and 1197 transitions. cyclomatic complexity: 449 Second operand has 15 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 10 states have call successors, (17), 2 states have call predecessors, (17), 6 states have return successors, (18), 8 states have call predecessors, (18), 10 states have call successors, (18) [2021-12-19 17:16:50,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:16:50,145 INFO L93 Difference]: Finished difference Result 1161 states and 1751 transitions. [2021-12-19 17:16:50,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-19 17:16:50,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1161 states and 1751 transitions. [2021-12-19 17:16:50,154 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 195 [2021-12-19 17:16:50,161 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1161 states to 1161 states and 1751 transitions. [2021-12-19 17:16:50,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 367 [2021-12-19 17:16:50,162 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 367 [2021-12-19 17:16:50,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1161 states and 1751 transitions. [2021-12-19 17:16:50,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:16:50,162 INFO L681 BuchiCegarLoop]: Abstraction has 1161 states and 1751 transitions. [2021-12-19 17:16:50,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states and 1751 transitions. [2021-12-19 17:16:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 759. [2021-12-19 17:16:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 474 states have (on average 1.1244725738396624) internal successors, (533), 461 states have internal predecessors, (533), 194 states have call successors, (194), 92 states have call predecessors, (194), 91 states have return successors, (470), 205 states have call predecessors, (470), 194 states have call successors, (470) [2021-12-19 17:16:50,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1197 transitions. [2021-12-19 17:16:50,181 INFO L704 BuchiCegarLoop]: Abstraction has 759 states and 1197 transitions. [2021-12-19 17:16:50,181 INFO L587 BuchiCegarLoop]: Abstraction has 759 states and 1197 transitions. [2021-12-19 17:16:50,181 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-19 17:16:50,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 759 states and 1197 transitions. [2021-12-19 17:16:50,184 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 85 [2021-12-19 17:16:50,184 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:16:50,184 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:16:50,185 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-19 17:16:50,185 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [14, 14, 8, 8, 8, 8, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:16:50,185 INFO L791 eck$LassoCheckResult]: Stem: 9537#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9511#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 9512#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 9536#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 9559#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 9935#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 9538#L43 [2021-12-19 17:16:50,185 INFO L793 eck$LassoCheckResult]: Loop: 9538#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 9539#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9649#factENTRY ~n := #in~n; 9656#L25 assume !(~n <= 0); 9590#L26 call #t~ret0 := fact(~n - 1);< 9610#factENTRY ~n := #in~n; 9624#L25 assume ~n <= 0;#res := 1; 9623#factFINAL assume true; 9614#factEXIT >#66#return; 9622#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9654#factFINAL assume true; 9650#factEXIT >#68#return; 9641#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 9649#factENTRY ~n := #in~n; 9656#L25 assume !(~n <= 0); 9590#L26 call #t~ret0 := fact(~n - 1);< 9610#factENTRY ~n := #in~n; 9624#L25 assume !(~n <= 0); 9587#L26 call #t~ret0 := fact(~n - 1);< 9610#factENTRY ~n := #in~n; 9624#L25 assume ~n <= 0;#res := 1; 9623#factFINAL assume true; 9614#factEXIT >#66#return; 9613#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9611#factFINAL assume true; 9607#factEXIT >#66#return; 9603#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9647#factFINAL assume true; 9648#factEXIT >#70#return; 9640#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 9652#factENTRY ~n := #in~n; 9653#L25 assume ~n <= 0;#res := 1; 9651#factFINAL assume true; 9639#factEXIT >#72#return; 9638#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 9637#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 9636#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 9635#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 9565#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 9572#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9578#factENTRY ~n := #in~n; 9630#L25 assume !(~n <= 0); 9596#L26 call #t~ret0 := fact(~n - 1);< 9610#factENTRY ~n := #in~n; 9624#L25 assume !(~n <= 0); 9587#L26 call #t~ret0 := fact(~n - 1);< 9610#factENTRY ~n := #in~n; 9624#L25 assume !(~n <= 0); 9587#L26 call #t~ret0 := fact(~n - 1);< 9610#factENTRY ~n := #in~n; 9624#L25 assume ~n <= 0;#res := 1; 9623#factFINAL assume true; 9614#factEXIT >#66#return; 9613#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9611#factFINAL assume true; 9607#factEXIT >#66#return; 9601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9606#factFINAL assume true; 9582#factEXIT >#66#return; 9581#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9580#factFINAL assume true; 9579#factEXIT >#74#return; 9571#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 9578#factENTRY ~n := #in~n; 9630#L25 assume !(~n <= 0); 9596#L26 call #t~ret0 := fact(~n - 1);< 9610#factENTRY ~n := #in~n; 9624#L25 assume ~n <= 0;#res := 1; 9623#factFINAL assume true; 9614#factEXIT >#66#return; 9621#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9631#factFINAL assume true; 9569#factEXIT >#76#return; 9570#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 9574#factENTRY ~n := #in~n; 9625#L25 assume !(~n <= 0); 9596#L26 call #t~ret0 := fact(~n - 1);< 9610#factENTRY ~n := #in~n; 9624#L25 assume ~n <= 0;#res := 1; 9623#factFINAL assume true; 9614#factEXIT >#66#return; 9621#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9631#factFINAL assume true; 9569#factEXIT >#78#return; 9568#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 9567#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 9566#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 9564#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 9533#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 9524#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 9525#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 9538#L43 [2021-12-19 17:16:50,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:50,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 3 times [2021-12-19 17:16:50,186 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:50,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763456493] [2021-12-19 17:16:50,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:50,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:50,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:50,188 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:50,190 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:16:50,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:50,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1212552818, now seen corresponding path program 2 times [2021-12-19 17:16:50,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:50,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13055886] [2021-12-19 17:16:50,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:50,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:50,193 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:16:50,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1204328314] [2021-12-19 17:16:50,194 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 17:16:50,194 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:16:50,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:50,195 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:16:50,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2021-12-19 17:16:50,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 17:16:50,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:16:50,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-19 17:16:50,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 218 proven. 27 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2021-12-19 17:16:50,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:16:50,707 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 8 proven. 167 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2021-12-19 17:16:50,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:16:50,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13055886] [2021-12-19 17:16:50,707 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:16:50,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204328314] [2021-12-19 17:16:50,707 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204328314] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:16:50,707 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:16:50,707 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2021-12-19 17:16:50,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278081180] [2021-12-19 17:16:50,707 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:16:50,708 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:16:50,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:16:50,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-19 17:16:50,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2021-12-19 17:16:50,708 INFO L87 Difference]: Start difference. First operand 759 states and 1197 transitions. cyclomatic complexity: 449 Second operand has 15 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 14 states have internal predecessors, (43), 10 states have call successors, (18), 2 states have call predecessors, (18), 6 states have return successors, (18), 6 states have call predecessors, (18), 10 states have call successors, (18) [2021-12-19 17:16:50,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:16:50,952 INFO L93 Difference]: Finished difference Result 968 states and 1497 transitions. [2021-12-19 17:16:50,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-19 17:16:50,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 968 states and 1497 transitions. [2021-12-19 17:16:50,958 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 125 [2021-12-19 17:16:50,963 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 968 states to 963 states and 1482 transitions. [2021-12-19 17:16:50,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 304 [2021-12-19 17:16:50,964 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 304 [2021-12-19 17:16:50,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 963 states and 1482 transitions. [2021-12-19 17:16:50,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:16:50,964 INFO L681 BuchiCegarLoop]: Abstraction has 963 states and 1482 transitions. [2021-12-19 17:16:50,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states and 1482 transitions. [2021-12-19 17:16:50,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 813. [2021-12-19 17:16:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 813 states, 516 states have (on average 1.1375968992248062) internal successors, (587), 494 states have internal predecessors, (587), 206 states have call successors, (206), 113 states have call predecessors, (206), 91 states have return successors, (465), 205 states have call predecessors, (465), 206 states have call successors, (465) [2021-12-19 17:16:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1258 transitions. [2021-12-19 17:16:50,998 INFO L704 BuchiCegarLoop]: Abstraction has 813 states and 1258 transitions. [2021-12-19 17:16:50,998 INFO L587 BuchiCegarLoop]: Abstraction has 813 states and 1258 transitions. [2021-12-19 17:16:50,998 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-19 17:16:50,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 813 states and 1258 transitions. [2021-12-19 17:16:51,002 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 85 [2021-12-19 17:16:51,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:16:51,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:16:51,003 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-19 17:16:51,003 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [17, 17, 11, 11, 11, 11, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:16:51,003 INFO L791 eck$LassoCheckResult]: Stem: 11844#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 11814#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 11815#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 11843#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 11861#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 12205#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 11845#L43 [2021-12-19 17:16:51,004 INFO L793 eck$LassoCheckResult]: Loop: 11845#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 11846#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 11959#factENTRY ~n := #in~n; 11967#L25 assume !(~n <= 0); 11887#L26 call #t~ret0 := fact(~n - 1);< 11915#factENTRY ~n := #in~n; 11934#L25 assume !(~n <= 0); 11886#L26 call #t~ret0 := fact(~n - 1);< 11915#factENTRY ~n := #in~n; 11934#L25 assume ~n <= 0;#res := 1; 11931#factFINAL assume true; 11919#factEXIT >#66#return; 11918#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11916#factFINAL assume true; 11912#factEXIT >#66#return; 11904#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11964#factFINAL assume true; 11960#factEXIT >#68#return; 11953#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 11959#factENTRY ~n := #in~n; 11967#L25 assume !(~n <= 0); 11887#L26 call #t~ret0 := fact(~n - 1);< 11915#factENTRY ~n := #in~n; 11934#L25 assume ~n <= 0;#res := 1; 11931#factFINAL assume true; 11919#factEXIT >#66#return; 11924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11957#factFINAL assume true; 11958#factEXIT >#70#return; 11954#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 11966#factENTRY ~n := #in~n; 11968#L25 assume !(~n <= 0); 11887#L26 call #t~ret0 := fact(~n - 1);< 11915#factENTRY ~n := #in~n; 11934#L25 assume ~n <= 0;#res := 1; 11931#factFINAL assume true; 11919#factEXIT >#66#return; 11924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11957#factFINAL assume true; 11958#factEXIT >#72#return; 11948#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 11947#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 11946#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 11943#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 11867#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 11873#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 11880#factENTRY ~n := #in~n; 11937#L25 assume !(~n <= 0); 11889#L26 call #t~ret0 := fact(~n - 1);< 11915#factENTRY ~n := #in~n; 11934#L25 assume !(~n <= 0); 11886#L26 call #t~ret0 := fact(~n - 1);< 11915#factENTRY ~n := #in~n; 11934#L25 assume !(~n <= 0); 11886#L26 call #t~ret0 := fact(~n - 1);< 11915#factENTRY ~n := #in~n; 11934#L25 assume ~n <= 0;#res := 1; 11931#factFINAL assume true; 11919#factEXIT >#66#return; 11918#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11916#factFINAL assume true; 11912#factEXIT >#66#return; 11903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11910#factFINAL assume true; 11884#factEXIT >#66#return; 11883#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11882#factFINAL assume true; 11881#factEXIT >#74#return; 11874#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 11880#factENTRY ~n := #in~n; 11937#L25 assume !(~n <= 0); 11889#L26 call #t~ret0 := fact(~n - 1);< 11915#factENTRY ~n := #in~n; 11934#L25 assume !(~n <= 0); 11886#L26 call #t~ret0 := fact(~n - 1);< 11915#factENTRY ~n := #in~n; 11934#L25 assume ~n <= 0;#res := 1; 11931#factFINAL assume true; 11919#factEXIT >#66#return; 11918#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11916#factFINAL assume true; 11912#factEXIT >#66#return; 11914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11877#factFINAL assume true; 11879#factEXIT >#76#return; 11872#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 11876#factENTRY ~n := #in~n; 11936#L25 assume !(~n <= 0); 11889#L26 call #t~ret0 := fact(~n - 1);< 11915#factENTRY ~n := #in~n; 11934#L25 assume !(~n <= 0); 11886#L26 call #t~ret0 := fact(~n - 1);< 11915#factENTRY ~n := #in~n; 11934#L25 assume ~n <= 0;#res := 1; 11931#factFINAL assume true; 11919#factEXIT >#66#return; 11918#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11916#factFINAL assume true; 11912#factEXIT >#66#return; 11914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11877#factFINAL assume true; 11879#factEXIT >#78#return; 11870#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 11869#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 11868#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 11866#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 11840#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 11830#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 11831#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 11845#L43 [2021-12-19 17:16:51,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:51,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 4 times [2021-12-19 17:16:51,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:51,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463733306] [2021-12-19 17:16:51,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:51,005 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:51,007 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:51,009 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:16:51,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:51,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1843234170, now seen corresponding path program 3 times [2021-12-19 17:16:51,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:51,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2746669] [2021-12-19 17:16:51,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:51,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:51,014 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:16:51,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [972071211] [2021-12-19 17:16:51,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 17:16:51,014 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:16:51,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:51,016 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:16:51,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2021-12-19 17:16:51,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-19 17:16:51,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:16:51,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-19 17:16:51,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:51,231 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 131 proven. 3 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2021-12-19 17:16:51,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:16:51,484 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 131 proven. 4 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2021-12-19 17:16:51,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:16:51,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2746669] [2021-12-19 17:16:51,485 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:16:51,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972071211] [2021-12-19 17:16:51,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972071211] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:16:51,485 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:16:51,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2021-12-19 17:16:51,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083856331] [2021-12-19 17:16:51,486 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:16:51,486 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:16:51,486 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:16:51,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-19 17:16:51,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-19 17:16:51,487 INFO L87 Difference]: Start difference. First operand 813 states and 1258 transitions. cyclomatic complexity: 456 Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 6 states have call successors, (10), 1 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2021-12-19 17:16:51,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:16:51,675 INFO L93 Difference]: Finished difference Result 971 states and 1551 transitions. [2021-12-19 17:16:51,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-19 17:16:51,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 971 states and 1551 transitions. [2021-12-19 17:16:51,685 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 133 [2021-12-19 17:16:51,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 971 states to 963 states and 1535 transitions. [2021-12-19 17:16:51,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 315 [2021-12-19 17:16:51,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 315 [2021-12-19 17:16:51,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 963 states and 1535 transitions. [2021-12-19 17:16:51,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:16:51,698 INFO L681 BuchiCegarLoop]: Abstraction has 963 states and 1535 transitions. [2021-12-19 17:16:51,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states and 1535 transitions. [2021-12-19 17:16:51,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 876. [2021-12-19 17:16:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 534 states have (on average 1.155430711610487) internal successors, (617), 524 states have internal predecessors, (617), 251 states have call successors, (251), 113 states have call predecessors, (251), 91 states have return successors, (552), 238 states have call predecessors, (552), 247 states have call successors, (552) [2021-12-19 17:16:51,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1420 transitions. [2021-12-19 17:16:51,720 INFO L704 BuchiCegarLoop]: Abstraction has 876 states and 1420 transitions. [2021-12-19 17:16:51,720 INFO L587 BuchiCegarLoop]: Abstraction has 876 states and 1420 transitions. [2021-12-19 17:16:51,720 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-19 17:16:51,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 876 states and 1420 transitions. [2021-12-19 17:16:51,724 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 109 [2021-12-19 17:16:51,724 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:16:51,724 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:16:51,725 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-19 17:16:51,725 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [13, 13, 7, 7, 7, 7, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:16:51,726 INFO L791 eck$LassoCheckResult]: Stem: 14296#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 14267#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 14268#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 14295#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 14313#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 14845#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 14423#L43 [2021-12-19 17:16:51,726 INFO L793 eck$LassoCheckResult]: Loop: 14423#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 14338#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 14421#factENTRY ~n := #in~n; 14430#L25 assume !(~n <= 0); 14359#L26 call #t~ret0 := fact(~n - 1);< 14372#factENTRY ~n := #in~n; 14390#L25 assume ~n <= 0;#res := 1; 14388#factFINAL assume true; 14376#factEXIT >#66#return; 14385#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 14419#factFINAL assume true; 14420#factEXIT >#68#return; 14404#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 14422#factENTRY ~n := #in~n; 14433#L25 assume !(~n <= 0); 14378#L26 call #t~ret0 := fact(~n - 1);< 14276#factENTRY ~n := #in~n; 14389#L25 assume ~n <= 0;#res := 1; 14388#factFINAL assume true; 14376#factEXIT >#66#return; 14385#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 14419#factFINAL assume true; 14420#factEXIT >#70#return; 14405#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 14426#factENTRY ~n := #in~n; 14427#L25 assume ~n <= 0;#res := 1; 14425#factFINAL assume true; 14402#factEXIT >#72#return; 14401#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 14400#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 14398#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 14396#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 14337#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 14323#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 14336#factENTRY ~n := #in~n; 14397#L25 assume !(~n <= 0); 14356#L26 call #t~ret0 := fact(~n - 1);< 14372#factENTRY ~n := #in~n; 14390#L25 assume !(~n <= 0); 14355#L26 call #t~ret0 := fact(~n - 1);< 14372#factENTRY ~n := #in~n; 14390#L25 assume !(~n <= 0); 14355#L26 call #t~ret0 := fact(~n - 1);< 14372#factENTRY ~n := #in~n; 14390#L25 assume ~n <= 0;#res := 1; 14388#factFINAL assume true; 14376#factEXIT >#66#return; 14375#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 14373#factFINAL assume true; 14369#factEXIT >#66#return; 14365#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 14368#factFINAL assume true; 14342#factEXIT >#66#return; 14341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 14340#factFINAL assume true; 14339#factEXIT >#74#return; 14326#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 14336#factENTRY ~n := #in~n; 14397#L25 assume !(~n <= 0); 14356#L26 call #t~ret0 := fact(~n - 1);< 14372#factENTRY ~n := #in~n; 14390#L25 assume ~n <= 0;#res := 1; 14388#factFINAL assume true; 14376#factEXIT >#66#return; 14386#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 14399#factFINAL assume true; 14322#factEXIT >#76#return; 14324#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 14331#factENTRY ~n := #in~n; 14395#L25 assume !(~n <= 0); 14356#L26 call #t~ret0 := fact(~n - 1);< 14372#factENTRY ~n := #in~n; 14390#L25 assume ~n <= 0;#res := 1; 14388#factFINAL assume true; 14376#factEXIT >#66#return; 14386#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 14399#factFINAL assume true; 14322#factEXIT >#78#return; 14321#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 14320#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 14319#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 14317#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 14293#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 14282#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 14283#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 14423#L43 [2021-12-19 17:16:51,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:51,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 5 times [2021-12-19 17:16:51,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:51,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272923413] [2021-12-19 17:16:51,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:51,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:51,730 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:51,734 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:16:51,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:51,734 INFO L85 PathProgramCache]: Analyzing trace with hash -500195718, now seen corresponding path program 4 times [2021-12-19 17:16:51,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:51,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564079005] [2021-12-19 17:16:51,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:51,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:51,740 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:16:51,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1850464860] [2021-12-19 17:16:51,741 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 17:16:51,741 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:16:51,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:51,763 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:16:51,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2021-12-19 17:16:51,823 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 17:16:51,824 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:16:51,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-19 17:16:51,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 216 proven. 57 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-12-19 17:16:51,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:16:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 52 proven. 138 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2021-12-19 17:16:52,299 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:16:52,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564079005] [2021-12-19 17:16:52,299 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:16:52,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850464860] [2021-12-19 17:16:52,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850464860] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:16:52,299 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:16:52,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 19 [2021-12-19 17:16:52,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85719683] [2021-12-19 17:16:52,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:16:52,300 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:16:52,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:16:52,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-19 17:16:52,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2021-12-19 17:16:52,300 INFO L87 Difference]: Start difference. First operand 876 states and 1420 transitions. cyclomatic complexity: 555 Second operand has 19 states, 16 states have (on average 3.0625) internal successors, (49), 19 states have internal predecessors, (49), 12 states have call successors, (17), 2 states have call predecessors, (17), 7 states have return successors, (18), 7 states have call predecessors, (18), 12 states have call successors, (18) [2021-12-19 17:16:52,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:16:52,875 INFO L93 Difference]: Finished difference Result 1277 states and 2438 transitions. [2021-12-19 17:16:52,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-19 17:16:52,876 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1277 states and 2438 transitions. [2021-12-19 17:16:52,885 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 215 [2021-12-19 17:16:52,896 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1277 states to 1275 states and 2433 transitions. [2021-12-19 17:16:52,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 424 [2021-12-19 17:16:52,897 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 424 [2021-12-19 17:16:52,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1275 states and 2433 transitions. [2021-12-19 17:16:52,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:16:52,898 INFO L681 BuchiCegarLoop]: Abstraction has 1275 states and 2433 transitions. [2021-12-19 17:16:52,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states and 2433 transitions. [2021-12-19 17:16:52,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1034. [2021-12-19 17:16:52,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 629 states have (on average 1.1605723370429253) internal successors, (730), 621 states have internal predecessors, (730), 309 states have call successors, (309), 113 states have call predecessors, (309), 96 states have return successors, (722), 299 states have call predecessors, (722), 305 states have call successors, (722) [2021-12-19 17:16:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1761 transitions. [2021-12-19 17:16:52,933 INFO L704 BuchiCegarLoop]: Abstraction has 1034 states and 1761 transitions. [2021-12-19 17:16:52,933 INFO L587 BuchiCegarLoop]: Abstraction has 1034 states and 1761 transitions. [2021-12-19 17:16:52,933 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-19 17:16:52,933 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1034 states and 1761 transitions. [2021-12-19 17:16:52,937 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 157 [2021-12-19 17:16:52,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:16:52,937 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:16:52,938 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-19 17:16:52,938 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [23, 23, 14, 14, 14, 14, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:16:52,938 INFO L791 eck$LassoCheckResult]: Stem: 17005#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 16977#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 16978#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 17004#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 17035#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 17597#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 17158#L43 [2021-12-19 17:16:52,938 INFO L793 eck$LassoCheckResult]: Loop: 17158#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 17144#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 17157#factENTRY ~n := #in~n; 17169#L25 assume !(~n <= 0); 17070#L26 call #t~ret0 := fact(~n - 1);< 17105#factENTRY ~n := #in~n; 17131#L25 assume ~n <= 0;#res := 1; 17108#factFINAL assume true; 17092#factEXIT >#66#return; 17099#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17167#factFINAL assume true; 17166#factEXIT >#68#return; 17145#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 17165#factENTRY ~n := #in~n; 17164#L25 assume !(~n <= 0); 17093#L26 call #t~ret0 := fact(~n - 1);< 17111#factENTRY ~n := #in~n; 17114#L25 assume ~n <= 0;#res := 1; 17108#factFINAL assume true; 17092#factEXIT >#66#return; 17099#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17167#factFINAL assume true; 17166#factEXIT >#70#return; 17143#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 17171#factENTRY ~n := #in~n; 17162#L25 assume ~n <= 0;#res := 1; 17163#factFINAL assume true; 17141#factEXIT >#72#return; 17140#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 17139#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 17138#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 17137#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 17087#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 17088#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 17157#factENTRY ~n := #in~n; 17169#L25 assume !(~n <= 0); 17070#L26 call #t~ret0 := fact(~n - 1);< 17105#factENTRY ~n := #in~n; 17131#L25 assume !(~n <= 0); 17066#L26 call #t~ret0 := fact(~n - 1);< 17105#factENTRY ~n := #in~n; 17131#L25 assume ~n <= 0;#res := 1; 17108#factFINAL assume true; 17092#factEXIT >#66#return; 17098#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17120#factFINAL assume true; 17117#factEXIT >#66#return; 17083#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17154#factFINAL assume true; 17156#factEXIT >#68#return; 17146#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 17157#factENTRY ~n := #in~n; 17169#L25 assume !(~n <= 0); 17070#L26 call #t~ret0 := fact(~n - 1);< 17105#factENTRY ~n := #in~n; 17131#L25 assume ~n <= 0;#res := 1; 17108#factFINAL assume true; 17092#factEXIT >#66#return; 17099#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17167#factFINAL assume true; 17166#factEXIT >#70#return; 17155#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 17168#factENTRY ~n := #in~n; 17170#L25 assume !(~n <= 0); 17070#L26 call #t~ret0 := fact(~n - 1);< 17105#factENTRY ~n := #in~n; 17131#L25 assume !(~n <= 0); 17066#L26 call #t~ret0 := fact(~n - 1);< 17105#factENTRY ~n := #in~n; 17131#L25 assume ~n <= 0;#res := 1; 17108#factFINAL assume true; 17092#factEXIT >#66#return; 17098#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17120#factFINAL assume true; 17117#factEXIT >#66#return; 17083#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17154#factFINAL assume true; 17156#factEXIT >#72#return; 17135#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 17134#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 17106#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 17091#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 17089#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 17045#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 17055#factENTRY ~n := #in~n; 17115#L25 assume !(~n <= 0); 17071#L26 call #t~ret0 := fact(~n - 1);< 17105#factENTRY ~n := #in~n; 17131#L25 assume !(~n <= 0); 17066#L26 call #t~ret0 := fact(~n - 1);< 17105#factENTRY ~n := #in~n; 17131#L25 assume !(~n <= 0); 17066#L26 call #t~ret0 := fact(~n - 1);< 17105#factENTRY ~n := #in~n; 17131#L25 assume ~n <= 0;#res := 1; 17108#factFINAL assume true; 17092#factEXIT >#66#return; 17098#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17120#factFINAL assume true; 17117#factEXIT >#66#return; 17080#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17136#factFINAL assume true; 17062#factEXIT >#66#return; 17061#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17057#factFINAL assume true; 17056#factEXIT >#74#return; 17051#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 17055#factENTRY ~n := #in~n; 17115#L25 assume !(~n <= 0); 17071#L26 call #t~ret0 := fact(~n - 1);< 17105#factENTRY ~n := #in~n; 17131#L25 assume !(~n <= 0); 17066#L26 call #t~ret0 := fact(~n - 1);< 17105#factENTRY ~n := #in~n; 17131#L25 assume !(~n <= 0); 17066#L26 call #t~ret0 := fact(~n - 1);< 17105#factENTRY ~n := #in~n; 17131#L25 assume ~n <= 0;#res := 1; 17108#factFINAL assume true; 17092#factEXIT >#66#return; 17098#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17120#factFINAL assume true; 17117#factEXIT >#66#return; 17080#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17136#factFINAL assume true; 17062#factEXIT >#66#return; 17061#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17057#factFINAL assume true; 17056#factEXIT >#76#return; 17049#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 17052#factENTRY ~n := #in~n; 17107#L25 assume !(~n <= 0); 17071#L26 call #t~ret0 := fact(~n - 1);< 17105#factENTRY ~n := #in~n; 17131#L25 assume ~n <= 0;#res := 1; 17108#factFINAL assume true; 17092#factEXIT >#66#return; 17090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 17053#factFINAL assume true; 17054#factEXIT >#78#return; 17041#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 17040#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 17039#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 17037#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 16995#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 16991#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 16992#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 17158#L43 [2021-12-19 17:16:52,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:52,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 6 times [2021-12-19 17:16:52,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:52,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705498418] [2021-12-19 17:16:52,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:52,939 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:52,942 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:52,944 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:16:52,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:52,944 INFO L85 PathProgramCache]: Analyzing trace with hash 750072755, now seen corresponding path program 5 times [2021-12-19 17:16:52,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:52,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432584593] [2021-12-19 17:16:52,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:52,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:52,949 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:16:52,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [500492901] [2021-12-19 17:16:52,949 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 17:16:52,949 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:16:52,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:52,951 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:16:52,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2021-12-19 17:16:53,009 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2021-12-19 17:16:53,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:16:53,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-19 17:16:53,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:53,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1211 backedges. 718 proven. 91 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2021-12-19 17:16:53,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:16:53,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1211 backedges. 100 proven. 300 refuted. 0 times theorem prover too weak. 811 trivial. 0 not checked. [2021-12-19 17:16:53,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:16:53,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432584593] [2021-12-19 17:16:53,675 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:16:53,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500492901] [2021-12-19 17:16:53,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500492901] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:16:53,675 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:16:53,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 20 [2021-12-19 17:16:53,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830518956] [2021-12-19 17:16:53,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:16:53,677 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:16:53,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:16:53,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-19 17:16:53,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2021-12-19 17:16:53,678 INFO L87 Difference]: Start difference. First operand 1034 states and 1761 transitions. cyclomatic complexity: 738 Second operand has 20 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 18 states have internal predecessors, (53), 15 states have call successors, (25), 2 states have call predecessors, (25), 6 states have return successors, (25), 11 states have call predecessors, (25), 15 states have call successors, (25) [2021-12-19 17:16:54,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:16:54,389 INFO L93 Difference]: Finished difference Result 1674 states and 2753 transitions. [2021-12-19 17:16:54,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-12-19 17:16:54,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1674 states and 2753 transitions. [2021-12-19 17:16:54,422 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 298 [2021-12-19 17:16:54,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1674 states to 1431 states and 2377 transitions. [2021-12-19 17:16:54,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 525 [2021-12-19 17:16:54,433 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 525 [2021-12-19 17:16:54,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1431 states and 2377 transitions. [2021-12-19 17:16:54,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:16:54,433 INFO L681 BuchiCegarLoop]: Abstraction has 1431 states and 2377 transitions. [2021-12-19 17:16:54,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states and 2377 transitions. [2021-12-19 17:16:54,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1018. [2021-12-19 17:16:54,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 600 states have (on average 1.175) internal successors, (705), 603 states have internal predecessors, (705), 343 states have call successors, (343), 92 states have call predecessors, (343), 75 states have return successors, (805), 322 states have call predecessors, (805), 340 states have call successors, (805) [2021-12-19 17:16:54,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1853 transitions. [2021-12-19 17:16:54,464 INFO L704 BuchiCegarLoop]: Abstraction has 1018 states and 1853 transitions. [2021-12-19 17:16:54,464 INFO L587 BuchiCegarLoop]: Abstraction has 1018 states and 1853 transitions. [2021-12-19 17:16:54,465 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-19 17:16:54,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1018 states and 1853 transitions. [2021-12-19 17:16:54,468 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 189 [2021-12-19 17:16:54,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:16:54,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:16:54,469 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:16:54,469 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:16:54,469 INFO L791 eck$LassoCheckResult]: Stem: 20680#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 20648#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 20649#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 20679#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 20695#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 20919#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 20918#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 20800#L30 [2021-12-19 17:16:54,469 INFO L793 eck$LassoCheckResult]: Loop: 20800#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 20838#factENTRY ~n := #in~n; 20887#L25 assume !(~n <= 0); 20740#L26 call #t~ret0 := fact(~n - 1);< 20657#factENTRY ~n := #in~n; 20762#L25 assume ~n <= 0;#res := 1; 20760#factFINAL assume true; 20735#factEXIT >#66#return; 20752#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20876#factFINAL assume true; 20866#factEXIT >#68#return; 20821#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 20838#factENTRY ~n := #in~n; 20887#L25 assume ~n <= 0;#res := 1; 20839#factFINAL assume true; 20813#factEXIT >#70#return; 20832#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 20875#factENTRY ~n := #in~n; 20882#L25 assume !(~n <= 0); 20744#L26 call #t~ret0 := fact(~n - 1);< 20757#factENTRY ~n := #in~n; 20769#L25 assume ~n <= 0;#res := 1; 20760#factFINAL assume true; 20735#factEXIT >#66#return; 20752#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 20876#factFINAL assume true; 20866#factEXIT >#72#return; 20829#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 20968#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 20966#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 20945#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 20799#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 20800#L30 [2021-12-19 17:16:54,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:54,470 INFO L85 PathProgramCache]: Analyzing trace with hash 553673399, now seen corresponding path program 1 times [2021-12-19 17:16:54,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:54,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856447522] [2021-12-19 17:16:54,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:54,470 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:54,474 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:54,479 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:16:54,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:54,480 INFO L85 PathProgramCache]: Analyzing trace with hash 46645474, now seen corresponding path program 1 times [2021-12-19 17:16:54,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:54,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511956131] [2021-12-19 17:16:54,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:54,480 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:54,483 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:16:54,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [493378527] [2021-12-19 17:16:54,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:54,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:16:54,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:54,489 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:16:54,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2021-12-19 17:16:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:54,529 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:54,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:54,544 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:16:54,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:54,544 INFO L85 PathProgramCache]: Analyzing trace with hash 824167320, now seen corresponding path program 1 times [2021-12-19 17:16:54,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:54,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589113466] [2021-12-19 17:16:54,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:54,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:54,551 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:16:54,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1821595381] [2021-12-19 17:16:54,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:54,552 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:16:54,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:54,571 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:16:54,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2021-12-19 17:16:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:54,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 17:16:54,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-19 17:16:54,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:16:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-19 17:16:54,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:16:54,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589113466] [2021-12-19 17:16:54,739 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:16:54,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821595381] [2021-12-19 17:16:54,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821595381] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:16:54,739 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:16:54,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-12-19 17:16:54,739 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286145105] [2021-12-19 17:16:54,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:16:55,002 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:16:55,002 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:16:55,002 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:16:55,002 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:16:55,002 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 17:16:55,002 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:55,002 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:16:55,002 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:16:55,003 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2021-12-19 17:16:55,003 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:16:55,003 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:16:55,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:55,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:55,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:55,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:55,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:55,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:55,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:55,049 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:16:55,049 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 17:16:55,049 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:55,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:55,051 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:55,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2021-12-19 17:16:55,054 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:55,054 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:55,060 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:55,060 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:55,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:55,076 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:55,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:55,077 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:55,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2021-12-19 17:16:55,079 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:55,079 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:55,095 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:55,095 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:55,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:55,118 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:55,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:55,119 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:55,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2021-12-19 17:16:55,121 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:55,121 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:55,129 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:55,129 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:55,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2021-12-19 17:16:55,149 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:55,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:55,160 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:55,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2021-12-19 17:16:55,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:55,162 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:55,169 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:55,169 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret9#1=0} Honda state: {ULTIMATE.start_main_#t~ret9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:55,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2021-12-19 17:16:55,189 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:55,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:55,190 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:55,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2021-12-19 17:16:55,199 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:55,207 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:55,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2021-12-19 17:16:55,228 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:55,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:55,229 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:55,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2021-12-19 17:16:55,231 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 17:16:55,231 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:55,716 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 17:16:55,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:55,721 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:16:55,721 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:16:55,721 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:16:55,721 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:16:55,721 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:16:55,721 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:55,721 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:16:55,721 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:16:55,721 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2021-12-19 17:16:55,721 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:16:55,721 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:16:55,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:55,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:55,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:55,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:55,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:55,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:55,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:55,819 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:16:55,819 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:16:55,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:55,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:55,820 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:55,838 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:55,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2021-12-19 17:16:55,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:55,843 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:55,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:55,843 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:55,843 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:55,845 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:55,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:55,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:55,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2021-12-19 17:16:55,861 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:55,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:55,862 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:55,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2021-12-19 17:16:55,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:55,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:55,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:55,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:55,869 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:55,869 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:55,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:55,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:55,885 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:55,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2021-12-19 17:16:55,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:55,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:55,900 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:55,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2021-12-19 17:16:55,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:55,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:55,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:55,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:55,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:55,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:55,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:55,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:55,915 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:55,929 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:55,930 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:55,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:55,930 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:55,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-12-19 17:16:55,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:55,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:55,937 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:55,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:55,937 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:55,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:55,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:55,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:55,943 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:16:55,946 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-19 17:16:55,946 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-19 17:16:55,946 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:55,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:55,947 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:55,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2021-12-19 17:16:55,948 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:16:55,948 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 17:16:55,948 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:16:55,949 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~k~0#1) = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2021-12-19 17:16:55,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2021-12-19 17:16:55,963 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 17:16:55,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:55,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-19 17:16:55,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:56,016 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-19 17:16:56,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:56,098 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-12-19 17:16:56,098 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2021-12-19 17:16:56,098 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1018 states and 1853 transitions. cyclomatic complexity: 848 Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-19 17:16:56,158 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1018 states and 1853 transitions. cyclomatic complexity: 848. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Result 2247 states and 3713 transitions. Complement of second has 13 states. [2021-12-19 17:16:56,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-19 17:16:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2021-12-19 17:16:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2021-12-19 17:16:56,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 7 letters. Loop has 32 letters. [2021-12-19 17:16:56,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:56,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 39 letters. Loop has 32 letters. [2021-12-19 17:16:56,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:56,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 7 letters. Loop has 64 letters. [2021-12-19 17:16:56,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:56,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2247 states and 3713 transitions. [2021-12-19 17:16:56,178 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2021-12-19 17:16:56,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2247 states to 1987 states and 3325 transitions. [2021-12-19 17:16:56,194 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 545 [2021-12-19 17:16:56,195 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 558 [2021-12-19 17:16:56,195 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1987 states and 3325 transitions. [2021-12-19 17:16:56,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:16:56,195 INFO L681 BuchiCegarLoop]: Abstraction has 1987 states and 3325 transitions. [2021-12-19 17:16:56,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states and 3325 transitions. [2021-12-19 17:16:56,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1874. [2021-12-19 17:16:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1117 states have (on average 1.1745747538048343) internal successors, (1312), 1137 states have internal predecessors, (1312), 566 states have call successors, (567), 195 states have call predecessors, (567), 191 states have return successors, (1279), 541 states have call predecessors, (1279), 557 states have call successors, (1279) [2021-12-19 17:16:56,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 3158 transitions. [2021-12-19 17:16:56,246 INFO L704 BuchiCegarLoop]: Abstraction has 1874 states and 3158 transitions. [2021-12-19 17:16:56,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:16:56,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-19 17:16:56,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-19 17:16:56,247 INFO L87 Difference]: Start difference. First operand 1874 states and 3158 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2021-12-19 17:16:56,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:56,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:16:56,408 INFO L93 Difference]: Finished difference Result 1428 states and 2446 transitions. [2021-12-19 17:16:56,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-19 17:16:56,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1428 states and 2446 transitions. [2021-12-19 17:16:56,419 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2021-12-19 17:16:56,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1428 states to 1398 states and 2412 transitions. [2021-12-19 17:16:56,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 449 [2021-12-19 17:16:56,429 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 449 [2021-12-19 17:16:56,429 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1398 states and 2412 transitions. [2021-12-19 17:16:56,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:16:56,429 INFO L681 BuchiCegarLoop]: Abstraction has 1398 states and 2412 transitions. [2021-12-19 17:16:56,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states and 2412 transitions. [2021-12-19 17:16:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1385. [2021-12-19 17:16:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 825 states have (on average 1.1757575757575758) internal successors, (970), 835 states have internal predecessors, (970), 433 states have call successors, (434), 139 states have call predecessors, (434), 127 states have return successors, (995), 410 states have call predecessors, (995), 425 states have call successors, (995) [2021-12-19 17:16:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 2399 transitions. [2021-12-19 17:16:56,459 INFO L704 BuchiCegarLoop]: Abstraction has 1385 states and 2399 transitions. [2021-12-19 17:16:56,459 INFO L587 BuchiCegarLoop]: Abstraction has 1385 states and 2399 transitions. [2021-12-19 17:16:56,459 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-19 17:16:56,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1385 states and 2399 transitions. [2021-12-19 17:16:56,463 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2021-12-19 17:16:56,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:16:56,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:16:56,463 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:16:56,463 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:16:56,463 INFO L791 eck$LassoCheckResult]: Stem: 27625#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 27597#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 27598#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 27624#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 27610#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 27611#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 27626#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 27627#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 27995#factENTRY ~n := #in~n; 27996#L25 assume ~n <= 0;#res := 1; 27993#factFINAL assume true; 27969#factEXIT >#68#return; 27638#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 27562#factENTRY ~n := #in~n; 28001#L25 assume ~n <= 0;#res := 1; 28000#factFINAL assume true; 27984#factEXIT >#70#return; 27557#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 27558#factENTRY ~n := #in~n; 28016#L25 assume !(~n <= 0); 27530#L26 call #t~ret0 := fact(~n - 1);< 28201#factENTRY [2021-12-19 17:16:56,463 INFO L793 eck$LassoCheckResult]: Loop: 28201#factENTRY ~n := #in~n; 28204#L25 assume !(~n <= 0); 27531#L26 call #t~ret0 := fact(~n - 1);< 28201#factENTRY [2021-12-19 17:16:56,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:56,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1786427505, now seen corresponding path program 1 times [2021-12-19 17:16:56,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:56,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448385900] [2021-12-19 17:16:56,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:56,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:56,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:56,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-19 17:16:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:56,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-19 17:16:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:56,514 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-19 17:16:56,514 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:16:56,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448385900] [2021-12-19 17:16:56,515 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448385900] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:16:56,515 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:16:56,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-19 17:16:56,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607161818] [2021-12-19 17:16:56,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:16:56,515 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:16:56,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:56,516 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 1 times [2021-12-19 17:16:56,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:56,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23681970] [2021-12-19 17:16:56,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:56,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:56,518 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:56,519 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:16:56,544 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:16:56,544 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:16:56,544 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:16:56,545 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:16:56,545 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 17:16:56,545 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:56,545 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:16:56,545 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:16:56,545 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2021-12-19 17:16:56,545 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:16:56,545 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:16:56,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:56,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:56,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:56,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:56,570 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:16:56,570 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 17:16:56,570 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:56,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:56,571 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:56,576 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:56,576 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:56,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2021-12-19 17:16:56,592 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:56,593 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#t~ret0=0} Honda state: {fact_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:56,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:56,608 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:56,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:56,624 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:56,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2021-12-19 17:16:56,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:56,626 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:56,647 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:56,647 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:56,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:56,662 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:56,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:56,676 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:56,680 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:56,680 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:56,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2021-12-19 17:16:56,697 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:56,697 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:56,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:56,712 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:56,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:56,713 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:56,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:56,728 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:56,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2021-12-19 17:16:56,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:56,760 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:56,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:56,761 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:56,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2021-12-19 17:16:56,792 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 17:16:56,792 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:56,843 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 17:16:56,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:56,849 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:16:56,849 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:16:56,849 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:16:56,849 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:16:56,849 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:16:56,849 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:56,849 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:16:56,849 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:16:56,849 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2021-12-19 17:16:56,849 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:16:56,849 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:16:56,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:56,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:56,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:56,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:56,869 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:16:56,869 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:16:56,869 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:56,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:56,870 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:56,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2021-12-19 17:16:56,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:56,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:56,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:56,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:56,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:56,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:56,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:56,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:56,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:56,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:56,898 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:56,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:56,899 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:56,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2021-12-19 17:16:56,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:56,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:56,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:56,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:56,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:56,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:56,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:56,907 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:56,908 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:56,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2021-12-19 17:16:56,924 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:56,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:56,925 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:56,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2021-12-19 17:16:56,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:56,932 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:56,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:56,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:56,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:56,932 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:56,933 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:56,933 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:56,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:56,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:56,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:56,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:56,975 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:56,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2021-12-19 17:16:56,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:56,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:56,998 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:56,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:56,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:56,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:56,999 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:56,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:57,000 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:16:57,002 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2021-12-19 17:16:57,002 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-19 17:16:57,002 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:57,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:57,003 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:57,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2021-12-19 17:16:57,004 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:16:57,005 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 17:16:57,005 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:16:57,005 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2021-12-19 17:16:57,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:57,024 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 17:16:57,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:57,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 17:16:57,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:57,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 17:16:57,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:57,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:16:57,185 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2021-12-19 17:16:57,185 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1385 states and 2399 transitions. cyclomatic complexity: 1035 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 17:16:57,264 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1385 states and 2399 transitions. cyclomatic complexity: 1035. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Result 1565 states and 2669 transitions. Complement of second has 13 states. [2021-12-19 17:16:57,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-19 17:16:57,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 17:16:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2021-12-19 17:16:57,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 21 letters. Loop has 3 letters. [2021-12-19 17:16:57,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:57,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:57,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 24 letters. Loop has 3 letters. [2021-12-19 17:16:57,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:57,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 21 letters. Loop has 6 letters. [2021-12-19 17:16:57,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:57,278 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1565 states and 2669 transitions. [2021-12-19 17:16:57,287 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 192 [2021-12-19 17:16:57,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1565 states to 1510 states and 2586 transitions. [2021-12-19 17:16:57,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 450 [2021-12-19 17:16:57,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 455 [2021-12-19 17:16:57,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1510 states and 2586 transitions. [2021-12-19 17:16:57,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:16:57,300 INFO L681 BuchiCegarLoop]: Abstraction has 1510 states and 2586 transitions. [2021-12-19 17:16:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states and 2586 transitions. [2021-12-19 17:16:57,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1504. [2021-12-19 17:16:57,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1504 states, 898 states have (on average 1.1804008908685968) internal successors, (1060), 919 states have internal predecessors, (1060), 464 states have call successors, (464), 162 states have call predecessors, (464), 142 states have return successors, (1050), 422 states have call predecessors, (1050), 456 states have call successors, (1050) [2021-12-19 17:16:57,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 2574 transitions. [2021-12-19 17:16:57,333 INFO L704 BuchiCegarLoop]: Abstraction has 1504 states and 2574 transitions. [2021-12-19 17:16:57,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:16:57,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-19 17:16:57,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-19 17:16:57,333 INFO L87 Difference]: Start difference. First operand 1504 states and 2574 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-19 17:16:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:16:57,486 INFO L93 Difference]: Finished difference Result 1690 states and 2719 transitions. [2021-12-19 17:16:57,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-19 17:16:57,487 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1690 states and 2719 transitions. [2021-12-19 17:16:57,496 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 220 [2021-12-19 17:16:57,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1690 states to 1599 states and 2607 transitions. [2021-12-19 17:16:57,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 486 [2021-12-19 17:16:57,511 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 486 [2021-12-19 17:16:57,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1599 states and 2607 transitions. [2021-12-19 17:16:57,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:16:57,511 INFO L681 BuchiCegarLoop]: Abstraction has 1599 states and 2607 transitions. [2021-12-19 17:16:57,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states and 2607 transitions. [2021-12-19 17:16:57,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1423. [2021-12-19 17:16:57,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 871 states have (on average 1.1618828932261769) internal successors, (1012), 902 states have internal predecessors, (1012), 398 states have call successors, (398), 148 states have call predecessors, (398), 154 states have return successors, (836), 372 states have call predecessors, (836), 392 states have call successors, (836) [2021-12-19 17:16:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 2246 transitions. [2021-12-19 17:16:57,566 INFO L704 BuchiCegarLoop]: Abstraction has 1423 states and 2246 transitions. [2021-12-19 17:16:57,566 INFO L587 BuchiCegarLoop]: Abstraction has 1423 states and 2246 transitions. [2021-12-19 17:16:57,566 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-19 17:16:57,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1423 states and 2246 transitions. [2021-12-19 17:16:57,569 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 178 [2021-12-19 17:16:57,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:16:57,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:16:57,570 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:16:57,570 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-19 17:16:57,570 INFO L791 eck$LassoCheckResult]: Stem: 33858#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 33827#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 33828#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 33857#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 33843#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 33844#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 34149#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 33811#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 33812#factENTRY ~n := #in~n; 34314#L25 assume ~n <= 0;#res := 1; 34313#factFINAL assume true; 34311#factEXIT >#68#return; 34307#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 34573#factENTRY ~n := #in~n; 34580#L25 assume !(~n <= 0); 34325#L26 call #t~ret0 := fact(~n - 1);< 34607#factENTRY ~n := #in~n; 34341#L25 assume ~n <= 0;#res := 1; 34342#factFINAL assume true; 34324#factEXIT >#66#return; 34323#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34322#factFINAL assume true; 34306#factEXIT >#70#return; 34304#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 34344#factENTRY ~n := #in~n; 34303#L25 assume ~n <= 0;#res := 1; 34305#factFINAL assume true; 34571#factEXIT >#72#return; 34570#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 34569#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 34568#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 34567#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 34289#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 34281#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 34545#factENTRY ~n := #in~n; 34512#L25 assume !(~n <= 0); 34513#L26 call #t~ret0 := fact(~n - 1);< 34531#factENTRY [2021-12-19 17:16:57,571 INFO L793 eck$LassoCheckResult]: Loop: 34531#factENTRY ~n := #in~n; 34561#L25 assume !(~n <= 0); 34527#L26 call #t~ret0 := fact(~n - 1);< 34531#factENTRY [2021-12-19 17:16:57,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:57,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1605874444, now seen corresponding path program 1 times [2021-12-19 17:16:57,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:57,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389578574] [2021-12-19 17:16:57,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:57,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:57,577 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:16:57,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [898894734] [2021-12-19 17:16:57,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:57,577 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:16:57,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:57,584 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:16:57,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2021-12-19 17:16:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:57,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-19 17:16:57,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:57,708 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-19 17:16:57,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:16:57,797 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-12-19 17:16:57,797 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:16:57,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389578574] [2021-12-19 17:16:57,797 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:16:57,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898894734] [2021-12-19 17:16:57,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898894734] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:16:57,797 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:16:57,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-12-19 17:16:57,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792521567] [2021-12-19 17:16:57,797 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:16:57,797 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:16:57,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:57,798 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 2 times [2021-12-19 17:16:57,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:57,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606400473] [2021-12-19 17:16:57,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:57,798 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:57,799 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:57,800 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:16:57,823 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:16:57,823 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:16:57,823 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:16:57,823 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:16:57,823 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 17:16:57,823 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:57,823 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:16:57,823 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:16:57,823 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2021-12-19 17:16:57,823 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:16:57,823 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:16:57,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:57,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:57,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:57,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:57,839 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:16:57,840 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 17:16:57,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:57,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:57,850 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:57,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2021-12-19 17:16:57,870 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:57,870 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:57,882 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:16:57,882 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#t~ret0=0} Honda state: {fact_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:16:57,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:57,900 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:57,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:57,900 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:57,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2021-12-19 17:16:57,902 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:16:57,902 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:57,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:57,933 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:57,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:57,934 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:57,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2021-12-19 17:16:57,936 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 17:16:57,936 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:16:57,992 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 17:16:57,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:57,995 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:16:57,995 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:16:57,995 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:16:57,995 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:16:57,996 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:16:57,996 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:57,996 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:16:57,996 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:16:57,996 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2021-12-19 17:16:57,996 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:16:57,996 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:16:57,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:57,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:58,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:58,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:16:58,026 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:16:58,026 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:16:58,026 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:58,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:58,027 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:58,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2021-12-19 17:16:58,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:58,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:58,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:58,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:58,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:58,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:58,035 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:58,035 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:58,049 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:16:58,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:58,068 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:58,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:58,069 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:58,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2021-12-19 17:16:58,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:16:58,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:16:58,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:16:58,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:16:58,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:16:58,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:16:58,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:16:58,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:16:58,109 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:16:58,113 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-19 17:16:58,113 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-19 17:16:58,113 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:16:58,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:58,114 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:16:58,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2021-12-19 17:16:58,116 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:16:58,116 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 17:16:58,116 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:16:58,116 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2021-12-19 17:16:58,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:58,133 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 17:16:58,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:58,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-19 17:16:58,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:58,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 17:16:58,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:58,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:16:58,351 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2021-12-19 17:16:58,351 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1423 states and 2246 transitions. cyclomatic complexity: 849 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:16:58,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2021-12-19 17:16:58,469 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1423 states and 2246 transitions. cyclomatic complexity: 849. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 1463 states and 2290 transitions. Complement of second has 13 states. [2021-12-19 17:16:58,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-19 17:16:58,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:16:58,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2021-12-19 17:16:58,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 37 letters. Loop has 3 letters. [2021-12-19 17:16:58,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:58,470 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:16:58,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:58,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-19 17:16:58,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:58,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 17:16:58,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:58,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:16:58,708 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2021-12-19 17:16:58,708 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1423 states and 2246 transitions. cyclomatic complexity: 849 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:16:58,771 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1423 states and 2246 transitions. cyclomatic complexity: 849. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 1463 states and 2290 transitions. Complement of second has 13 states. [2021-12-19 17:16:58,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-19 17:16:58,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:16:58,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2021-12-19 17:16:58,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 37 letters. Loop has 3 letters. [2021-12-19 17:16:58,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:58,772 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:16:58,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:58,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-19 17:16:58,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:59,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:59,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 17:16:59,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:59,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-19 17:16:59,097 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2021-12-19 17:16:59,098 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1423 states and 2246 transitions. cyclomatic complexity: 849 Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:16:59,308 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1423 states and 2246 transitions. cyclomatic complexity: 849. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Result 1597 states and 2457 transitions. Complement of second has 16 states. [2021-12-19 17:16:59,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-19 17:16:59,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2021-12-19 17:16:59,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2021-12-19 17:16:59,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 37 letters. Loop has 3 letters. [2021-12-19 17:16:59,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:59,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 40 letters. Loop has 3 letters. [2021-12-19 17:16:59,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:59,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 37 letters. Loop has 6 letters. [2021-12-19 17:16:59,313 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:16:59,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1597 states and 2457 transitions. [2021-12-19 17:16:59,330 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 172 [2021-12-19 17:16:59,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1597 states to 1229 states and 1978 transitions. [2021-12-19 17:16:59,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 355 [2021-12-19 17:16:59,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 358 [2021-12-19 17:16:59,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1229 states and 1978 transitions. [2021-12-19 17:16:59,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:16:59,344 INFO L681 BuchiCegarLoop]: Abstraction has 1229 states and 1978 transitions. [2021-12-19 17:16:59,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states and 1978 transitions. [2021-12-19 17:16:59,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1210. [2021-12-19 17:16:59,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 741 states have (on average 1.163292847503374) internal successors, (862), 760 states have internal predecessors, (862), 345 states have call successors, (345), 122 states have call predecessors, (345), 124 states have return successors, (737), 327 states have call predecessors, (737), 345 states have call successors, (737) [2021-12-19 17:16:59,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1944 transitions. [2021-12-19 17:16:59,385 INFO L704 BuchiCegarLoop]: Abstraction has 1210 states and 1944 transitions. [2021-12-19 17:16:59,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:16:59,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-19 17:16:59,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-19 17:16:59,386 INFO L87 Difference]: Start difference. First operand 1210 states and 1944 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-19 17:16:59,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:16:59,475 INFO L93 Difference]: Finished difference Result 1244 states and 1968 transitions. [2021-12-19 17:16:59,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 17:16:59,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1244 states and 1968 transitions. [2021-12-19 17:16:59,483 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 170 [2021-12-19 17:16:59,494 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1244 states to 1244 states and 1968 transitions. [2021-12-19 17:16:59,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 369 [2021-12-19 17:16:59,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 369 [2021-12-19 17:16:59,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1244 states and 1968 transitions. [2021-12-19 17:16:59,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:16:59,496 INFO L681 BuchiCegarLoop]: Abstraction has 1244 states and 1968 transitions. [2021-12-19 17:16:59,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states and 1968 transitions. [2021-12-19 17:16:59,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1204. [2021-12-19 17:16:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 741 states have (on average 1.163292847503374) internal successors, (862), 760 states have internal predecessors, (862), 339 states have call successors, (339), 122 states have call predecessors, (339), 124 states have return successors, (707), 321 states have call predecessors, (707), 339 states have call successors, (707) [2021-12-19 17:16:59,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1908 transitions. [2021-12-19 17:16:59,560 INFO L704 BuchiCegarLoop]: Abstraction has 1204 states and 1908 transitions. [2021-12-19 17:16:59,561 INFO L587 BuchiCegarLoop]: Abstraction has 1204 states and 1908 transitions. [2021-12-19 17:16:59,561 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-19 17:16:59,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1204 states and 1908 transitions. [2021-12-19 17:16:59,565 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 170 [2021-12-19 17:16:59,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:16:59,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:16:59,567 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 8, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:16:59,567 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:16:59,567 INFO L791 eck$LassoCheckResult]: Stem: 42926#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 42896#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 42897#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 42925#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 42911#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 42912#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43689#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 43683#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43684#factENTRY ~n := #in~n; 43688#L25 assume ~n <= 0;#res := 1; 43687#factFINAL assume true; 43682#factEXIT >#68#return; 43601#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 43619#factENTRY ~n := #in~n; 43606#L25 assume ~n <= 0;#res := 1; 43607#factFINAL assume true; 43685#factEXIT >#70#return; 43686#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43695#factENTRY ~n := #in~n; 43697#L25 assume ~n <= 0;#res := 1; 43696#factFINAL assume true; 43694#factEXIT >#72#return; 43693#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 43692#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 43691#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 43690#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43624#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 43625#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43912#factENTRY ~n := #in~n; 43919#L25 assume ~n <= 0;#res := 1; 43918#factFINAL assume true; 43911#factEXIT >#74#return; 42961#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42962#factENTRY ~n := #in~n; 43942#L25 assume ~n <= 0;#res := 1; 43928#factFINAL assume true; 43924#factEXIT >#76#return; 43433#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43886#factENTRY ~n := #in~n; 43925#L25 assume !(~n <= 0); 42905#L26 call #t~ret0 := fact(~n - 1);< 43903#factENTRY ~n := #in~n; 43927#L25 assume ~n <= 0;#res := 1; 43926#factFINAL assume true; 43901#factEXIT >#66#return; 43892#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 43888#factFINAL assume true; 43425#factEXIT >#78#return; 43434#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 43400#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 43399#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 43182#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 43180#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 43153#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 43151#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43149#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 43092#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 43106#factENTRY ~n := #in~n; 43117#L25 assume ~n <= 0;#res := 1; 43107#factFINAL assume true; 43084#factEXIT >#68#return; 42933#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42958#factENTRY ~n := #in~n; 43443#L25 assume ~n <= 0;#res := 1; 43522#factFINAL assume true; 43520#factEXIT >#70#return; 42932#L30-2 [2021-12-19 17:16:59,567 INFO L793 eck$LassoCheckResult]: Loop: 42932#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 43517#factENTRY ~n := #in~n; 43518#L25 assume ~n <= 0;#res := 1; 43522#factFINAL assume true; 43520#factEXIT >#72#return; 43068#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 43065#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 43063#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 43060#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 43061#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 42935#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 42958#factENTRY ~n := #in~n; 43443#L25 assume ~n <= 0;#res := 1; 43522#factFINAL assume true; 43520#factEXIT >#68#return; 42936#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 42958#factENTRY ~n := #in~n; 43443#L25 assume ~n <= 0;#res := 1; 43522#factFINAL assume true; 43520#factEXIT >#70#return; 42932#L30-2 [2021-12-19 17:16:59,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:59,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1028541888, now seen corresponding path program 1 times [2021-12-19 17:16:59,568 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:59,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285282483] [2021-12-19 17:16:59,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:59,568 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:59,575 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:16:59,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1218485264] [2021-12-19 17:16:59,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:59,576 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:16:59,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:59,592 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:16:59,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2021-12-19 17:16:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:16:59,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 17:16:59,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:16:59,733 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-12-19 17:16:59,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-19 17:16:59,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:16:59,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285282483] [2021-12-19 17:16:59,734 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:16:59,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218485264] [2021-12-19 17:16:59,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218485264] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-19 17:16:59,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-19 17:16:59,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-19 17:16:59,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504296033] [2021-12-19 17:16:59,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-19 17:16:59,735 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:16:59,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:16:59,735 INFO L85 PathProgramCache]: Analyzing trace with hash 480928306, now seen corresponding path program 1 times [2021-12-19 17:16:59,735 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:16:59,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980677064] [2021-12-19 17:16:59,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:59,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:16:59,738 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:16:59,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1941590525] [2021-12-19 17:16:59,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:16:59,738 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:16:59,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:16:59,739 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:16:59,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2021-12-19 17:16:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:59,781 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:16:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:16:59,795 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:17:00,179 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:17:00,179 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:17:00,179 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:17:00,179 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:17:00,179 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 17:17:00,179 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:00,179 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:17:00,179 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:17:00,179 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2021-12-19 17:17:00,179 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:17:00,179 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:17:00,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:00,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:00,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:00,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:00,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:00,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:00,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:00,299 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:17:00,299 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 17:17:00,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:00,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:00,301 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:00,324 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:17:00,324 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:00,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2021-12-19 17:17:00,341 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:17:00,341 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:17:00,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:00,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:00,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:00,356 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:00,359 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:17:00,359 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:00,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2021-12-19 17:17:00,374 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:17:00,374 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:17:00,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:00,391 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:00,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:00,392 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:00,395 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:17:00,396 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:00,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2021-12-19 17:17:00,411 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:17:00,411 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:17:00,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:00,444 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:00,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:00,444 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:00,460 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:17:00,460 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:00,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2021-12-19 17:17:00,478 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:17:00,478 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:17:00,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:00,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:00,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:00,496 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:00,505 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:17:00,505 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:00,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2021-12-19 17:17:00,522 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:17:00,522 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret9#1=0} Honda state: {ULTIMATE.start_main_#t~ret9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:17:00,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:00,537 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:00,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:00,538 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:00,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2021-12-19 17:17:00,539 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:17:00,539 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:00,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2021-12-19 17:17:00,560 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:00,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:00,561 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:00,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2021-12-19 17:17:00,563 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 17:17:00,563 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:01,177 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 17:17:01,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:01,183 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:17:01,183 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:17:01,183 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:17:01,183 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:17:01,183 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:17:01,183 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:01,183 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:17:01,183 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:17:01,183 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2021-12-19 17:17:01,183 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:17:01,183 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:17:01,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:01,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:01,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:01,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:01,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:01,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:01,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:01,264 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:17:01,264 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:17:01,264 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:01,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:01,265 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:01,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2021-12-19 17:17:01,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:17:01,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:17:01,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:17:01,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:17:01,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:17:01,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:17:01,272 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:17:01,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:17:01,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:17:01,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:01,288 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:01,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:01,289 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:01,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2021-12-19 17:17:01,290 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:17:01,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:17:01,295 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:17:01,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:17:01,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:17:01,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:17:01,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:17:01,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:17:01,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:17:01,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2021-12-19 17:17:01,317 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:01,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:01,318 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:01,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2021-12-19 17:17:01,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:17:01,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:17:01,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:17:01,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:17:01,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:17:01,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:17:01,326 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:17:01,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:17:01,327 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:17:01,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:01,343 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:01,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:01,343 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:01,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2021-12-19 17:17:01,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:17:01,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:17:01,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:17:01,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:17:01,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:17:01,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:17:01,351 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:17:01,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:17:01,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:17:01,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:01,371 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:01,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:01,371 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:01,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2021-12-19 17:17:01,374 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:17:01,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:17:01,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:17:01,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:17:01,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:17:01,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:17:01,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:17:01,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:17:01,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:17:01,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:01,395 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:01,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:01,395 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:01,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2021-12-19 17:17:01,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:17:01,403 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:17:01,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:17:01,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:17:01,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:17:01,403 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:17:01,405 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:17:01,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:17:01,412 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:17:01,417 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-19 17:17:01,417 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 2 variables to zero. [2021-12-19 17:17:01,417 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:01,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:01,419 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:01,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2021-12-19 17:17:01,420 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:17:01,420 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 17:17:01,420 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:17:01,420 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2021-12-19 17:17:01,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:01,435 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 17:17:01,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:01,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-19 17:17:01,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:01,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:01,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:01,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-19 17:17:01,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:01,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-19 17:17:01,934 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2021-12-19 17:17:01,935 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1204 states and 1908 transitions. cyclomatic complexity: 723 Second operand has 10 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-19 17:17:02,058 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1204 states and 1908 transitions. cyclomatic complexity: 723. Second operand has 10 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Result 1599 states and 2422 transitions. Complement of second has 35 states. [2021-12-19 17:17:02,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2021-12-19 17:17:02,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-19 17:17:02,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 61 transitions. [2021-12-19 17:17:02,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 61 transitions. Stem has 66 letters. Loop has 20 letters. [2021-12-19 17:17:02,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:02,060 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:17:02,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:02,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-19 17:17:02,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:02,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-19 17:17:02,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-19 17:17:02,455 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2021-12-19 17:17:02,455 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1204 states and 1908 transitions. cyclomatic complexity: 723 Second operand has 10 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-19 17:17:02,582 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1204 states and 1908 transitions. cyclomatic complexity: 723. Second operand has 10 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Result 1596 states and 2419 transitions. Complement of second has 37 states. [2021-12-19 17:17:02,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2021-12-19 17:17:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-19 17:17:02,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2021-12-19 17:17:02,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 60 transitions. Stem has 66 letters. Loop has 20 letters. [2021-12-19 17:17:02,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:02,588 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:17:02,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:02,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-19 17:17:02,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:02,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:02,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-19 17:17:02,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-19 17:17:02,950 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2021-12-19 17:17:02,950 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1204 states and 1908 transitions. cyclomatic complexity: 723 Second operand has 10 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-19 17:17:03,067 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1204 states and 1908 transitions. cyclomatic complexity: 723. Second operand has 10 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Result 3376 states and 4864 transitions. Complement of second has 60 states. [2021-12-19 17:17:03,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2021-12-19 17:17:03,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-19 17:17:03,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 89 transitions. [2021-12-19 17:17:03,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 89 transitions. Stem has 66 letters. Loop has 20 letters. [2021-12-19 17:17:03,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:03,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 89 transitions. Stem has 86 letters. Loop has 20 letters. [2021-12-19 17:17:03,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:03,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 89 transitions. Stem has 66 letters. Loop has 40 letters. [2021-12-19 17:17:03,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:03,074 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3376 states and 4864 transitions. [2021-12-19 17:17:03,088 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 166 [2021-12-19 17:17:03,103 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3376 states to 2709 states and 3959 transitions. [2021-12-19 17:17:03,103 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 466 [2021-12-19 17:17:03,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 488 [2021-12-19 17:17:03,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2709 states and 3959 transitions. [2021-12-19 17:17:03,104 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:17:03,104 INFO L681 BuchiCegarLoop]: Abstraction has 2709 states and 3959 transitions. [2021-12-19 17:17:03,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2709 states and 3959 transitions. [2021-12-19 17:17:03,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2709 to 2506. [2021-12-19 17:17:03,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2506 states, 1558 states have (on average 1.1386392811296533) internal successors, (1774), 1598 states have internal predecessors, (1774), 640 states have call successors, (665), 282 states have call predecessors, (665), 308 states have return successors, (1313), 625 states have call predecessors, (1313), 640 states have call successors, (1313) [2021-12-19 17:17:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 3752 transitions. [2021-12-19 17:17:03,165 INFO L704 BuchiCegarLoop]: Abstraction has 2506 states and 3752 transitions. [2021-12-19 17:17:03,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:17:03,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-19 17:17:03,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-19 17:17:03,166 INFO L87 Difference]: Start difference. First operand 2506 states and 3752 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2021-12-19 17:17:03,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:17:03,283 INFO L93 Difference]: Finished difference Result 2151 states and 3191 transitions. [2021-12-19 17:17:03,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-19 17:17:03,284 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2151 states and 3191 transitions. [2021-12-19 17:17:03,292 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 158 [2021-12-19 17:17:03,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2151 states to 1299 states and 1919 transitions. [2021-12-19 17:17:03,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 411 [2021-12-19 17:17:03,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 411 [2021-12-19 17:17:03,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1299 states and 1919 transitions. [2021-12-19 17:17:03,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:17:03,308 INFO L681 BuchiCegarLoop]: Abstraction has 1299 states and 1919 transitions. [2021-12-19 17:17:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states and 1919 transitions. [2021-12-19 17:17:03,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1264. [2021-12-19 17:17:03,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1264 states, 792 states have (on average 1.1414141414141414) internal successors, (904), 807 states have internal predecessors, (904), 327 states have call successors, (327), 134 states have call predecessors, (327), 145 states have return successors, (648), 322 states have call predecessors, (648), 327 states have call successors, (648) [2021-12-19 17:17:03,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1264 states to 1264 states and 1879 transitions. [2021-12-19 17:17:03,328 INFO L704 BuchiCegarLoop]: Abstraction has 1264 states and 1879 transitions. [2021-12-19 17:17:03,328 INFO L587 BuchiCegarLoop]: Abstraction has 1264 states and 1879 transitions. [2021-12-19 17:17:03,328 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-12-19 17:17:03,328 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1264 states and 1879 transitions. [2021-12-19 17:17:03,331 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 158 [2021-12-19 17:17:03,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:17:03,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:17:03,333 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 9, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:17:03,333 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:17:03,334 INFO L791 eck$LassoCheckResult]: Stem: 56525#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 56493#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 56494#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 56524#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 56511#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 56512#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 57289#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 57287#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 57288#factENTRY ~n := #in~n; 57293#L25 assume ~n <= 0;#res := 1; 57291#factFINAL assume true; 57286#factEXIT >#68#return; 57275#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 57276#factENTRY ~n := #in~n; 57280#L25 assume ~n <= 0;#res := 1; 57279#factFINAL assume true; 57274#factEXIT >#70#return; 57267#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 57268#factENTRY ~n := #in~n; 57292#L25 assume ~n <= 0;#res := 1; 57290#factFINAL assume true; 57266#factEXIT >#72#return; 57264#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 57261#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 57260#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 57244#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 57240#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 57241#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 57324#factENTRY ~n := #in~n; 57402#L25 assume !(~n <= 0); 57395#L26 call #t~ret0 := fact(~n - 1);< 57401#factENTRY ~n := #in~n; 57446#L25 assume ~n <= 0;#res := 1; 57498#factFINAL assume true; 57494#factEXIT >#66#return; 57493#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57485#factFINAL assume true; 57484#factEXIT >#74#return; 57346#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 57480#factENTRY ~n := #in~n; 57483#L25 assume ~n <= 0;#res := 1; 57482#factFINAL assume true; 57345#factEXIT >#76#return; 57209#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 57455#factENTRY ~n := #in~n; 57488#L25 assume !(~n <= 0); 57396#L26 call #t~ret0 := fact(~n - 1);< 57487#factENTRY ~n := #in~n; 57492#L25 assume ~n <= 0;#res := 1; 57490#factFINAL assume true; 57486#factEXIT >#66#return; 57343#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57344#factFINAL assume true; 57203#factEXIT >#78#return; 57202#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 57201#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 57200#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 56716#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 56691#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 56692#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 56687#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 56685#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 56503#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 56675#factENTRY ~n := #in~n; 56912#L25 assume ~n <= 0;#res := 1; 56677#factFINAL assume true; 56669#factEXIT >#68#return; 56667#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 56668#factENTRY ~n := #in~n; 56686#L25 assume ~n <= 0;#res := 1; 56683#factFINAL assume true; 56684#factEXIT >#70#return; 56481#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 56489#factENTRY ~n := #in~n; 56490#L25 assume ~n <= 0;#res := 1; 56480#factFINAL assume true; 56482#factEXIT >#72#return; 56659#L30-3 [2021-12-19 17:17:03,334 INFO L793 eck$LassoCheckResult]: Loop: 56659#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 56658#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 56657#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 56656#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 56630#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 56631#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 56676#factENTRY ~n := #in~n; 56681#L25 assume !(~n <= 0); 56637#L26 call #t~ret0 := fact(~n - 1);< 56650#factENTRY ~n := #in~n; 56653#L25 assume ~n <= 0;#res := 1; 56648#factFINAL assume true; 56633#factEXIT >#66#return; 56646#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 56679#factFINAL assume true; 56674#factEXIT >#68#return; 56666#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 56676#factENTRY ~n := #in~n; 56681#L25 assume ~n <= 0;#res := 1; 56682#factFINAL assume true; 56665#factEXIT >#70#return; 56661#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 56662#factENTRY ~n := #in~n; 57195#L25 assume !(~n <= 0); 56591#L26 call #t~ret0 := fact(~n - 1);< 56624#factENTRY ~n := #in~n; 56653#L25 assume ~n <= 0;#res := 1; 56648#factFINAL assume true; 56633#factEXIT >#66#return; 56602#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57213#factFINAL assume true; 56660#factEXIT >#72#return; 56659#L30-3 [2021-12-19 17:17:03,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:03,334 INFO L85 PathProgramCache]: Analyzing trace with hash 2096897635, now seen corresponding path program 2 times [2021-12-19 17:17:03,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:17:03,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079188154] [2021-12-19 17:17:03,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:17:03,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:17:03,338 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:17:03,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [324870058] [2021-12-19 17:17:03,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 17:17:03,338 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:17:03,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:03,339 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:17:03,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2021-12-19 17:17:03,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 17:17:03,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:17:03,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 17:17:03,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:03,495 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 104 proven. 1 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2021-12-19 17:17:03,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:17:03,628 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 32 proven. 7 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2021-12-19 17:17:03,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:17:03,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079188154] [2021-12-19 17:17:03,629 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:17:03,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324870058] [2021-12-19 17:17:03,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324870058] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:17:03,629 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:17:03,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-12-19 17:17:03,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868125775] [2021-12-19 17:17:03,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:17:03,629 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:17:03,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:03,630 INFO L85 PathProgramCache]: Analyzing trace with hash 324652672, now seen corresponding path program 2 times [2021-12-19 17:17:03,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:17:03,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839056920] [2021-12-19 17:17:03,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:17:03,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:17:03,632 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:17:03,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [970858340] [2021-12-19 17:17:03,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 17:17:03,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:17:03,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:03,643 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:17:03,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2021-12-19 17:17:03,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 17:17:03,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-19 17:17:03,696 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:17:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:17:03,709 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:17:04,184 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:17:04,184 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:17:04,184 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:17:04,184 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:17:04,184 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 17:17:04,184 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:04,184 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:17:04,184 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:17:04,185 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration16_Loop [2021-12-19 17:17:04,185 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:17:04,185 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:17:04,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:04,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:04,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:04,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:04,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:04,289 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:17:04,289 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 17:17:04,289 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:04,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:04,290 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:04,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2021-12-19 17:17:04,292 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:17:04,292 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:04,298 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:17:04,298 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:17:04,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2021-12-19 17:17:04,313 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:04,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:04,314 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:04,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2021-12-19 17:17:04,315 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:17:04,315 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:04,321 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:17:04,321 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret9#1=0} Honda state: {ULTIMATE.start_main_#t~ret9#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:17:04,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2021-12-19 17:17:04,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:04,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:04,338 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:04,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2021-12-19 17:17:04,340 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:17:04,340 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:04,346 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:17:04,346 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:17:04,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2021-12-19 17:17:04,361 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:04,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:04,362 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:04,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2021-12-19 17:17:04,363 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:17:04,363 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:04,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2021-12-19 17:17:04,384 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:04,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:04,385 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:04,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2021-12-19 17:17:04,386 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 17:17:04,386 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:05,161 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 17:17:05,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:05,167 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:17:05,167 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:17:05,167 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:17:05,167 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:17:05,167 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:17:05,167 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:05,167 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:17:05,167 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:17:05,167 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration16_Loop [2021-12-19 17:17:05,167 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:17:05,167 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:17:05,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:05,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:05,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:05,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:05,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:05,296 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:17:05,296 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:17:05,296 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:05,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:05,297 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:05,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2021-12-19 17:17:05,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:17:05,304 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:17:05,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:17:05,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:17:05,304 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:17:05,304 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:17:05,304 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:17:05,304 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:17:05,305 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:17:05,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:05,320 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:05,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:05,321 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:05,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2021-12-19 17:17:05,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:17:05,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:17:05,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:17:05,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:17:05,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:17:05,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:17:05,331 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:17:05,331 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:17:05,334 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:17:05,336 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2021-12-19 17:17:05,336 INFO L444 ModelExtractionUtils]: 9 out of 11 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-19 17:17:05,337 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:05,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:05,337 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:05,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2021-12-19 17:17:05,339 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:17:05,339 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 17:17:05,339 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:17:05,339 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2021-12-19 17:17:05,354 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2021-12-19 17:17:05,354 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 17:17:05,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:05,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-19 17:17:05,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:05,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-19 17:17:05,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:05,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:05,966 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-19 17:17:05,967 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2021-12-19 17:17:05,967 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1264 states and 1879 transitions. cyclomatic complexity: 634 Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2021-12-19 17:17:06,113 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1264 states and 1879 transitions. cyclomatic complexity: 634. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Result 1484 states and 2160 transitions. Complement of second has 38 states. [2021-12-19 17:17:06,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2021-12-19 17:17:06,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2021-12-19 17:17:06,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 55 transitions. [2021-12-19 17:17:06,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 55 transitions. Stem has 77 letters. Loop has 32 letters. [2021-12-19 17:17:06,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:06,115 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:17:06,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:06,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-19 17:17:06,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:06,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-19 17:17:06,508 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:06,653 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-19 17:17:06,653 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2021-12-19 17:17:06,653 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1264 states and 1879 transitions. cyclomatic complexity: 634 Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2021-12-19 17:17:06,809 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1264 states and 1879 transitions. cyclomatic complexity: 634. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Result 1488 states and 2166 transitions. Complement of second has 36 states. [2021-12-19 17:17:06,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2021-12-19 17:17:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2021-12-19 17:17:06,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 56 transitions. [2021-12-19 17:17:06,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 56 transitions. Stem has 77 letters. Loop has 32 letters. [2021-12-19 17:17:06,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:06,810 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:17:06,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:06,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-19 17:17:06,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:07,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:07,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-19 17:17:07,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:07,419 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2021-12-19 17:17:07,420 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2021-12-19 17:17:07,420 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1264 states and 1879 transitions. cyclomatic complexity: 634 Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2021-12-19 17:17:07,619 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1264 states and 1879 transitions. cyclomatic complexity: 634. Second operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Result 2849 states and 3969 transitions. Complement of second has 49 states. [2021-12-19 17:17:07,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2021-12-19 17:17:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 6 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2021-12-19 17:17:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2021-12-19 17:17:07,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 96 transitions. Stem has 77 letters. Loop has 32 letters. [2021-12-19 17:17:07,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:07,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 96 transitions. Stem has 109 letters. Loop has 32 letters. [2021-12-19 17:17:07,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:07,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 96 transitions. Stem has 77 letters. Loop has 64 letters. [2021-12-19 17:17:07,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:07,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2849 states and 3969 transitions. [2021-12-19 17:17:07,631 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 90 [2021-12-19 17:17:07,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2849 states to 2656 states and 3711 transitions. [2021-12-19 17:17:07,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 433 [2021-12-19 17:17:07,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 450 [2021-12-19 17:17:07,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2656 states and 3711 transitions. [2021-12-19 17:17:07,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:17:07,644 INFO L681 BuchiCegarLoop]: Abstraction has 2656 states and 3711 transitions. [2021-12-19 17:17:07,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2656 states and 3711 transitions. [2021-12-19 17:17:07,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2656 to 2544. [2021-12-19 17:17:07,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 1620 states have (on average 1.117283950617284) internal successors, (1810), 1656 states have internal predecessors, (1810), 591 states have call successors, (616), 284 states have call predecessors, (616), 333 states have return successors, (1164), 603 states have call predecessors, (1164), 591 states have call successors, (1164) [2021-12-19 17:17:07,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 3590 transitions. [2021-12-19 17:17:07,680 INFO L704 BuchiCegarLoop]: Abstraction has 2544 states and 3590 transitions. [2021-12-19 17:17:07,680 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:17:07,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-19 17:17:07,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-19 17:17:07,680 INFO L87 Difference]: Start difference. First operand 2544 states and 3590 transitions. Second operand has 8 states, 7 states have (on average 4.428571428571429) internal successors, (31), 8 states have internal predecessors, (31), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2021-12-19 17:17:07,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:17:07,779 INFO L93 Difference]: Finished difference Result 2076 states and 2956 transitions. [2021-12-19 17:17:07,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 17:17:07,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2076 states and 2956 transitions. [2021-12-19 17:17:07,787 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 81 [2021-12-19 17:17:07,794 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2076 states to 1486 states and 2101 transitions. [2021-12-19 17:17:07,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 312 [2021-12-19 17:17:07,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 324 [2021-12-19 17:17:07,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1486 states and 2101 transitions. [2021-12-19 17:17:07,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:17:07,795 INFO L681 BuchiCegarLoop]: Abstraction has 1486 states and 2101 transitions. [2021-12-19 17:17:07,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states and 2101 transitions. [2021-12-19 17:17:07,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1486. [2021-12-19 17:17:07,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1486 states, 949 states have (on average 1.1232876712328768) internal successors, (1066), 971 states have internal predecessors, (1066), 343 states have call successors, (355), 168 states have call predecessors, (355), 194 states have return successors, (680), 346 states have call predecessors, (680), 343 states have call successors, (680) [2021-12-19 17:17:07,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 2101 transitions. [2021-12-19 17:17:07,843 INFO L704 BuchiCegarLoop]: Abstraction has 1486 states and 2101 transitions. [2021-12-19 17:17:07,843 INFO L587 BuchiCegarLoop]: Abstraction has 1486 states and 2101 transitions. [2021-12-19 17:17:07,843 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-12-19 17:17:07,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1486 states and 2101 transitions. [2021-12-19 17:17:07,846 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 81 [2021-12-19 17:17:07,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:17:07,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:17:07,846 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [20, 20, 12, 8, 8, 8, 8, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:17:07,847 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:17:07,847 INFO L791 eck$LassoCheckResult]: Stem: 69877#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 69845#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 69846#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 69876#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 69900#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 70064#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 70062#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 70059#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 70060#factENTRY ~n := #in~n; 70067#L25 assume ~n <= 0;#res := 1; 70065#factFINAL assume true; 70058#factEXIT >#68#return; 70056#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 70057#factENTRY ~n := #in~n; 70063#L25 assume ~n <= 0;#res := 1; 70061#factFINAL assume true; 70055#factEXIT >#70#return; 70053#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 70054#factENTRY ~n := #in~n; 70068#L25 assume ~n <= 0;#res := 1; 70066#factFINAL assume true; 70052#factEXIT >#72#return; 70050#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 70051#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 70704#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 71206#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 71203#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 69948#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69949#factENTRY ~n := #in~n; 69965#L25 assume !(~n <= 0); 69962#L26 call #t~ret0 := fact(~n - 1);< 69963#factENTRY ~n := #in~n; 69966#L25 assume ~n <= 0;#res := 1; 69964#factFINAL assume true; 69961#factEXIT >#66#return; 69960#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 69957#factFINAL assume true; 69947#factEXIT >#74#return; 69941#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69943#factENTRY ~n := #in~n; 69945#L25 assume ~n <= 0;#res := 1; 69944#factFINAL assume true; 69940#factEXIT >#76#return; 69927#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 69937#factENTRY ~n := #in~n; 69956#L25 assume !(~n <= 0); 69951#L26 call #t~ret0 := fact(~n - 1);< 69955#factENTRY ~n := #in~n; 70107#L25 assume ~n <= 0;#res := 1; 70108#factFINAL assume true; 69950#factEXIT >#66#return; 69954#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 71285#factFINAL assume true; 71266#factEXIT >#78#return; 69928#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 69909#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 69910#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 69905#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 69906#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 70346#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 70344#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 69878#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 69838#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69839#factENTRY ~n := #in~n; 70340#L25 assume !(~n <= 0); 69851#L26 call #t~ret0 := fact(~n - 1);< 69855#factENTRY ~n := #in~n; 70316#L25 assume ~n <= 0;#res := 1; 70315#factFINAL assume true; 70314#factEXIT >#66#return; 70313#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70311#factFINAL assume true; 70305#factEXIT >#68#return; 70295#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 70296#factENTRY ~n := #in~n; 70304#L25 assume ~n <= 0;#res := 1; 70303#factFINAL assume true; 70294#factEXIT >#70#return; 70285#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 70292#factENTRY ~n := #in~n; 70339#L25 assume !(~n <= 0); 70299#L26 call #t~ret0 := fact(~n - 1);< 70337#factENTRY ~n := #in~n; 70345#L25 assume ~n <= 0;#res := 1; 70338#factFINAL assume true; 70336#factEXIT >#66#return; 70335#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70334#factFINAL assume true; 70331#factEXIT >#72#return; 70289#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 70257#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 70252#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 70229#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 70097#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 69921#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69971#factENTRY ~n := #in~n; 70013#L25 assume !(~n <= 0); 69984#L26 call #t~ret0 := fact(~n - 1);< 70034#factENTRY ~n := #in~n; 70000#L25 assume !(~n <= 0); 69983#L26 call #t~ret0 := fact(~n - 1);< 69999#factENTRY ~n := #in~n; 70004#L25 assume ~n <= 0;#res := 1; 70008#factFINAL assume true; 70007#factEXIT >#66#return; 70006#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70005#factFINAL assume true; 70001#factEXIT >#66#return; 70003#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70010#factFINAL assume true; 69913#factEXIT >#74#return; 69897#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69812#factENTRY ~n := #in~n; 70132#L25 assume !(~n <= 0); 69981#L26 call #t~ret0 := fact(~n - 1);< 70034#factENTRY ~n := #in~n; 70075#L25 assume ~n <= 0;#res := 1; 70072#factFINAL assume true; 70026#factEXIT >#66#return; 70031#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70139#factFINAL assume true; 70138#factEXIT >#76#return; 70127#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 70136#factENTRY ~n := #in~n; 70140#L25 assume !(~n <= 0); 69981#L26 call #t~ret0 := fact(~n - 1);< 70034#factENTRY ~n := #in~n; 70075#L25 assume ~n <= 0;#res := 1; 70072#factFINAL assume true; 70026#factEXIT >#66#return; 70031#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70139#factFINAL assume true; 70138#factEXIT >#78#return; 70128#L30-8 [2021-12-19 17:17:07,847 INFO L793 eck$LassoCheckResult]: Loop: 70128#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 70222#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 70221#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 70220#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 70218#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 70117#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 69812#factENTRY ~n := #in~n; 70132#L25 assume !(~n <= 0); 69981#L26 call #t~ret0 := fact(~n - 1);< 70034#factENTRY ~n := #in~n; 70000#L25 assume !(~n <= 0); 69983#L26 call #t~ret0 := fact(~n - 1);< 69999#factENTRY ~n := #in~n; 70004#L25 assume ~n <= 0;#res := 1; 70008#factFINAL assume true; 70007#factEXIT >#66#return; 70006#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70005#factFINAL assume true; 70001#factEXIT >#66#return; 70002#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70134#factFINAL assume true; 70135#factEXIT >#74#return; 70116#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 69812#factENTRY ~n := #in~n; 70132#L25 assume ~n <= 0;#res := 1; 70131#factFINAL assume true; 70114#factEXIT >#76#return; 70101#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 70111#factENTRY ~n := #in~n; 70099#L25 assume !(~n <= 0); 69977#L26 call #t~ret0 := fact(~n - 1);< 69995#factENTRY ~n := #in~n; 70000#L25 assume !(~n <= 0); 69983#L26 call #t~ret0 := fact(~n - 1);< 69999#factENTRY ~n := #in~n; 70004#L25 assume ~n <= 0;#res := 1; 70008#factFINAL assume true; 70007#factEXIT >#66#return; 70006#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70005#factFINAL assume true; 70001#factEXIT >#66#return; 70002#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 70134#factFINAL assume true; 70135#factEXIT >#78#return; 70128#L30-8 [2021-12-19 17:17:07,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:07,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1885209446, now seen corresponding path program 3 times [2021-12-19 17:17:07,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:17:07,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30678704] [2021-12-19 17:17:07,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:17:07,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:17:07,852 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:17:07,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1646618030] [2021-12-19 17:17:07,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 17:17:07,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:17:07,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:07,856 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:17:07,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2021-12-19 17:17:07,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-19 17:17:07,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:17:07,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-19 17:17:07,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:08,087 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 417 proven. 2 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2021-12-19 17:17:08,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:17:08,291 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2021-12-19 17:17:08,291 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:17:08,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30678704] [2021-12-19 17:17:08,291 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:17:08,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646618030] [2021-12-19 17:17:08,291 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646618030] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:17:08,291 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:17:08,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2021-12-19 17:17:08,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714363894] [2021-12-19 17:17:08,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:17:08,291 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:17:08,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:08,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1514306572, now seen corresponding path program 1 times [2021-12-19 17:17:08,292 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:17:08,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132652364] [2021-12-19 17:17:08,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:17:08,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:17:08,293 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:17:08,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1491656309] [2021-12-19 17:17:08,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:17:08,293 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:17:08,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:08,306 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:17:08,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2021-12-19 17:17:08,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:17:08,357 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:17:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:17:08,372 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:17:09,380 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:17:09,380 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:17:09,380 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:17:09,380 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:17:09,380 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 17:17:09,380 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:09,380 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:17:09,380 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:17:09,380 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration17_Loop [2021-12-19 17:17:09,381 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:17:09,381 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:17:09,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:09,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:09,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:09,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:09,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:09,470 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:17:09,470 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 17:17:09,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:09,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:09,471 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:09,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2021-12-19 17:17:09,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:17:09,520 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:09,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:09,550 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:09,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:09,552 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:09,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2021-12-19 17:17:09,554 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 17:17:09,554 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:09,568 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 17:17:09,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2021-12-19 17:17:09,582 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:17:09,582 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:17:09,582 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:17:09,582 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:17:09,582 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:17:09,583 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:09,583 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:17:09,583 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:17:09,583 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration17_Loop [2021-12-19 17:17:09,583 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:17:09,583 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:17:09,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:09,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:09,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:09,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:09,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:09,688 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:17:09,689 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:17:09,689 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:09,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:09,690 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:09,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2021-12-19 17:17:09,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:17:09,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:17:09,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:17:09,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:17:09,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:17:09,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:17:09,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:17:09,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:17:09,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:17:09,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2021-12-19 17:17:09,724 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:09,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:09,725 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:09,726 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2021-12-19 17:17:09,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:17:09,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:17:09,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:17:09,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:17:09,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:17:09,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:17:09,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:17:09,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:17:09,738 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:17:09,743 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-19 17:17:09,743 INFO L444 ModelExtractionUtils]: 8 out of 11 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-19 17:17:09,743 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:09,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:09,744 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:09,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2021-12-19 17:17:09,746 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:17:09,746 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 17:17:09,746 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:17:09,746 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 3 Supporting invariants [] [2021-12-19 17:17:09,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2021-12-19 17:17:09,760 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 17:17:09,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:09,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:09,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-19 17:17:09,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:10,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2021-12-19 17:17:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:10,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-19 17:17:10,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:10,945 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-19 17:17:10,945 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2021-12-19 17:17:10,945 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1486 states and 2101 transitions. cyclomatic complexity: 640 Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2021-12-19 17:17:11,135 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1486 states and 2101 transitions. cyclomatic complexity: 640. Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Result 2073 states and 2854 transitions. Complement of second has 49 states. [2021-12-19 17:17:11,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2021-12-19 17:17:11,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2021-12-19 17:17:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 78 transitions. [2021-12-19 17:17:11,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 78 transitions. Stem has 133 letters. Loop has 44 letters. [2021-12-19 17:17:11,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:11,137 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:17:11,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:11,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-19 17:17:11,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:11,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-19 17:17:11,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-19 17:17:11,944 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2021-12-19 17:17:11,944 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1486 states and 2101 transitions. cyclomatic complexity: 640 Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2021-12-19 17:17:12,096 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1486 states and 2101 transitions. cyclomatic complexity: 640. Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Result 2007 states and 2763 transitions. Complement of second has 43 states. [2021-12-19 17:17:12,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2021-12-19 17:17:12,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2021-12-19 17:17:12,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 77 transitions. [2021-12-19 17:17:12,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 77 transitions. Stem has 133 letters. Loop has 44 letters. [2021-12-19 17:17:12,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:12,097 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:17:12,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:12,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:12,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 876 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-19 17:17:12,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:12,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-19 17:17:12,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:12,828 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-19 17:17:12,829 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2021-12-19 17:17:12,829 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1486 states and 2101 transitions. cyclomatic complexity: 640 Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2021-12-19 17:17:13,068 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1486 states and 2101 transitions. cyclomatic complexity: 640. Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) Result 4068 states and 5598 transitions. Complement of second has 57 states. [2021-12-19 17:17:13,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 8 non-accepting loop states 1 accepting loop states [2021-12-19 17:17:13,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 6 states have call successors, (12), 2 states have call predecessors, (12), 5 states have return successors, (14), 7 states have call predecessors, (14), 6 states have call successors, (14) [2021-12-19 17:17:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 103 transitions. [2021-12-19 17:17:13,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 103 transitions. Stem has 133 letters. Loop has 44 letters. [2021-12-19 17:17:13,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:13,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 103 transitions. Stem has 177 letters. Loop has 44 letters. [2021-12-19 17:17:13,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:13,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 103 transitions. Stem has 133 letters. Loop has 88 letters. [2021-12-19 17:17:13,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:13,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4068 states and 5598 transitions. [2021-12-19 17:17:13,084 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 118 [2021-12-19 17:17:13,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4068 states to 3005 states and 4173 transitions. [2021-12-19 17:17:13,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 442 [2021-12-19 17:17:13,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 462 [2021-12-19 17:17:13,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3005 states and 4173 transitions. [2021-12-19 17:17:13,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:17:13,096 INFO L681 BuchiCegarLoop]: Abstraction has 3005 states and 4173 transitions. [2021-12-19 17:17:13,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states and 4173 transitions. [2021-12-19 17:17:13,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2604. [2021-12-19 17:17:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2604 states, 1626 states have (on average 1.1039360393603936) internal successors, (1795), 1657 states have internal predecessors, (1795), 597 states have call successors, (626), 306 states have call predecessors, (626), 381 states have return successors, (1194), 640 states have call predecessors, (1194), 597 states have call successors, (1194) [2021-12-19 17:17:13,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2604 states to 2604 states and 3615 transitions. [2021-12-19 17:17:13,171 INFO L704 BuchiCegarLoop]: Abstraction has 2604 states and 3615 transitions. [2021-12-19 17:17:13,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:17:13,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-19 17:17:13,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2021-12-19 17:17:13,172 INFO L87 Difference]: Start difference. First operand 2604 states and 3615 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 5 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2021-12-19 17:17:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:17:13,270 INFO L93 Difference]: Finished difference Result 2704 states and 3795 transitions. [2021-12-19 17:17:13,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-19 17:17:13,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2704 states and 3795 transitions. [2021-12-19 17:17:13,280 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 114 [2021-12-19 17:17:13,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2704 states to 2696 states and 3787 transitions. [2021-12-19 17:17:13,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 420 [2021-12-19 17:17:13,296 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 420 [2021-12-19 17:17:13,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2696 states and 3787 transitions. [2021-12-19 17:17:13,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:17:13,298 INFO L681 BuchiCegarLoop]: Abstraction has 2696 states and 3787 transitions. [2021-12-19 17:17:13,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states and 3787 transitions. [2021-12-19 17:17:13,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2608. [2021-12-19 17:17:13,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2608 states, 1634 states have (on average 1.0973072215422277) internal successors, (1793), 1661 states have internal predecessors, (1793), 593 states have call successors, (622), 306 states have call predecessors, (622), 381 states have return successors, (1188), 640 states have call predecessors, (1188), 593 states have call successors, (1188) [2021-12-19 17:17:13,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 3603 transitions. [2021-12-19 17:17:13,347 INFO L704 BuchiCegarLoop]: Abstraction has 2608 states and 3603 transitions. [2021-12-19 17:17:13,347 INFO L587 BuchiCegarLoop]: Abstraction has 2608 states and 3603 transitions. [2021-12-19 17:17:13,348 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-12-19 17:17:13,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2608 states and 3603 transitions. [2021-12-19 17:17:13,353 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 106 [2021-12-19 17:17:13,353 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:17:13,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:17:13,354 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [15, 15, 9, 6, 6, 6, 6, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:17:13,354 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:17:13,354 INFO L791 eck$LassoCheckResult]: Stem: 87438#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 87410#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 87411#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 87437#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 87423#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 87424#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 87806#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 87801#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 87802#factENTRY ~n := #in~n; 87808#L25 assume ~n <= 0;#res := 1; 87805#factFINAL assume true; 87800#factEXIT >#68#return; 87795#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 87796#factENTRY ~n := #in~n; 87804#L25 assume ~n <= 0;#res := 1; 87799#factFINAL assume true; 87794#factEXIT >#70#return; 87789#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 87790#factENTRY ~n := #in~n; 87798#L25 assume ~n <= 0;#res := 1; 87793#factFINAL assume true; 87788#factEXIT >#72#return; 87783#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 87784#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 87850#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 87846#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 87843#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 87840#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 87841#factENTRY ~n := #in~n; 87852#L25 assume !(~n <= 0); 87848#L26 call #t~ret0 := fact(~n - 1);< 87849#factENTRY ~n := #in~n; 87853#L25 assume ~n <= 0;#res := 1; 87851#factFINAL assume true; 87847#factEXIT >#66#return; 87845#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87842#factFINAL assume true; 87839#factEXIT >#74#return; 87837#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 87838#factENTRY ~n := #in~n; 87856#L25 assume ~n <= 0;#res := 1; 87855#factFINAL assume true; 87836#factEXIT >#76#return; 87830#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 87832#factENTRY ~n := #in~n; 87831#L25 assume !(~n <= 0); 87768#L26 call #t~ret0 := fact(~n - 1);< 87781#factENTRY ~n := #in~n; 87825#L25 assume ~n <= 0;#res := 1; 87829#factFINAL assume true; 87826#factEXIT >#66#return; 87827#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87866#factFINAL assume true; 87865#factEXIT >#78#return; 87478#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 87479#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 87472#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 87473#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 87433#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 87434#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 87678#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 87679#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 87635#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 87643#factENTRY ~n := #in~n; 87652#L25 assume !(~n <= 0); 87649#L26 call #t~ret0 := fact(~n - 1);< 87650#factENTRY ~n := #in~n; 87654#L25 assume !(~n <= 0); 87667#L26 call #t~ret0 := fact(~n - 1);< 87670#factENTRY ~n := #in~n; 87672#L25 assume ~n <= 0;#res := 1; 87673#factFINAL assume true; 87671#factEXIT >#66#return; 87668#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87669#factFINAL assume true; 87666#factEXIT >#66#return; 87665#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87664#factFINAL assume true; 87655#factEXIT >#68#return; 87637#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 87643#factENTRY ~n := #in~n; 87652#L25 assume ~n <= 0;#res := 1; 87642#factFINAL assume true; 87633#factEXIT >#70#return; 87639#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 87658#factENTRY ~n := #in~n; 87685#L25 assume !(~n <= 0); 87682#L26 call #t~ret0 := fact(~n - 1);< 87687#factENTRY ~n := #in~n; 87686#L25 assume !(~n <= 0); 87681#L26 call #t~ret0 := fact(~n - 1);< 87684#factENTRY ~n := #in~n; 87688#L25 assume ~n <= 0;#res := 1; 87694#factFINAL assume true; 87693#factEXIT >#66#return; 87691#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87680#factFINAL assume true; 87683#factEXIT >#66#return; 87692#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87656#factFINAL assume true; 87657#factEXIT >#72#return; 87886#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 87900#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 87464#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 87447#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 87448#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 87383#L30 [2021-12-19 17:17:13,355 INFO L793 eck$LassoCheckResult]: Loop: 87383#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 87402#factENTRY ~n := #in~n; 89349#L25 assume !(~n <= 0); 87508#L26 call #t~ret0 := fact(~n - 1);< 87514#factENTRY ~n := #in~n; 89230#L25 assume !(~n <= 0); 89217#L26 call #t~ret0 := fact(~n - 1);< 89228#factENTRY ~n := #in~n; 89231#L25 assume ~n <= 0;#res := 1; 89235#factFINAL assume true; 89234#factEXIT >#66#return; 89233#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 89227#factFINAL assume true; 89224#factEXIT >#66#return; 89221#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 89723#factFINAL assume true; 89724#factEXIT >#68#return; 87382#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 87402#factENTRY ~n := #in~n; 89349#L25 assume !(~n <= 0); 87508#L26 call #t~ret0 := fact(~n - 1);< 87514#factENTRY ~n := #in~n; 87522#L25 assume ~n <= 0;#res := 1; 87517#factFINAL assume true; 87500#factEXIT >#66#return; 87513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 89725#factFINAL assume true; 89722#factEXIT >#70#return; 87397#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 89972#factENTRY ~n := #in~n; 89238#L25 assume !(~n <= 0); 87501#L26 call #t~ret0 := fact(~n - 1);< 87518#factENTRY ~n := #in~n; 87522#L25 assume ~n <= 0;#res := 1; 87517#factFINAL assume true; 87500#factEXIT >#66#return; 87443#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87396#factFINAL assume true; 87400#factEXIT >#72#return; 87431#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 87427#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 87428#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 89242#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 89958#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 87383#L30 [2021-12-19 17:17:13,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:13,355 INFO L85 PathProgramCache]: Analyzing trace with hash -351210155, now seen corresponding path program 4 times [2021-12-19 17:17:13,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:17:13,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895722656] [2021-12-19 17:17:13,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:17:13,356 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:17:13,361 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:17:13,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [200405691] [2021-12-19 17:17:13,362 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 17:17:13,362 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:17:13,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:13,378 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:17:13,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2021-12-19 17:17:13,434 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 17:17:13,434 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:17:13,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-19 17:17:13,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 268 proven. 10 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2021-12-19 17:17:13,656 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:17:13,970 INFO L134 CoverageAnalysis]: Checked inductivity of 475 backedges. 76 proven. 43 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2021-12-19 17:17:13,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:17:13,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895722656] [2021-12-19 17:17:13,970 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:17:13,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200405691] [2021-12-19 17:17:13,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200405691] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:17:13,970 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:17:13,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2021-12-19 17:17:13,971 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827322109] [2021-12-19 17:17:13,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:17:13,986 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:17:13,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:13,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1980596210, now seen corresponding path program 3 times [2021-12-19 17:17:13,987 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:17:13,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258974092] [2021-12-19 17:17:13,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:17:13,987 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:17:13,989 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:17:13,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1743592607] [2021-12-19 17:17:13,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 17:17:13,989 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:17:13,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:13,991 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:17:13,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2021-12-19 17:17:14,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-12-19 17:17:14,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-19 17:17:14,029 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:17:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:17:14,045 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:17:14,495 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:17:14,495 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:17:14,495 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:17:14,495 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:17:14,495 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 17:17:14,495 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:14,495 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:17:14,495 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:17:14,496 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration18_Loop [2021-12-19 17:17:14,496 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:17:14,496 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:17:14,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:14,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:14,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:14,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:14,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:14,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:14,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:14,566 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:17:14,566 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 17:17:14,566 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:14,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:14,580 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:14,595 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:17:14,596 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:14,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2021-12-19 17:17:14,619 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:17:14,619 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:17:14,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:14,633 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:14,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:14,634 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:14,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2021-12-19 17:17:14,636 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:17:14,636 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:14,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:14,671 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:14,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:14,672 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:14,683 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 17:17:14,683 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:14,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2021-12-19 17:17:15,069 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 17:17:15,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:15,074 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:17:15,074 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:17:15,074 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:17:15,074 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:17:15,075 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:17:15,075 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:15,075 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:17:15,075 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:17:15,075 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration18_Loop [2021-12-19 17:17:15,075 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:17:15,075 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:17:15,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:15,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:15,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:15,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:15,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:15,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:15,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:15,136 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:17:15,136 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:17:15,136 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:15,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:15,137 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:15,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2021-12-19 17:17:15,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:17:15,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:17:15,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:17:15,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:17:15,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:17:15,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:17:15,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:17:15,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:17:15,149 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:17:15,152 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-19 17:17:15,152 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-19 17:17:15,152 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:15,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:15,153 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:15,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2021-12-19 17:17:15,154 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:17:15,154 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 17:17:15,154 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:17:15,154 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1, ULTIMATE.start_main_~k~0#1) = 1*ULTIMATE.start_main_~n~0#1 - 1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2021-12-19 17:17:15,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:15,169 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 17:17:15,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:15,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-19 17:17:15,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:15,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:15,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-19 17:17:15,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-19 17:17:15,989 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2021-12-19 17:17:15,989 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2608 states and 3603 transitions. cyclomatic complexity: 1034 Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-19 17:17:16,056 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2608 states and 3603 transitions. cyclomatic complexity: 1034. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Result 3155 states and 4292 transitions. Complement of second has 15 states. [2021-12-19 17:17:16,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-19 17:17:16,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-19 17:17:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2021-12-19 17:17:16,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 106 letters. Loop has 44 letters. [2021-12-19 17:17:16,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:16,059 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:17:16,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:16,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-19 17:17:16,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:16,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-19 17:17:16,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-19 17:17:16,926 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2021-12-19 17:17:16,926 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2608 states and 3603 transitions. cyclomatic complexity: 1034 Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-19 17:17:16,992 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2608 states and 3603 transitions. cyclomatic complexity: 1034. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Result 3155 states and 4292 transitions. Complement of second has 15 states. [2021-12-19 17:17:16,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-19 17:17:16,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-19 17:17:16,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2021-12-19 17:17:16,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 36 transitions. Stem has 106 letters. Loop has 44 letters. [2021-12-19 17:17:16,994 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:16,994 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:17:17,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:17,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-19 17:17:17,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:17,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-19 17:17:17,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2021-12-19 17:17:17,749 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2021-12-19 17:17:17,750 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2608 states and 3603 transitions. cyclomatic complexity: 1034 Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-19 17:17:17,851 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2608 states and 3603 transitions. cyclomatic complexity: 1034. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Result 5542 states and 7511 transitions. Complement of second has 14 states. [2021-12-19 17:17:17,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2021-12-19 17:17:17,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2021-12-19 17:17:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2021-12-19 17:17:17,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 65 transitions. Stem has 106 letters. Loop has 44 letters. [2021-12-19 17:17:17,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:17,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 65 transitions. Stem has 150 letters. Loop has 44 letters. [2021-12-19 17:17:17,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:17,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 65 transitions. Stem has 106 letters. Loop has 88 letters. [2021-12-19 17:17:17,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:17,853 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5542 states and 7511 transitions. [2021-12-19 17:17:17,873 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 118 [2021-12-19 17:17:17,892 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5542 states to 4444 states and 6103 transitions. [2021-12-19 17:17:17,892 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 347 [2021-12-19 17:17:17,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 350 [2021-12-19 17:17:17,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4444 states and 6103 transitions. [2021-12-19 17:17:17,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:17:17,893 INFO L681 BuchiCegarLoop]: Abstraction has 4444 states and 6103 transitions. [2021-12-19 17:17:17,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4444 states and 6103 transitions. [2021-12-19 17:17:17,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4444 to 4203. [2021-12-19 17:17:17,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4203 states, 2643 states have (on average 1.079455164585698) internal successors, (2853), 2669 states have internal predecessors, (2853), 933 states have call successors, (994), 516 states have call predecessors, (994), 627 states have return successors, (1910), 1017 states have call predecessors, (1910), 933 states have call successors, (1910) [2021-12-19 17:17:17,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4203 states to 4203 states and 5757 transitions. [2021-12-19 17:17:17,989 INFO L704 BuchiCegarLoop]: Abstraction has 4203 states and 5757 transitions. [2021-12-19 17:17:17,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:17:17,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-19 17:17:17,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-19 17:17:17,990 INFO L87 Difference]: Start difference. First operand 4203 states and 5757 transitions. Second operand has 10 states, 9 states have (on average 4.888888888888889) internal successors, (44), 10 states have internal predecessors, (44), 7 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 7 states have call successors, (16) [2021-12-19 17:17:18,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:17:18,178 INFO L93 Difference]: Finished difference Result 4608 states and 6535 transitions. [2021-12-19 17:17:18,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-19 17:17:18,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4608 states and 6535 transitions. [2021-12-19 17:17:18,202 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 118 [2021-12-19 17:17:18,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4608 states to 4608 states and 6535 transitions. [2021-12-19 17:17:18,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 360 [2021-12-19 17:17:18,227 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 360 [2021-12-19 17:17:18,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4608 states and 6535 transitions. [2021-12-19 17:17:18,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:17:18,228 INFO L681 BuchiCegarLoop]: Abstraction has 4608 states and 6535 transitions. [2021-12-19 17:17:18,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states and 6535 transitions. [2021-12-19 17:17:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 4208. [2021-12-19 17:17:18,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4208 states, 2646 states have (on average 1.0793650793650793) internal successors, (2856), 2674 states have internal predecessors, (2856), 935 states have call successors, (996), 516 states have call predecessors, (996), 627 states have return successors, (1912), 1017 states have call predecessors, (1912), 935 states have call successors, (1912) [2021-12-19 17:17:18,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4208 states to 4208 states and 5764 transitions. [2021-12-19 17:17:18,286 INFO L704 BuchiCegarLoop]: Abstraction has 4208 states and 5764 transitions. [2021-12-19 17:17:18,286 INFO L587 BuchiCegarLoop]: Abstraction has 4208 states and 5764 transitions. [2021-12-19 17:17:18,286 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-12-19 17:17:18,286 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4208 states and 5764 transitions. [2021-12-19 17:17:18,292 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 109 [2021-12-19 17:17:18,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:17:18,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:17:18,297 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [30, 30, 18, 12, 12, 12, 12, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2021-12-19 17:17:18,297 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [12, 12, 9, 9, 9, 9, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:17:18,297 INFO L791 eck$LassoCheckResult]: Stem: 112779#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 112747#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 112748#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 112778#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 112800#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 112925#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 112923#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 112894#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 112895#factENTRY ~n := #in~n; 112919#L25 assume ~n <= 0;#res := 1; 112915#factFINAL assume true; 112893#factEXIT >#68#return; 112889#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 112890#factENTRY ~n := #in~n; 112906#L25 assume ~n <= 0;#res := 1; 112904#factFINAL assume true; 112888#factEXIT >#70#return; 112863#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 112864#factENTRY ~n := #in~n; 112887#L25 assume ~n <= 0;#res := 1; 112886#factFINAL assume true; 112862#factEXIT >#72#return; 112858#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 112859#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 112946#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 112942#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 112939#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 112935#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 112936#factENTRY ~n := #in~n; 112948#L25 assume !(~n <= 0); 112944#L26 call #t~ret0 := fact(~n - 1);< 112945#factENTRY ~n := #in~n; 112949#L25 assume ~n <= 0;#res := 1; 112947#factFINAL assume true; 112943#factEXIT >#66#return; 112941#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 112938#factFINAL assume true; 112934#factEXIT >#74#return; 112931#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 112932#factENTRY ~n := #in~n; 112937#L25 assume ~n <= 0;#res := 1; 112933#factFINAL assume true; 112930#factEXIT >#76#return; 112828#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 112929#factENTRY ~n := #in~n; 112928#L25 assume !(~n <= 0); 112881#L26 call #t~ret0 := fact(~n - 1);< 112897#factENTRY ~n := #in~n; 112907#L25 assume ~n <= 0;#res := 1; 113086#factFINAL assume true; 113076#factEXIT >#66#return; 113077#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113703#factFINAL assume true; 112827#factEXIT >#78#return; 112826#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 112809#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 112810#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 112805#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 112806#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 112762#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 112763#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 112813#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 112733#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 112734#factENTRY ~n := #in~n; 113363#L25 assume !(~n <= 0); 113359#L26 call #t~ret0 := fact(~n - 1);< 113361#factENTRY ~n := #in~n; 113402#L25 assume ~n <= 0;#res := 1; 113494#factFINAL assume true; 113493#factEXIT >#66#return; 113492#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113491#factFINAL assume true; 113490#factEXIT >#68#return; 113454#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 113455#factENTRY ~n := #in~n; 113461#L25 assume ~n <= 0;#res := 1; 113457#factFINAL assume true; 113453#factEXIT >#70#return; 113449#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 113460#factENTRY ~n := #in~n; 113495#L25 assume !(~n <= 0); 113464#L26 call #t~ret0 := fact(~n - 1);< 113515#factENTRY ~n := #in~n; 113517#L25 assume ~n <= 0;#res := 1; 113516#factFINAL assume true; 113514#factEXIT >#66#return; 113513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113512#factFINAL assume true; 113511#factEXIT >#72#return; 113451#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 113508#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 113506#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 113504#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 113210#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 113205#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 113207#factENTRY ~n := #in~n; 113209#L25 assume !(~n <= 0); 113015#L26 call #t~ret0 := fact(~n - 1);< 113044#factENTRY ~n := #in~n; 113051#L25 assume ~n <= 0;#res := 1; 113043#factFINAL assume true; 113011#factEXIT >#66#return; 113025#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113208#factFINAL assume true; 113204#factEXIT >#68#return; 112983#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 113198#factENTRY ~n := #in~n; 113201#L25 assume ~n <= 0;#res := 1; 113200#factFINAL assume true; 113197#factEXIT >#70#return; 113046#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 113117#factENTRY ~n := #in~n; 113118#L25 assume !(~n <= 0); 113013#L26 call #t~ret0 := fact(~n - 1);< 113029#factENTRY ~n := #in~n; 113051#L25 assume ~n <= 0;#res := 1; 113043#factFINAL assume true; 113011#factEXIT >#66#return; 113023#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113240#factFINAL assume true; 113228#factEXIT >#72#return; 113224#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 113217#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 113214#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 113174#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 113123#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 113001#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 113005#factENTRY ~n := #in~n; 113030#L25 assume !(~n <= 0); 113018#L26 call #t~ret0 := fact(~n - 1);< 113029#factENTRY ~n := #in~n; 113051#L25 assume ~n <= 0;#res := 1; 113043#factFINAL assume true; 113011#factEXIT >#66#return; 113007#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113006#factFINAL assume true; 112999#factEXIT >#74#return; 112994#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 112995#factENTRY ~n := #in~n; 112998#L25 assume ~n <= 0;#res := 1; 112997#factFINAL assume true; 112993#factEXIT >#76#return; 112961#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 112962#factENTRY ~n := #in~n; 112985#L25 assume !(~n <= 0); 112968#L26 call #t~ret0 := fact(~n - 1);< 112981#factENTRY ~n := #in~n; 112986#L25 assume ~n <= 0;#res := 1; 112982#factFINAL assume true; 112965#factEXIT >#66#return; 112964#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 112963#factFINAL assume true; 112960#factEXIT >#78#return; 112749#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 112750#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 116895#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 116894#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 116893#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 114160#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 114153#factENTRY ~n := #in~n; 116901#L25 assume !(~n <= 0); 113726#L26 call #t~ret0 := fact(~n - 1);< 113739#factENTRY ~n := #in~n; 113749#L25 assume !(~n <= 0); 113714#L26 call #t~ret0 := fact(~n - 1);< 113747#factENTRY ~n := #in~n; 113750#L25 assume ~n <= 0;#res := 1; 113748#factFINAL assume true; 113746#factEXIT >#66#return; 113745#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113743#factFINAL assume true; 113713#factEXIT >#66#return; 113738#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114156#factFINAL assume true; 114164#factEXIT >#74#return; 112785#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 114139#factENTRY ~n := #in~n; 114141#L25 assume ~n <= 0;#res := 1; 114140#factFINAL assume true; 114137#factEXIT >#76#return; 112739#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 113866#factENTRY ~n := #in~n; 113867#L25 assume !(~n <= 0); 113579#L26 call #t~ret0 := fact(~n - 1);< 113602#factENTRY ~n := #in~n; 113610#L25 assume !(~n <= 0); 113592#L26 call #t~ret0 := fact(~n - 1);< 113609#factENTRY ~n := #in~n; 113635#L25 assume ~n <= 0;#res := 1; 113698#factFINAL assume true; 113696#factEXIT >#66#return; 113695#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113651#factFINAL assume true; 113615#factEXIT >#66#return; 112783#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 112738#factFINAL assume true; 112740#factEXIT >#78#return; 112723#L30-8 [2021-12-19 17:17:18,298 INFO L793 eck$LassoCheckResult]: Loop: 112723#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 112759#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 112760#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 112799#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 112780#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 112716#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 112717#factENTRY ~n := #in~n; 114169#L25 assume !(~n <= 0); 113582#L26 call #t~ret0 := fact(~n - 1);< 113608#factENTRY ~n := #in~n; 113610#L25 assume !(~n <= 0); 113592#L26 call #t~ret0 := fact(~n - 1);< 113609#factENTRY ~n := #in~n; 113610#L25 assume !(~n <= 0); 113592#L26 call #t~ret0 := fact(~n - 1);< 113609#factENTRY ~n := #in~n; 113635#L25 assume ~n <= 0;#res := 1; 113698#factFINAL assume true; 113696#factEXIT >#66#return; 113695#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113651#factFINAL assume true; 113615#factEXIT >#66#return; 113601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113606#factFINAL assume true; 113578#factEXIT >#66#return; 113594#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114133#factFINAL assume true; 114129#factEXIT >#74#return; 114130#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 112717#factENTRY ~n := #in~n; 114169#L25 assume !(~n <= 0); 113582#L26 call #t~ret0 := fact(~n - 1);< 113608#factENTRY ~n := #in~n; 113610#L25 assume !(~n <= 0); 113592#L26 call #t~ret0 := fact(~n - 1);< 113609#factENTRY ~n := #in~n; 113610#L25 assume !(~n <= 0); 113592#L26 call #t~ret0 := fact(~n - 1);< 113609#factENTRY ~n := #in~n; 113635#L25 assume ~n <= 0;#res := 1; 113698#factFINAL assume true; 113696#factEXIT >#66#return; 113695#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113651#factFINAL assume true; 113615#factEXIT >#66#return; 113601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113606#factFINAL assume true; 113578#factEXIT >#66#return; 113594#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114133#factFINAL assume true; 114129#factEXIT >#76#return; 114131#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 112802#factENTRY ~n := #in~n; 114135#L25 assume !(~n <= 0); 113582#L26 call #t~ret0 := fact(~n - 1);< 113608#factENTRY ~n := #in~n; 113610#L25 assume !(~n <= 0); 113592#L26 call #t~ret0 := fact(~n - 1);< 113609#factENTRY ~n := #in~n; 113610#L25 assume !(~n <= 0); 113592#L26 call #t~ret0 := fact(~n - 1);< 113609#factENTRY ~n := #in~n; 113635#L25 assume ~n <= 0;#res := 1; 113698#factFINAL assume true; 113696#factEXIT >#66#return; 113695#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113651#factFINAL assume true; 113615#factEXIT >#66#return; 113601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 113606#factFINAL assume true; 113578#factEXIT >#66#return; 113594#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114133#factFINAL assume true; 114129#factEXIT >#78#return; 112723#L30-8 [2021-12-19 17:17:18,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:18,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2088561688, now seen corresponding path program 5 times [2021-12-19 17:17:18,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:17:18,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835400900] [2021-12-19 17:17:18,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:17:18,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:17:18,304 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:17:18,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [454013825] [2021-12-19 17:17:18,304 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 17:17:18,304 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:17:18,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:18,305 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:17:18,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2021-12-19 17:17:18,386 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2021-12-19 17:17:18,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:17:18,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-19 17:17:18,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1945 backedges. 1152 proven. 41 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2021-12-19 17:17:18,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:17:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1945 backedges. 186 proven. 239 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked. [2021-12-19 17:17:18,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:17:18,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835400900] [2021-12-19 17:17:18,930 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:17:18,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454013825] [2021-12-19 17:17:18,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454013825] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:17:18,930 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:17:18,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 17 [2021-12-19 17:17:18,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53964627] [2021-12-19 17:17:18,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:17:18,931 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:17:18,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:18,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1678442820, now seen corresponding path program 2 times [2021-12-19 17:17:18,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:17:18,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903930639] [2021-12-19 17:17:18,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:17:18,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:17:18,935 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:17:18,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [722984402] [2021-12-19 17:17:18,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 17:17:18,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:17:18,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:18,939 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:17:18,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2021-12-19 17:17:18,986 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 17:17:18,986 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:17:18,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 21 conjunts are in the unsatisfiable core [2021-12-19 17:17:18,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 179 proven. 86 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-19 17:17:19,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:17:19,739 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 15 proven. 219 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2021-12-19 17:17:19,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:17:19,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903930639] [2021-12-19 17:17:19,740 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:17:19,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722984402] [2021-12-19 17:17:19,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722984402] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:17:19,740 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:17:19,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 21 [2021-12-19 17:17:19,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025963978] [2021-12-19 17:17:19,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:17:19,740 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:17:19,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:17:19,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-12-19 17:17:19,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2021-12-19 17:17:19,741 INFO L87 Difference]: Start difference. First operand 4208 states and 5764 transitions. cyclomatic complexity: 1608 Second operand has 21 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 20 states have internal predecessors, (49), 13 states have call successors, (15), 2 states have call predecessors, (15), 9 states have return successors, (18), 9 states have call predecessors, (18), 13 states have call successors, (18) [2021-12-19 17:17:20,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:17:20,285 INFO L93 Difference]: Finished difference Result 6380 states and 9304 transitions. [2021-12-19 17:17:20,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-19 17:17:20,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6380 states and 9304 transitions. [2021-12-19 17:17:20,346 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 203 [2021-12-19 17:17:20,377 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6380 states to 6248 states and 9138 transitions. [2021-12-19 17:17:20,377 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 518 [2021-12-19 17:17:20,377 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 524 [2021-12-19 17:17:20,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6248 states and 9138 transitions. [2021-12-19 17:17:20,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:17:20,378 INFO L681 BuchiCegarLoop]: Abstraction has 6248 states and 9138 transitions. [2021-12-19 17:17:20,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6248 states and 9138 transitions. [2021-12-19 17:17:20,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6248 to 4665. [2021-12-19 17:17:20,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4665 states, 2917 states have (on average 1.0887898525882755) internal successors, (3176), 2915 states have internal predecessors, (3176), 1067 states have call successors, (1128), 611 states have call predecessors, (1128), 681 states have return successors, (2567), 1138 states have call predecessors, (2567), 1067 states have call successors, (2567) [2021-12-19 17:17:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 6871 transitions. [2021-12-19 17:17:20,465 INFO L704 BuchiCegarLoop]: Abstraction has 4665 states and 6871 transitions. [2021-12-19 17:17:20,465 INFO L587 BuchiCegarLoop]: Abstraction has 4665 states and 6871 transitions. [2021-12-19 17:17:20,466 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-12-19 17:17:20,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4665 states and 6871 transitions. [2021-12-19 17:17:20,473 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 118 [2021-12-19 17:17:20,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:17:20,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:17:20,474 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [35, 35, 21, 14, 14, 14, 14, 7, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2021-12-19 17:17:20,475 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:17:20,475 INFO L791 eck$LassoCheckResult]: Stem: 125043#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 125013#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 125014#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 125042#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 125066#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 125306#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125304#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 125300#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 125301#factENTRY ~n := #in~n; 125305#L25 assume ~n <= 0;#res := 1; 125303#factFINAL assume true; 125299#factEXIT >#68#return; 125295#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125296#factENTRY ~n := #in~n; 125302#L25 assume ~n <= 0;#res := 1; 125298#factFINAL assume true; 125294#factEXIT >#70#return; 125291#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 125292#factENTRY ~n := #in~n; 125297#L25 assume ~n <= 0;#res := 1; 125293#factFINAL assume true; 125290#factEXIT >#72#return; 125288#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 125289#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 125472#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 125471#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125469#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 125412#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 125414#factENTRY ~n := #in~n; 125429#L25 assume !(~n <= 0); 125427#L26 call #t~ret0 := fact(~n - 1);< 125434#factENTRY ~n := #in~n; 125435#L25 assume ~n <= 0;#res := 1; 125426#factFINAL assume true; 125428#factEXIT >#66#return; 125420#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125421#factFINAL assume true; 125411#factEXIT >#74#return; 125413#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125466#factENTRY ~n := #in~n; 125468#L25 assume ~n <= 0;#res := 1; 125467#factFINAL assume true; 125465#factEXIT >#76#return; 125460#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 125464#factENTRY ~n := #in~n; 125463#L25 assume !(~n <= 0); 125455#L26 call #t~ret0 := fact(~n - 1);< 125458#factENTRY ~n := #in~n; 125462#L25 assume ~n <= 0;#res := 1; 125459#factFINAL assume true; 125454#factEXIT >#66#return; 125457#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125665#factFINAL assume true; 125661#factEXIT >#78#return; 125089#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 125090#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 125085#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 125086#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 125038#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 125039#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 125641#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125640#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 124998#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 124999#factENTRY ~n := #in~n; 125622#L25 assume !(~n <= 0); 125598#L26 call #t~ret0 := fact(~n - 1);< 125599#factENTRY ~n := #in~n; 125626#L25 assume ~n <= 0;#res := 1; 125621#factFINAL assume true; 125597#factEXIT >#66#return; 125595#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125593#factFINAL assume true; 125589#factEXIT >#68#return; 125591#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125637#factENTRY ~n := #in~n; 125643#L25 assume ~n <= 0;#res := 1; 125644#factFINAL assume true; 125648#factEXIT >#70#return; 125570#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 126917#factENTRY ~n := #in~n; 126932#L25 assume !(~n <= 0); 126927#L26 call #t~ret0 := fact(~n - 1);< 126956#factENTRY ~n := #in~n; 126960#L25 assume ~n <= 0;#res := 1; 126958#factFINAL assume true; 126955#factEXIT >#66#return; 126952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126945#factFINAL assume true; 125569#factEXIT >#72#return; 125571#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 127242#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 127231#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 127223#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125327#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 125323#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 125325#factENTRY ~n := #in~n; 125328#L25 assume !(~n <= 0); 125174#L26 call #t~ret0 := fact(~n - 1);< 125188#factENTRY ~n := #in~n; 125189#L25 assume ~n <= 0;#res := 1; 125185#factFINAL assume true; 125163#factEXIT >#66#return; 125182#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125326#factFINAL assume true; 125322#factEXIT >#68#return; 125318#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125320#factENTRY ~n := #in~n; 125341#L25 assume ~n <= 0;#res := 1; 125342#factFINAL assume true; 125317#factEXIT >#70#return; 125319#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 125447#factENTRY ~n := #in~n; 125659#L25 assume !(~n <= 0); 125170#L26 call #t~ret0 := fact(~n - 1);< 125183#factENTRY ~n := #in~n; 125189#L25 assume ~n <= 0;#res := 1; 125185#factFINAL assume true; 125163#factEXIT >#66#return; 125180#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125647#factFINAL assume true; 125448#factEXIT >#72#return; 125257#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 125256#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 125254#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 125248#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125199#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 125135#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 125137#factENTRY ~n := #in~n; 125226#L25 assume !(~n <= 0); 125169#L26 call #t~ret0 := fact(~n - 1);< 125183#factENTRY ~n := #in~n; 125189#L25 assume ~n <= 0;#res := 1; 125185#factFINAL assume true; 125163#factEXIT >#66#return; 125159#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125140#factFINAL assume true; 125130#factEXIT >#74#return; 125125#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125127#factENTRY ~n := #in~n; 125333#L25 assume ~n <= 0;#res := 1; 125332#factFINAL assume true; 125330#factEXIT >#76#return; 125225#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 125258#factENTRY ~n := #in~n; 125259#L25 assume !(~n <= 0); 125167#L26 call #t~ret0 := fact(~n - 1);< 125183#factENTRY ~n := #in~n; 125189#L25 assume ~n <= 0;#res := 1; 125185#factFINAL assume true; 125163#factEXIT >#66#return; 125179#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126502#factFINAL assume true; 126501#factEXIT >#78#return; 126497#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 126494#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 126490#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 126482#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 126470#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 126294#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 126295#factENTRY ~n := #in~n; 126446#L25 assume !(~n <= 0); 126093#L26 call #t~ret0 := fact(~n - 1);< 126215#factENTRY ~n := #in~n; 126110#L25 assume ~n <= 0;#res := 1; 126103#factFINAL assume true; 126078#factEXIT >#66#return; 126101#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126297#factFINAL assume true; 126307#factEXIT >#74#return; 126223#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 126226#factENTRY ~n := #in~n; 126228#L25 assume ~n <= 0;#res := 1; 126227#factFINAL assume true; 126222#factEXIT >#76#return; 126107#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 126121#factENTRY ~n := #in~n; 126122#L25 assume !(~n <= 0); 125803#L26 call #t~ret0 := fact(~n - 1);< 126106#factENTRY ~n := #in~n; 125842#L25 assume ~n <= 0;#res := 1; 126105#factFINAL assume true; 126066#factEXIT >#66#return; 126070#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129638#factFINAL assume true; 129637#factEXIT >#78#return; 126193#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 125016#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 126192#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 126191#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 126190#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 125783#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 125784#factENTRY ~n := #in~n; 126131#L25 assume !(~n <= 0); 125802#L26 call #t~ret0 := fact(~n - 1);< 126106#factENTRY ~n := #in~n; 125838#L25 assume !(~n <= 0); 125804#L26 call #t~ret0 := fact(~n - 1);< 125835#factENTRY ~n := #in~n; 125840#L25 assume ~n <= 0;#res := 1; 125837#factFINAL assume true; 125833#factEXIT >#66#return; 125832#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125830#factFINAL assume true; 125800#factEXIT >#66#return; 125819#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125785#factFINAL assume true; 125796#factEXIT >#74#return; 125753#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125769#factENTRY ~n := #in~n; 125763#L25 assume ~n <= 0;#res := 1; 125764#factFINAL assume true; 126018#factEXIT >#76#return; 125007#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 125006#factENTRY ~n := #in~n; 125008#L25 assume !(~n <= 0); 125054#L26 call #t~ret0 := fact(~n - 1);< 125732#factENTRY ~n := #in~n; 125733#L25 assume !(~n <= 0); 125706#L26 call #t~ret0 := fact(~n - 1);< 125731#factENTRY ~n := #in~n; 125734#L25 assume ~n <= 0;#res := 1; 125760#factFINAL assume true; 125757#factEXIT >#66#return; 125756#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125752#factFINAL assume true; 125744#factEXIT >#66#return; 125720#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126364#factFINAL assume true; 126188#factEXIT >#78#return; 125091#L30-8 [2021-12-19 17:17:20,476 INFO L793 eck$LassoCheckResult]: Loop: 125091#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 125025#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 125026#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 125065#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 125044#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 125045#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 125062#factENTRY ~n := #in~n; 126013#L25 assume !(~n <= 0); 125714#L26 call #t~ret0 := fact(~n - 1);< 125726#factENTRY ~n := #in~n; 125733#L25 assume !(~n <= 0); 125706#L26 call #t~ret0 := fact(~n - 1);< 125731#factENTRY ~n := #in~n; 125733#L25 assume !(~n <= 0); 125706#L26 call #t~ret0 := fact(~n - 1);< 125731#factENTRY ~n := #in~n; 125734#L25 assume ~n <= 0;#res := 1; 125760#factFINAL assume true; 125757#factEXIT >#66#return; 125756#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125752#factFINAL assume true; 125744#factEXIT >#66#return; 125748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125971#factFINAL assume true; 125970#factEXIT >#66#return; 125968#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125964#factFINAL assume true; 125946#factEXIT >#74#return; 125766#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 125765#factENTRY ~n := #in~n; 125768#L25 assume ~n <= 0;#res := 1; 126012#factFINAL assume true; 126007#factEXIT >#76#return; 125949#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 126004#factENTRY ~n := #in~n; 126002#L25 assume !(~n <= 0); 125716#L26 call #t~ret0 := fact(~n - 1);< 125732#factENTRY ~n := #in~n; 125733#L25 assume !(~n <= 0); 125706#L26 call #t~ret0 := fact(~n - 1);< 125731#factENTRY ~n := #in~n; 125734#L25 assume ~n <= 0;#res := 1; 125760#factFINAL assume true; 125757#factEXIT >#66#return; 125756#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 125752#factFINAL assume true; 125744#factEXIT >#66#return; 125750#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 126017#factFINAL assume true; 126016#factEXIT >#78#return; 125091#L30-8 [2021-12-19 17:17:20,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:20,476 INFO L85 PathProgramCache]: Analyzing trace with hash 480719467, now seen corresponding path program 6 times [2021-12-19 17:17:20,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:17:20,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069999770] [2021-12-19 17:17:20,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:17:20,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:17:20,482 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:17:20,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [172437158] [2021-12-19 17:17:20,482 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-19 17:17:20,482 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:17:20,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:20,504 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:17:20,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2021-12-19 17:17:20,573 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-12-19 17:17:20,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:17:20,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-19 17:17:20,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2666 backedges. 880 proven. 68 refuted. 0 times theorem prover too weak. 1718 trivial. 0 not checked. [2021-12-19 17:17:20,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:17:21,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2666 backedges. 15 proven. 69 refuted. 0 times theorem prover too weak. 2582 trivial. 0 not checked. [2021-12-19 17:17:21,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:17:21,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069999770] [2021-12-19 17:17:21,382 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:17:21,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172437158] [2021-12-19 17:17:21,382 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172437158] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:17:21,382 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:17:21,382 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2021-12-19 17:17:21,382 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995075910] [2021-12-19 17:17:21,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:17:21,383 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:17:21,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:21,383 INFO L85 PathProgramCache]: Analyzing trace with hash -312765636, now seen corresponding path program 3 times [2021-12-19 17:17:21,383 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:17:21,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791180103] [2021-12-19 17:17:21,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:17:21,383 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:17:21,384 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:17:21,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1860435983] [2021-12-19 17:17:21,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 17:17:21,385 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:17:21,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:21,388 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:17:21,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2021-12-19 17:17:21,428 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2021-12-19 17:17:21,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:17:21,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-19 17:17:21,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 64 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-12-19 17:17:21,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:17:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 74 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2021-12-19 17:17:22,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:17:22,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791180103] [2021-12-19 17:17:22,064 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:17:22,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860435983] [2021-12-19 17:17:22,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860435983] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:17:22,064 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:17:22,064 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 18 [2021-12-19 17:17:22,064 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314628040] [2021-12-19 17:17:22,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:17:22,064 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:17:22,064 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:17:22,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-19 17:17:22,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2021-12-19 17:17:22,065 INFO L87 Difference]: Start difference. First operand 4665 states and 6871 transitions. cyclomatic complexity: 2255 Second operand has 19 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 7 states have return successors, (14), 9 states have call predecessors, (14), 11 states have call successors, (14) [2021-12-19 17:17:22,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:17:22,499 INFO L93 Difference]: Finished difference Result 6466 states and 9146 transitions. [2021-12-19 17:17:22,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-19 17:17:22,500 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6466 states and 9146 transitions. [2021-12-19 17:17:22,523 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 244 [2021-12-19 17:17:22,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6466 states to 6440 states and 9120 transitions. [2021-12-19 17:17:22,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 543 [2021-12-19 17:17:22,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 543 [2021-12-19 17:17:22,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6440 states and 9120 transitions. [2021-12-19 17:17:22,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:17:22,551 INFO L681 BuchiCegarLoop]: Abstraction has 6440 states and 9120 transitions. [2021-12-19 17:17:22,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6440 states and 9120 transitions. [2021-12-19 17:17:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6440 to 4877. [2021-12-19 17:17:22,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4877 states, 3035 states have (on average 1.085337726523888) internal successors, (3294), 3031 states have internal predecessors, (3294), 1139 states have call successors, (1200), 649 states have call predecessors, (1200), 703 states have return successors, (2727), 1196 states have call predecessors, (2727), 1139 states have call successors, (2727) [2021-12-19 17:17:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4877 states to 4877 states and 7221 transitions. [2021-12-19 17:17:22,628 INFO L704 BuchiCegarLoop]: Abstraction has 4877 states and 7221 transitions. [2021-12-19 17:17:22,629 INFO L587 BuchiCegarLoop]: Abstraction has 4877 states and 7221 transitions. [2021-12-19 17:17:22,629 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-12-19 17:17:22,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4877 states and 7221 transitions. [2021-12-19 17:17:22,636 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 124 [2021-12-19 17:17:22,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:17:22,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:17:22,637 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [35, 35, 21, 14, 14, 14, 14, 7, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2021-12-19 17:17:22,637 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [11, 11, 8, 8, 8, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:17:22,638 INFO L791 eck$LassoCheckResult]: Stem: 137895#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 137864#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 137865#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 137894#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 137918#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 139542#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 139540#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 139536#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 139537#factENTRY ~n := #in~n; 139541#L25 assume ~n <= 0;#res := 1; 139539#factFINAL assume true; 139535#factEXIT >#68#return; 139531#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 139532#factENTRY ~n := #in~n; 139538#L25 assume ~n <= 0;#res := 1; 139534#factFINAL assume true; 139530#factEXIT >#70#return; 139527#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 139528#factENTRY ~n := #in~n; 139533#L25 assume ~n <= 0;#res := 1; 139529#factFINAL assume true; 139526#factEXIT >#72#return; 139524#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 139525#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 139622#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 139618#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 139615#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 139593#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 139594#factENTRY ~n := #in~n; 139624#L25 assume !(~n <= 0); 139620#L26 call #t~ret0 := fact(~n - 1);< 139621#factENTRY ~n := #in~n; 139625#L25 assume ~n <= 0;#res := 1; 139623#factFINAL assume true; 139619#factEXIT >#66#return; 139617#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139614#factFINAL assume true; 139592#factEXIT >#74#return; 139590#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 139591#factENTRY ~n := #in~n; 139600#L25 assume ~n <= 0;#res := 1; 139598#factFINAL assume true; 139589#factEXIT >#76#return; 139484#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 139588#factENTRY ~n := #in~n; 139581#L25 assume !(~n <= 0); 139576#L26 call #t~ret0 := fact(~n - 1);< 139578#factENTRY ~n := #in~n; 139587#L25 assume ~n <= 0;#res := 1; 139580#factFINAL assume true; 139574#factEXIT >#66#return; 139577#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139691#factFINAL assume true; 139483#factEXIT >#78#return; 137866#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 137867#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 137878#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 139477#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 137891#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 137880#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 137881#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 139321#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 137849#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 137850#factENTRY ~n := #in~n; 139164#L25 assume !(~n <= 0); 139161#L26 call #t~ret0 := fact(~n - 1);< 139162#factENTRY ~n := #in~n; 139165#L25 assume ~n <= 0;#res := 1; 139163#factFINAL assume true; 139160#factEXIT >#66#return; 139159#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139158#factFINAL assume true; 139155#factEXIT >#68#return; 139144#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 139153#factENTRY ~n := #in~n; 139157#L25 assume ~n <= 0;#res := 1; 139154#factFINAL assume true; 139143#factEXIT >#70#return; 139141#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 139142#factENTRY ~n := #in~n; 139283#L25 assume !(~n <= 0); 139235#L26 call #t~ret0 := fact(~n - 1);< 139280#factENTRY ~n := #in~n; 139285#L25 assume ~n <= 0;#res := 1; 139282#factFINAL assume true; 139279#factEXIT >#66#return; 139278#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139276#factFINAL assume true; 139140#factEXIT >#72#return; 139136#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 139134#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 139132#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 139130#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 138246#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 138242#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 138243#factENTRY ~n := #in~n; 138247#L25 assume !(~n <= 0); 138143#L26 call #t~ret0 := fact(~n - 1);< 138159#factENTRY ~n := #in~n; 138158#L25 assume ~n <= 0;#res := 1; 138155#factFINAL assume true; 138134#factEXIT >#66#return; 138152#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 138245#factFINAL assume true; 138241#factEXIT >#68#return; 138237#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 138240#factENTRY ~n := #in~n; 138269#L25 assume ~n <= 0;#res := 1; 138270#factFINAL assume true; 138263#factEXIT >#70#return; 138258#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 138619#factENTRY ~n := #in~n; 138673#L25 assume !(~n <= 0); 138146#L26 call #t~ret0 := fact(~n - 1);< 138157#factENTRY ~n := #in~n; 138158#L25 assume ~n <= 0;#res := 1; 138155#factFINAL assume true; 138134#factEXIT >#66#return; 138153#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 138665#factFINAL assume true; 138257#factEXIT >#72#return; 138252#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 138249#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 138223#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 138181#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 138160#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 138125#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 138127#factENTRY ~n := #in~n; 138164#L25 assume !(~n <= 0); 138137#L26 call #t~ret0 := fact(~n - 1);< 138157#factENTRY ~n := #in~n; 138158#L25 assume ~n <= 0;#res := 1; 138155#factFINAL assume true; 138134#factEXIT >#66#return; 138131#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 138129#factFINAL assume true; 138120#factEXIT >#74#return; 138116#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 138118#factENTRY ~n := #in~n; 138285#L25 assume ~n <= 0;#res := 1; 138284#factFINAL assume true; 138282#factEXIT >#76#return; 138156#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 138279#factENTRY ~n := #in~n; 138280#L25 assume !(~n <= 0); 138136#L26 call #t~ret0 := fact(~n - 1);< 138157#factENTRY ~n := #in~n; 138158#L25 assume ~n <= 0;#res := 1; 138155#factFINAL assume true; 138134#factEXIT >#66#return; 138148#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 138916#factFINAL assume true; 138913#factEXIT >#78#return; 138912#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 138910#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 138908#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 138901#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 138850#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 138647#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 138652#factENTRY ~n := #in~n; 138875#L25 assume !(~n <= 0); 138505#L26 call #t~ret0 := fact(~n - 1);< 138595#factENTRY ~n := #in~n; 138529#L25 assume ~n <= 0;#res := 1; 138528#factFINAL assume true; 138504#factEXIT >#66#return; 138520#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 138854#factFINAL assume true; 138640#factEXIT >#74#return; 138634#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 138637#factENTRY ~n := #in~n; 138639#L25 assume ~n <= 0;#res := 1; 138638#factFINAL assume true; 138633#factEXIT >#76#return; 138441#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 138632#factENTRY ~n := #in~n; 138439#L25 assume !(~n <= 0); 138344#L26 call #t~ret0 := fact(~n - 1);< 138368#factENTRY ~n := #in~n; 138382#L25 assume ~n <= 0;#res := 1; 138432#factFINAL assume true; 138424#factEXIT >#66#return; 138430#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 142706#factFINAL assume true; 142696#factEXIT >#78#return; 138627#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 138626#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 138625#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 138624#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 138620#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 138311#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 138312#factENTRY ~n := #in~n; 138454#L25 assume !(~n <= 0); 138348#L26 call #t~ret0 := fact(~n - 1);< 138368#factENTRY ~n := #in~n; 138378#L25 assume !(~n <= 0); 138352#L26 call #t~ret0 := fact(~n - 1);< 138375#factENTRY ~n := #in~n; 138380#L25 assume ~n <= 0;#res := 1; 138377#factFINAL assume true; 138373#factEXIT >#66#return; 138372#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 138369#factFINAL assume true; 138340#factEXIT >#66#return; 138360#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 138314#factFINAL assume true; 138324#factEXIT >#74#return; 138293#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 138296#factENTRY ~n := #in~n; 138292#L25 assume ~n <= 0;#res := 1; 138295#factFINAL assume true; 138602#factEXIT >#76#return; 137854#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 137919#factENTRY ~n := #in~n; 138611#L25 assume !(~n <= 0); 137945#L26 call #t~ret0 := fact(~n - 1);< 138268#factENTRY ~n := #in~n; 137971#L25 assume !(~n <= 0); 137950#L26 call #t~ret0 := fact(~n - 1);< 138013#factENTRY ~n := #in~n; 138031#L25 assume ~n <= 0;#res := 1; 138027#factFINAL assume true; 138010#factEXIT >#66#return; 138005#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 137997#factFINAL assume true; 137973#factEXIT >#66#return; 137900#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 137853#factFINAL assume true; 137855#factEXIT >#78#return; 137840#L30-8 [2021-12-19 17:17:22,638 INFO L793 eck$LassoCheckResult]: Loop: 137840#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 139453#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 139451#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 139427#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 138331#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 138088#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 138395#factENTRY ~n := #in~n; 138094#L25 assume !(~n <= 0); 137949#L26 call #t~ret0 := fact(~n - 1);< 137959#factENTRY ~n := #in~n; 137971#L25 assume !(~n <= 0); 137950#L26 call #t~ret0 := fact(~n - 1);< 138013#factENTRY ~n := #in~n; 137971#L25 assume !(~n <= 0); 137950#L26 call #t~ret0 := fact(~n - 1);< 138013#factENTRY ~n := #in~n; 137971#L25 assume !(~n <= 0); 137950#L26 call #t~ret0 := fact(~n - 1);< 138013#factENTRY ~n := #in~n; 138031#L25 assume ~n <= 0;#res := 1; 138027#factFINAL assume true; 138010#factEXIT >#66#return; 138005#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 137997#factFINAL assume true; 137973#factEXIT >#66#return; 137978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 137963#factFINAL assume true; 137964#factEXIT >#66#return; 137955#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 137972#factFINAL assume true; 137936#factEXIT >#66#return; 137954#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139421#factFINAL assume true; 138327#factEXIT >#74#return; 138089#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 138395#factENTRY ~n := #in~n; 138094#L25 assume ~n <= 0;#res := 1; 138087#factFINAL assume true; 138091#factEXIT >#76#return; 138020#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 138037#factENTRY ~n := #in~n; 138038#L25 assume !(~n <= 0); 137942#L26 call #t~ret0 := fact(~n - 1);< 138019#factENTRY ~n := #in~n; 138017#L25 assume !(~n <= 0); 137943#L26 call #t~ret0 := fact(~n - 1);< 137985#factENTRY ~n := #in~n; 137971#L25 assume !(~n <= 0); 137950#L26 call #t~ret0 := fact(~n - 1);< 138013#factENTRY ~n := #in~n; 137971#L25 assume !(~n <= 0); 137950#L26 call #t~ret0 := fact(~n - 1);< 138013#factENTRY ~n := #in~n; 138031#L25 assume ~n <= 0;#res := 1; 138027#factFINAL assume true; 138010#factEXIT >#66#return; 138005#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 137997#factFINAL assume true; 137973#factEXIT >#66#return; 137978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 137963#factFINAL assume true; 137964#factEXIT >#66#return; 137955#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 137972#factFINAL assume true; 137936#factEXIT >#66#return; 137954#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 139421#factFINAL assume true; 138327#factEXIT >#78#return; 137840#L30-8 [2021-12-19 17:17:22,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash 480719467, now seen corresponding path program 7 times [2021-12-19 17:17:22,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:17:22,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81757376] [2021-12-19 17:17:22,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:17:22,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:17:22,644 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:17:22,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1246895075] [2021-12-19 17:17:22,645 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-19 17:17:22,645 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:17:22,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:22,646 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:17:22,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2021-12-19 17:17:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:22,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-19 17:17:22,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:22,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2666 backedges. 1427 proven. 2 refuted. 0 times theorem prover too weak. 1237 trivial. 0 not checked. [2021-12-19 17:17:22,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:17:23,315 INFO L134 CoverageAnalysis]: Checked inductivity of 2666 backedges. 121 proven. 59 refuted. 0 times theorem prover too weak. 2486 trivial. 0 not checked. [2021-12-19 17:17:23,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:17:23,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81757376] [2021-12-19 17:17:23,315 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:17:23,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246895075] [2021-12-19 17:17:23,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246895075] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:17:23,316 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:17:23,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2021-12-19 17:17:23,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386435399] [2021-12-19 17:17:23,316 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:17:23,318 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:17:23,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:23,318 INFO L85 PathProgramCache]: Analyzing trace with hash 857296756, now seen corresponding path program 4 times [2021-12-19 17:17:23,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:17:23,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127595731] [2021-12-19 17:17:23,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:17:23,319 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:17:23,321 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:17:23,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [576374760] [2021-12-19 17:17:23,321 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 17:17:23,321 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:17:23,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:23,322 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:17:23,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2021-12-19 17:17:23,379 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 17:17:23,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-19 17:17:23,380 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:17:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:17:23,401 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:17:25,485 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:17:25,485 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:17:25,485 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:17:25,486 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:17:25,486 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 17:17:25,486 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:25,486 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:17:25,486 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:17:25,486 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration21_Loop [2021-12-19 17:17:25,486 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:17:25,486 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:17:25,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:25,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:25,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:25,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:25,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:25,601 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:17:25,601 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 17:17:25,601 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:25,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:25,604 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:25,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2021-12-19 17:17:25,607 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:17:25,607 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:25,615 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:17:25,616 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:17:25,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:25,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:25,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:25,631 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:25,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2021-12-19 17:17:25,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:17:25,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:25,642 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:17:25,642 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:17:25,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:25,663 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:25,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:25,664 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:25,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2021-12-19 17:17:25,666 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:17:25,666 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:25,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:25,694 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:25,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:25,696 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:25,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2021-12-19 17:17:25,697 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 17:17:25,697 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:17:25,712 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 17:17:25,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:25,732 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:17:25,732 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:17:25,732 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:17:25,732 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:17:25,732 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:17:25,732 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:25,732 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:17:25,732 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:17:25,732 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration21_Loop [2021-12-19 17:17:25,732 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:17:25,732 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:17:25,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:25,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:25,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:25,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:25,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:17:25,852 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:17:25,852 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:17:25,852 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:25,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:25,854 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:25,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2021-12-19 17:17:25,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:17:25,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:17:25,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:17:25,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:17:25,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:17:25,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:17:25,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:17:25,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:17:25,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:17:25,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2021-12-19 17:17:25,876 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:25,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:25,877 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:25,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2021-12-19 17:17:25,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:17:25,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:17:25,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:17:25,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:17:25,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:17:25,885 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:17:25,885 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:17:25,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:17:25,886 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:17:25,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2021-12-19 17:17:25,900 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:25,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:25,901 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:25,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2021-12-19 17:17:25,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:17:25,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:17:25,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:17:25,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:17:25,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:17:25,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:17:25,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:17:25,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:17:25,910 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:17:25,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2021-12-19 17:17:25,925 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:25,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:25,926 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:25,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2021-12-19 17:17:25,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:17:25,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:17:25,934 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:17:25,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:17:25,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:17:25,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:17:25,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:17:25,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:17:25,939 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:17:25,942 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-19 17:17:25,942 INFO L444 ModelExtractionUtils]: 8 out of 11 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-19 17:17:25,942 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:17:25,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:25,943 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:17:25,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2021-12-19 17:17:25,944 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:17:25,944 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 17:17:25,944 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:17:25,944 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 7 Supporting invariants [] [2021-12-19 17:17:25,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2021-12-19 17:17:25,959 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 17:17:25,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:26,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 1521 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-19 17:17:26,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:26,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Forceful destruction successful, exit code 0 [2021-12-19 17:17:27,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:27,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-19 17:17:27,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:27,637 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-12-19 17:17:27,637 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2021-12-19 17:17:27,637 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4877 states and 7221 transitions. cyclomatic complexity: 2393 Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2021-12-19 17:17:27,970 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4877 states and 7221 transitions. cyclomatic complexity: 2393. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 5907 states and 8735 transitions. Complement of second has 65 states. [2021-12-19 17:17:27,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2021-12-19 17:17:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2021-12-19 17:17:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 94 transitions. [2021-12-19 17:17:27,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 94 transitions. Stem has 229 letters. Loop has 68 letters. [2021-12-19 17:17:27,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:27,972 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:17:27,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:28,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 1521 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-19 17:17:28,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:29,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-19 17:17:29,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:29,962 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-12-19 17:17:29,962 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 11 loop predicates [2021-12-19 17:17:29,962 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4877 states and 7221 transitions. cyclomatic complexity: 2393 Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2021-12-19 17:17:30,254 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4877 states and 7221 transitions. cyclomatic complexity: 2393. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 5781 states and 8524 transitions. Complement of second has 55 states. [2021-12-19 17:17:30,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2021-12-19 17:17:30,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2021-12-19 17:17:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 93 transitions. [2021-12-19 17:17:30,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 93 transitions. Stem has 229 letters. Loop has 68 letters. [2021-12-19 17:17:30,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:30,255 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:17:30,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:30,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 1521 conjuncts, 72 conjunts are in the unsatisfiable core [2021-12-19 17:17:30,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:17:31,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 38 conjunts are in the unsatisfiable core [2021-12-19 17:17:31,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:31,808 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2021-12-19 17:17:31,809 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2021-12-19 17:17:31,809 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4877 states and 7221 transitions. cyclomatic complexity: 2393 Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2021-12-19 17:17:32,264 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4877 states and 7221 transitions. cyclomatic complexity: 2393. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 14104 states and 21157 transitions. Complement of second has 73 states. [2021-12-19 17:17:32,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2021-12-19 17:17:32,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 6 states have call successors, (12), 2 states have call predecessors, (12), 7 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2021-12-19 17:17:32,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 125 transitions. [2021-12-19 17:17:32,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 125 transitions. Stem has 229 letters. Loop has 68 letters. [2021-12-19 17:17:32,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:32,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 125 transitions. Stem has 297 letters. Loop has 68 letters. [2021-12-19 17:17:32,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:32,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 125 transitions. Stem has 229 letters. Loop has 136 letters. [2021-12-19 17:17:32,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:17:32,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14104 states and 21157 transitions. [2021-12-19 17:17:32,326 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 221 [2021-12-19 17:17:32,381 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14104 states to 9832 states and 14742 transitions. [2021-12-19 17:17:32,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 594 [2021-12-19 17:17:32,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 622 [2021-12-19 17:17:32,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9832 states and 14742 transitions. [2021-12-19 17:17:32,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:17:32,383 INFO L681 BuchiCegarLoop]: Abstraction has 9832 states and 14742 transitions. [2021-12-19 17:17:32,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9832 states and 14742 transitions. [2021-12-19 17:17:32,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9832 to 7212. [2021-12-19 17:17:32,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7212 states, 4428 states have (on average 1.0815266485998194) internal successors, (4789), 4466 states have internal predecessors, (4789), 1647 states have call successors, (1779), 907 states have call predecessors, (1779), 1137 states have return successors, (4594), 1838 states have call predecessors, (4594), 1647 states have call successors, (4594) [2021-12-19 17:17:32,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7212 states to 7212 states and 11162 transitions. [2021-12-19 17:17:32,615 INFO L704 BuchiCegarLoop]: Abstraction has 7212 states and 11162 transitions. [2021-12-19 17:17:32,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:17:32,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-19 17:17:32,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-19 17:17:32,616 INFO L87 Difference]: Start difference. First operand 7212 states and 11162 transitions. Second operand has 8 states, 7 states have (on average 6.428571428571429) internal successors, (45), 8 states have internal predecessors, (45), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2021-12-19 17:17:32,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:17:32,737 INFO L93 Difference]: Finished difference Result 7065 states and 10853 transitions. [2021-12-19 17:17:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-19 17:17:32,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7065 states and 10853 transitions. [2021-12-19 17:17:32,768 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 181 [2021-12-19 17:17:32,815 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7065 states to 7037 states and 10825 transitions. [2021-12-19 17:17:32,815 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 439 [2021-12-19 17:17:32,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 439 [2021-12-19 17:17:32,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7037 states and 10825 transitions. [2021-12-19 17:17:32,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:17:32,817 INFO L681 BuchiCegarLoop]: Abstraction has 7037 states and 10825 transitions. [2021-12-19 17:17:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7037 states and 10825 transitions. [2021-12-19 17:17:32,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7037 to 6973. [2021-12-19 17:17:32,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6973 states, 4301 states have (on average 1.0806789118809579) internal successors, (4648), 4334 states have internal predecessors, (4648), 1571 states have call successors, (1703), 868 states have call predecessors, (1703), 1101 states have return successors, (4362), 1770 states have call predecessors, (4362), 1571 states have call successors, (4362) [2021-12-19 17:17:32,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6973 states to 6973 states and 10713 transitions. [2021-12-19 17:17:32,931 INFO L704 BuchiCegarLoop]: Abstraction has 6973 states and 10713 transitions. [2021-12-19 17:17:32,931 INFO L587 BuchiCegarLoop]: Abstraction has 6973 states and 10713 transitions. [2021-12-19 17:17:32,931 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-12-19 17:17:32,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6973 states and 10713 transitions. [2021-12-19 17:17:32,944 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 179 [2021-12-19 17:17:32,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:17:32,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:17:32,947 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [25, 25, 15, 10, 10, 10, 10, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:17:32,947 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [13, 13, 10, 10, 10, 10, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:17:32,947 INFO L791 eck$LassoCheckResult]: Stem: 187181#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 187150#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 187151#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 187180#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 187165#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 187166#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 187671#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 187667#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 187668#factENTRY ~n := #in~n; 187672#L25 assume ~n <= 0;#res := 1; 187670#factFINAL assume true; 187666#factEXIT >#68#return; 187662#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 187663#factENTRY ~n := #in~n; 187669#L25 assume ~n <= 0;#res := 1; 187665#factFINAL assume true; 187661#factEXIT >#70#return; 187658#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 187659#factENTRY ~n := #in~n; 187664#L25 assume ~n <= 0;#res := 1; 187660#factFINAL assume true; 187657#factEXIT >#72#return; 187654#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 187655#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 187763#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 187761#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 187755#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 187752#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 187753#factENTRY ~n := #in~n; 187807#L25 assume !(~n <= 0); 187778#L26 call #t~ret0 := fact(~n - 1);< 187779#factENTRY ~n := #in~n; 187784#L25 assume ~n <= 0;#res := 1; 187782#factFINAL assume true; 187777#factEXIT >#66#return; 187776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 187775#factFINAL assume true; 187751#factEXIT >#74#return; 187730#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 187731#factENTRY ~n := #in~n; 187768#L25 assume ~n <= 0;#res := 1; 187750#factFINAL assume true; 187729#factEXIT >#76#return; 187718#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 187726#factENTRY ~n := #in~n; 187724#L25 assume !(~n <= 0); 187713#L26 call #t~ret0 := fact(~n - 1);< 187716#factENTRY ~n := #in~n; 187723#L25 assume ~n <= 0;#res := 1; 187717#factFINAL assume true; 187712#factEXIT >#66#return; 187715#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 187735#factFINAL assume true; 187732#factEXIT >#78#return; 187219#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 187220#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 187214#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 187215#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 187169#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 187170#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 187578#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 187243#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 187140#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 187141#factENTRY ~n := #in~n; 187577#L25 assume !(~n <= 0); 187545#L26 call #t~ret0 := fact(~n - 1);< 187546#factENTRY ~n := #in~n; 187549#L25 assume ~n <= 0;#res := 1; 187548#factFINAL assume true; 187544#factEXIT >#66#return; 187543#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 187541#factFINAL assume true; 187464#factEXIT >#68#return; 187435#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 187436#factENTRY ~n := #in~n; 187503#L25 assume ~n <= 0;#res := 1; 187452#factFINAL assume true; 187457#factEXIT >#70#return; 187427#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 187495#factENTRY ~n := #in~n; 187570#L25 assume !(~n <= 0); 187523#L26 call #t~ret0 := fact(~n - 1);< 187566#factENTRY ~n := #in~n; 187572#L25 assume ~n <= 0;#res := 1; 187569#factFINAL assume true; 187565#factEXIT >#66#return; 187498#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 187493#factFINAL assume true; 187426#factEXIT >#72#return; 187415#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 187416#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 187388#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 187389#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 187376#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 187356#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 187372#factENTRY ~n := #in~n; 187371#L25 assume !(~n <= 0); 187283#L26 call #t~ret0 := fact(~n - 1);< 187299#factENTRY ~n := #in~n; 187301#L25 assume ~n <= 0;#res := 1; 187296#factFINAL assume true; 187273#factEXIT >#66#return; 187287#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 187368#factFINAL assume true; 187354#factEXIT >#68#return; 187350#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 187352#factENTRY ~n := #in~n; 188999#L25 assume !(~n <= 0); 187265#L26 call #t~ret0 := fact(~n - 1);< 187302#factENTRY ~n := #in~n; 187300#L25 assume ~n <= 0;#res := 1; 187294#factFINAL assume true; 187263#factEXIT >#66#return; 187270#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 188996#factFINAL assume true; 188991#factEXIT >#70#return; 188982#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 188983#factENTRY ~n := #in~n; 188989#L25 assume ~n <= 0;#res := 1; 188987#factFINAL assume true; 188981#factEXIT >#72#return; 188971#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 188969#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 188968#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 188965#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 188964#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 188948#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 188952#factENTRY ~n := #in~n; 188974#L25 assume !(~n <= 0); 187187#L26 call #t~ret0 := fact(~n - 1);< 187271#factENTRY ~n := #in~n; 188975#L25 assume !(~n <= 0); 187125#L26 call #t~ret0 := fact(~n - 1);< 188967#factENTRY ~n := #in~n; 188976#L25 assume ~n <= 0;#res := 1; 190891#factFINAL assume true; 187123#factEXIT >#66#return; 187126#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 187191#factFINAL assume true; 188822#factEXIT >#66#return; 188823#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 188954#factFINAL assume true; 188955#factEXIT >#74#return; 188922#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 188946#factENTRY ~n := #in~n; 188985#L25 assume !(~n <= 0); 187157#L26 call #t~ret0 := fact(~n - 1);< 188921#factENTRY ~n := #in~n; 187300#L25 assume ~n <= 0;#res := 1; 187294#factFINAL assume true; 187263#factEXIT >#66#return; 187268#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 189630#factFINAL assume true; 189626#factEXIT >#76#return; 187194#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 189627#factENTRY ~n := #in~n; 187193#L25 assume !(~n <= 0); 187190#L26 call #t~ret0 := fact(~n - 1);< 187271#factENTRY ~n := #in~n; 187300#L25 assume ~n <= 0;#res := 1; 187294#factFINAL assume true; 187263#factEXIT >#66#return; 187268#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 189630#factFINAL assume true; 189626#factEXIT >#78#return; 189624#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 187162#L30-9 [2021-12-19 17:17:32,947 INFO L793 eck$LassoCheckResult]: Loop: 187162#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 187163#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 189145#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 189144#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 189106#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 187120#factENTRY ~n := #in~n; 189143#L25 assume !(~n <= 0); 188847#L26 call #t~ret0 := fact(~n - 1);< 188866#factENTRY ~n := #in~n; 188902#L25 assume !(~n <= 0); 188837#L26 call #t~ret0 := fact(~n - 1);< 188899#factENTRY ~n := #in~n; 188902#L25 assume !(~n <= 0); 188837#L26 call #t~ret0 := fact(~n - 1);< 188899#factENTRY ~n := #in~n; 188902#L25 assume !(~n <= 0); 188837#L26 call #t~ret0 := fact(~n - 1);< 188899#factENTRY ~n := #in~n; 188902#L25 assume !(~n <= 0); 188837#L26 call #t~ret0 := fact(~n - 1);< 188899#factENTRY ~n := #in~n; 188903#L25 assume ~n <= 0;#res := 1; 188900#factFINAL assume true; 188896#factEXIT >#66#return; 188895#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 188890#factFINAL assume true; 188879#factEXIT >#66#return; 188878#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 188877#factFINAL assume true; 188876#factEXIT >#66#return; 188875#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 188874#factFINAL assume true; 188871#factEXIT >#66#return; 188855#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 188867#factFINAL assume true; 188828#factEXIT >#66#return; 188860#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 189116#factFINAL assume true; 189104#factEXIT >#74#return; 189105#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 187120#factENTRY ~n := #in~n; 189143#L25 assume ~n <= 0;#res := 1; 189142#factFINAL assume true; 189135#factEXIT >#76#return; 189108#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 189131#factENTRY ~n := #in~n; 189130#L25 assume !(~n <= 0); 188841#L26 call #t~ret0 := fact(~n - 1);< 188869#factENTRY ~n := #in~n; 188909#L25 assume !(~n <= 0); 188833#L26 call #t~ret0 := fact(~n - 1);< 188870#factENTRY ~n := #in~n; 188902#L25 assume !(~n <= 0); 188837#L26 call #t~ret0 := fact(~n - 1);< 188899#factENTRY ~n := #in~n; 188902#L25 assume !(~n <= 0); 188837#L26 call #t~ret0 := fact(~n - 1);< 188899#factENTRY ~n := #in~n; 188902#L25 assume !(~n <= 0); 188837#L26 call #t~ret0 := fact(~n - 1);< 188899#factENTRY ~n := #in~n; 188903#L25 assume ~n <= 0;#res := 1; 188900#factFINAL assume true; 188896#factEXIT >#66#return; 188895#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 188890#factFINAL assume true; 188879#factEXIT >#66#return; 188878#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 188877#factFINAL assume true; 188876#factEXIT >#66#return; 188875#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 188874#factFINAL assume true; 188871#factEXIT >#66#return; 188855#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 188867#factFINAL assume true; 188828#factEXIT >#66#return; 188860#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 189116#factFINAL assume true; 189104#factEXIT >#78#return; 187218#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 187162#L30-9 [2021-12-19 17:17:32,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:32,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1794473022, now seen corresponding path program 8 times [2021-12-19 17:17:32,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:17:32,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213877257] [2021-12-19 17:17:32,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:17:32,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:17:32,952 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:17:32,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1247496270] [2021-12-19 17:17:32,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 17:17:32,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:17:32,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:32,954 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:17:32,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2021-12-19 17:17:33,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 17:17:33,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:17:33,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-19 17:17:33,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:17:33,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 558 proven. 35 refuted. 0 times theorem prover too weak. 748 trivial. 0 not checked. [2021-12-19 17:17:33,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:17:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1341 backedges. 5 proven. 35 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2021-12-19 17:17:33,634 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:17:33,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213877257] [2021-12-19 17:17:33,635 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:17:33,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247496270] [2021-12-19 17:17:33,635 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247496270] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:17:33,635 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:17:33,635 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2021-12-19 17:17:33,635 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335170895] [2021-12-19 17:17:33,635 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:17:33,635 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:17:33,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:17:33,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1988608930, now seen corresponding path program 5 times [2021-12-19 17:17:33,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:17:33,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457491673] [2021-12-19 17:17:33,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:17:33,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:17:33,638 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:17:33,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [794937855] [2021-12-19 17:17:33,638 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 17:17:33,638 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:17:33,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:17:33,640 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:17:33,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process [2021-12-19 17:17:33,729 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2021-12-19 17:17:33,729 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-19 17:17:33,729 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:17:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:17:33,756 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:19:11,679 WARN L227 SmtUtils]: Spent 1.61m on a formula simplification. DAG size of input: 92 DAG size of output: 88 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:19:33,171 WARN L227 SmtUtils]: Spent 17.26s on a formula simplification that was a NOOP. DAG size: 25 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-19 17:19:47,265 WARN L227 SmtUtils]: Spent 13.21s on a formula simplification. DAG size of input: 16 DAG size of output: 1 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-19 17:20:14,413 WARN L227 SmtUtils]: Spent 24.01s on a formula simplification. DAG size of input: 16 DAG size of output: 1 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-19 17:20:15,932 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:20:15,932 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:20:15,932 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:20:15,932 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:20:15,932 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 17:20:15,933 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:20:15,933 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:20:15,933 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:20:15,933 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration22_Loop [2021-12-19 17:20:15,933 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:20:15,933 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:20:15,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:20:15,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:20:15,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:20:16,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:20:16,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:20:16,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:20:17,321 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:20:17,321 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 17:20:17,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:20:17,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:20:17,323 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:20:17,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2021-12-19 17:20:17,327 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:20:17,328 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:20:17,336 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:20:17,336 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:20:17,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2021-12-19 17:20:17,361 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:20:17,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:20:17,362 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:20:17,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2021-12-19 17:20:17,365 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:20:17,365 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:20:17,371 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:20:17,372 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:20:17,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2021-12-19 17:20:17,387 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:20:17,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:20:17,389 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:20:17,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2021-12-19 17:20:17,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:20:17,390 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:20:17,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2021-12-19 17:20:17,413 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:20:17,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:20:17,414 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:20:17,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2021-12-19 17:20:17,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 17:20:17,416 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:20:17,440 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 17:20:17,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2021-12-19 17:20:17,456 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:20:17,456 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:20:17,456 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:20:17,456 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:20:17,456 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:20:17,456 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:20:17,456 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:20:17,456 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:20:17,456 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration22_Loop [2021-12-19 17:20:17,456 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:20:17,456 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:20:17,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:20:17,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:20:17,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:20:17,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:20:17,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:20:17,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:20:34,732 WARN L227 SmtUtils]: Spent 12.45s on a formula simplification that was a NOOP. DAG size: 121 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2021-12-19 17:20:34,736 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:20:34,736 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:20:34,736 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:20:34,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:20:34,737 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:20:34,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2021-12-19 17:20:34,742 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:20:34,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:20:34,747 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:20:34,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:20:34,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:20:34,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:20:34,748 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:20:34,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:20:34,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:20:34,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2021-12-19 17:20:34,778 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:20:34,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:20:34,779 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:20:34,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2021-12-19 17:20:34,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:20:34,787 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:20:34,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:20:34,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:20:34,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:20:34,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:20:34,796 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:20:34,796 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:20:34,813 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:20:34,817 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-19 17:20:34,817 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-19 17:20:34,817 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:20:34,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:20:34,819 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:20:34,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2021-12-19 17:20:34,821 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:20:34,821 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 17:20:34,822 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:20:34,822 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1, ULTIMATE.start_main_~x~0#1) = -10*ULTIMATE.start_main_~k~0#1 + 9*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2021-12-19 17:20:34,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2021-12-19 17:20:34,838 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 17:20:34,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:20:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:20:34,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-19 17:20:34,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:20:35,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Forceful destruction successful, exit code 0 [2021-12-19 17:20:37,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:20:37,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-19 17:20:37,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:20:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-12-19 17:20:38,589 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 13 loop predicates [2021-12-19 17:20:38,589 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6973 states and 10713 transitions. cyclomatic complexity: 3800 Second operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2021-12-19 17:20:39,587 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6973 states and 10713 transitions. cyclomatic complexity: 3800. Second operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 8766 states and 13369 transitions. Complement of second has 75 states. [2021-12-19 17:20:39,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2021-12-19 17:20:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2021-12-19 17:20:39,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 103 transitions. [2021-12-19 17:20:39,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 103 transitions. Stem has 166 letters. Loop has 80 letters. [2021-12-19 17:20:39,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:20:39,589 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:20:39,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:20:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:20:39,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-19 17:20:39,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:20:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:20:41,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-19 17:20:41,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:20:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-12-19 17:20:42,880 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 13 loop predicates [2021-12-19 17:20:42,880 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6973 states and 10713 transitions. cyclomatic complexity: 3800 Second operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2021-12-19 17:20:44,439 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6973 states and 10713 transitions. cyclomatic complexity: 3800. Second operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 8580 states and 13170 transitions. Complement of second has 63 states. [2021-12-19 17:20:44,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 2 stem states 13 non-accepting loop states 1 accepting loop states [2021-12-19 17:20:44,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2021-12-19 17:20:44,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 102 transitions. [2021-12-19 17:20:44,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 102 transitions. Stem has 166 letters. Loop has 80 letters. [2021-12-19 17:20:44,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:20:44,449 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:20:44,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:20:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:20:44,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 52 conjunts are in the unsatisfiable core [2021-12-19 17:20:44,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:20:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:20:46,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 45 conjunts are in the unsatisfiable core [2021-12-19 17:20:46,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:20:47,271 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2021-12-19 17:20:47,271 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 13 loop predicates [2021-12-19 17:20:47,271 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6973 states and 10713 transitions. cyclomatic complexity: 3800 Second operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2021-12-19 17:20:48,793 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6973 states and 10713 transitions. cyclomatic complexity: 3800. Second operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) Result 24109 states and 37228 transitions. Complement of second has 83 states. [2021-12-19 17:20:48,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 2 stem states 12 non-accepting loop states 1 accepting loop states [2021-12-19 17:20:48,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 6 states have call successors, (12), 2 states have call predecessors, (12), 8 states have return successors, (16), 9 states have call predecessors, (16), 6 states have call successors, (16) [2021-12-19 17:20:48,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 136 transitions. [2021-12-19 17:20:48,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 136 transitions. Stem has 166 letters. Loop has 80 letters. [2021-12-19 17:20:48,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:20:48,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 136 transitions. Stem has 246 letters. Loop has 80 letters. [2021-12-19 17:20:48,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:20:48,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 136 transitions. Stem has 166 letters. Loop has 160 letters. [2021-12-19 17:20:48,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:20:48,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24109 states and 37228 transitions. [2021-12-19 17:20:49,012 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 333 [2021-12-19 17:20:49,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24109 states to 15743 states and 24189 transitions. [2021-12-19 17:20:49,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 779 [2021-12-19 17:20:49,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 814 [2021-12-19 17:20:49,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15743 states and 24189 transitions. [2021-12-19 17:20:49,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:20:49,139 INFO L681 BuchiCegarLoop]: Abstraction has 15743 states and 24189 transitions. [2021-12-19 17:20:49,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15743 states and 24189 transitions. [2021-12-19 17:20:49,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15743 to 9274. [2021-12-19 17:20:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9274 states, 5704 states have (on average 1.084326788218794) internal successors, (6185), 5800 states have internal predecessors, (6185), 2031 states have call successors, (2269), 1130 states have call predecessors, (2269), 1539 states have return successors, (6673), 2343 states have call predecessors, (6673), 2031 states have call successors, (6673) [2021-12-19 17:20:49,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9274 states to 9274 states and 15127 transitions. [2021-12-19 17:20:49,449 INFO L704 BuchiCegarLoop]: Abstraction has 9274 states and 15127 transitions. [2021-12-19 17:20:49,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:20:49,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-19 17:20:49,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2021-12-19 17:20:49,450 INFO L87 Difference]: Start difference. First operand 9274 states and 15127 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 8 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 8 states have call predecessors, (26), 8 states have call successors, (26) [2021-12-19 17:20:51,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:20:51,080 INFO L93 Difference]: Finished difference Result 11410 states and 20264 transitions. [2021-12-19 17:20:51,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-12-19 17:20:51,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11410 states and 20264 transitions. [2021-12-19 17:20:51,147 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 429 [2021-12-19 17:20:51,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11410 states to 10752 states and 19089 transitions. [2021-12-19 17:20:51,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 548 [2021-12-19 17:20:51,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 548 [2021-12-19 17:20:51,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10752 states and 19089 transitions. [2021-12-19 17:20:51,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:20:51,381 INFO L681 BuchiCegarLoop]: Abstraction has 10752 states and 19089 transitions. [2021-12-19 17:20:51,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10752 states and 19089 transitions. [2021-12-19 17:20:51,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10752 to 9226. [2021-12-19 17:20:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9226 states, 5680 states have (on average 1.0839788732394366) internal successors, (6157), 5772 states have internal predecessors, (6157), 2018 states have call successors, (2255), 1119 states have call predecessors, (2255), 1528 states have return successors, (6656), 2334 states have call predecessors, (6656), 2018 states have call successors, (6656) [2021-12-19 17:20:51,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9226 states to 9226 states and 15068 transitions. [2021-12-19 17:20:51,649 INFO L704 BuchiCegarLoop]: Abstraction has 9226 states and 15068 transitions. [2021-12-19 17:20:51,649 INFO L587 BuchiCegarLoop]: Abstraction has 9226 states and 15068 transitions. [2021-12-19 17:20:51,649 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-12-19 17:20:51,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9226 states and 15068 transitions. [2021-12-19 17:20:51,672 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 256 [2021-12-19 17:20:51,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:20:51,672 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:20:51,673 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [30, 30, 18, 12, 12, 12, 12, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2021-12-19 17:20:51,673 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [21, 21, 18, 18, 18, 18, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:20:51,674 INFO L791 eck$LassoCheckResult]: Stem: 259879#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 259847#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 259848#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 259878#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 259863#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 259864#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 260195#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 260193#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 260194#factENTRY ~n := #in~n; 260197#L25 assume ~n <= 0;#res := 1; 260196#factFINAL assume true; 260192#factEXIT >#68#return; 260190#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 260191#factENTRY ~n := #in~n; 260199#L25 assume ~n <= 0;#res := 1; 260198#factFINAL assume true; 260189#factEXIT >#70#return; 260187#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 260188#factENTRY ~n := #in~n; 260201#L25 assume ~n <= 0;#res := 1; 260200#factFINAL assume true; 260186#factEXIT >#72#return; 260183#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 260184#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 260217#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 260216#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 260214#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 260211#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 260212#factENTRY ~n := #in~n; 260225#L25 assume !(~n <= 0); 260222#L26 call #t~ret0 := fact(~n - 1);< 260223#factENTRY ~n := #in~n; 260226#L25 assume ~n <= 0;#res := 1; 260224#factFINAL assume true; 260221#factEXIT >#66#return; 260220#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260219#factFINAL assume true; 260210#factEXIT >#74#return; 260176#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 260177#factENTRY ~n := #in~n; 266311#L25 assume ~n <= 0;#res := 1; 266308#factFINAL assume true; 266305#factEXIT >#76#return; 260290#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 266304#factENTRY ~n := #in~n; 266302#L25 assume !(~n <= 0); 266294#L26 call #t~ret0 := fact(~n - 1);< 266297#factENTRY ~n := #in~n; 266303#L25 assume ~n <= 0;#res := 1; 266301#factFINAL assume true; 266292#factEXIT >#66#return; 266296#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 266327#factFINAL assume true; 260289#factEXIT >#78#return; 260288#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 260274#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 260275#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 260269#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 260267#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 260257#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 260258#factENTRY ~n := #in~n; 260265#L25 assume !(~n <= 0); 260262#L26 call #t~ret0 := fact(~n - 1);< 260263#factENTRY ~n := #in~n; 260266#L25 assume ~n <= 0;#res := 1; 260264#factFINAL assume true; 260261#factEXIT >#66#return; 260260#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260259#factFINAL assume true; 260256#factEXIT >#74#return; 260252#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 260253#factENTRY ~n := #in~n; 260255#L25 assume ~n <= 0;#res := 1; 260254#factFINAL assume true; 260251#factEXIT >#76#return; 259939#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 259940#factENTRY ~n := #in~n; 260137#L25 assume !(~n <= 0); 259961#L26 call #t~ret0 := fact(~n - 1);< 259993#factENTRY ~n := #in~n; 260009#L25 assume ~n <= 0;#res := 1; 260022#factFINAL assume true; 260015#factEXIT >#66#return; 259969#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260236#factFINAL assume true; 260237#factEXIT >#78#return; 259934#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 259925#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 259926#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 259902#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 259874#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 259875#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 259909#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 259905#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 259836#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 259837#factENTRY ~n := #in~n; 262394#L25 assume !(~n <= 0); 262389#L26 call #t~ret0 := fact(~n - 1);< 262393#factENTRY ~n := #in~n; 262399#L25 assume ~n <= 0;#res := 1; 262555#factFINAL assume true; 262554#factEXIT >#66#return; 262553#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 262552#factFINAL assume true; 262551#factEXIT >#68#return; 262335#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 262336#factENTRY ~n := #in~n; 262338#L25 assume ~n <= 0;#res := 1; 262337#factFINAL assume true; 262330#factEXIT >#70#return; 262313#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 262316#factENTRY ~n := #in~n; 262488#L25 assume !(~n <= 0); 262379#L26 call #t~ret0 := fact(~n - 1);< 262759#factENTRY ~n := #in~n; 262761#L25 assume ~n <= 0;#res := 1; 262760#factFINAL assume true; 262758#factEXIT >#66#return; 262757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 262756#factFINAL assume true; 262755#factEXIT >#72#return; 262323#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 262754#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 262752#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 262750#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 262253#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 261701#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 261729#factENTRY ~n := #in~n; 261730#L25 assume !(~n <= 0); 261709#L26 call #t~ret0 := fact(~n - 1);< 261725#factENTRY ~n := #in~n; 261727#L25 assume ~n <= 0;#res := 1; 261726#factFINAL assume true; 261707#factEXIT >#66#return; 261706#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 261705#factFINAL assume true; 261699#factEXIT >#68#return; 260500#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 261693#factENTRY ~n := #in~n; 261249#L25 assume !(~n <= 0); 260484#L26 call #t~ret0 := fact(~n - 1);< 260501#factENTRY ~n := #in~n; 260502#L25 assume ~n <= 0;#res := 1; 260499#factFINAL assume true; 260482#factEXIT >#66#return; 260492#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 262011#factFINAL assume true; 262009#factEXIT >#70#return; 259827#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 259828#factENTRY ~n := #in~n; 262089#L25 assume ~n <= 0;#res := 1; 262088#factFINAL assume true; 262084#factEXIT >#72#return; 259867#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 259868#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 259871#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 261080#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 261078#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 260468#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 260470#factENTRY ~n := #in~n; 260524#L25 assume !(~n <= 0); 260483#L26 call #t~ret0 := fact(~n - 1);< 260496#factENTRY ~n := #in~n; 260990#L25 assume !(~n <= 0); 260980#L26 call #t~ret0 := fact(~n - 1);< 260987#factENTRY ~n := #in~n; 260992#L25 assume ~n <= 0;#res := 1; 260993#factFINAL assume true; 260991#factEXIT >#66#return; 260989#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260986#factFINAL assume true; 260979#factEXIT >#66#return; 260978#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260977#factFINAL assume true; 260976#factEXIT >#74#return; 260972#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 260975#factENTRY ~n := #in~n; 260974#L25 assume !(~n <= 0); 259854#L26 call #t~ret0 := fact(~n - 1);< 260968#factENTRY ~n := #in~n; 260502#L25 assume ~n <= 0;#res := 1; 260499#factFINAL assume true; 260482#factEXIT >#66#return; 260491#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 262127#factFINAL assume true; 262125#factEXIT >#76#return; 261176#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 262126#factENTRY ~n := #in~n; 261175#L25 assume !(~n <= 0); 260487#L26 call #t~ret0 := fact(~n - 1);< 260496#factENTRY ~n := #in~n; 260502#L25 assume ~n <= 0;#res := 1; 260499#factFINAL assume true; 260482#factEXIT >#66#return; 260491#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 262127#factFINAL assume true; 262125#factEXIT >#78#return; 262122#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 262121#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 259860#L42-2 [2021-12-19 17:20:51,674 INFO L793 eck$LassoCheckResult]: Loop: 259860#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 259900#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 259880#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 259815#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 259816#factENTRY ~n := #in~n; 261268#L25 assume !(~n <= 0); 260327#L26 call #t~ret0 := fact(~n - 1);< 260366#factENTRY ~n := #in~n; 260438#L25 assume !(~n <= 0); 260331#L26 call #t~ret0 := fact(~n - 1);< 260434#factENTRY ~n := #in~n; 260438#L25 assume !(~n <= 0); 260331#L26 call #t~ret0 := fact(~n - 1);< 260434#factENTRY ~n := #in~n; 260438#L25 assume !(~n <= 0); 260331#L26 call #t~ret0 := fact(~n - 1);< 260434#factENTRY ~n := #in~n; 260438#L25 assume !(~n <= 0); 260331#L26 call #t~ret0 := fact(~n - 1);< 260434#factENTRY ~n := #in~n; 260438#L25 assume !(~n <= 0); 260331#L26 call #t~ret0 := fact(~n - 1);< 260434#factENTRY ~n := #in~n; 260441#L25 assume ~n <= 0;#res := 1; 260435#factFINAL assume true; 260431#factEXIT >#66#return; 260426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260417#factFINAL assume true; 260396#factEXIT >#66#return; 260401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260423#factFINAL assume true; 260415#factEXIT >#66#return; 260413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260410#factFINAL assume true; 260394#factEXIT >#66#return; 260387#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260376#factFINAL assume true; 260370#factEXIT >#66#return; 260351#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260364#factFINAL assume true; 260318#factEXIT >#66#return; 260345#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 261255#factFINAL assume true; 261250#factEXIT >#74#return; 259898#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 259816#factENTRY ~n := #in~n; 261268#L25 assume !(~n <= 0); 260327#L26 call #t~ret0 := fact(~n - 1);< 260366#factENTRY ~n := #in~n; 260438#L25 assume !(~n <= 0); 260331#L26 call #t~ret0 := fact(~n - 1);< 260434#factENTRY ~n := #in~n; 260438#L25 assume !(~n <= 0); 260331#L26 call #t~ret0 := fact(~n - 1);< 260434#factENTRY ~n := #in~n; 260438#L25 assume !(~n <= 0); 260331#L26 call #t~ret0 := fact(~n - 1);< 260434#factENTRY ~n := #in~n; 260438#L25 assume !(~n <= 0); 260331#L26 call #t~ret0 := fact(~n - 1);< 260434#factENTRY ~n := #in~n; 260438#L25 assume !(~n <= 0); 260331#L26 call #t~ret0 := fact(~n - 1);< 260434#factENTRY ~n := #in~n; 260441#L25 assume ~n <= 0;#res := 1; 260435#factFINAL assume true; 260431#factEXIT >#66#return; 260426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260417#factFINAL assume true; 260396#factEXIT >#66#return; 260401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260423#factFINAL assume true; 260415#factEXIT >#66#return; 260413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260410#factFINAL assume true; 260394#factEXIT >#66#return; 260387#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260376#factFINAL assume true; 260370#factEXIT >#66#return; 260351#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260364#factFINAL assume true; 260318#factEXIT >#66#return; 260345#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 261255#factFINAL assume true; 261250#factEXIT >#76#return; 261251#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 261256#factENTRY ~n := #in~n; 261260#L25 assume !(~n <= 0); 260327#L26 call #t~ret0 := fact(~n - 1);< 260366#factENTRY ~n := #in~n; 260438#L25 assume !(~n <= 0); 260331#L26 call #t~ret0 := fact(~n - 1);< 260434#factENTRY ~n := #in~n; 260438#L25 assume !(~n <= 0); 260331#L26 call #t~ret0 := fact(~n - 1);< 260434#factENTRY ~n := #in~n; 260438#L25 assume !(~n <= 0); 260331#L26 call #t~ret0 := fact(~n - 1);< 260434#factENTRY ~n := #in~n; 260438#L25 assume !(~n <= 0); 260331#L26 call #t~ret0 := fact(~n - 1);< 260434#factENTRY ~n := #in~n; 260438#L25 assume !(~n <= 0); 260331#L26 call #t~ret0 := fact(~n - 1);< 260434#factENTRY ~n := #in~n; 260441#L25 assume ~n <= 0;#res := 1; 260435#factFINAL assume true; 260431#factEXIT >#66#return; 260426#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260417#factFINAL assume true; 260396#factEXIT >#66#return; 260401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260423#factFINAL assume true; 260415#factEXIT >#66#return; 260413#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260410#factFINAL assume true; 260394#factEXIT >#66#return; 260387#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260376#factFINAL assume true; 260370#factEXIT >#66#return; 260351#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 260364#factFINAL assume true; 260318#factEXIT >#66#return; 260345#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 261255#factFINAL assume true; 261250#factEXIT >#78#return; 259849#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 259850#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 259860#L42-2 [2021-12-19 17:20:51,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:20:51,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1581803756, now seen corresponding path program 9 times [2021-12-19 17:20:51,675 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:20:51,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490279527] [2021-12-19 17:20:51,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:20:51,675 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:20:51,680 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:20:51,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1598237378] [2021-12-19 17:20:51,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-19 17:20:51,680 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:20:51,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:20:51,696 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:20:51,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2021-12-19 17:20:51,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-19 17:20:51,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:20:51,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-19 17:20:51,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:20:52,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1949 backedges. 833 proven. 77 refuted. 0 times theorem prover too weak. 1039 trivial. 0 not checked. [2021-12-19 17:20:52,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:20:53,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1949 backedges. 125 proven. 128 refuted. 0 times theorem prover too weak. 1696 trivial. 0 not checked. [2021-12-19 17:20:53,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:20:53,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490279527] [2021-12-19 17:20:53,463 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:20:53,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598237378] [2021-12-19 17:20:53,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598237378] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:20:53,464 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:20:53,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 14 [2021-12-19 17:20:53,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978788275] [2021-12-19 17:20:53,464 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:20:53,464 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:20:53,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:20:53,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1077516940, now seen corresponding path program 6 times [2021-12-19 17:20:53,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:20:53,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222962725] [2021-12-19 17:20:53,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:20:53,465 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:20:53,469 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:20:53,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1656033205] [2021-12-19 17:20:53,469 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-19 17:20:53,470 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:20:53,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:20:53,476 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:20:53,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2021-12-19 17:20:53,868 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2021-12-19 17:20:53,868 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:20:53,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 39 conjunts are in the unsatisfiable core [2021-12-19 17:20:53,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:20:54,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 205 proven. 579 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2021-12-19 17:20:54,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:21:00,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 205 proven. 697 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2021-12-19 17:21:00,904 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:21:00,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222962725] [2021-12-19 17:21:00,904 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:21:00,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656033205] [2021-12-19 17:21:00,905 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656033205] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:21:00,905 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:21:00,905 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 30] total 35 [2021-12-19 17:21:00,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935577045] [2021-12-19 17:21:00,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:21:00,905 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-19 17:21:00,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:21:00,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-12-19 17:21:00,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1013, Unknown=0, NotChecked=0, Total=1190 [2021-12-19 17:21:00,906 INFO L87 Difference]: Start difference. First operand 9226 states and 15068 transitions. cyclomatic complexity: 5915 Second operand has 35 states, 31 states have (on average 2.225806451612903) internal successors, (69), 31 states have internal predecessors, (69), 19 states have call successors, (20), 1 states have call predecessors, (20), 15 states have return successors, (30), 19 states have call predecessors, (30), 19 states have call successors, (30) [2021-12-19 17:21:06,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:21:06,056 INFO L93 Difference]: Finished difference Result 22387 states and 38202 transitions. [2021-12-19 17:21:06,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-12-19 17:21:06,058 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22387 states and 38202 transitions. [2021-12-19 17:21:06,275 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 957 [2021-12-19 17:21:06,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22387 states to 22350 states and 38096 transitions. [2021-12-19 17:21:06,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1285 [2021-12-19 17:21:06,622 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1309 [2021-12-19 17:21:06,622 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22350 states and 38096 transitions. [2021-12-19 17:21:06,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:21:06,622 INFO L681 BuchiCegarLoop]: Abstraction has 22350 states and 38096 transitions. [2021-12-19 17:21:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22350 states and 38096 transitions. [2021-12-19 17:21:07,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22350 to 11984. [2021-12-19 17:21:07,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11984 states, 7230 states have (on average 1.087551867219917) internal successors, (7863), 7254 states have internal predecessors, (7863), 2774 states have call successors, (3011), 1472 states have call predecessors, (3011), 1980 states have return successors, (11735), 3257 states have call predecessors, (11735), 2774 states have call successors, (11735) [2021-12-19 17:21:07,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11984 states to 11984 states and 22609 transitions. [2021-12-19 17:21:07,209 INFO L704 BuchiCegarLoop]: Abstraction has 11984 states and 22609 transitions. [2021-12-19 17:21:07,210 INFO L587 BuchiCegarLoop]: Abstraction has 11984 states and 22609 transitions. [2021-12-19 17:21:07,210 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-12-19 17:21:07,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11984 states and 22609 transitions. [2021-12-19 17:21:07,232 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 341 [2021-12-19 17:21:07,232 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:21:07,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:21:07,233 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [30, 30, 18, 12, 12, 12, 12, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2021-12-19 17:21:07,233 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [18, 18, 15, 15, 15, 15, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:21:07,233 INFO L791 eck$LassoCheckResult]: Stem: 293536#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 293506#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 293507#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 293535#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 293557#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 296875#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 296872#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 296861#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 296862#factENTRY ~n := #in~n; 296867#L25 assume ~n <= 0;#res := 1; 296865#factFINAL assume true; 296860#factEXIT >#68#return; 296858#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 296859#factENTRY ~n := #in~n; 296866#L25 assume ~n <= 0;#res := 1; 296864#factFINAL assume true; 296857#factEXIT >#70#return; 296853#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 296854#factENTRY ~n := #in~n; 296863#L25 assume ~n <= 0;#res := 1; 296856#factFINAL assume true; 296852#factEXIT >#72#return; 296847#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 296848#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 296849#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 296844#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 296841#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 293483#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 296839#factENTRY ~n := #in~n; 296851#L25 assume !(~n <= 0); 293515#L26 call #t~ret0 := fact(~n - 1);< 296846#factENTRY ~n := #in~n; 296855#L25 assume ~n <= 0;#res := 1; 296850#factFINAL assume true; 296845#factEXIT >#66#return; 296842#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 296840#factFINAL assume true; 296838#factEXIT >#74#return; 296829#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 296831#factENTRY ~n := #in~n; 305189#L25 assume ~n <= 0;#res := 1; 305187#factFINAL assume true; 305185#factEXIT >#76#return; 305183#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 305184#factENTRY ~n := #in~n; 305322#L25 assume !(~n <= 0); 305318#L26 call #t~ret0 := fact(~n - 1);< 305320#factENTRY ~n := #in~n; 305323#L25 assume ~n <= 0;#res := 1; 305321#factFINAL assume true; 305316#factEXIT >#66#return; 305315#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 305314#factFINAL assume true; 305313#factEXIT >#78#return; 305182#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 305181#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 305180#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 305179#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 305178#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 294004#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 294006#factENTRY ~n := #in~n; 294005#L25 assume !(~n <= 0); 293999#L26 call #t~ret0 := fact(~n - 1);< 294003#factENTRY ~n := #in~n; 293998#L25 assume ~n <= 0;#res := 1; 294000#factFINAL assume true; 294032#factEXIT >#66#return; 294033#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 294037#factFINAL assume true; 294035#factEXIT >#74#return; 293946#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 293947#factENTRY ~n := #in~n; 294188#L25 assume ~n <= 0;#res := 1; 294187#factFINAL assume true; 294185#factEXIT >#76#return; 293490#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 294168#factENTRY ~n := #in~n; 294142#L25 assume !(~n <= 0); 294061#L26 call #t~ret0 := fact(~n - 1);< 294121#factENTRY ~n := #in~n; 294101#L25 assume ~n <= 0;#res := 1; 294183#factFINAL assume true; 294175#factEXIT >#66#return; 293540#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 293489#factFINAL assume true; 293491#factEXIT >#78#return; 293930#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 293929#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 293928#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 293927#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 293926#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 293922#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 293920#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 293918#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 293495#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 293496#factENTRY ~n := #in~n; 293876#L25 assume !(~n <= 0); 293869#L26 call #t~ret0 := fact(~n - 1);< 293870#factENTRY ~n := #in~n; 293878#L25 assume ~n <= 0;#res := 1; 293875#factFINAL assume true; 293868#factEXIT >#66#return; 293845#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 293843#factFINAL assume true; 293840#factEXIT >#68#return; 293834#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 293838#factENTRY ~n := #in~n; 293881#L25 assume ~n <= 0;#res := 1; 293831#factFINAL assume true; 293837#factEXIT >#70#return; 293825#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 293826#factENTRY ~n := #in~n; 297728#L25 assume !(~n <= 0); 297725#L26 call #t~ret0 := fact(~n - 1);< 297726#factENTRY ~n := #in~n; 297731#L25 assume ~n <= 0;#res := 1; 297727#factFINAL assume true; 297724#factEXIT >#66#return; 297723#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 297721#factFINAL assume true; 293824#factEXIT >#72#return; 293823#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 293822#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 293821#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 293778#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 293745#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 293703#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 293705#factENTRY ~n := #in~n; 293741#L25 assume !(~n <= 0); 293670#L26 call #t~ret0 := fact(~n - 1);< 293678#factENTRY ~n := #in~n; 293682#L25 assume ~n <= 0;#res := 1; 293679#factFINAL assume true; 293657#factEXIT >#66#return; 293677#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 293706#factFINAL assume true; 293700#factEXIT >#68#return; 293695#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 293696#factENTRY ~n := #in~n; 294313#L25 assume !(~n <= 0); 294299#L26 call #t~ret0 := fact(~n - 1);< 294306#factENTRY ~n := #in~n; 294290#L25 assume ~n <= 0;#res := 1; 294310#factFINAL assume true; 294297#factEXIT >#66#return; 294296#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 294295#factFINAL assume true; 294292#factEXIT >#70#return; 294283#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 294284#factENTRY ~n := #in~n; 294309#L25 assume ~n <= 0;#res := 1; 294291#factFINAL assume true; 294282#factEXIT >#72#return; 294280#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 294270#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 294264#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 294248#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 294244#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 294233#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 294237#factENTRY ~n := #in~n; 294272#L25 assume !(~n <= 0); 294256#L26 call #t~ret0 := fact(~n - 1);< 293632#factENTRY ~n := #in~n; 294278#L25 assume !(~n <= 0); 294255#L26 call #t~ret0 := fact(~n - 1);< 294269#factENTRY ~n := #in~n; 294289#L25 assume ~n <= 0;#res := 1; 294293#factFINAL assume true; 294286#factEXIT >#66#return; 294276#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 294265#factFINAL assume true; 294249#factEXIT >#66#return; 294246#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 294240#factFINAL assume true; 294241#factEXIT >#74#return; 293623#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 294225#factENTRY ~n := #in~n; 294308#L25 assume !(~n <= 0); 293622#L26 call #t~ret0 := fact(~n - 1);< 293624#factENTRY ~n := #in~n; 294290#L25 assume ~n <= 0;#res := 1; 294310#factFINAL assume true; 294297#factEXIT >#66#return; 294305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 294360#factFINAL assume true; 294361#factEXIT >#76#return; 294223#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 294238#factENTRY ~n := #in~n; 294239#L25 assume !(~n <= 0); 294222#L26 call #t~ret0 := fact(~n - 1);< 294221#factENTRY ~n := #in~n; 294290#L25 assume ~n <= 0;#res := 1; 294310#factFINAL assume true; 294297#factEXIT >#66#return; 294305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 294360#factFINAL assume true; 294361#factEXIT >#78#return; 296601#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 296602#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 296715#L42-2 [2021-12-19 17:21:07,234 INFO L793 eck$LassoCheckResult]: Loop: 296715#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 296713#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 293537#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 293538#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 293475#factENTRY ~n := #in~n; 296011#L25 assume !(~n <= 0); 293597#L26 call #t~ret0 := fact(~n - 1);< 293617#factENTRY ~n := #in~n; 293626#L25 assume !(~n <= 0); 293593#L26 call #t~ret0 := fact(~n - 1);< 294451#factENTRY ~n := #in~n; 293626#L25 assume !(~n <= 0); 293593#L26 call #t~ret0 := fact(~n - 1);< 294451#factENTRY ~n := #in~n; 293626#L25 assume !(~n <= 0); 293593#L26 call #t~ret0 := fact(~n - 1);< 294451#factENTRY ~n := #in~n; 293626#L25 assume !(~n <= 0); 293593#L26 call #t~ret0 := fact(~n - 1);< 294451#factENTRY ~n := #in~n; 293626#L25 assume !(~n <= 0); 293593#L26 call #t~ret0 := fact(~n - 1);< 294451#factENTRY ~n := #in~n; 293626#L25 assume !(~n <= 0); 293593#L26 call #t~ret0 := fact(~n - 1);< 294451#factENTRY ~n := #in~n; 294425#L25 assume ~n <= 0;#res := 1; 294452#factFINAL assume true; 294448#factEXIT >#66#return; 294447#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 294439#factFINAL assume true; 294426#factEXIT >#66#return; 294424#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 294422#factFINAL assume true; 294419#factEXIT >#66#return; 294417#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 294415#factFINAL assume true; 294406#factEXIT >#66#return; 294405#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 294401#factFINAL assume true; 294389#factEXIT >#66#return; 294398#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 294924#factFINAL assume true; 294921#factEXIT >#66#return; 294923#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 294941#factFINAL assume true; 293575#factEXIT >#66#return; 293598#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 296007#factFINAL assume true; 296003#factEXIT >#74#return; 296000#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 293475#factENTRY ~n := #in~n; 296011#L25 assume ~n <= 0;#res := 1; 296013#factFINAL assume true; 296012#factEXIT >#76#return; 294464#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 296006#factENTRY ~n := #in~n; 294463#L25 assume !(~n <= 0); 293576#L26 call #t~ret0 := fact(~n - 1);< 293627#factENTRY ~n := #in~n; 293628#L25 assume !(~n <= 0); 293594#L26 call #t~ret0 := fact(~n - 1);< 293625#factENTRY ~n := #in~n; 293626#L25 assume !(~n <= 0); 293593#L26 call #t~ret0 := fact(~n - 1);< 294451#factENTRY ~n := #in~n; 293626#L25 assume !(~n <= 0); 293593#L26 call #t~ret0 := fact(~n - 1);< 294451#factENTRY ~n := #in~n; 293626#L25 assume !(~n <= 0); 293593#L26 call #t~ret0 := fact(~n - 1);< 294451#factENTRY ~n := #in~n; 293626#L25 assume !(~n <= 0); 293593#L26 call #t~ret0 := fact(~n - 1);< 294451#factENTRY ~n := #in~n; 293626#L25 assume !(~n <= 0); 293593#L26 call #t~ret0 := fact(~n - 1);< 294451#factENTRY ~n := #in~n; 293626#L25 assume !(~n <= 0); 293593#L26 call #t~ret0 := fact(~n - 1);< 294451#factENTRY ~n := #in~n; 294425#L25 assume ~n <= 0;#res := 1; 294452#factFINAL assume true; 294448#factEXIT >#66#return; 294447#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 294439#factFINAL assume true; 294426#factEXIT >#66#return; 294424#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 294422#factFINAL assume true; 294419#factEXIT >#66#return; 294417#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 294415#factFINAL assume true; 294406#factEXIT >#66#return; 294405#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 294401#factFINAL assume true; 294389#factEXIT >#66#return; 294398#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 294924#factFINAL assume true; 294921#factEXIT >#66#return; 294923#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 294941#factFINAL assume true; 293575#factEXIT >#66#return; 293614#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 293620#factFINAL assume true; 293621#factEXIT >#66#return; 294940#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 296004#factFINAL assume true; 296005#factEXIT >#78#return; 293481#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 293508#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 296715#L42-2 [2021-12-19 17:21:07,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:21:07,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1581803756, now seen corresponding path program 10 times [2021-12-19 17:21:07,235 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:21:07,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731173114] [2021-12-19 17:21:07,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:21:07,235 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:21:07,239 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:21:07,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [868778966] [2021-12-19 17:21:07,239 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-19 17:21:07,240 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:21:07,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:21:07,241 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:21:07,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2021-12-19 17:21:07,353 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-19 17:21:07,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:21:07,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-19 17:21:07,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:21:07,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1949 backedges. 961 proven. 3 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2021-12-19 17:21:07,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:21:08,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1949 backedges. 107 proven. 142 refuted. 0 times theorem prover too weak. 1700 trivial. 0 not checked. [2021-12-19 17:21:08,334 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:21:08,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731173114] [2021-12-19 17:21:08,334 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:21:08,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868778966] [2021-12-19 17:21:08,334 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868778966] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:21:08,334 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:21:08,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2021-12-19 17:21:08,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82196009] [2021-12-19 17:21:08,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:21:08,334 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-19 17:21:08,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:21:08,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1887340356, now seen corresponding path program 7 times [2021-12-19 17:21:08,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:21:08,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140226984] [2021-12-19 17:21:08,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:21:08,335 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:21:08,338 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:21:08,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [561414934] [2021-12-19 17:21:08,339 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2021-12-19 17:21:08,339 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:21:08,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:21:08,351 INFO L229 MonitoredProcess]: Starting monitored process 149 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:21:08,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (149)] Waiting until timeout for monitored process [2021-12-19 17:21:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:21:08,502 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:21:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:21:08,545 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:22:05,691 WARN L227 SmtUtils]: Spent 52.49s on a formula simplification. DAG size of input: 111 DAG size of output: 108 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:22:21,286 WARN L227 SmtUtils]: Spent 12.66s on a formula simplification that was a NOOP. DAG size: 5 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-19 17:22:45,918 WARN L227 SmtUtils]: Spent 24.56s on a formula simplification that was a NOOP. DAG size: 96 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-19 17:23:10,054 WARN L227 SmtUtils]: Spent 24.13s on a formula simplification that was a NOOP. DAG size: 97 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-19 17:23:39,756 WARN L227 SmtUtils]: Spent 24.09s on a formula simplification that was a NOOP. DAG size: 98 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-19 17:24:11,058 WARN L227 SmtUtils]: Spent 30.79s on a formula simplification that was a NOOP. DAG size: 120 (called from [L 271] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:24:11,060 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:24:11,060 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:24:11,060 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:24:11,060 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:24:11,060 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-19 17:24:11,060 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:24:11,060 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:24:11,060 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:24:11,060 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration24_Loop [2021-12-19 17:24:11,060 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:24:11,060 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:24:11,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:24:11,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:24:11,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:24:11,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:24:39,423 WARN L227 SmtUtils]: Spent 28.35s on a formula simplification that was a NOOP. DAG size: 120 (called from [L 441] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.setFormulaAndSimplify) [2021-12-19 17:24:39,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:24:39,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:25:34,541 WARN L227 SmtUtils]: Spent 55.11s on a formula simplification. DAG size of input: 284 DAG size of output: 252 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2021-12-19 17:26:10,839 WARN L227 SmtUtils]: Spent 36.29s on a formula simplification that was a NOOP. DAG size: 251 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2021-12-19 17:26:10,842 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:26:10,842 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-19 17:26:10,842 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:26:10,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:26:10,844 INFO L229 MonitoredProcess]: Starting monitored process 150 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:26:10,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2021-12-19 17:26:10,848 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:26:10,848 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:26:10,869 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:26:10,869 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret10#1=0} Honda state: {ULTIMATE.start_main_#t~ret10#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:26:10,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Forceful destruction successful, exit code 0 [2021-12-19 17:26:10,885 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:26:10,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:26:10,886 INFO L229 MonitoredProcess]: Starting monitored process 151 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:26:10,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2021-12-19 17:26:10,888 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:26:10,888 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:26:10,909 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:26:10,909 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:26:10,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Forceful destruction successful, exit code 0 [2021-12-19 17:26:10,926 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:26:10,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:26:10,927 INFO L229 MonitoredProcess]: Starting monitored process 152 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:26:10,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2021-12-19 17:26:10,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:26:10,929 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:26:10,950 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-19 17:26:10,950 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-19 17:26:10,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Forceful destruction successful, exit code 0 [2021-12-19 17:26:10,968 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:26:10,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:26:10,970 INFO L229 MonitoredProcess]: Starting monitored process 153 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:26:10,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2021-12-19 17:26:10,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-19 17:26:10,972 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:26:10,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2021-12-19 17:26:10,996 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:26:10,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:26:10,997 INFO L229 MonitoredProcess]: Starting monitored process 154 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:26:10,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2021-12-19 17:26:10,999 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-19 17:26:10,999 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-19 17:26:11,019 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-19 17:26:11,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Forceful destruction successful, exit code 0 [2021-12-19 17:26:11,036 INFO L210 LassoAnalysis]: Preferences: [2021-12-19 17:26:11,036 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-19 17:26:11,036 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-19 17:26:11,036 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-19 17:26:11,036 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-19 17:26:11,036 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:26:11,036 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-19 17:26:11,036 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-19 17:26:11,036 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration24_Loop [2021-12-19 17:26:11,036 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-19 17:26:11,036 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-19 17:26:11,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:26:11,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:26:11,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:26:11,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:27:04,655 WARN L227 SmtUtils]: Spent 53.61s on a formula simplification that was a NOOP. DAG size: 120 (called from [L 441] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.setFormulaAndSimplify) [2021-12-19 17:27:04,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:27:04,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-19 17:27:51,715 WARN L227 SmtUtils]: Spent 47.05s on a formula simplification. DAG size of input: 284 DAG size of output: 252 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2021-12-19 17:28:23,050 WARN L227 SmtUtils]: Spent 31.33s on a formula simplification that was a NOOP. DAG size: 251 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2021-12-19 17:28:23,053 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-19 17:28:23,053 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-19 17:28:23,053 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:28:23,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:28:23,058 INFO L229 MonitoredProcess]: Starting monitored process 155 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:28:23,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2021-12-19 17:28:23,063 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:28:23,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:28:23,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:28:23,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:28:23,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:28:23,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:28:23,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:28:23,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:28:23,072 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:28:23,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Forceful destruction successful, exit code 0 [2021-12-19 17:28:23,092 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:28:23,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:28:23,093 INFO L229 MonitoredProcess]: Starting monitored process 156 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:28:23,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2021-12-19 17:28:23,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:28:23,101 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:28:23,101 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:28:23,101 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:28:23,101 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:28:23,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:28:23,102 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:28:23,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:28:23,103 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:28:23,118 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Forceful destruction successful, exit code 0 [2021-12-19 17:28:23,118 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:28:23,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:28:23,119 INFO L229 MonitoredProcess]: Starting monitored process 157 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:28:23,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2021-12-19 17:28:23,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:28:23,127 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:28:23,127 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:28:23,127 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:28:23,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:28:23,127 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:28:23,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:28:23,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:28:23,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-19 17:28:23,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2021-12-19 17:28:23,146 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:28:23,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:28:23,147 INFO L229 MonitoredProcess]: Starting monitored process 158 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:28:23,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2021-12-19 17:28:23,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-19 17:28:23,155 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-19 17:28:23,155 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-19 17:28:23,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-19 17:28:23,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-19 17:28:23,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-19 17:28:23,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-19 17:28:23,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-19 17:28:23,160 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-19 17:28:23,163 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-19 17:28:23,163 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-19 17:28:23,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-19 17:28:23,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:28:23,164 INFO L229 MonitoredProcess]: Starting monitored process 159 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-19 17:28:23,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2021-12-19 17:28:23,166 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-19 17:28:23,166 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-19 17:28:23,166 INFO L513 LassoAnalysis]: Proved termination. [2021-12-19 17:28:23,166 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 13 Supporting invariants [] [2021-12-19 17:28:23,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Ended with exit code 0 [2021-12-19 17:28:23,183 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-19 17:28:23,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:28:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:28:23,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 1309 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-19 17:28:23,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:28:24,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2021-12-19 17:28:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:28:26,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-19 17:28:26,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:28:28,514 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2021-12-19 17:28:28,515 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 14 loop predicates [2021-12-19 17:28:28,515 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11984 states and 22609 transitions. cyclomatic complexity: 10698 Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 16 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2021-12-19 17:28:30,612 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11984 states and 22609 transitions. cyclomatic complexity: 10698. Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 16 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) Result 14889 states and 26858 transitions. Complement of second has 89 states. [2021-12-19 17:28:30,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 2 stem states 13 non-accepting loop states 1 accepting loop states [2021-12-19 17:28:30,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 16 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2021-12-19 17:28:30,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 120 transitions. [2021-12-19 17:28:30,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 120 transitions. Stem has 199 letters. Loop has 110 letters. [2021-12-19 17:28:30,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:28:30,614 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:28:30,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:28:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:28:30,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 1309 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-19 17:28:30,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:28:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:28:33,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-19 17:28:33,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:28:35,777 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2021-12-19 17:28:35,778 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 14 loop predicates [2021-12-19 17:28:35,778 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11984 states and 22609 transitions. cyclomatic complexity: 10698 Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 16 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2021-12-19 17:28:38,147 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11984 states and 22609 transitions. cyclomatic complexity: 10698. Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 16 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) Result 14605 states and 26558 transitions. Complement of second has 71 states. [2021-12-19 17:28:38,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 2 stem states 13 non-accepting loop states 1 accepting loop states [2021-12-19 17:28:38,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 16 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2021-12-19 17:28:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 119 transitions. [2021-12-19 17:28:38,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 119 transitions. Stem has 199 letters. Loop has 110 letters. [2021-12-19 17:28:38,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:28:38,150 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-19 17:28:38,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:28:38,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:28:38,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 1309 conjuncts, 62 conjunts are in the unsatisfiable core [2021-12-19 17:28:38,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:28:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-19 17:28:41,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 58 conjunts are in the unsatisfiable core [2021-12-19 17:28:41,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:28:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2021-12-19 17:28:43,639 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 14 loop predicates [2021-12-19 17:28:43,639 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11984 states and 22609 transitions. cyclomatic complexity: 10698 Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 16 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2021-12-19 17:28:46,068 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11984 states and 22609 transitions. cyclomatic complexity: 10698. Second operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 16 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) Result 42332 states and 69000 transitions. Complement of second has 94 states. [2021-12-19 17:28:46,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 16 states 2 stem states 13 non-accepting loop states 1 accepting loop states [2021-12-19 17:28:46,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 16 states have internal predecessors, (49), 6 states have call successors, (12), 2 states have call predecessors, (12), 10 states have return successors, (18), 11 states have call predecessors, (18), 6 states have call successors, (18) [2021-12-19 17:28:46,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 158 transitions. [2021-12-19 17:28:46,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 158 transitions. Stem has 199 letters. Loop has 110 letters. [2021-12-19 17:28:46,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:28:46,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 158 transitions. Stem has 309 letters. Loop has 110 letters. [2021-12-19 17:28:46,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:28:46,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 158 transitions. Stem has 199 letters. Loop has 220 letters. [2021-12-19 17:28:46,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-19 17:28:46,081 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42332 states and 69000 transitions. [2021-12-19 17:28:46,451 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 536 [2021-12-19 17:28:46,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42332 states to 26350 states and 42813 transitions. [2021-12-19 17:28:46,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1139 [2021-12-19 17:28:46,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1182 [2021-12-19 17:28:46,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26350 states and 42813 transitions. [2021-12-19 17:28:46,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:28:46,652 INFO L681 BuchiCegarLoop]: Abstraction has 26350 states and 42813 transitions. [2021-12-19 17:28:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26350 states and 42813 transitions. [2021-12-19 17:28:47,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26350 to 15861. [2021-12-19 17:28:47,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15861 states, 9586 states have (on average 1.0834550385979553) internal successors, (10386), 9677 states have internal predecessors, (10386), 3555 states have call successors, (3940), 1926 states have call predecessors, (3940), 2720 states have return successors, (14159), 4257 states have call predecessors, (14159), 3555 states have call successors, (14159) [2021-12-19 17:28:47,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15861 states to 15861 states and 28485 transitions. [2021-12-19 17:28:47,276 INFO L704 BuchiCegarLoop]: Abstraction has 15861 states and 28485 transitions. [2021-12-19 17:28:47,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-19 17:28:47,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-19 17:28:47,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2021-12-19 17:28:47,277 INFO L87 Difference]: Start difference. First operand 15861 states and 28485 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 7 states have call successors, (23), 2 states have call predecessors, (23), 4 states have return successors, (23), 5 states have call predecessors, (23), 7 states have call successors, (23) [2021-12-19 17:28:48,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-19 17:28:48,460 INFO L93 Difference]: Finished difference Result 15970 states and 28937 transitions. [2021-12-19 17:28:48,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-19 17:28:48,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15970 states and 28937 transitions. [2021-12-19 17:28:48,671 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 469 [2021-12-19 17:28:48,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15970 states to 12985 states and 23532 transitions. [2021-12-19 17:28:48,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 730 [2021-12-19 17:28:48,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 767 [2021-12-19 17:28:48,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12985 states and 23532 transitions. [2021-12-19 17:28:48,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-19 17:28:48,778 INFO L681 BuchiCegarLoop]: Abstraction has 12985 states and 23532 transitions. [2021-12-19 17:28:48,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12985 states and 23532 transitions. [2021-12-19 17:28:49,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12985 to 12163. [2021-12-19 17:28:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12163 states, 7363 states have (on average 1.0856987640907239) internal successors, (7994), 7443 states have internal predecessors, (7994), 2686 states have call successors, (3030), 1487 states have call predecessors, (3030), 2114 states have return successors, (11047), 3232 states have call predecessors, (11047), 2686 states have call successors, (11047) [2021-12-19 17:28:49,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12163 states to 12163 states and 22071 transitions. [2021-12-19 17:28:49,172 INFO L704 BuchiCegarLoop]: Abstraction has 12163 states and 22071 transitions. [2021-12-19 17:28:49,172 INFO L587 BuchiCegarLoop]: Abstraction has 12163 states and 22071 transitions. [2021-12-19 17:28:49,172 INFO L425 BuchiCegarLoop]: ======== Iteration 25============ [2021-12-19 17:28:49,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12163 states and 22071 transitions. [2021-12-19 17:28:49,244 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 442 [2021-12-19 17:28:49,244 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-19 17:28:49,244 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-19 17:28:49,245 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2021-12-19 17:28:49,245 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [19, 19, 16, 16, 16, 16, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-19 17:28:49,245 INFO L791 eck$LassoCheckResult]: Stem: 413533#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 413505#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~ret9#1, main_#t~ret10#1, main_#t~post8#1, main_~k~0#1, main_#t~post7#1, main_~n~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 413506#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 413532#L38 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~n~0#1 := 0; 413555#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 413938#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 413936#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 413932#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 413933#factENTRY ~n := #in~n; 413937#L25 assume ~n <= 0;#res := 1; 413935#factFINAL assume true; 413931#factEXIT >#68#return; 413926#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 413927#factENTRY ~n := #in~n; 413934#L25 assume ~n <= 0;#res := 1; 413930#factFINAL assume true; 413925#factEXIT >#70#return; 413921#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 413922#factENTRY ~n := #in~n; 413929#L25 assume ~n <= 0;#res := 1; 413924#factFINAL assume true; 413920#factEXIT >#72#return; 413918#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 413916#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 413913#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 413909#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 413907#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 413902#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 413903#factENTRY ~n := #in~n; 413915#L25 assume !(~n <= 0); 413911#L26 call #t~ret0 := fact(~n - 1);< 413912#factENTRY ~n := #in~n; 413917#L25 assume ~n <= 0;#res := 1; 413914#factFINAL assume true; 413910#factEXIT >#66#return; 413908#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 413906#factFINAL assume true; 413901#factEXIT >#74#return; 413897#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 413898#factENTRY ~n := #in~n; 413905#L25 assume ~n <= 0;#res := 1; 413900#factFINAL assume true; 413896#factEXIT >#76#return; 413878#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 413889#factENTRY ~n := #in~n; 413884#L25 assume !(~n <= 0); 413866#L26 call #t~ret0 := fact(~n - 1);< 413870#factENTRY ~n := #in~n; 413883#L25 assume ~n <= 0;#res := 1; 413877#factFINAL assume true; 413865#factEXIT >#66#return; 413869#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 417948#factFINAL assume true; 417925#factEXIT >#78#return; 417926#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 425024#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 425022#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 425021#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 425020#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 413940#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 413941#factENTRY ~n := #in~n; 413951#L25 assume !(~n <= 0); 413947#L26 call #t~ret0 := fact(~n - 1);< 413949#factENTRY ~n := #in~n; 413956#L25 assume !(~n <= 0); 413948#L26 call #t~ret0 := fact(~n - 1);< 413954#factENTRY ~n := #in~n; 413957#L25 assume ~n <= 0;#res := 1; 413955#factFINAL assume true; 413953#factEXIT >#66#return; 413952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 413950#factFINAL assume true; 413946#factEXIT >#66#return; 413945#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 413942#factFINAL assume true; 413939#factEXIT >#74#return; 413662#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 413704#factENTRY ~n := #in~n; 413686#L25 assume ~n <= 0;#res := 1; 413687#factFINAL assume true; 414020#factEXIT >#76#return; 413582#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 413583#factENTRY ~n := #in~n; 413983#L25 assume !(~n <= 0); 413596#L26 call #t~ret0 := fact(~n - 1);< 413616#factENTRY ~n := #in~n; 413674#L25 assume !(~n <= 0); 413598#L26 call #t~ret0 := fact(~n - 1);< 413669#factENTRY ~n := #in~n; 413649#L25 assume ~n <= 0;#res := 1; 413673#factFINAL assume true; 413667#factEXIT >#66#return; 413665#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 413660#factFINAL assume true; 413650#factEXIT >#66#return; 413626#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 413999#factFINAL assume true; 413991#factEXIT >#78#return; 413574#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 413563#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 413564#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 413560#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 413530#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 413519#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 413520#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 417758#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 413496#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 413497#factENTRY ~n := #in~n; 417532#L25 assume !(~n <= 0); 417529#L26 call #t~ret0 := fact(~n - 1);< 417530#factENTRY ~n := #in~n; 417533#L25 assume ~n <= 0;#res := 1; 417531#factFINAL assume true; 417528#factEXIT >#66#return; 417511#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 417510#factFINAL assume true; 417495#factEXIT >#68#return; 417482#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 417489#factENTRY ~n := #in~n; 417509#L25 assume ~n <= 0;#res := 1; 417494#factFINAL assume true; 417481#factEXIT >#70#return; 417472#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 417478#factENTRY ~n := #in~n; 417527#L25 assume !(~n <= 0); 417507#L26 call #t~ret0 := fact(~n - 1);< 417508#factENTRY ~n := #in~n; 417515#L25 assume ~n <= 0;#res := 1; 417514#factFINAL assume true; 417506#factEXIT >#66#return; 417493#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 417480#factFINAL assume true; 417477#factEXIT >#72#return; 413528#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 413524#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 413525#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 413554#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 414019#L43 assume main_~k~0#1 <= main_~n~0#1;assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~n~0#1, main_~k~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 413512#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 416785#factENTRY ~n := #in~n; 417360#L25 assume !(~n <= 0); 413511#L26 call #t~ret0 := fact(~n - 1);< 413513#factENTRY ~n := #in~n; 416806#L25 assume ~n <= 0;#res := 1; 416805#factFINAL assume true; 416804#factEXIT >#66#return; 416802#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 416800#factFINAL assume true; 416784#factEXIT >#68#return; 416781#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 416782#factENTRY ~n := #in~n; 416818#L25 assume !(~n <= 0); 414330#L26 call #t~ret0 := fact(~n - 1);< 414345#factENTRY ~n := #in~n; 414402#L25 assume ~n <= 0;#res := 1; 414396#factFINAL assume true; 414329#factEXIT >#66#return; 414341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 416808#factFINAL assume true; 416780#factEXIT >#70#return; 416777#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 416778#factENTRY ~n := #in~n; 416810#L25 assume ~n <= 0;#res := 1; 416807#factFINAL assume true; 416776#factEXIT >#72#return; 416774#L30-3 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 416769#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 416764#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 416757#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 416755#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 414318#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 414325#factENTRY ~n := #in~n; 415871#L25 assume !(~n <= 0); 414333#L26 call #t~ret0 := fact(~n - 1);< 416524#factENTRY ~n := #in~n; 416646#L25 assume !(~n <= 0); 415680#L26 call #t~ret0 := fact(~n - 1);< 416528#factENTRY ~n := #in~n; 416645#L25 assume ~n <= 0;#res := 1; 416643#factFINAL assume true; 416627#factEXIT >#66#return; 416626#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 416523#factFINAL assume true; 415676#factEXIT >#66#return; 415674#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 415673#factFINAL assume true; 415672#factEXIT >#74#return; 415666#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 415671#factENTRY ~n := #in~n; 415778#L25 assume !(~n <= 0); 414331#L26 call #t~ret0 := fact(~n - 1);< 415686#factENTRY ~n := #in~n; 414402#L25 assume ~n <= 0;#res := 1; 414396#factFINAL assume true; 414329#factEXIT >#66#return; 414342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 415704#factFINAL assume true; 415665#factEXIT >#76#return; 415667#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 415668#factENTRY ~n := #in~n; 416562#L25 assume !(~n <= 0); 414335#L26 call #t~ret0 := fact(~n - 1);< 416527#factENTRY ~n := #in~n; 414402#L25 assume ~n <= 0;#res := 1; 414396#factFINAL assume true; 414329#factEXIT >#66#return; 414342#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 415704#factFINAL assume true; 415665#factEXIT >#78#return; 415631#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 415632#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 417167#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 416371#L42-3 [2021-12-19 17:28:49,246 INFO L793 eck$LassoCheckResult]: Loop: 416371#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 413534#L43 assume !(main_~k~0#1 <= main_~n~0#1);assume { :begin_inline_binomialCoefficient } true;binomialCoefficient_#in~n#1, binomialCoefficient_#in~k#1 := main_~k~0#1, main_~n~0#1;havoc binomialCoefficient_#res#1;havoc binomialCoefficient_#t~ret1#1, binomialCoefficient_#t~ret2#1, binomialCoefficient_#t~ret3#1, binomialCoefficient_~n#1, binomialCoefficient_~k#1;binomialCoefficient_~n#1 := binomialCoefficient_#in~n#1;binomialCoefficient_~k#1 := binomialCoefficient_#in~k#1; 413477#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 413478#factENTRY ~n := #in~n; 416367#L25 assume !(~n <= 0); 414062#L26 call #t~ret0 := fact(~n - 1);< 414123#factENTRY ~n := #in~n; 414237#L25 assume !(~n <= 0); 414078#L26 call #t~ret0 := fact(~n - 1);< 414252#factENTRY ~n := #in~n; 414237#L25 assume !(~n <= 0); 414078#L26 call #t~ret0 := fact(~n - 1);< 414252#factENTRY ~n := #in~n; 414237#L25 assume !(~n <= 0); 414078#L26 call #t~ret0 := fact(~n - 1);< 414252#factENTRY ~n := #in~n; 414237#L25 assume !(~n <= 0); 414078#L26 call #t~ret0 := fact(~n - 1);< 414252#factENTRY ~n := #in~n; 414237#L25 assume !(~n <= 0); 414078#L26 call #t~ret0 := fact(~n - 1);< 414252#factENTRY ~n := #in~n; 414237#L25 assume !(~n <= 0); 414078#L26 call #t~ret0 := fact(~n - 1);< 414252#factENTRY ~n := #in~n; 414237#L25 assume !(~n <= 0); 414078#L26 call #t~ret0 := fact(~n - 1);< 414252#factENTRY ~n := #in~n; 414227#L25 assume ~n <= 0;#res := 1; 414256#factFINAL assume true; 414249#factEXIT >#66#return; 414246#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 414230#factFINAL assume true; 414168#factEXIT >#66#return; 414175#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 414224#factFINAL assume true; 414222#factEXIT >#66#return; 414200#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 414198#factFINAL assume true; 414194#factEXIT >#66#return; 414192#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 414189#factFINAL assume true; 414157#factEXIT >#66#return; 414155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 414152#factFINAL assume true; 414145#factEXIT >#66#return; 414135#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 414130#factFINAL assume true; 414126#factEXIT >#66#return; 414090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 414120#factFINAL assume true; 414058#factEXIT >#66#return; 414092#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 416333#factFINAL assume true; 416263#factEXIT >#74#return; 416267#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 413478#factENTRY ~n := #in~n; 416367#L25 assume ~n <= 0;#res := 1; 416364#factFINAL assume true; 416358#factEXIT >#76#return; 416268#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 416348#factENTRY ~n := #in~n; 416344#L25 assume !(~n <= 0); 414072#L26 call #t~ret0 := fact(~n - 1);< 414115#factENTRY ~n := #in~n; 414258#L25 assume !(~n <= 0); 414059#L26 call #t~ret0 := fact(~n - 1);< 414121#factENTRY ~n := #in~n; 414237#L25 assume !(~n <= 0); 414078#L26 call #t~ret0 := fact(~n - 1);< 414252#factENTRY ~n := #in~n; 414237#L25 assume !(~n <= 0); 414078#L26 call #t~ret0 := fact(~n - 1);< 414252#factENTRY ~n := #in~n; 414237#L25 assume !(~n <= 0); 414078#L26 call #t~ret0 := fact(~n - 1);< 414252#factENTRY ~n := #in~n; 414237#L25 assume !(~n <= 0); 414078#L26 call #t~ret0 := fact(~n - 1);< 414252#factENTRY ~n := #in~n; 414237#L25 assume !(~n <= 0); 414078#L26 call #t~ret0 := fact(~n - 1);< 414252#factENTRY ~n := #in~n; 414237#L25 assume !(~n <= 0); 414078#L26 call #t~ret0 := fact(~n - 1);< 414252#factENTRY ~n := #in~n; 414227#L25 assume ~n <= 0;#res := 1; 414256#factFINAL assume true; 414249#factEXIT >#66#return; 414246#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 414230#factFINAL assume true; 414168#factEXIT >#66#return; 414175#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 414224#factFINAL assume true; 414222#factEXIT >#66#return; 414200#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 414198#factFINAL assume true; 414194#factEXIT >#66#return; 414192#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 414189#factFINAL assume true; 414157#factEXIT >#66#return; 414155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 414152#factFINAL assume true; 414145#factEXIT >#66#return; 414135#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 414130#factFINAL assume true; 414126#factEXIT >#66#return; 414090#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 414120#factFINAL assume true; 414058#factEXIT >#66#return; 414092#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 416333#factFINAL assume true; 416263#factEXIT >#78#return; 413507#L30-8 binomialCoefficient_#res#1 := (if binomialCoefficient_#t~ret1#1 < 0 && 0 != binomialCoefficient_#t~ret1#1 % (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) then (if binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1 < 0 then binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1) - 1 else 1 + binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1)) else binomialCoefficient_#t~ret1#1 / (binomialCoefficient_#t~ret2#1 * binomialCoefficient_#t~ret3#1));havoc binomialCoefficient_#t~ret1#1;havoc binomialCoefficient_#t~ret2#1;havoc binomialCoefficient_#t~ret3#1; 413508#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 413517#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 416371#L42-3 [2021-12-19 17:28:49,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:28:49,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2104594835, now seen corresponding path program 11 times [2021-12-19 17:28:49,246 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:28:49,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699867367] [2021-12-19 17:28:49,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:28:49,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:28:49,253 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:28:49,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333169285] [2021-12-19 17:28:49,253 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-19 17:28:49,254 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:28:49,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:28:49,255 INFO L229 MonitoredProcess]: Starting monitored process 160 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:28:49,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (160)] Waiting until timeout for monitored process [2021-12-19 17:28:49,411 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-12-19 17:28:49,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-19 17:28:49,411 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:28:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:28:49,490 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:28:49,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:28:49,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1086456786, now seen corresponding path program 8 times [2021-12-19 17:28:49,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:28:49,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981213745] [2021-12-19 17:28:49,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:28:49,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:28:49,494 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:28:49,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1175546676] [2021-12-19 17:28:49,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-19 17:28:49,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:28:49,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:28:49,512 INFO L229 MonitoredProcess]: Starting monitored process 161 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:28:49,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (161)] Waiting until timeout for monitored process [2021-12-19 17:28:49,689 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-19 17:28:49,689 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-19 17:28:49,689 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-19 17:28:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-19 17:28:49,926 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-19 17:28:49,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-19 17:28:49,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1862580416, now seen corresponding path program 12 times [2021-12-19 17:28:49,926 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-19 17:28:49,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895055418] [2021-12-19 17:28:49,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-19 17:28:49,926 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-19 17:28:49,988 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-19 17:28:49,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1494071478] [2021-12-19 17:28:49,988 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-19 17:28:49,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-19 17:28:49,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-19 17:28:49,998 INFO L229 MonitoredProcess]: Starting monitored process 162 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-19 17:28:49,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (162)] Waiting until timeout for monitored process [2021-12-19 17:28:50,169 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2021-12-19 17:28:50,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-19 17:28:50,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 17 conjunts are in the unsatisfiable core [2021-12-19 17:28:50,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-19 17:28:52,017 INFO L134 CoverageAnalysis]: Checked inductivity of 6086 backedges. 3084 proven. 209 refuted. 0 times theorem prover too weak. 2793 trivial. 0 not checked. [2021-12-19 17:28:52,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-19 17:28:53,917 INFO L134 CoverageAnalysis]: Checked inductivity of 6086 backedges. 204 proven. 448 refuted. 0 times theorem prover too weak. 5434 trivial. 0 not checked. [2021-12-19 17:28:53,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-19 17:28:53,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895055418] [2021-12-19 17:28:53,918 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-19 17:28:53,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1494071478] [2021-12-19 17:28:53,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1494071478] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-19 17:28:53,918 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-19 17:28:53,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 17 [2021-12-19 17:28:53,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066432128] [2021-12-19 17:28:53,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-19 17:29:48,839 WARN L227 SmtUtils]: Spent 49.62s on a formula simplification. DAG size of input: 107 DAG size of output: 104 (called from [L 234] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2021-12-19 17:30:12,511 WARN L227 SmtUtils]: Spent 23.59s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-19 17:30:37,697 WARN L227 SmtUtils]: Spent 25.19s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Killed by 15