./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-16 09:21:06,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-16 09:21:06,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-16 09:21:06,378 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-16 09:21:06,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-16 09:21:06,379 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-16 09:21:06,380 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-16 09:21:06,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-16 09:21:06,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-16 09:21:06,382 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-16 09:21:06,383 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-16 09:21:06,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-16 09:21:06,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-16 09:21:06,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-16 09:21:06,385 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-16 09:21:06,386 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-16 09:21:06,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-16 09:21:06,387 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-16 09:21:06,388 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-16 09:21:06,389 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-16 09:21:06,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-16 09:21:06,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-16 09:21:06,391 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-16 09:21:06,392 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-16 09:21:06,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-16 09:21:06,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-16 09:21:06,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-16 09:21:06,394 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-16 09:21:06,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-16 09:21:06,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-16 09:21:06,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-16 09:21:06,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-16 09:21:06,396 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-16 09:21:06,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-16 09:21:06,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-16 09:21:06,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-16 09:21:06,398 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-16 09:21:06,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-16 09:21:06,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-16 09:21:06,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-16 09:21:06,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-16 09:21:06,400 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2021-12-16 09:21:06,413 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-16 09:21:06,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-16 09:21:06,414 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-16 09:21:06,414 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-16 09:21:06,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-16 09:21:06,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-16 09:21:06,415 INFO L138 SettingsManager]: * Use SBE=true [2021-12-16 09:21:06,415 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-16 09:21:06,415 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-16 09:21:06,415 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-16 09:21:06,416 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-16 09:21:06,416 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-16 09:21:06,416 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-16 09:21:06,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-16 09:21:06,416 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-16 09:21:06,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-16 09:21:06,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-16 09:21:06,417 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-16 09:21:06,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-16 09:21:06,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-16 09:21:06,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-16 09:21:06,417 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-16 09:21:06,417 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-16 09:21:06,418 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-16 09:21:06,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-16 09:21:06,418 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-16 09:21:06,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-16 09:21:06,418 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-16 09:21:06,418 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-16 09:21:06,419 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-16 09:21:06,419 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-16 09:21:06,582 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-16 09:21:06,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-16 09:21:06,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-16 09:21:06,605 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-16 09:21:06,605 INFO L275 PluginConnector]: CDTParser initialized [2021-12-16 09:21:06,606 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-16 09:21:06,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07692c3b0/e3fbfdf1929f47e9bbd5b82e2ab5a2a4/FLAG448f210d0 [2021-12-16 09:21:07,014 INFO L306 CDTParser]: Found 1 translation units. [2021-12-16 09:21:07,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Binomial.c [2021-12-16 09:21:07,018 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07692c3b0/e3fbfdf1929f47e9bbd5b82e2ab5a2a4/FLAG448f210d0 [2021-12-16 09:21:07,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07692c3b0/e3fbfdf1929f47e9bbd5b82e2ab5a2a4 [2021-12-16 09:21:07,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-16 09:21:07,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-16 09:21:07,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-16 09:21:07,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-16 09:21:07,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-16 09:21:07,039 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:21:07" (1/1) ... [2021-12-16 09:21:07,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a316a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:07, skipping insertion in model container [2021-12-16 09:21:07,040 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 09:21:07" (1/1) ... [2021-12-16 09:21:07,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-16 09:21:07,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-16 09:21:07,208 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:21:07,212 INFO L203 MainTranslator]: Completed pre-run [2021-12-16 09:21:07,225 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-16 09:21:07,232 INFO L208 MainTranslator]: Completed translation [2021-12-16 09:21:07,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:07 WrapperNode [2021-12-16 09:21:07,233 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-16 09:21:07,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-16 09:21:07,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-16 09:21:07,234 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-16 09:21:07,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:07" (1/1) ... [2021-12-16 09:21:07,242 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:07" (1/1) ... [2021-12-16 09:21:07,260 INFO L137 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2021-12-16 09:21:07,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-16 09:21:07,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-16 09:21:07,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-16 09:21:07,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-16 09:21:07,266 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:07" (1/1) ... [2021-12-16 09:21:07,266 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:07" (1/1) ... [2021-12-16 09:21:07,268 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:07" (1/1) ... [2021-12-16 09:21:07,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:07" (1/1) ... [2021-12-16 09:21:07,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:07" (1/1) ... [2021-12-16 09:21:07,276 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:07" (1/1) ... [2021-12-16 09:21:07,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:07" (1/1) ... [2021-12-16 09:21:07,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-16 09:21:07,282 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-16 09:21:07,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-16 09:21:07,283 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-16 09:21:07,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:07" (1/1) ... [2021-12-16 09:21:07,294 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:07,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:07,334 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-16 09:21:07,351 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-16 09:21:07,362 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2021-12-16 09:21:07,362 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2021-12-16 09:21:07,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-16 09:21:07,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-16 09:21:07,401 INFO L236 CfgBuilder]: Building ICFG [2021-12-16 09:21:07,402 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-16 09:21:07,533 INFO L277 CfgBuilder]: Performing block encoding [2021-12-16 09:21:07,555 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-16 09:21:07,555 INFO L301 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-16 09:21:07,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:21:07 BoogieIcfgContainer [2021-12-16 09:21:07,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-16 09:21:07,557 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-16 09:21:07,558 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-16 09:21:07,560 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-16 09:21:07,560 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:21:07,560 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.12 09:21:07" (1/3) ... [2021-12-16 09:21:07,562 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60b1eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:21:07, skipping insertion in model container [2021-12-16 09:21:07,575 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:21:07,575 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 09:21:07" (2/3) ... [2021-12-16 09:21:07,576 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@60b1eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.12 09:21:07, skipping insertion in model container [2021-12-16 09:21:07,576 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-16 09:21:07,576 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 09:21:07" (3/3) ... [2021-12-16 09:21:07,577 INFO L388 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2021-12-16 09:21:07,603 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-16 09:21:07,603 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-16 09:21:07,603 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-16 09:21:07,603 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-16 09:21:07,603 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-16 09:21:07,603 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-16 09:21:07,603 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-16 09:21:07,604 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-16 09:21:07,616 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-16 09:21:07,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-12-16 09:21:07,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:07,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:07,637 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-16 09:21:07,637 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-16 09:21:07,637 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-16 09:21:07,637 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-16 09:21:07,643 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-12-16 09:21:07,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:07,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:07,644 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-16 09:21:07,644 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-16 09:21:07,649 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-16 09:21:07,649 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-16 09:21:07,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:07,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2021-12-16 09:21:07,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:07,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266502195] [2021-12-16 09:21:07,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:07,665 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:07,721 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:07,743 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:07,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:07,745 INFO L85 PathProgramCache]: Analyzing trace with hash 57812, now seen corresponding path program 1 times [2021-12-16 09:21:07,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:07,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510072406] [2021-12-16 09:21:07,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:07,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:07,758 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:07,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:07,772 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:07,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:07,774 INFO L85 PathProgramCache]: Analyzing trace with hash 553673357, now seen corresponding path program 1 times [2021-12-16 09:21:07,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:07,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791953241] [2021-12-16 09:21:07,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:07,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:07,834 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-16 09:21:07,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:07,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791953241] [2021-12-16 09:21:07,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791953241] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:21:07,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:21:07,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:21:07,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208690412] [2021-12-16 09:21:07,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:21:07,876 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:07,877 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:07,877 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:07,877 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:07,877 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:21:07,877 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:07,878 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:07,878 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:07,878 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2021-12-16 09:21:07,878 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:07,878 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:07,900 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-16 09:21:07,912 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-16 09:21:07,976 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:07,977 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:21:07,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:07,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:07,985 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-16 09:21:07,986 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-16 09:21:07,987 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:07,987 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:08,000 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:08,001 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-16 09:21:08,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-16 09:21:08,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:08,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:08,025 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-16 09:21:08,025 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-16 09:21:08,028 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:08,029 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:08,055 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-16 09:21:08,055 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:08,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:08,056 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-16 09:21:08,057 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-16 09:21:08,059 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:21:08,059 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:08,216 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:21:08,221 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-16 09:21:08,221 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:08,221 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:08,221 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:08,221 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:08,222 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:21:08,222 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:08,222 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:08,222 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:08,222 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2021-12-16 09:21:08,222 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:08,222 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:08,223 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-16 09:21:08,230 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-16 09:21:08,277 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:08,280 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:21:08,281 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:08,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:08,282 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-16 09:21:08,288 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-16 09:21:08,293 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-16 09:21:08,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:08,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:08,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:08,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:08,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:08,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:08,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:08,320 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:08,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2021-12-16 09:21:08,369 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:08,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:08,369 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-16 09:21:08,370 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-16 09:21:08,372 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-16 09:21:08,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:08,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:08,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:08,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:08,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:08,381 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:08,381 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:08,391 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:21:08,396 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-16 09:21:08,396 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2021-12-16 09:21:08,397 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:08,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:08,398 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-16 09:21:08,406 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:21:08,407 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 09:21:08,407 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:21:08,407 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-16 09:21:08,415 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-16 09:21:08,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-12-16 09:21:08,430 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 09:21:08,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:08,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:08,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:08,475 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:21:08,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:08,526 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-16 09:21:08,551 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-16 09:21:08,552 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-16 09:21:08,616 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-16 09:21:08,617 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-16 09:21:08,623 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-16 09:21:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2021-12-16 09:21:08,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 3 letters. [2021-12-16 09:21:08,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:08,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 7 letters. Loop has 3 letters. [2021-12-16 09:21:08,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:08,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 6 letters. [2021-12-16 09:21:08,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:08,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 106 transitions. [2021-12-16 09:21:08,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2021-12-16 09:21:08,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 33 states and 48 transitions. [2021-12-16 09:21:08,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-12-16 09:21:08,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2021-12-16 09:21:08,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2021-12-16 09:21:08,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:08,646 INFO L681 BuchiCegarLoop]: Abstraction has 33 states and 48 transitions. [2021-12-16 09:21:08,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2021-12-16 09:21:08,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2021-12-16 09:21:08,668 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-16 09:21:08,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2021-12-16 09:21:08,669 INFO L704 BuchiCegarLoop]: Abstraction has 30 states and 42 transitions. [2021-12-16 09:21:08,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:08,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 09:21:08,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-16 09:21:08,672 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-16 09:21:08,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:08,708 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2021-12-16 09:21:08,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 09:21:08,709 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2021-12-16 09:21:08,710 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2021-12-16 09:21:08,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 37 transitions. [2021-12-16 09:21:08,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2021-12-16 09:21:08,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2021-12-16 09:21:08,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2021-12-16 09:21:08,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-16 09:21:08,713 INFO L681 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2021-12-16 09:21:08,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2021-12-16 09:21:08,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2021-12-16 09:21:08,715 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-16 09:21:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2021-12-16 09:21:08,715 INFO L704 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2021-12-16 09:21:08,715 INFO L587 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2021-12-16 09:21:08,715 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-16 09:21:08,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2021-12-16 09:21:08,716 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2021-12-16 09:21:08,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:08,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:08,717 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-12-16 09:21:08,717 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-16 09:21:08,717 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-16 09:21:08,718 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-16 09:21:08,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:08,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2021-12-16 09:21:08,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:08,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138923197] [2021-12-16 09:21:08,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:08,719 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:08,722 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:08,725 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:08,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:08,726 INFO L85 PathProgramCache]: Analyzing trace with hash -743603515, now seen corresponding path program 1 times [2021-12-16 09:21:08,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:08,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784668029] [2021-12-16 09:21:08,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:08,726 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:08,733 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:21:08,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [914409334] [2021-12-16 09:21:08,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:08,734 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:08,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:08,735 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-16 09:21:08,735 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-16 09:21:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:08,786 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:08,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:08,799 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:08,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:08,800 INFO L85 PathProgramCache]: Analyzing trace with hash 343305470, now seen corresponding path program 1 times [2021-12-16 09:21:08,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:08,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741961701] [2021-12-16 09:21:08,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:08,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:08,825 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:21:08,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1898651131] [2021-12-16 09:21:08,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:08,825 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:08,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:08,827 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-16 09:21:08,831 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-16 09:21:08,831 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-16 09:21:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:08,858 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:08,876 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:09,190 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:09,191 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:09,191 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:09,191 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:09,191 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:21:09,191 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:09,191 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:09,192 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:09,192 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2021-12-16 09:21:09,192 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:09,192 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:09,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-16 09:21:09,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-16 09:21:09,198 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-16 09:21:09,200 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-16 09:21:09,202 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-16 09:21:09,204 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-16 09:21:09,215 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-16 09:21:09,218 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-16 09:21:09,316 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:09,316 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:21:09,316 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:09,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:09,317 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-16 09:21:09,318 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-16 09:21:09,319 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:09,319 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:09,340 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:09,340 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-16 09:21:09,357 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-16 09:21:09,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:09,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:09,358 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-16 09:21:09,359 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-16 09:21:09,360 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:09,360 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:09,371 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:09,372 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-16 09:21:09,386 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-16 09:21:09,387 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:09,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:09,387 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-16 09:21:09,388 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-16 09:21:09,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:09,390 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:09,396 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:09,397 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-16 09:21:09,413 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-16 09:21:09,413 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:09,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:09,414 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-16 09:21:09,414 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-16 09:21:09,416 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:09,416 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:09,424 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:09,424 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-16 09:21:09,441 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-16 09:21:09,441 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:09,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:09,442 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-16 09:21:09,443 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-16 09:21:09,444 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:09,444 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:09,455 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:09,456 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-16 09:21:09,472 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-16 09:21:09,474 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:09,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:09,475 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-16 09:21:09,475 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-16 09:21:09,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:09,478 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:09,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:09,517 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:09,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:09,519 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-16 09:21:09,520 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-16 09:21:09,522 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:21:09,522 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:09,832 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:21:09,836 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-16 09:21:09,836 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:09,836 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:09,837 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:09,837 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:09,837 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:21:09,837 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:09,837 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:09,837 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:09,837 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2021-12-16 09:21:09,837 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:09,837 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:09,838 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-16 09:21:09,841 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-16 09:21:09,842 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-16 09:21:09,845 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-16 09:21:09,846 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-16 09:21:09,848 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-16 09:21:09,852 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-16 09:21:09,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-16 09:21:09,954 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:09,955 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:21:09,955 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:09,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:09,956 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-16 09:21:09,957 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-16 09:21:09,961 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-16 09:21:09,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:09,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:09,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:09,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:09,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:09,968 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:09,968 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:09,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:09,998 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-16 09:21:09,998 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:09,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:09,999 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-16 09:21:10,000 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-16 09:21:10,001 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-16 09:21:10,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:10,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:10,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:10,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:10,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:10,007 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:10,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:10,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:10,023 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-16 09:21:10,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:10,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:10,024 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-16 09:21:10,025 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-16 09:21:10,025 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-16 09:21:10,031 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:10,031 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:10,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:10,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:10,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:10,032 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:10,032 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:10,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:10,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2021-12-16 09:21:10,054 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:10,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:10,055 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-16 09:21:10,056 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-16 09:21:10,057 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-16 09:21:10,063 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:10,063 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:10,063 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:10,063 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:10,063 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:10,064 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:10,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:10,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:10,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2021-12-16 09:21:10,082 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:10,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:10,083 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-16 09:21:10,084 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-16 09:21:10,085 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-16 09:21:10,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:10,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:10,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:10,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:10,091 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:10,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:10,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:10,113 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:10,128 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-16 09:21:10,129 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:10,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:10,130 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-16 09:21:10,136 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-16 09:21:10,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:10,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:10,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:10,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:10,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:10,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:10,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:10,146 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-16 09:21:10,148 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:10,163 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-16 09:21:10,163 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:10,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:10,164 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-16 09:21:10,164 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-16 09:21:10,166 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-16 09:21:10,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:10,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:10,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:10,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:10,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:10,172 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:10,172 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:10,175 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:10,192 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-16 09:21:10,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:10,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:10,193 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-16 09:21:10,193 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-16 09:21:10,194 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-16 09:21:10,200 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:10,200 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:10,200 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:10,200 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:10,200 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:10,205 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:10,205 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:10,219 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:21:10,239 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-16 09:21:10,239 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-16 09:21:10,239 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:10,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:10,240 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-16 09:21:10,241 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-16 09:21:10,244 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:21:10,244 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 09:21:10,245 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:21:10,245 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-16 09:21:10,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:10,262 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 09:21:10,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:10,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:10,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:10,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 09:21:10,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:10,445 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-16 09:21:10,445 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-16 09:21:10,445 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-16 09:21:10,602 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-16 09:21:10,642 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-16 09:21:10,643 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-16 09:21:10,643 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-16 09:21:10,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 74 transitions. [2021-12-16 09:21:10,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 74 transitions. Stem has 4 letters. Loop has 23 letters. [2021-12-16 09:21:10,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:10,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 74 transitions. Stem has 27 letters. Loop has 23 letters. [2021-12-16 09:21:10,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:10,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 74 transitions. Stem has 4 letters. Loop has 46 letters. [2021-12-16 09:21:10,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:10,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 182 transitions. [2021-12-16 09:21:10,648 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2021-12-16 09:21:10,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 116 states and 181 transitions. [2021-12-16 09:21:10,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2021-12-16 09:21:10,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 60 [2021-12-16 09:21:10,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 181 transitions. [2021-12-16 09:21:10,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:10,651 INFO L681 BuchiCegarLoop]: Abstraction has 116 states and 181 transitions. [2021-12-16 09:21:10,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states and 181 transitions. [2021-12-16 09:21:10,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 105. [2021-12-16 09:21:10,659 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-16 09:21:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2021-12-16 09:21:10,660 INFO L704 BuchiCegarLoop]: Abstraction has 105 states and 154 transitions. [2021-12-16 09:21:10,660 INFO L587 BuchiCegarLoop]: Abstraction has 105 states and 154 transitions. [2021-12-16 09:21:10,660 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-16 09:21:10,660 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 105 states and 154 transitions. [2021-12-16 09:21:10,661 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2021-12-16 09:21:10,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:10,661 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:10,662 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-16 09:21:10,662 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-16 09:21:10,662 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-16 09:21:10,662 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-16 09:21:10,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:10,662 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 1 times [2021-12-16 09:21:10,662 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:10,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253097611] [2021-12-16 09:21:10,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:10,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:10,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:10,666 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:10,668 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:10,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:10,668 INFO L85 PathProgramCache]: Analyzing trace with hash 471779129, now seen corresponding path program 1 times [2021-12-16 09:21:10,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:10,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644902149] [2021-12-16 09:21:10,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:10,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:10,672 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:21:10,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1522047191] [2021-12-16 09:21:10,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:10,673 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:10,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:10,674 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-16 09:21:10,675 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-16 09:21:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:10,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:21:10,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:10,808 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-16 09:21:10,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:21:11,016 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-16 09:21:11,016 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:11,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644902149] [2021-12-16 09:21:11,017 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 09:21:11,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522047191] [2021-12-16 09:21:11,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522047191] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:21:11,017 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 09:21:11,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2021-12-16 09:21:11,017 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105158766] [2021-12-16 09:21:11,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 09:21:11,017 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:21:11,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:11,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-16 09:21:11,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-12-16 09:21:11,018 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-16 09:21:11,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:11,255 INFO L93 Difference]: Finished difference Result 307 states and 482 transitions. [2021-12-16 09:21:11,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-16 09:21:11,255 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 482 transitions. [2021-12-16 09:21:11,263 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 112 [2021-12-16 09:21:11,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 307 states and 482 transitions. [2021-12-16 09:21:11,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2021-12-16 09:21:11,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2021-12-16 09:21:11,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 307 states and 482 transitions. [2021-12-16 09:21:11,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:11,275 INFO L681 BuchiCegarLoop]: Abstraction has 307 states and 482 transitions. [2021-12-16 09:21:11,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 482 transitions. [2021-12-16 09:21:11,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 149. [2021-12-16 09:21:11,299 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-16 09:21:11,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 264 transitions. [2021-12-16 09:21:11,303 INFO L704 BuchiCegarLoop]: Abstraction has 149 states and 264 transitions. [2021-12-16 09:21:11,303 INFO L587 BuchiCegarLoop]: Abstraction has 149 states and 264 transitions. [2021-12-16 09:21:11,303 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-16 09:21:11,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 264 transitions. [2021-12-16 09:21:11,305 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 40 [2021-12-16 09:21:11,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:11,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:11,307 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-16 09:21:11,307 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-16 09:21:11,307 INFO L791 eck$LassoCheckResult]: Stem: 1233#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; 1232#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; 1263#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1221#L42-3 [2021-12-16 09:21:11,308 INFO L793 eck$LassoCheckResult]: Loop: 1221#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1234#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; 1235#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1268#factENTRY ~n := #in~n; 1275#L25 assume !(~n <= 0); 1186#L26 call #t~ret0 := fact(~n - 1);< 1216#factENTRY ~n := #in~n; 1266#L25 assume !(~n <= 0); 1185#L26 call #t~ret0 := fact(~n - 1);< 1216#factENTRY ~n := #in~n; 1266#L25 assume ~n <= 0;#res := 1; 1200#factFINAL assume true; 1184#factEXIT >#66#return; 1188#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1307#factFINAL assume true; 1305#factEXIT >#66#return; 1306#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1316#factFINAL assume true; 1278#factEXIT >#68#return; 1270#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1268#factENTRY ~n := #in~n; 1275#L25 assume ~n <= 0;#res := 1; 1256#factFINAL assume true; 1287#factEXIT >#70#return; 1272#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1268#factENTRY ~n := #in~n; 1275#L25 assume ~n <= 0;#res := 1; 1256#factFINAL assume true; 1287#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; 1310#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1309#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1230#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-16 09:21:11,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:11,309 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 2 times [2021-12-16 09:21:11,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:11,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771497540] [2021-12-16 09:21:11,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:11,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:11,327 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:11,331 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:11,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:11,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2146445903, now seen corresponding path program 2 times [2021-12-16 09:21:11,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:11,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463942035] [2021-12-16 09:21:11,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:11,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:11,338 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:21:11,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1262269272] [2021-12-16 09:21:11,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 09:21:11,341 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:11,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:11,342 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-16 09:21:11,343 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-16 09:21:11,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 09:21:11,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:21:11,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:21:11,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:11,458 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-16 09:21:11,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:21:11,642 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-16 09:21:11,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:11,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463942035] [2021-12-16 09:21:11,643 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 09:21:11,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262269272] [2021-12-16 09:21:11,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262269272] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:21:11,643 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 09:21:11,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2021-12-16 09:21:11,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136252598] [2021-12-16 09:21:11,643 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 09:21:11,644 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:21:11,644 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:11,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-16 09:21:11,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2021-12-16 09:21:11,645 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-16 09:21:11,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:11,921 INFO L93 Difference]: Finished difference Result 377 states and 584 transitions. [2021-12-16 09:21:11,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-16 09:21:11,922 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 377 states and 584 transitions. [2021-12-16 09:21:11,925 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 123 [2021-12-16 09:21:11,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 377 states to 365 states and 564 transitions. [2021-12-16 09:21:11,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 178 [2021-12-16 09:21:11,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 178 [2021-12-16 09:21:11,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 365 states and 564 transitions. [2021-12-16 09:21:11,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:11,929 INFO L681 BuchiCegarLoop]: Abstraction has 365 states and 564 transitions. [2021-12-16 09:21:11,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states and 564 transitions. [2021-12-16 09:21:11,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 183. [2021-12-16 09:21:11,941 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-16 09:21:11,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 308 transitions. [2021-12-16 09:21:11,943 INFO L704 BuchiCegarLoop]: Abstraction has 183 states and 308 transitions. [2021-12-16 09:21:11,943 INFO L587 BuchiCegarLoop]: Abstraction has 183 states and 308 transitions. [2021-12-16 09:21:11,943 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-16 09:21:11,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 308 transitions. [2021-12-16 09:21:11,944 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 45 [2021-12-16 09:21:11,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:11,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:11,944 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2021-12-16 09:21:11,944 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-16 09:21:11,945 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-16 09:21:11,945 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-16 09:21:11,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:11,945 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 3 times [2021-12-16 09:21:11,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:11,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058335257] [2021-12-16 09:21:11,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:11,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:11,948 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:11,950 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:11,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:11,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1703111285, now seen corresponding path program 1 times [2021-12-16 09:21:11,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:11,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624979043] [2021-12-16 09:21:11,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:11,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:11,956 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:21:11,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1463932848] [2021-12-16 09:21:11,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:11,956 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:11,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:11,972 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-16 09:21:11,979 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-16 09:21:12,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:12,014 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:12,044 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:12,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:12,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1023536866, now seen corresponding path program 1 times [2021-12-16 09:21:12,044 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:12,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525618812] [2021-12-16 09:21:12,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:12,045 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:12,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-16 09:21:12,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:12,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525618812] [2021-12-16 09:21:12,088 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2021-12-16 09:21:12,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [374637320] [2021-12-16 09:21:12,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:12,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:12,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:12,092 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-16 09:21:12,093 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-16 09:21:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:12,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-16 09:21:12,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:12,181 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-16 09:21:12,182 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 09:21:12,182 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [374637320] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:21:12,182 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:21:12,182 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-16 09:21:12,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029096862] [2021-12-16 09:21:12,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:21:24,847 WARN L227 SmtUtils]: Spent 12.41s 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-16 09:21:36,907 WARN L227 SmtUtils]: Spent 12.01s 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-16 09:21:37,010 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:37,010 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:37,010 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:37,010 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:37,010 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:21:37,010 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:37,010 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:37,010 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:37,010 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2021-12-16 09:21:37,010 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:37,010 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:37,011 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-16 09:21:37,013 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-16 09:21:37,014 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-16 09:21:37,016 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-16 09:21:37,017 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-16 09:21:37,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-16 09:21:37,020 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-16 09:21:37,277 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:37,277 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:21:37,277 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:37,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:37,280 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-16 09:21:37,281 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-16 09:21:37,283 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:37,283 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:37,300 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:37,300 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-16 09:21:37,315 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-16 09:21:37,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:37,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:37,316 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-16 09:21:37,320 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:37,320 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:37,335 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-16 09:21:37,335 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:37,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-16 09:21:37,356 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-16 09:21:37,356 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:37,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:37,357 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-16 09:21:37,373 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:37,373 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:37,376 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-16 09:21:37,403 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:37,404 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-16 09:21:37,422 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-16 09:21:37,422 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:37,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:37,423 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-16 09:21:37,424 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-16 09:21:37,426 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:37,426 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:37,451 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:37,451 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-16 09:21:37,467 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-16 09:21:37,468 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:37,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:37,471 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-16 09:21:37,471 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-16 09:21:37,473 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:37,473 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:37,479 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:37,479 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-16 09:21:37,495 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-16 09:21:37,495 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:37,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:37,496 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-16 09:21:37,497 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-16 09:21:37,498 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:37,498 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:37,504 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:37,504 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-16 09:21:37,520 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-16 09:21:37,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:37,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:37,521 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-16 09:21:37,521 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-16 09:21:37,523 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:37,523 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:37,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-12-16 09:21:37,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:37,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:37,556 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-16 09:21:37,557 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-16 09:21:37,558 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:21:37,558 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:37,582 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:21:37,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:37,599 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:37,599 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:37,599 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:37,599 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:37,599 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:21:37,599 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:37,599 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:37,599 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:37,599 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2021-12-16 09:21:37,599 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:37,599 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:37,601 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-16 09:21:37,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:21:37,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:21:37,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-16 09:21:37,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-16 09:21:37,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-16 09:21:37,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-16 09:21:37,824 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:37,825 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:21:37,825 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:37,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:37,826 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-16 09:21:37,826 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-16 09:21:37,827 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-16 09:21:37,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:37,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:37,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:37,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:37,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:37,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:37,833 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:37,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:37,847 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-16 09:21:37,848 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:37,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:37,848 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-16 09:21:37,850 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-16 09:21:37,850 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-16 09:21:37,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:37,855 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:37,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:37,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:37,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:37,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:37,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:37,856 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:37,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2021-12-16 09:21:37,870 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:37,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:37,871 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-16 09:21:37,871 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-16 09:21:37,873 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-16 09:21:37,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:37,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:37,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:37,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:37,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:37,878 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:37,878 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:37,883 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:37,897 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-16 09:21:37,897 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:37,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:37,898 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-16 09:21:37,898 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-16 09:21:37,899 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-16 09:21:37,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:37,904 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:37,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:37,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:37,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:37,905 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:37,905 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:37,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:37,933 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-16 09:21:37,933 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:37,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:37,934 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-16 09:21:37,935 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-16 09:21:37,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-16 09:21:37,941 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:37,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:37,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:37,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:37,941 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:37,941 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:37,941 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:37,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:37,956 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-16 09:21:37,956 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:37,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:37,957 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-16 09:21:37,958 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-16 09:21:37,959 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-16 09:21:37,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:37,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:37,964 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:37,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:37,964 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:37,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:37,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:37,965 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:21:37,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:37,982 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:37,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:37,982 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-16 09:21:37,983 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-16 09:21:37,984 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-16 09:21:37,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:21:37,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:21:37,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:21:37,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:21:37,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:21:37,991 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:21:37,991 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:21:37,999 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:21:38,002 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-16 09:21:38,002 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-16 09:21:38,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:38,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:38,004 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-16 09:21:38,004 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-16 09:21:38,005 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:21:38,005 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 09:21:38,005 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:21:38,005 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-16 09:21:38,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-12-16 09:21:38,023 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 09:21:38,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:38,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:21:38,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:38,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-16 09:21:38,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:38,303 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-16 09:21:38,304 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-16 09:21:38,304 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-16 09:21:38,609 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-16 09:21:38,609 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-16 09:21:38,610 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-16 09:21:38,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2021-12-16 09:21:38,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 113 transitions. Stem has 5 letters. Loop has 47 letters. [2021-12-16 09:21:38,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:38,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 113 transitions. Stem has 52 letters. Loop has 47 letters. [2021-12-16 09:21:38,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:38,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 113 transitions. Stem has 5 letters. Loop has 94 letters. [2021-12-16 09:21:38,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:21:38,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1103 states and 1896 transitions. [2021-12-16 09:21:38,640 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 95 [2021-12-16 09:21:38,648 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-16 09:21:38,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1103 states to 847 states and 1435 transitions. [2021-12-16 09:21:38,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 275 [2021-12-16 09:21:38,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 277 [2021-12-16 09:21:38,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 847 states and 1435 transitions. [2021-12-16 09:21:38,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:38,659 INFO L681 BuchiCegarLoop]: Abstraction has 847 states and 1435 transitions. [2021-12-16 09:21:38,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states and 1435 transitions. [2021-12-16 09:21:38,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 737. [2021-12-16 09:21:38,693 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-16 09:21:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1175 transitions. [2021-12-16 09:21:38,697 INFO L704 BuchiCegarLoop]: Abstraction has 737 states and 1175 transitions. [2021-12-16 09:21:38,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:38,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-16 09:21:38,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-16 09:21:38,700 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-16 09:21:38,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:38,728 INFO L93 Difference]: Finished difference Result 799 states and 1321 transitions. [2021-12-16 09:21:38,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-16 09:21:38,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 799 states and 1321 transitions. [2021-12-16 09:21:38,737 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 93 [2021-12-16 09:21:38,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 799 states to 799 states and 1321 transitions. [2021-12-16 09:21:38,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 258 [2021-12-16 09:21:38,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 258 [2021-12-16 09:21:38,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 799 states and 1321 transitions. [2021-12-16 09:21:38,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:38,745 INFO L681 BuchiCegarLoop]: Abstraction has 799 states and 1321 transitions. [2021-12-16 09:21:38,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states and 1321 transitions. [2021-12-16 09:21:38,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 741. [2021-12-16 09:21:38,760 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-16 09:21:38,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1179 transitions. [2021-12-16 09:21:38,764 INFO L704 BuchiCegarLoop]: Abstraction has 741 states and 1179 transitions. [2021-12-16 09:21:38,764 INFO L587 BuchiCegarLoop]: Abstraction has 741 states and 1179 transitions. [2021-12-16 09:21:38,764 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-16 09:21:38,764 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 741 states and 1179 transitions. [2021-12-16 09:21:38,767 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 83 [2021-12-16 09:21:38,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:38,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:38,769 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:21:38,769 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-16 09:21:38,769 INFO L791 eck$LassoCheckResult]: Stem: 5273#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5245#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; 5246#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; 5289#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 5638#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 5377#L43 [2021-12-16 09:21:38,769 INFO L793 eck$LassoCheckResult]: Loop: 5377#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; 5310#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 5317#factENTRY ~n := #in~n; 5382#L25 assume !(~n <= 0); 5329#L26 call #t~ret0 := fact(~n - 1);< 5351#factENTRY ~n := #in~n; 5367#L25 assume ~n <= 0;#res := 1; 5363#factFINAL assume true; 5355#factEXIT >#66#return; 5361#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5381#factFINAL assume true; 5311#factEXIT >#68#return; 5312#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 5317#factENTRY ~n := #in~n; 5382#L25 assume ~n <= 0;#res := 1; 5380#factFINAL assume true; 5388#factEXIT >#70#return; 5314#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 5386#factENTRY ~n := #in~n; 5384#L25 assume !(~n <= 0); 5329#L26 call #t~ret0 := fact(~n - 1);< 5351#factENTRY ~n := #in~n; 5367#L25 assume !(~n <= 0); 5325#L26 call #t~ret0 := fact(~n - 1);< 5351#factENTRY ~n := #in~n; 5367#L25 assume ~n <= 0;#res := 1; 5363#factFINAL assume true; 5355#factEXIT >#66#return; 5354#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5352#factFINAL assume true; 5348#factEXIT >#66#return; 5341#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5374#factFINAL assume true; 5376#factEXIT >#72#return; 5306#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; 5298#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 5296#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 5294#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 5269#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 5259#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 5260#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 5377#L43 [2021-12-16 09:21:38,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:38,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 1 times [2021-12-16 09:21:38,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:38,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130305319] [2021-12-16 09:21:38,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:38,770 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:38,775 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:38,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:38,780 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:38,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:38,781 INFO L85 PathProgramCache]: Analyzing trace with hash 249527309, now seen corresponding path program 3 times [2021-12-16 09:21:38,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:38,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487342611] [2021-12-16 09:21:38,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:38,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:38,789 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:21:38,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1880991006] [2021-12-16 09:21:38,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 09:21:38,790 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:38,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:38,790 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-16 09:21:38,791 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-16 09:21:38,816 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-12-16 09:21:38,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:21:38,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-16 09:21:38,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:38,874 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2021-12-16 09:21:38,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 09:21:38,875 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:38,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487342611] [2021-12-16 09:21:38,875 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 09:21:38,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880991006] [2021-12-16 09:21:38,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880991006] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:21:38,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:21:38,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 09:21:38,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020880680] [2021-12-16 09:21:38,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:21:38,876 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:21:38,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:38,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 09:21:38,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-16 09:21:38,877 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-16 09:21:38,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:38,934 INFO L93 Difference]: Finished difference Result 884 states and 1467 transitions. [2021-12-16 09:21:38,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 09:21:38,935 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 884 states and 1467 transitions. [2021-12-16 09:21:38,943 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 125 [2021-12-16 09:21:38,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 884 states to 866 states and 1449 transitions. [2021-12-16 09:21:38,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 284 [2021-12-16 09:21:38,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 284 [2021-12-16 09:21:38,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 866 states and 1449 transitions. [2021-12-16 09:21:38,955 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:38,955 INFO L681 BuchiCegarLoop]: Abstraction has 866 states and 1449 transitions. [2021-12-16 09:21:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states and 1449 transitions. [2021-12-16 09:21:39,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 759. [2021-12-16 09:21:39,001 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-16 09:21:39,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1197 transitions. [2021-12-16 09:21:39,005 INFO L704 BuchiCegarLoop]: Abstraction has 759 states and 1197 transitions. [2021-12-16 09:21:39,005 INFO L587 BuchiCegarLoop]: Abstraction has 759 states and 1197 transitions. [2021-12-16 09:21:39,006 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-16 09:21:39,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 759 states and 1197 transitions. [2021-12-16 09:21:39,009 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 85 [2021-12-16 09:21:39,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:39,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:39,011 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:21:39,011 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [21, 21, 15, 15, 15, 15, 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-16 09:21:39,011 INFO L791 eck$LassoCheckResult]: Stem: 7029#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7000#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; 7001#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 7028#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; 7053#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 7418#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7152#L43 [2021-12-16 09:21:39,016 INFO L793 eck$LassoCheckResult]: Loop: 7152#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; 7071#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7138#factENTRY ~n := #in~n; 7150#L25 assume !(~n <= 0); 7089#L26 call #t~ret0 := fact(~n - 1);< 7104#factENTRY ~n := #in~n; 7117#L25 assume !(~n <= 0); 7084#L26 call #t~ret0 := fact(~n - 1);< 7104#factENTRY ~n := #in~n; 7117#L25 assume ~n <= 0;#res := 1; 7116#factFINAL assume true; 7108#factEXIT >#66#return; 7107#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7105#factFINAL assume true; 7101#factEXIT >#66#return; 7098#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7136#factFINAL assume true; 7137#factEXIT >#68#return; 7128#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7138#factENTRY ~n := #in~n; 7150#L25 assume !(~n <= 0); 7089#L26 call #t~ret0 := fact(~n - 1);< 7104#factENTRY ~n := #in~n; 7117#L25 assume !(~n <= 0); 7084#L26 call #t~ret0 := fact(~n - 1);< 7104#factENTRY ~n := #in~n; 7117#L25 assume ~n <= 0;#res := 1; 7116#factFINAL assume true; 7108#factEXIT >#66#return; 7107#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7105#factFINAL assume true; 7101#factEXIT >#66#return; 7098#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7136#factFINAL assume true; 7137#factEXIT >#70#return; 7126#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7138#factENTRY ~n := #in~n; 7150#L25 assume !(~n <= 0); 7089#L26 call #t~ret0 := fact(~n - 1);< 7104#factENTRY ~n := #in~n; 7117#L25 assume !(~n <= 0); 7084#L26 call #t~ret0 := fact(~n - 1);< 7104#factENTRY ~n := #in~n; 7117#L25 assume ~n <= 0;#res := 1; 7116#factFINAL assume true; 7108#factEXIT >#66#return; 7107#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7105#factFINAL assume true; 7101#factEXIT >#66#return; 7098#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7136#factFINAL assume true; 7137#factEXIT >#72#return; 7124#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; 7123#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 7122#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 7120#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7057#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; 7064#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7070#factENTRY ~n := #in~n; 7154#L25 assume !(~n <= 0); 7080#L26 call #t~ret0 := fact(~n - 1);< 7104#factENTRY ~n := #in~n; 7117#L25 assume !(~n <= 0); 7084#L26 call #t~ret0 := fact(~n - 1);< 7104#factENTRY ~n := #in~n; 7117#L25 assume !(~n <= 0); 7084#L26 call #t~ret0 := fact(~n - 1);< 7104#factENTRY ~n := #in~n; 7117#L25 assume ~n <= 0;#res := 1; 7116#factFINAL assume true; 7108#factEXIT >#66#return; 7107#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7105#factFINAL assume true; 7101#factEXIT >#66#return; 7097#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7100#factFINAL assume true; 7075#factEXIT >#66#return; 7074#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7073#factFINAL assume true; 7072#factEXIT >#74#return; 7062#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7070#factENTRY ~n := #in~n; 7154#L25 assume !(~n <= 0); 7080#L26 call #t~ret0 := fact(~n - 1);< 7104#factENTRY ~n := #in~n; 7117#L25 assume !(~n <= 0); 7084#L26 call #t~ret0 := fact(~n - 1);< 7104#factENTRY ~n := #in~n; 7117#L25 assume !(~n <= 0); 7084#L26 call #t~ret0 := fact(~n - 1);< 7104#factENTRY ~n := #in~n; 7117#L25 assume ~n <= 0;#res := 1; 7116#factFINAL assume true; 7108#factEXIT >#66#return; 7107#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7105#factFINAL assume true; 7101#factEXIT >#66#return; 7097#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7100#factFINAL assume true; 7075#factEXIT >#66#return; 7074#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7073#factFINAL assume true; 7072#factEXIT >#76#return; 7063#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7119#factENTRY ~n := #in~n; 7118#L25 assume !(~n <= 0); 7080#L26 call #t~ret0 := fact(~n - 1);< 7104#factENTRY ~n := #in~n; 7117#L25 assume !(~n <= 0); 7084#L26 call #t~ret0 := fact(~n - 1);< 7104#factENTRY ~n := #in~n; 7117#L25 assume !(~n <= 0); 7084#L26 call #t~ret0 := fact(~n - 1);< 7104#factENTRY ~n := #in~n; 7117#L25 assume ~n <= 0;#res := 1; 7116#factFINAL assume true; 7108#factEXIT >#66#return; 7107#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7105#factFINAL assume true; 7101#factEXIT >#66#return; 7097#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7100#factFINAL assume true; 7075#factEXIT >#66#return; 7074#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7073#factFINAL assume true; 7072#factEXIT >#78#return; 7060#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; 7059#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 7058#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 7056#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 7025#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 7015#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 7016#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7152#L43 [2021-12-16 09:21:39,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:39,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 2 times [2021-12-16 09:21:39,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:39,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868646450] [2021-12-16 09:21:39,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:39,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:39,027 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:39,033 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:39,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:39,034 INFO L85 PathProgramCache]: Analyzing trace with hash -271478662, now seen corresponding path program 1 times [2021-12-16 09:21:39,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:39,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605880896] [2021-12-16 09:21:39,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:39,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:39,044 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:21:39,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1784611448] [2021-12-16 09:21:39,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:39,045 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:39,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:39,046 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-16 09:21:39,047 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-16 09:21:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:39,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 09:21:39,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:39,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 556 proven. 103 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2021-12-16 09:21:39,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:21:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1055 backedges. 16 proven. 415 refuted. 0 times theorem prover too weak. 624 trivial. 0 not checked. [2021-12-16 09:21:39,828 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:39,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605880896] [2021-12-16 09:21:39,828 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 09:21:39,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784611448] [2021-12-16 09:21:39,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784611448] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:21:39,828 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 09:21:39,828 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 17 [2021-12-16 09:21:39,828 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49007944] [2021-12-16 09:21:39,829 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 09:21:39,830 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:21:39,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:39,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-16 09:21:39,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2021-12-16 09:21:39,831 INFO L87 Difference]: Start difference. First operand 759 states and 1197 transitions. cyclomatic complexity: 449 Second operand has 17 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 11 states have call successors, (18), 2 states have call predecessors, (18), 7 states have return successors, (20), 9 states have call predecessors, (20), 11 states have call successors, (20) [2021-12-16 09:21:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:40,132 INFO L93 Difference]: Finished difference Result 1231 states and 2037 transitions. [2021-12-16 09:21:40,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-16 09:21:40,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1231 states and 2037 transitions. [2021-12-16 09:21:40,142 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 195 [2021-12-16 09:21:40,153 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1231 states to 1216 states and 2017 transitions. [2021-12-16 09:21:40,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 394 [2021-12-16 09:21:40,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 394 [2021-12-16 09:21:40,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1216 states and 2017 transitions. [2021-12-16 09:21:40,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:40,154 INFO L681 BuchiCegarLoop]: Abstraction has 1216 states and 2017 transitions. [2021-12-16 09:21:40,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states and 2017 transitions. [2021-12-16 09:21:40,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 827. [2021-12-16 09:21:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 508 states have (on average 1.1161417322834646) internal successors, (567), 495 states have internal predecessors, (567), 211 states have call successors, (211), 92 states have call predecessors, (211), 108 states have return successors, (625), 239 states have call predecessors, (625), 211 states have call successors, (625) [2021-12-16 09:21:40,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1403 transitions. [2021-12-16 09:21:40,178 INFO L704 BuchiCegarLoop]: Abstraction has 827 states and 1403 transitions. [2021-12-16 09:21:40,178 INFO L587 BuchiCegarLoop]: Abstraction has 827 states and 1403 transitions. [2021-12-16 09:21:40,178 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-16 09:21:40,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 827 states and 1403 transitions. [2021-12-16 09:21:40,190 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 91 [2021-12-16 09:21:40,191 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:40,191 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:40,192 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:21:40,192 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [18, 18, 12, 12, 12, 12, 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-16 09:21:40,192 INFO L791 eck$LassoCheckResult]: Stem: 9850#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 9823#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; 9824#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 9849#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; 9871#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 10282#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 9851#L43 [2021-12-16 09:21:40,192 INFO L793 eck$LassoCheckResult]: Loop: 9851#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; 9852#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9971#factENTRY ~n := #in~n; 9980#L25 assume !(~n <= 0); 9902#L26 call #t~ret0 := fact(~n - 1);< 9944#factENTRY ~n := #in~n; 9948#L25 assume !(~n <= 0); 9899#L26 call #t~ret0 := fact(~n - 1);< 9944#factENTRY ~n := #in~n; 9948#L25 assume ~n <= 0;#res := 1; 9945#factFINAL assume true; 9926#factEXIT >#66#return; 9933#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9946#factFINAL assume true; 9935#factEXIT >#66#return; 9939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9969#factFINAL assume true; 9970#factEXIT >#68#return; 9962#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 9971#factENTRY ~n := #in~n; 9980#L25 assume !(~n <= 0); 9902#L26 call #t~ret0 := fact(~n - 1);< 9944#factENTRY ~n := #in~n; 9948#L25 assume ~n <= 0;#res := 1; 9945#factFINAL assume true; 9926#factEXIT >#66#return; 9929#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9977#factFINAL assume true; 9976#factEXIT >#70#return; 9961#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 9971#factENTRY ~n := #in~n; 9980#L25 assume !(~n <= 0); 9902#L26 call #t~ret0 := fact(~n - 1);< 9944#factENTRY ~n := #in~n; 9948#L25 assume !(~n <= 0); 9899#L26 call #t~ret0 := fact(~n - 1);< 9944#factENTRY ~n := #in~n; 9948#L25 assume ~n <= 0;#res := 1; 9945#factFINAL assume true; 9926#factEXIT >#66#return; 9933#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9946#factFINAL assume true; 9935#factEXIT >#66#return; 9939#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9969#factFINAL assume true; 9970#factEXIT >#72#return; 9959#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; 9958#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 9957#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 9954#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 9877#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; 9882#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9889#factENTRY ~n := #in~n; 9892#L25 assume !(~n <= 0); 9893#L26 call #t~ret0 := fact(~n - 1);< 9944#factENTRY ~n := #in~n; 9948#L25 assume !(~n <= 0); 9899#L26 call #t~ret0 := fact(~n - 1);< 9944#factENTRY ~n := #in~n; 9948#L25 assume !(~n <= 0); 9899#L26 call #t~ret0 := fact(~n - 1);< 9944#factENTRY ~n := #in~n; 9948#L25 assume ~n <= 0;#res := 1; 9945#factFINAL assume true; 9926#factEXIT >#66#return; 9933#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9946#factFINAL assume true; 9935#factEXIT >#66#return; 9914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9921#factFINAL assume true; 9896#factEXIT >#66#return; 9895#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9894#factFINAL assume true; 9891#factEXIT >#74#return; 9883#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 9889#factENTRY ~n := #in~n; 9892#L25 assume !(~n <= 0); 9893#L26 call #t~ret0 := fact(~n - 1);< 9944#factENTRY ~n := #in~n; 9948#L25 assume !(~n <= 0); 9899#L26 call #t~ret0 := fact(~n - 1);< 9944#factENTRY ~n := #in~n; 9948#L25 assume ~n <= 0;#res := 1; 9945#factFINAL assume true; 9926#factEXIT >#66#return; 9933#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9946#factFINAL assume true; 9935#factEXIT >#66#return; 9940#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9919#factFINAL assume true; 9920#factEXIT >#76#return; 9884#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 9925#factENTRY ~n := #in~n; 9922#L25 assume !(~n <= 0); 9893#L26 call #t~ret0 := fact(~n - 1);< 9944#factENTRY ~n := #in~n; 9948#L25 assume !(~n <= 0); 9899#L26 call #t~ret0 := fact(~n - 1);< 9944#factENTRY ~n := #in~n; 9948#L25 assume ~n <= 0;#res := 1; 9945#factFINAL assume true; 9926#factEXIT >#66#return; 9933#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9946#factFINAL assume true; 9935#factEXIT >#66#return; 9940#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 9919#factFINAL assume true; 9920#factEXIT >#78#return; 9880#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; 9879#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 9878#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 9876#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 9846#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 9837#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 9838#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 9851#L43 [2021-12-16 09:21:40,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:40,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 3 times [2021-12-16 09:21:40,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:40,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325332859] [2021-12-16 09:21:40,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:40,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:40,195 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:40,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:40,196 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:40,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:40,197 INFO L85 PathProgramCache]: Analyzing trace with hash 881443394, now seen corresponding path program 2 times [2021-12-16 09:21:40,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:40,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218069406] [2021-12-16 09:21:40,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:40,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:40,201 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:21:40,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1362837221] [2021-12-16 09:21:40,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 09:21:40,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:40,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:40,202 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-16 09:21:40,203 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-16 09:21:40,248 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 09:21:40,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:21:40,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 09:21:40,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:40,419 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 409 proven. 72 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2021-12-16 09:21:40,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:21:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 19 proven. 328 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2021-12-16 09:21:40,896 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:40,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218069406] [2021-12-16 09:21:40,897 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 09:21:40,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362837221] [2021-12-16 09:21:40,897 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362837221] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:21:40,897 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 09:21:40,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 17 [2021-12-16 09:21:40,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583751483] [2021-12-16 09:21:40,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 09:21:40,898 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:21:40,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:40,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-16 09:21:40,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2021-12-16 09:21:40,899 INFO L87 Difference]: Start difference. First operand 827 states and 1403 transitions. cyclomatic complexity: 587 Second operand has 17 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 11 states have call successors, (18), 2 states have call predecessors, (18), 7 states have return successors, (20), 9 states have call predecessors, (20), 11 states have call successors, (20) [2021-12-16 09:21:41,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:41,276 INFO L93 Difference]: Finished difference Result 1344 states and 2183 transitions. [2021-12-16 09:21:41,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 09:21:41,277 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1344 states and 2183 transitions. [2021-12-16 09:21:41,286 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 213 [2021-12-16 09:21:41,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1344 states to 1344 states and 2183 transitions. [2021-12-16 09:21:41,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 423 [2021-12-16 09:21:41,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 423 [2021-12-16 09:21:41,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1344 states and 2183 transitions. [2021-12-16 09:21:41,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:41,298 INFO L681 BuchiCegarLoop]: Abstraction has 1344 states and 2183 transitions. [2021-12-16 09:21:41,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states and 2183 transitions. [2021-12-16 09:21:41,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 903. [2021-12-16 09:21:41,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 903 states, 550 states have (on average 1.1290909090909091) internal successors, (621), 533 states have internal predecessors, (621), 245 states have call successors, (245), 113 states have call predecessors, (245), 108 states have return successors, (671), 256 states have call predecessors, (671), 245 states have call successors, (671) [2021-12-16 09:21:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 1537 transitions. [2021-12-16 09:21:41,327 INFO L704 BuchiCegarLoop]: Abstraction has 903 states and 1537 transitions. [2021-12-16 09:21:41,327 INFO L587 BuchiCegarLoop]: Abstraction has 903 states and 1537 transitions. [2021-12-16 09:21:41,327 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-16 09:21:41,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 903 states and 1537 transitions. [2021-12-16 09:21:41,331 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 97 [2021-12-16 09:21:41,331 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:41,331 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:41,333 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:21:41,333 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-16 09:21:41,333 INFO L791 eck$LassoCheckResult]: Stem: 12743#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12718#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; 12719#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 12742#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; 12773#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 13307#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 12744#L43 [2021-12-16 09:21:41,333 INFO L793 eck$LassoCheckResult]: Loop: 12744#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; 12745#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 12879#factENTRY ~n := #in~n; 12891#L25 assume !(~n <= 0); 12802#L26 call #t~ret0 := fact(~n - 1);< 12850#factENTRY ~n := #in~n; 12855#L25 assume !(~n <= 0); 12801#L26 call #t~ret0 := fact(~n - 1);< 12850#factENTRY ~n := #in~n; 12855#L25 assume ~n <= 0;#res := 1; 12851#factFINAL assume true; 12827#factEXIT >#66#return; 12834#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 12852#factFINAL assume true; 12841#factEXIT >#66#return; 12844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 12887#factFINAL assume true; 12880#factEXIT >#68#return; 12867#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 12879#factENTRY ~n := #in~n; 12891#L25 assume !(~n <= 0); 12802#L26 call #t~ret0 := fact(~n - 1);< 12850#factENTRY ~n := #in~n; 12855#L25 assume !(~n <= 0); 12801#L26 call #t~ret0 := fact(~n - 1);< 12850#factENTRY ~n := #in~n; 12855#L25 assume ~n <= 0;#res := 1; 12851#factFINAL assume true; 12827#factEXIT >#66#return; 12834#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 12852#factFINAL assume true; 12841#factEXIT >#66#return; 12844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 12887#factFINAL assume true; 12880#factEXIT >#70#return; 12869#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 12882#factENTRY ~n := #in~n; 12883#L25 assume ~n <= 0;#res := 1; 12881#factFINAL assume true; 12866#factEXIT >#72#return; 12865#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; 12864#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 12863#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 12862#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 12778#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; 12783#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 12790#factENTRY ~n := #in~n; 12793#L25 assume !(~n <= 0); 12794#L26 call #t~ret0 := fact(~n - 1);< 12850#factENTRY ~n := #in~n; 12855#L25 assume !(~n <= 0); 12801#L26 call #t~ret0 := fact(~n - 1);< 12850#factENTRY ~n := #in~n; 12855#L25 assume !(~n <= 0); 12801#L26 call #t~ret0 := fact(~n - 1);< 12850#factENTRY ~n := #in~n; 12855#L25 assume ~n <= 0;#res := 1; 12851#factFINAL assume true; 12827#factEXIT >#66#return; 12834#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 12852#factFINAL assume true; 12841#factEXIT >#66#return; 12817#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 12824#factFINAL assume true; 12797#factEXIT >#66#return; 12796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 12795#factFINAL assume true; 12792#factEXIT >#74#return; 12784#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 12790#factENTRY ~n := #in~n; 12793#L25 assume !(~n <= 0); 12794#L26 call #t~ret0 := fact(~n - 1);< 12850#factENTRY ~n := #in~n; 12855#L25 assume !(~n <= 0); 12801#L26 call #t~ret0 := fact(~n - 1);< 12850#factENTRY ~n := #in~n; 12855#L25 assume ~n <= 0;#res := 1; 12851#factFINAL assume true; 12827#factEXIT >#66#return; 12834#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 12852#factFINAL assume true; 12841#factEXIT >#66#return; 12847#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 12822#factFINAL assume true; 12823#factEXIT >#76#return; 12785#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 12857#factENTRY ~n := #in~n; 12856#L25 assume !(~n <= 0); 12794#L26 call #t~ret0 := fact(~n - 1);< 12850#factENTRY ~n := #in~n; 12855#L25 assume !(~n <= 0); 12801#L26 call #t~ret0 := fact(~n - 1);< 12850#factENTRY ~n := #in~n; 12855#L25 assume ~n <= 0;#res := 1; 12851#factFINAL assume true; 12827#factEXIT >#66#return; 12834#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 12852#factFINAL assume true; 12841#factEXIT >#66#return; 12847#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 12822#factFINAL assume true; 12823#factEXIT >#78#return; 12781#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; 12780#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 12779#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 12777#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 12735#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 12731#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 12732#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 12744#L43 [2021-12-16 09:21:41,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:41,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 4 times [2021-12-16 09:21:41,334 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:41,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686172442] [2021-12-16 09:21:41,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:41,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:41,336 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:41,338 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:41,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:41,339 INFO L85 PathProgramCache]: Analyzing trace with hash 644896122, now seen corresponding path program 3 times [2021-12-16 09:21:41,339 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:41,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908416526] [2021-12-16 09:21:41,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:41,339 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:41,344 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:21:41,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1670521958] [2021-12-16 09:21:41,344 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 09:21:41,344 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:41,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:41,348 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-16 09:21:41,371 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-16 09:21:41,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-12-16 09:21:41,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:21:41,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-16 09:21:41,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:41,559 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-16 09:21:41,559 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:21:41,813 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-16 09:21:41,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:41,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908416526] [2021-12-16 09:21:41,813 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 09:21:41,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670521958] [2021-12-16 09:21:41,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670521958] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:21:41,814 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 09:21:41,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 10 [2021-12-16 09:21:41,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253929485] [2021-12-16 09:21:41,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 09:21:41,814 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:21:41,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:41,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-16 09:21:41,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-12-16 09:21:41,815 INFO L87 Difference]: Start difference. First operand 903 states and 1537 transitions. cyclomatic complexity: 645 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-16 09:21:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:41,993 INFO L93 Difference]: Finished difference Result 1071 states and 1865 transitions. [2021-12-16 09:21:41,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-16 09:21:41,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1071 states and 1865 transitions. [2021-12-16 09:21:42,001 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 149 [2021-12-16 09:21:42,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1071 states to 1063 states and 1846 transitions. [2021-12-16 09:21:42,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 351 [2021-12-16 09:21:42,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 351 [2021-12-16 09:21:42,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1063 states and 1846 transitions. [2021-12-16 09:21:42,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:42,011 INFO L681 BuchiCegarLoop]: Abstraction has 1063 states and 1846 transitions. [2021-12-16 09:21:42,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states and 1846 transitions. [2021-12-16 09:21:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 971. [2021-12-16 09:21:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 568 states have (on average 1.1461267605633803) internal successors, (651), 563 states have internal predecessors, (651), 295 states have call successors, (295), 113 states have call predecessors, (295), 108 states have return successors, (775), 294 states have call predecessors, (775), 291 states have call successors, (775) [2021-12-16 09:21:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1721 transitions. [2021-12-16 09:21:42,049 INFO L704 BuchiCegarLoop]: Abstraction has 971 states and 1721 transitions. [2021-12-16 09:21:42,049 INFO L587 BuchiCegarLoop]: Abstraction has 971 states and 1721 transitions. [2021-12-16 09:21:42,049 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-16 09:21:42,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 971 states and 1721 transitions. [2021-12-16 09:21:42,052 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 123 [2021-12-16 09:21:42,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:42,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:42,055 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:21:42,055 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [16, 16, 10, 10, 10, 10, 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-16 09:21:42,055 INFO L791 eck$LassoCheckResult]: Stem: 15387#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 15358#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; 15359#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 15386#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; 15405#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 16019#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 15529#L43 [2021-12-16 09:21:42,055 INFO L793 eck$LassoCheckResult]: Loop: 15529#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; 15430#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 15528#factENTRY ~n := #in~n; 15541#L25 assume !(~n <= 0); 15446#L26 call #t~ret0 := fact(~n - 1);< 15472#factENTRY ~n := #in~n; 15491#L25 assume !(~n <= 0); 15441#L26 call #t~ret0 := fact(~n - 1);< 15472#factENTRY ~n := #in~n; 15491#L25 assume ~n <= 0;#res := 1; 15489#factFINAL assume true; 15476#factEXIT >#66#return; 15475#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 15473#factFINAL assume true; 15463#factEXIT >#66#return; 15470#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 15538#factFINAL assume true; 15537#factEXIT >#68#return; 15504#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 15528#factENTRY ~n := #in~n; 15541#L25 assume !(~n <= 0); 15446#L26 call #t~ret0 := fact(~n - 1);< 15472#factENTRY ~n := #in~n; 15491#L25 assume ~n <= 0;#res := 1; 15489#factFINAL assume true; 15476#factEXIT >#66#return; 15482#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 15535#factFINAL assume true; 15534#factEXIT >#70#return; 15507#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 15532#factENTRY ~n := #in~n; 15539#L25 assume !(~n <= 0); 15477#L26 call #t~ret0 := fact(~n - 1);< 15365#factENTRY ~n := #in~n; 15490#L25 assume ~n <= 0;#res := 1; 15489#factFINAL assume true; 15476#factEXIT >#66#return; 15482#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 15535#factFINAL assume true; 15534#factEXIT >#72#return; 15502#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; 15501#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 15499#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 15497#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 15429#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; 15416#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 15428#factENTRY ~n := #in~n; 15498#L25 assume !(~n <= 0); 15444#L26 call #t~ret0 := fact(~n - 1);< 15472#factENTRY ~n := #in~n; 15491#L25 assume !(~n <= 0); 15441#L26 call #t~ret0 := fact(~n - 1);< 15472#factENTRY ~n := #in~n; 15491#L25 assume !(~n <= 0); 15441#L26 call #t~ret0 := fact(~n - 1);< 15472#factENTRY ~n := #in~n; 15491#L25 assume ~n <= 0;#res := 1; 15489#factFINAL assume true; 15476#factEXIT >#66#return; 15475#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 15473#factFINAL assume true; 15463#factEXIT >#66#return; 15456#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 15460#factFINAL assume true; 15434#factEXIT >#66#return; 15433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 15432#factFINAL assume true; 15431#factEXIT >#74#return; 15417#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 15428#factENTRY ~n := #in~n; 15498#L25 assume !(~n <= 0); 15444#L26 call #t~ret0 := fact(~n - 1);< 15472#factENTRY ~n := #in~n; 15491#L25 assume !(~n <= 0); 15441#L26 call #t~ret0 := fact(~n - 1);< 15472#factENTRY ~n := #in~n; 15491#L25 assume ~n <= 0;#res := 1; 15489#factFINAL assume true; 15476#factEXIT >#66#return; 15475#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 15473#factFINAL assume true; 15463#factEXIT >#66#return; 15468#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 15424#factFINAL assume true; 15427#factEXIT >#76#return; 15415#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 15423#factENTRY ~n := #in~n; 15496#L25 assume !(~n <= 0); 15444#L26 call #t~ret0 := fact(~n - 1);< 15472#factENTRY ~n := #in~n; 15491#L25 assume ~n <= 0;#res := 1; 15489#factFINAL assume true; 15476#factEXIT >#66#return; 15487#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 15500#factFINAL assume true; 15414#factEXIT >#78#return; 15413#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; 15412#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 15411#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 15409#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 15384#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 15373#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 15374#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 15529#L43 [2021-12-16 09:21:42,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:42,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 5 times [2021-12-16 09:21:42,056 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:42,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119801015] [2021-12-16 09:21:42,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:42,056 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:42,059 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:42,062 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:42,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:42,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1345138446, now seen corresponding path program 4 times [2021-12-16 09:21:42,062 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:42,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788526096] [2021-12-16 09:21:42,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:42,063 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:42,067 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:21:42,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [173505621] [2021-12-16 09:21:42,067 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 09:21:42,067 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:42,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:42,069 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-16 09:21:42,070 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-16 09:21:42,113 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 09:21:42,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:21:42,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-16 09:21:42,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 317 proven. 51 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2021-12-16 09:21:42,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:21:42,724 INFO L134 CoverageAnalysis]: Checked inductivity of 575 backedges. 17 proven. 197 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2021-12-16 09:21:42,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:42,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788526096] [2021-12-16 09:21:42,724 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 09:21:42,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173505621] [2021-12-16 09:21:42,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173505621] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:21:42,725 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 09:21:42,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 20 [2021-12-16 09:21:42,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359529379] [2021-12-16 09:21:42,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 09:21:42,725 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:21:42,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:42,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-16 09:21:42,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2021-12-16 09:21:42,726 INFO L87 Difference]: Start difference. First operand 971 states and 1721 transitions. cyclomatic complexity: 761 Second operand has 20 states, 16 states have (on average 3.125) internal successors, (50), 18 states have internal predecessors, (50), 13 states have call successors, (19), 2 states have call predecessors, (19), 6 states have return successors, (19), 9 states have call predecessors, (19), 13 states have call successors, (19) [2021-12-16 09:21:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:43,294 INFO L93 Difference]: Finished difference Result 1498 states and 2726 transitions. [2021-12-16 09:21:43,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-16 09:21:43,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1498 states and 2726 transitions. [2021-12-16 09:21:43,308 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 301 [2021-12-16 09:21:43,340 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1498 states to 1498 states and 2726 transitions. [2021-12-16 09:21:43,341 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 502 [2021-12-16 09:21:43,341 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 502 [2021-12-16 09:21:43,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1498 states and 2726 transitions. [2021-12-16 09:21:43,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:43,341 INFO L681 BuchiCegarLoop]: Abstraction has 1498 states and 2726 transitions. [2021-12-16 09:21:43,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states and 2726 transitions. [2021-12-16 09:21:43,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1148. [2021-12-16 09:21:43,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1148 states, 680 states have (on average 1.1220588235294118) internal successors, (763), 663 states have internal predecessors, (763), 360 states have call successors, (360), 113 states have call predecessors, (360), 108 states have return successors, (985), 371 states have call predecessors, (985), 356 states have call successors, (985) [2021-12-16 09:21:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 2108 transitions. [2021-12-16 09:21:43,383 INFO L704 BuchiCegarLoop]: Abstraction has 1148 states and 2108 transitions. [2021-12-16 09:21:43,383 INFO L587 BuchiCegarLoop]: Abstraction has 1148 states and 2108 transitions. [2021-12-16 09:21:43,383 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-16 09:21:43,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1148 states and 2108 transitions. [2021-12-16 09:21:43,389 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 183 [2021-12-16 09:21:43,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:43,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:43,390 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:21:43,390 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [10, 10, 7, 7, 7, 7, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:21:43,390 INFO L791 eck$LassoCheckResult]: Stem: 18545#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 18515#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; 18516#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 18544#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; 18567#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 19090#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 18696#L43 [2021-12-16 09:21:43,390 INFO L793 eck$LassoCheckResult]: Loop: 18696#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; 18591#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 18684#factENTRY ~n := #in~n; 18695#L25 assume !(~n <= 0); 18610#L26 call #t~ret0 := fact(~n - 1);< 18632#factENTRY ~n := #in~n; 18651#L25 assume !(~n <= 0); 18604#L26 call #t~ret0 := fact(~n - 1);< 18632#factENTRY ~n := #in~n; 18651#L25 assume !(~n <= 0); 18604#L26 call #t~ret0 := fact(~n - 1);< 18632#factENTRY ~n := #in~n; 18651#L25 assume ~n <= 0;#res := 1; 18649#factFINAL assume true; 18636#factEXIT >#66#return; 18635#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18633#factFINAL assume true; 18623#factEXIT >#66#return; 18618#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18622#factFINAL assume true; 18596#factEXIT >#66#return; 18619#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18697#factFINAL assume true; 18698#factEXIT >#68#return; 18672#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 18684#factENTRY ~n := #in~n; 18695#L25 assume !(~n <= 0); 18610#L26 call #t~ret0 := fact(~n - 1);< 18632#factENTRY ~n := #in~n; 18651#L25 assume !(~n <= 0); 18604#L26 call #t~ret0 := fact(~n - 1);< 18632#factENTRY ~n := #in~n; 18651#L25 assume ~n <= 0;#res := 1; 18649#factFINAL assume true; 18636#factEXIT >#66#return; 18635#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18633#factFINAL assume true; 18623#factEXIT >#66#return; 18630#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18703#factFINAL assume true; 18692#factEXIT >#70#return; 18666#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 18684#factENTRY ~n := #in~n; 18695#L25 assume !(~n <= 0); 18610#L26 call #t~ret0 := fact(~n - 1);< 18632#factENTRY ~n := #in~n; 18651#L25 assume !(~n <= 0); 18604#L26 call #t~ret0 := fact(~n - 1);< 18632#factENTRY ~n := #in~n; 18651#L25 assume ~n <= 0;#res := 1; 18649#factFINAL assume true; 18636#factEXIT >#66#return; 18635#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18633#factFINAL assume true; 18623#factEXIT >#66#return; 18630#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 18703#factFINAL assume true; 18692#factEXIT >#72#return; 18688#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; 18711#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 18705#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 18532#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 18696#L43 [2021-12-16 09:21:43,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:43,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 6 times [2021-12-16 09:21:43,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:43,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453679030] [2021-12-16 09:21:43,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:43,391 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:43,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:43,393 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:43,395 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:43,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:43,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1269270456, now seen corresponding path program 1 times [2021-12-16 09:21:43,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:43,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468154046] [2021-12-16 09:21:43,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:43,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:43,399 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:21:43,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1704090518] [2021-12-16 09:21:43,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:43,399 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:43,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:43,416 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-16 09:21:43,438 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-16 09:21:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:43,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 19 conjunts are in the unsatisfiable core [2021-12-16 09:21:43,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 23 proven. 128 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2021-12-16 09:21:43,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:21:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 23 proven. 141 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-12-16 09:21:44,191 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:44,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468154046] [2021-12-16 09:21:44,191 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 09:21:44,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704090518] [2021-12-16 09:21:44,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704090518] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:21:44,192 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 09:21:44,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 19 [2021-12-16 09:21:44,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366998584] [2021-12-16 09:21:44,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 09:21:44,193 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:21:44,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:44,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-12-16 09:21:44,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2021-12-16 09:21:44,193 INFO L87 Difference]: Start difference. First operand 1148 states and 2108 transitions. cyclomatic complexity: 971 Second operand has 19 states, 16 states have (on average 2.3125) internal successors, (37), 16 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-16 09:21:44,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:44,664 INFO L93 Difference]: Finished difference Result 2357 states and 4224 transitions. [2021-12-16 09:21:44,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-16 09:21:44,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2357 states and 4224 transitions. [2021-12-16 09:21:44,681 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 501 [2021-12-16 09:21:44,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2357 states to 2357 states and 4224 transitions. [2021-12-16 09:21:44,700 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 774 [2021-12-16 09:21:44,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 774 [2021-12-16 09:21:44,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2357 states and 4224 transitions. [2021-12-16 09:21:44,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:44,701 INFO L681 BuchiCegarLoop]: Abstraction has 2357 states and 4224 transitions. [2021-12-16 09:21:44,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2357 states and 4224 transitions. [2021-12-16 09:21:44,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2357 to 1308. [2021-12-16 09:21:44,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1308 states, 750 states have (on average 1.1106666666666667) internal successors, (833), 733 states have internal predecessors, (833), 422 states have call successors, (422), 120 states have call predecessors, (422), 136 states have return successors, (1461), 454 states have call predecessors, (1461), 418 states have call successors, (1461) [2021-12-16 09:21:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 2716 transitions. [2021-12-16 09:21:44,771 INFO L704 BuchiCegarLoop]: Abstraction has 1308 states and 2716 transitions. [2021-12-16 09:21:44,771 INFO L587 BuchiCegarLoop]: Abstraction has 1308 states and 2716 transitions. [2021-12-16 09:21:44,772 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-16 09:21:44,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1308 states and 2716 transitions. [2021-12-16 09:21:44,779 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 201 [2021-12-16 09:21:44,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:44,779 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:44,781 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:21:44,781 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [15, 15, 12, 12, 12, 12, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:21:44,781 INFO L791 eck$LassoCheckResult]: Stem: 22435#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 22405#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; 22406#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 22434#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; 22453#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 23268#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 22593#L43 [2021-12-16 09:21:44,781 INFO L793 eck$LassoCheckResult]: Loop: 22593#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; 22479#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 22591#factENTRY ~n := #in~n; 22602#L25 assume !(~n <= 0); 22491#L26 call #t~ret0 := fact(~n - 1);< 22538#factENTRY ~n := #in~n; 22546#L25 assume !(~n <= 0); 22488#L26 call #t~ret0 := fact(~n - 1);< 22538#factENTRY ~n := #in~n; 22546#L25 assume !(~n <= 0); 22488#L26 call #t~ret0 := fact(~n - 1);< 22538#factENTRY ~n := #in~n; 22546#L25 assume !(~n <= 0); 22488#L26 call #t~ret0 := fact(~n - 1);< 22538#factENTRY ~n := #in~n; 22546#L25 assume ~n <= 0;#res := 1; 22523#factFINAL assume true; 22529#factEXIT >#66#return; 22530#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22540#factFINAL assume true; 22486#factEXIT >#66#return; 22505#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22564#factFINAL assume true; 22556#factEXIT >#66#return; 22515#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22565#factFINAL assume true; 22513#factEXIT >#66#return; 22518#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22609#factFINAL assume true; 22594#factEXIT >#68#return; 22579#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 22591#factENTRY ~n := #in~n; 22602#L25 assume !(~n <= 0); 22491#L26 call #t~ret0 := fact(~n - 1);< 22538#factENTRY ~n := #in~n; 22546#L25 assume !(~n <= 0); 22488#L26 call #t~ret0 := fact(~n - 1);< 22538#factENTRY ~n := #in~n; 22546#L25 assume !(~n <= 0); 22488#L26 call #t~ret0 := fact(~n - 1);< 22538#factENTRY ~n := #in~n; 22546#L25 assume !(~n <= 0); 22488#L26 call #t~ret0 := fact(~n - 1);< 22538#factENTRY ~n := #in~n; 22546#L25 assume ~n <= 0;#res := 1; 22523#factFINAL assume true; 22529#factEXIT >#66#return; 22530#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22540#factFINAL assume true; 22486#factEXIT >#66#return; 22505#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22564#factFINAL assume true; 22556#factEXIT >#66#return; 22515#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22565#factFINAL assume true; 22513#factEXIT >#66#return; 22518#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22609#factFINAL assume true; 22594#factEXIT >#70#return; 22573#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 22591#factENTRY ~n := #in~n; 22602#L25 assume !(~n <= 0); 22491#L26 call #t~ret0 := fact(~n - 1);< 22538#factENTRY ~n := #in~n; 22546#L25 assume !(~n <= 0); 22488#L26 call #t~ret0 := fact(~n - 1);< 22538#factENTRY ~n := #in~n; 22546#L25 assume !(~n <= 0); 22488#L26 call #t~ret0 := fact(~n - 1);< 22538#factENTRY ~n := #in~n; 22546#L25 assume !(~n <= 0); 22488#L26 call #t~ret0 := fact(~n - 1);< 22538#factENTRY ~n := #in~n; 22546#L25 assume ~n <= 0;#res := 1; 22523#factFINAL assume true; 22529#factEXIT >#66#return; 22530#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22540#factFINAL assume true; 22486#factEXIT >#66#return; 22505#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22564#factFINAL assume true; 22556#factEXIT >#66#return; 22515#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22565#factFINAL assume true; 22513#factEXIT >#66#return; 22518#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 22609#factFINAL assume true; 22594#factEXIT >#72#return; 22595#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; 22617#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 22615#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 22422#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 22593#L43 [2021-12-16 09:21:44,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:44,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 7 times [2021-12-16 09:21:44,782 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:44,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283312961] [2021-12-16 09:21:44,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:44,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:44,786 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:44,807 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:44,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:44,807 INFO L85 PathProgramCache]: Analyzing trace with hash 778867824, now seen corresponding path program 2 times [2021-12-16 09:21:44,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:44,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619282610] [2021-12-16 09:21:44,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:44,808 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:44,817 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:21:44,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2017582883] [2021-12-16 09:21:44,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 09:21:44,818 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:44,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:44,820 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-16 09:21:44,821 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-16 09:21:44,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 09:21:44,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:21:44,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-16 09:21:44,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 40 proven. 338 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2021-12-16 09:21:45,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:21:46,157 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 40 proven. 366 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2021-12-16 09:21:46,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:46,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619282610] [2021-12-16 09:21:46,157 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 09:21:46,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017582883] [2021-12-16 09:21:46,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017582883] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:21:46,157 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 09:21:46,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22] total 25 [2021-12-16 09:21:46,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913254812] [2021-12-16 09:21:46,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 09:21:46,158 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:21:46,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:46,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-16 09:21:46,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2021-12-16 09:21:46,158 INFO L87 Difference]: Start difference. First operand 1308 states and 2716 transitions. cyclomatic complexity: 1419 Second operand has 25 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 22 states have internal predecessors, (51), 14 states have call successors, (15), 1 states have call predecessors, (15), 10 states have return successors, (21), 13 states have call predecessors, (21), 14 states have call successors, (21) [2021-12-16 09:21:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:46,802 INFO L93 Difference]: Finished difference Result 2147 states and 4461 transitions. [2021-12-16 09:21:46,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-16 09:21:46,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2147 states and 4461 transitions. [2021-12-16 09:21:46,827 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 391 [2021-12-16 09:21:46,863 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2147 states to 2063 states and 4305 transitions. [2021-12-16 09:21:46,863 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 684 [2021-12-16 09:21:46,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 684 [2021-12-16 09:21:46,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2063 states and 4305 transitions. [2021-12-16 09:21:46,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:46,865 INFO L681 BuchiCegarLoop]: Abstraction has 2063 states and 4305 transitions. [2021-12-16 09:21:46,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states and 4305 transitions. [2021-12-16 09:21:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 1428. [2021-12-16 09:21:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 806 states have (on average 1.1029776674937966) internal successors, (889), 789 states have internal predecessors, (889), 458 states have call successors, (458), 120 states have call predecessors, (458), 164 states have return successors, (1875), 518 states have call predecessors, (1875), 454 states have call successors, (1875) [2021-12-16 09:21:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 3222 transitions. [2021-12-16 09:21:46,917 INFO L704 BuchiCegarLoop]: Abstraction has 1428 states and 3222 transitions. [2021-12-16 09:21:46,917 INFO L587 BuchiCegarLoop]: Abstraction has 1428 states and 3222 transitions. [2021-12-16 09:21:46,917 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-16 09:21:46,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1428 states and 3222 transitions. [2021-12-16 09:21:46,925 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 213 [2021-12-16 09:21:46,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:46,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:46,926 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:21:46,926 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-16 09:21:46,926 INFO L791 eck$LassoCheckResult]: Stem: 26493#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 26464#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; 26465#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 26492#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; 26517#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 27427#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 26608#L43 [2021-12-16 09:21:46,926 INFO L793 eck$LassoCheckResult]: Loop: 26608#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; 26544#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 26572#factENTRY ~n := #in~n; 26610#L25 assume !(~n <= 0); 26587#L26 call #t~ret0 := fact(~n - 1);< 26614#factENTRY ~n := #in~n; 26615#L25 assume !(~n <= 0); 26583#L26 call #t~ret0 := fact(~n - 1);< 26614#factENTRY ~n := #in~n; 26615#L25 assume !(~n <= 0); 26583#L26 call #t~ret0 := fact(~n - 1);< 26614#factENTRY ~n := #in~n; 26615#L25 assume !(~n <= 0); 26583#L26 call #t~ret0 := fact(~n - 1);< 26614#factENTRY ~n := #in~n; 26615#L25 assume !(~n <= 0); 26583#L26 call #t~ret0 := fact(~n - 1);< 26614#factENTRY ~n := #in~n; 26615#L25 assume ~n <= 0;#res := 1; 26606#factFINAL assume true; 26580#factEXIT >#66#return; 26599#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26677#factFINAL assume true; 26669#factEXIT >#66#return; 26668#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26656#factFINAL assume true; 26647#factEXIT >#66#return; 26652#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26698#factFINAL assume true; 26690#factEXIT >#66#return; 26632#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26707#factFINAL assume true; 26619#factEXIT >#66#return; 26634#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26704#factFINAL assume true; 26703#factEXIT >#68#return; 26561#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 26572#factENTRY ~n := #in~n; 26610#L25 assume !(~n <= 0); 26587#L26 call #t~ret0 := fact(~n - 1);< 26614#factENTRY ~n := #in~n; 26615#L25 assume !(~n <= 0); 26583#L26 call #t~ret0 := fact(~n - 1);< 26614#factENTRY ~n := #in~n; 26615#L25 assume ~n <= 0;#res := 1; 26606#factFINAL assume true; 26580#factEXIT >#66#return; 26599#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26677#factFINAL assume true; 26669#factEXIT >#66#return; 26676#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26683#factFINAL assume true; 26679#factEXIT >#70#return; 26560#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 26572#factENTRY ~n := #in~n; 26610#L25 assume !(~n <= 0); 26587#L26 call #t~ret0 := fact(~n - 1);< 26614#factENTRY ~n := #in~n; 26615#L25 assume !(~n <= 0); 26583#L26 call #t~ret0 := fact(~n - 1);< 26614#factENTRY ~n := #in~n; 26615#L25 assume ~n <= 0;#res := 1; 26606#factFINAL assume true; 26580#factEXIT >#66#return; 26599#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26677#factFINAL assume true; 26669#factEXIT >#66#return; 26676#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26683#factFINAL assume true; 26679#factEXIT >#72#return; 26576#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; 26636#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 26616#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 26479#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 26608#L43 [2021-12-16 09:21:46,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:46,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 8 times [2021-12-16 09:21:46,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:46,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659625016] [2021-12-16 09:21:46,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:46,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:46,930 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:46,931 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:46,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:46,932 INFO L85 PathProgramCache]: Analyzing trace with hash -842618120, now seen corresponding path program 3 times [2021-12-16 09:21:46,932 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:46,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930049469] [2021-12-16 09:21:46,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:46,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:46,951 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:21:46,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [521914098] [2021-12-16 09:21:46,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-16 09:21:46,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:46,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:46,953 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-16 09:21:46,954 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-16 09:21:47,005 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-12-16 09:21:47,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:21:47,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 25 conjunts are in the unsatisfiable core [2021-12-16 09:21:47,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:47,202 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 65 proven. 160 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2021-12-16 09:21:47,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:21:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 65 proven. 192 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2021-12-16 09:21:48,183 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:48,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930049469] [2021-12-16 09:21:48,183 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 09:21:48,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521914098] [2021-12-16 09:21:48,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521914098] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:21:48,183 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 09:21:48,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 23 [2021-12-16 09:21:48,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325103264] [2021-12-16 09:21:48,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 09:21:48,184 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:21:48,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:48,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-16 09:21:48,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2021-12-16 09:21:48,184 INFO L87 Difference]: Start difference. First operand 1428 states and 3222 transitions. cyclomatic complexity: 1805 Second operand has 23 states, 20 states have (on average 2.25) internal successors, (45), 20 states have internal predecessors, (45), 13 states have call successors, (13), 1 states have call predecessors, (13), 9 states have return successors, (18), 11 states have call predecessors, (18), 13 states have call successors, (18) [2021-12-16 09:21:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:48,885 INFO L93 Difference]: Finished difference Result 2460 states and 4962 transitions. [2021-12-16 09:21:48,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-16 09:21:48,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2460 states and 4962 transitions. [2021-12-16 09:21:48,902 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 473 [2021-12-16 09:21:48,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2460 states to 2452 states and 4938 transitions. [2021-12-16 09:21:48,954 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 804 [2021-12-16 09:21:48,955 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 804 [2021-12-16 09:21:48,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2452 states and 4938 transitions. [2021-12-16 09:21:48,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:48,956 INFO L681 BuchiCegarLoop]: Abstraction has 2452 states and 4938 transitions. [2021-12-16 09:21:48,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states and 4938 transitions. [2021-12-16 09:21:49,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 1552. [2021-12-16 09:21:49,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 862 states have (on average 1.0962877030162412) internal successors, (945), 845 states have internal predecessors, (945), 526 states have call successors, (526), 148 states have call predecessors, (526), 164 states have return successors, (2055), 558 states have call predecessors, (2055), 518 states have call successors, (2055) [2021-12-16 09:21:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 3526 transitions. [2021-12-16 09:21:49,014 INFO L704 BuchiCegarLoop]: Abstraction has 1552 states and 3526 transitions. [2021-12-16 09:21:49,014 INFO L587 BuchiCegarLoop]: Abstraction has 1552 states and 3526 transitions. [2021-12-16 09:21:49,014 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-16 09:21:49,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1552 states and 3526 transitions. [2021-12-16 09:21:49,019 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 225 [2021-12-16 09:21:49,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:49,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:49,020 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:21:49,020 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-16 09:21:49,020 INFO L791 eck$LassoCheckResult]: Stem: 30888#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 30863#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; 30864#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 30887#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; 30908#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 31859#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 31078#L43 [2021-12-16 09:21:49,020 INFO L793 eck$LassoCheckResult]: Loop: 31078#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; 30938#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 31076#factENTRY ~n := #in~n; 31087#L25 assume !(~n <= 0); 30958#L26 call #t~ret0 := fact(~n - 1);< 31011#factENTRY ~n := #in~n; 31015#L25 assume !(~n <= 0); 30963#L26 call #t~ret0 := fact(~n - 1);< 31011#factENTRY ~n := #in~n; 31015#L25 assume !(~n <= 0); 30963#L26 call #t~ret0 := fact(~n - 1);< 31011#factENTRY ~n := #in~n; 31015#L25 assume !(~n <= 0); 30963#L26 call #t~ret0 := fact(~n - 1);< 31011#factENTRY ~n := #in~n; 31015#L25 assume ~n <= 0;#res := 1; 30989#factFINAL assume true; 30997#factEXIT >#66#return; 31001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31002#factFINAL assume true; 30979#factEXIT >#66#return; 30986#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31046#factFINAL assume true; 31038#factEXIT >#66#return; 31037#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31036#factFINAL assume true; 30940#factEXIT >#66#return; 30967#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31098#factFINAL assume true; 31096#factEXIT >#68#return; 31058#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 31076#factENTRY ~n := #in~n; 31087#L25 assume !(~n <= 0); 30958#L26 call #t~ret0 := fact(~n - 1);< 31011#factENTRY ~n := #in~n; 31015#L25 assume !(~n <= 0); 30963#L26 call #t~ret0 := fact(~n - 1);< 31011#factENTRY ~n := #in~n; 31015#L25 assume !(~n <= 0); 30963#L26 call #t~ret0 := fact(~n - 1);< 31011#factENTRY ~n := #in~n; 31015#L25 assume ~n <= 0;#res := 1; 30989#factFINAL assume true; 30997#factEXIT >#66#return; 31001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31002#factFINAL assume true; 30979#factEXIT >#66#return; 30986#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31046#factFINAL assume true; 31038#factEXIT >#66#return; 31040#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31092#factFINAL assume true; 31090#factEXIT >#70#return; 31061#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 31076#factENTRY ~n := #in~n; 31087#L25 assume !(~n <= 0); 30958#L26 call #t~ret0 := fact(~n - 1);< 31011#factENTRY ~n := #in~n; 31015#L25 assume !(~n <= 0); 30963#L26 call #t~ret0 := fact(~n - 1);< 31011#factENTRY ~n := #in~n; 31015#L25 assume !(~n <= 0); 30963#L26 call #t~ret0 := fact(~n - 1);< 31011#factENTRY ~n := #in~n; 31015#L25 assume ~n <= 0;#res := 1; 30989#factFINAL assume true; 30997#factEXIT >#66#return; 31001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31002#factFINAL assume true; 30979#factEXIT >#66#return; 30986#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31046#factFINAL assume true; 31038#factEXIT >#66#return; 31040#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 31092#factFINAL assume true; 31090#factEXIT >#72#return; 31081#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; 31108#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 31107#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 30876#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 31078#L43 [2021-12-16 09:21:49,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:49,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 9 times [2021-12-16 09:21:49,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:49,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442401681] [2021-12-16 09:21:49,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:49,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:49,025 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:49,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:49,033 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:49,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:49,034 INFO L85 PathProgramCache]: Analyzing trace with hash -256491728, now seen corresponding path program 4 times [2021-12-16 09:21:49,034 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:49,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801743812] [2021-12-16 09:21:49,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:49,034 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:49,044 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:21:49,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [177509763] [2021-12-16 09:21:49,044 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-16 09:21:49,045 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:49,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:49,053 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:21:49,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2021-12-16 09:21:49,118 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-16 09:21:49,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:21:49,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-16 09:21:49,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:49,316 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 37 proven. 242 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2021-12-16 09:21:49,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:21:50,285 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 37 proven. 268 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2021-12-16 09:21:50,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:50,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801743812] [2021-12-16 09:21:50,285 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 09:21:50,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177509763] [2021-12-16 09:21:50,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [177509763] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:21:50,286 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 09:21:50,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 23 [2021-12-16 09:21:50,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49030176] [2021-12-16 09:21:50,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 09:21:50,286 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:21:50,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:21:50,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-16 09:21:50,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=419, Unknown=0, NotChecked=0, Total=506 [2021-12-16 09:21:50,287 INFO L87 Difference]: Start difference. First operand 1552 states and 3526 transitions. cyclomatic complexity: 1985 Second operand has 23 states, 20 states have (on average 2.35) internal successors, (47), 20 states have internal predecessors, (47), 13 states have call successors, (14), 1 states have call predecessors, (14), 9 states have return successors, (19), 12 states have call predecessors, (19), 13 states have call successors, (19) [2021-12-16 09:21:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:21:51,045 INFO L93 Difference]: Finished difference Result 2652 states and 5150 transitions. [2021-12-16 09:21:51,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-16 09:21:51,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2652 states and 5150 transitions. [2021-12-16 09:21:51,062 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 509 [2021-12-16 09:21:51,086 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2652 states to 2652 states and 5150 transitions. [2021-12-16 09:21:51,086 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 868 [2021-12-16 09:21:51,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 868 [2021-12-16 09:21:51,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2652 states and 5150 transitions. [2021-12-16 09:21:51,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:21:51,088 INFO L681 BuchiCegarLoop]: Abstraction has 2652 states and 5150 transitions. [2021-12-16 09:21:51,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2652 states and 5150 transitions. [2021-12-16 09:21:51,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2652 to 1552. [2021-12-16 09:21:51,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 862 states have (on average 1.0962877030162412) internal successors, (945), 845 states have internal predecessors, (945), 526 states have call successors, (526), 148 states have call predecessors, (526), 164 states have return successors, (2055), 558 states have call predecessors, (2055), 518 states have call successors, (2055) [2021-12-16 09:21:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 3526 transitions. [2021-12-16 09:21:51,190 INFO L704 BuchiCegarLoop]: Abstraction has 1552 states and 3526 transitions. [2021-12-16 09:21:51,190 INFO L587 BuchiCegarLoop]: Abstraction has 1552 states and 3526 transitions. [2021-12-16 09:21:51,190 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-16 09:21:51,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1552 states and 3526 transitions. [2021-12-16 09:21:51,197 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 225 [2021-12-16 09:21:51,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:21:51,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:21:51,197 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-16 09:21:51,197 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-16 09:21:51,198 INFO L791 eck$LassoCheckResult]: Stem: 35613#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 35583#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; 35584#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 35612#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; 35635#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 36584#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 35827#L43 [2021-12-16 09:21:51,198 INFO L793 eck$LassoCheckResult]: Loop: 35827#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; 35664#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 35817#factENTRY ~n := #in~n; 35825#L25 assume !(~n <= 0); 35682#L26 call #t~ret0 := fact(~n - 1);< 35737#factENTRY ~n := #in~n; 35753#L25 assume ~n <= 0;#res := 1; 35718#factFINAL assume true; 35725#factEXIT >#66#return; 35736#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 35822#factFINAL assume true; 35820#factEXIT >#68#return; 35797#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 35817#factENTRY ~n := #in~n; 35825#L25 assume ~n <= 0;#res := 1; 35816#factFINAL assume true; 35794#factEXIT >#70#return; 35808#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 35824#factENTRY ~n := #in~n; 35826#L25 assume !(~n <= 0); 35682#L26 call #t~ret0 := fact(~n - 1);< 35737#factENTRY ~n := #in~n; 35753#L25 assume !(~n <= 0); 35688#L26 call #t~ret0 := fact(~n - 1);< 35737#factENTRY ~n := #in~n; 35753#L25 assume !(~n <= 0); 35688#L26 call #t~ret0 := fact(~n - 1);< 35737#factENTRY ~n := #in~n; 35753#L25 assume ~n <= 0;#res := 1; 35718#factFINAL assume true; 35725#factEXIT >#66#return; 35728#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 35729#factFINAL assume true; 35706#factEXIT >#66#return; 35712#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 35776#factFINAL assume true; 35777#factEXIT >#66#return; 35782#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 35839#factFINAL assume true; 35840#factEXIT >#72#return; 35821#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; 35850#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 35847#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 35600#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 35827#L43 [2021-12-16 09:21:51,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:51,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1126239088, now seen corresponding path program 10 times [2021-12-16 09:21:51,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:51,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692887409] [2021-12-16 09:21:51,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:51,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:51,202 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:51,208 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:51,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:51,208 INFO L85 PathProgramCache]: Analyzing trace with hash 946604608, now seen corresponding path program 5 times [2021-12-16 09:21:51,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:51,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459140826] [2021-12-16 09:21:51,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:51,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:51,213 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:21:51,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1498996739] [2021-12-16 09:21:51,213 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 09:21:51,213 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:51,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:51,216 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:21:51,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2021-12-16 09:21:51,334 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-12-16 09:21:51,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-16 09:21:51,334 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:21:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:21:51,351 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:21:51,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:21:51,352 INFO L85 PathProgramCache]: Analyzing trace with hash 35449647, now seen corresponding path program 1 times [2021-12-16 09:21:51,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:21:51,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370447213] [2021-12-16 09:21:51,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:51,352 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:21:51,356 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:21:51,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1156140078] [2021-12-16 09:21:51,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:21:51,357 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:21:51,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:51,358 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:21:51,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2021-12-16 09:21:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:21:51,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:21:51,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:21:51,494 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 49 proven. 1 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2021-12-16 09:21:51,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:21:51,589 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2021-12-16 09:21:51,589 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:21:51,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370447213] [2021-12-16 09:21:51,589 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 09:21:51,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156140078] [2021-12-16 09:21:51,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156140078] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:21:51,590 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 09:21:51,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-12-16 09:21:51,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873016576] [2021-12-16 09:21:51,590 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 09:21:52,427 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:21:52,427 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:21:52,427 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:21:52,427 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:21:52,427 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:21:52,427 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:52,427 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:21:52,427 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:21:52,427 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2021-12-16 09:21:52,427 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:21:52,427 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:21:52,428 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-16 09:21:52,430 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-16 09:21:52,432 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-16 09:21:52,477 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-16 09:21:52,482 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-16 09:21:52,483 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-16 09:21:59,901 WARN L227 SmtUtils]: Spent 7.10s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2021-12-16 09:21:59,904 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:21:59,905 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:21:59,905 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:59,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:59,906 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-16 09:21:59,907 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-16 09:21:59,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:59,909 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:59,915 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:59,915 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-16 09:21:59,930 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-16 09:21:59,930 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:59,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:59,931 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-16 09:21:59,932 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-16 09:21:59,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:59,933 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:59,940 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:21:59,940 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-16 09:21:59,955 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-16 09:21:59,956 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:59,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:59,957 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-16 09:21:59,957 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-16 09:21:59,958 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:21:59,958 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:21:59,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2021-12-16 09:21:59,984 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:21:59,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:21:59,985 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-16 09:21:59,985 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-16 09:21:59,986 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:21:59,986 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:22:00,011 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:22:00,026 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-16 09:22:00,027 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:22:00,027 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:22:00,027 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:22:00,027 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:22:00,028 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:22:00,028 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:00,028 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:22:00,028 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:22:00,028 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration15_Loop [2021-12-16 09:22:00,028 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:22:00,028 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:22:00,029 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-16 09:22:00,030 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-16 09:22:00,076 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-16 09:22:00,078 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-16 09:22:00,088 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-16 09:22:00,089 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-16 09:22:06,650 WARN L227 SmtUtils]: Spent 6.26s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2021-12-16 09:22:06,659 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:22:06,659 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:22:06,659 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:06,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:06,660 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-16 09:22:06,661 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-16 09:22:06,662 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-16 09:22:06,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:22:06,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:22:06,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:22:06,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:22:06,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:22:06,668 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:22:06,668 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:22:06,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:22:06,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2021-12-16 09:22:06,695 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:06,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:06,696 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-16 09:22:06,697 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-16 09:22:06,699 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-16 09:22:06,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:22:06,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:22:06,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:22:06,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:22:06,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:22:06,708 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:22:06,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:22:06,727 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:22:06,731 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2021-12-16 09:22:06,731 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-16 09:22:06,731 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:06,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:06,737 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-16 09:22:06,738 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-16 09:22:06,739 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:22:06,739 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 09:22:06,739 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:22:06,739 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-16 09:22:06,755 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-16 09:22:06,755 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 09:22:06,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:22:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:22:06,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-16 09:22:06,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:22:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:22:06,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 18 conjunts are in the unsatisfiable core [2021-12-16 09:22:06,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:22:06,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2021-12-16 09:22:06,965 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-16 09:22:06,966 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-16 09:22:06,966 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1552 states and 3526 transitions. cyclomatic complexity: 1985 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-16 09:22:07,064 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1552 states and 3526 transitions. cyclomatic complexity: 1985. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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) Result 4593 states and 10494 transitions. Complement of second has 11 states. [2021-12-16 09:22:07,065 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-16 09:22:07,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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-16 09:22:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 35 transitions. [2021-12-16 09:22:07,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 6 letters. Loop has 44 letters. [2021-12-16 09:22:07,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:22:07,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 50 letters. Loop has 44 letters. [2021-12-16 09:22:07,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:22:07,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 35 transitions. Stem has 6 letters. Loop has 88 letters. [2021-12-16 09:22:07,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:22:07,068 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4593 states and 10494 transitions. [2021-12-16 09:22:07,108 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 228 [2021-12-16 09:22:07,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4593 states to 3941 states and 8651 transitions. [2021-12-16 09:22:07,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 888 [2021-12-16 09:22:07,203 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 904 [2021-12-16 09:22:07,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3941 states and 8651 transitions. [2021-12-16 09:22:07,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:22:07,203 INFO L681 BuchiCegarLoop]: Abstraction has 3941 states and 8651 transitions. [2021-12-16 09:22:07,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states and 8651 transitions. [2021-12-16 09:22:07,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 3740. [2021-12-16 09:22:07,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3740 states, 2056 states have (on average 1.0997081712062258) internal successors, (2261), 2032 states have internal predecessors, (2261), 1258 states have call successors, (1258), 367 states have call predecessors, (1258), 426 states have return successors, (4781), 1340 states have call predecessors, (4781), 1236 states have call successors, (4781) [2021-12-16 09:22:07,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 8300 transitions. [2021-12-16 09:22:07,350 INFO L704 BuchiCegarLoop]: Abstraction has 3740 states and 8300 transitions. [2021-12-16 09:22:07,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:22:07,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 09:22:07,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 09:22:07,351 INFO L87 Difference]: Start difference. First operand 3740 states and 8300 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 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-16 09:22:07,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:22:07,478 INFO L93 Difference]: Finished difference Result 2491 states and 5094 transitions. [2021-12-16 09:22:07,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-16 09:22:07,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2491 states and 5094 transitions. [2021-12-16 09:22:07,497 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 228 [2021-12-16 09:22:07,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2491 states to 2374 states and 4968 transitions. [2021-12-16 09:22:07,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 618 [2021-12-16 09:22:07,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 618 [2021-12-16 09:22:07,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2374 states and 4968 transitions. [2021-12-16 09:22:07,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:22:07,520 INFO L681 BuchiCegarLoop]: Abstraction has 2374 states and 4968 transitions. [2021-12-16 09:22:07,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states and 4968 transitions. [2021-12-16 09:22:07,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 2307. [2021-12-16 09:22:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 1302 states have (on average 1.1013824884792627) internal successors, (1434), 1291 states have internal predecessors, (1434), 736 states have call successors, (736), 231 states have call predecessors, (736), 269 states have return successors, (2711), 784 states have call predecessors, (2711), 720 states have call successors, (2711) [2021-12-16 09:22:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 4881 transitions. [2021-12-16 09:22:07,633 INFO L704 BuchiCegarLoop]: Abstraction has 2307 states and 4881 transitions. [2021-12-16 09:22:07,633 INFO L587 BuchiCegarLoop]: Abstraction has 2307 states and 4881 transitions. [2021-12-16 09:22:07,634 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-12-16 09:22:07,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2307 states and 4881 transitions. [2021-12-16 09:22:07,641 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 228 [2021-12-16 09:22:07,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:22:07,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:22:07,641 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:22:07,641 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-16 09:22:07,642 INFO L791 eck$LassoCheckResult]: Stem: 48445#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 48413#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; 48414#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 48444#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; 48428#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 48429#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 48899#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; 48821#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 48932#factENTRY ~n := #in~n; 48928#L25 assume !(~n <= 0); 48371#L26 call #t~ret0 := fact(~n - 1);< 49157#factENTRY [2021-12-16 09:22:07,642 INFO L793 eck$LassoCheckResult]: Loop: 49157#factENTRY ~n := #in~n; 49159#L25 assume !(~n <= 0); 48372#L26 call #t~ret0 := fact(~n - 1);< 49157#factENTRY [2021-12-16 09:22:07,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:22:07,642 INFO L85 PathProgramCache]: Analyzing trace with hash 271623377, now seen corresponding path program 1 times [2021-12-16 09:22:07,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:22:07,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889922824] [2021-12-16 09:22:07,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:22:07,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:22:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:22:07,668 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-16 09:22:07,668 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:22:07,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889922824] [2021-12-16 09:22:07,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889922824] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:22:07,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:22:07,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-16 09:22:07,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336755898] [2021-12-16 09:22:07,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:22:07,669 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:22:07,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:22:07,669 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 1 times [2021-12-16 09:22:07,669 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:22:07,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759770259] [2021-12-16 09:22:07,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:22:07,669 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:22:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:22:07,672 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:22:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:22:07,674 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:22:07,710 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:22:07,711 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:22:07,711 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:22:07,711 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:22:07,711 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:22:07,711 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:07,711 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:22:07,711 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:22:07,712 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration16_Loop [2021-12-16 09:22:07,712 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:22:07,712 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:22:07,712 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-16 09:22:07,714 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-16 09:22:07,715 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-16 09:22:07,717 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-16 09:22:07,738 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:22:07,739 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:22:07,739 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:07,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:07,740 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-16 09:22:07,741 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-16 09:22:07,742 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:22:07,743 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:22:07,755 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:22:07,755 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-16 09:22:07,773 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-16 09:22:07,774 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:07,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:07,775 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-16 09:22:07,776 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-16 09:22:07,778 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:22:07,778 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:22:07,799 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:22:07,799 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 09:22:07,817 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-16 09:22:07,817 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:07,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:07,818 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-16 09:22:07,819 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-16 09:22:07,821 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:22:07,821 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:22:07,847 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-16 09:22:07,847 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-16 09:22:07,866 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-16 09:22:07,866 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:07,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:07,867 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-16 09:22:07,869 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-16 09:22:07,870 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:22:07,870 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:22:07,922 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-16 09:22:07,923 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:07,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:07,924 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-16 09:22:07,925 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-16 09:22:07,927 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:22:07,927 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:22:07,995 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:22:08,001 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-16 09:22:08,001 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:22:08,002 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:22:08,002 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:22:08,002 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:22:08,002 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:22:08,002 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:08,002 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:22:08,002 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:22:08,002 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration16_Loop [2021-12-16 09:22:08,002 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:22:08,002 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:22:08,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-16 09:22:08,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-16 09:22:08,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-16 09:22:08,011 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-16 09:22:08,028 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:22:08,028 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:22:08,028 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:08,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:08,029 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-16 09:22:08,053 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-16 09:22:08,059 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:22:08,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:22:08,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:22:08,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:22:08,059 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:22:08,059 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:22:08,059 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:22:08,063 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-16 09:22:08,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:22:08,085 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2021-12-16 09:22:08,086 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:08,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:08,087 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-16 09:22:08,087 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-16 09:22:08,088 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-16 09:22:08,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:22:08,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:22:08,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:22:08,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:22:08,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:22:08,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:22:08,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:22:08,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-16 09:22:08,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2021-12-16 09:22:08,109 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:08,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:08,110 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-16 09:22:08,111 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-16 09:22:08,112 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-16 09:22:08,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:22:08,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:22:08,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:22:08,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:22:08,118 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:22:08,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:22:08,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:22:08,119 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:22:08,121 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-16 09:22:08,121 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-16 09:22:08,121 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:08,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:08,122 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-16 09:22:08,123 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-16 09:22:08,123 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:22:08,123 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 09:22:08,123 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:22:08,123 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2021-12-16 09:22:08,138 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-16 09:22:08,138 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 09:22:08,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:22:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:22:08,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:22:08,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:22:08,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:22:08,206 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 09:22:08,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:22:08,228 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-16 09:22:08,228 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-16 09:22:08,229 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2307 states and 4881 transitions. cyclomatic complexity: 2596 Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:22:08,294 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2307 states and 4881 transitions. cyclomatic complexity: 2596. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 2534 states and 5294 transitions. Complement of second has 13 states. [2021-12-16 09:22:08,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2021-12-16 09:22:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:22:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2021-12-16 09:22:08,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 3 letters. [2021-12-16 09:22:08,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:22:08,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 3 letters. [2021-12-16 09:22:08,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:22:08,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 6 letters. [2021-12-16 09:22:08,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:22:08,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2534 states and 5294 transitions. [2021-12-16 09:22:08,319 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 228 [2021-12-16 09:22:08,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2534 states to 2467 states and 5198 transitions. [2021-12-16 09:22:08,345 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 618 [2021-12-16 09:22:08,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 620 [2021-12-16 09:22:08,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2467 states and 5198 transitions. [2021-12-16 09:22:08,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:22:08,346 INFO L681 BuchiCegarLoop]: Abstraction has 2467 states and 5198 transitions. [2021-12-16 09:22:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2467 states and 5198 transitions. [2021-12-16 09:22:08,456 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-16 09:22:08,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2467 to 2457. [2021-12-16 09:22:08,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 1394 states have (on average 1.1119081779053084) internal successors, (1550), 1400 states have internal predecessors, (1550), 775 states have call successors, (775), 257 states have call predecessors, (775), 288 states have return successors, (2838), 799 states have call predecessors, (2838), 759 states have call successors, (2838) [2021-12-16 09:22:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 5163 transitions. [2021-12-16 09:22:08,511 INFO L704 BuchiCegarLoop]: Abstraction has 2457 states and 5163 transitions. [2021-12-16 09:22:08,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:22:08,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-16 09:22:08,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-16 09:22:08,512 INFO L87 Difference]: Start difference. First operand 2457 states and 5163 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-16 09:22:08,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:22:08,575 INFO L93 Difference]: Finished difference Result 2496 states and 5193 transitions. [2021-12-16 09:22:08,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 09:22:08,588 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2496 states and 5193 transitions. [2021-12-16 09:22:08,662 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 228 [2021-12-16 09:22:08,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2496 states to 2496 states and 5193 transitions. [2021-12-16 09:22:08,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 624 [2021-12-16 09:22:08,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 624 [2021-12-16 09:22:08,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2496 states and 5193 transitions. [2021-12-16 09:22:08,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:22:08,688 INFO L681 BuchiCegarLoop]: Abstraction has 2496 states and 5193 transitions. [2021-12-16 09:22:08,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states and 5193 transitions. [2021-12-16 09:22:08,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2478. [2021-12-16 09:22:08,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 1412 states have (on average 1.1104815864022664) internal successors, (1568), 1415 states have internal predecessors, (1568), 772 states have call successors, (772), 263 states have call predecessors, (772), 294 states have return successors, (2835), 799 states have call predecessors, (2835), 756 states have call successors, (2835) [2021-12-16 09:22:08,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 5175 transitions. [2021-12-16 09:22:08,760 INFO L704 BuchiCegarLoop]: Abstraction has 2478 states and 5175 transitions. [2021-12-16 09:22:08,760 INFO L587 BuchiCegarLoop]: Abstraction has 2478 states and 5175 transitions. [2021-12-16 09:22:08,760 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-12-16 09:22:08,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2478 states and 5175 transitions. [2021-12-16 09:22:08,770 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 228 [2021-12-16 09:22:08,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:22:08,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:22:08,772 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-16 09:22:08,772 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2021-12-16 09:22:08,773 INFO L791 eck$LassoCheckResult]: Stem: 58310#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 58278#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; 58279#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 58309#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; 58293#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 58294#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 58311#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; 58312#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 58940#factENTRY ~n := #in~n; 58942#L25 assume ~n <= 0;#res := 1; 58941#factFINAL assume true; 58939#factEXIT >#68#return; 58933#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 58935#factENTRY ~n := #in~n; 58937#L25 assume !(~n <= 0); 58938#L26 call #t~ret0 := fact(~n - 1);< 59003#factENTRY ~n := #in~n; 59020#L25 assume ~n <= 0;#res := 1; 59002#factFINAL assume true; 58973#factEXIT >#66#return; 58972#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58964#factFINAL assume true; 58953#factEXIT >#70#return; 58956#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 58997#factENTRY ~n := #in~n; 59000#L25 assume ~n <= 0;#res := 1; 58996#factFINAL assume true; 58966#factEXIT >#72#return; 58967#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; 59054#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 59055#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 59106#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 58986#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; 58240#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 58241#factENTRY ~n := #in~n; 58276#L25 assume !(~n <= 0); 59179#L26 call #t~ret0 := fact(~n - 1);< 59182#factENTRY [2021-12-16 09:22:08,773 INFO L793 eck$LassoCheckResult]: Loop: 59182#factENTRY ~n := #in~n; 59190#L25 assume !(~n <= 0); 59180#L26 call #t~ret0 := fact(~n - 1);< 59182#factENTRY [2021-12-16 09:22:08,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:22:08,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1605874444, now seen corresponding path program 1 times [2021-12-16 09:22:08,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:22:08,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715879247] [2021-12-16 09:22:08,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:22:08,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:22:08,820 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:22:08,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1072218690] [2021-12-16 09:22:08,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:22:08,821 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:22:08,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:08,832 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:22:08,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2021-12-16 09:22:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:22:08,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-16 09:22:08,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:22:08,990 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-16 09:22:08,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:22:09,069 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-16 09:22:09,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:22:09,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715879247] [2021-12-16 09:22:09,070 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 09:22:09,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072218690] [2021-12-16 09:22:09,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072218690] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:22:09,070 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 09:22:09,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-12-16 09:22:09,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404054794] [2021-12-16 09:22:09,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 09:22:09,070 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:22:09,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:22:09,071 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 2 times [2021-12-16 09:22:09,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:22:09,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094330381] [2021-12-16 09:22:09,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:22:09,071 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:22:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:22:09,073 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:22:09,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:22:09,074 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:22:09,110 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:22:09,110 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:22:09,110 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:22:09,110 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:22:09,110 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-16 09:22:09,110 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:09,110 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:22:09,110 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:22:09,110 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration17_Loop [2021-12-16 09:22:09,110 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:22:09,110 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:22:09,111 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-16 09:22:09,116 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-16 09:22:09,117 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-16 09:22:09,119 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-16 09:22:09,135 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:22:09,135 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-16 09:22:09,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:09,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:09,136 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-16 09:22:09,137 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-16 09:22:09,138 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-16 09:22:09,138 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:22:09,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2021-12-16 09:22:09,159 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:09,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:09,160 INFO L229 MonitoredProcess]: Starting monitored process 75 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-16 09:22:09,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-12-16 09:22:09,162 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-16 09:22:09,162 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-16 09:22:09,224 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-16 09:22:09,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2021-12-16 09:22:09,232 INFO L210 LassoAnalysis]: Preferences: [2021-12-16 09:22:09,232 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-16 09:22:09,232 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-16 09:22:09,232 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-16 09:22:09,232 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-16 09:22:09,232 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:09,232 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-16 09:22:09,232 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-16 09:22:09,232 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration17_Loop [2021-12-16 09:22:09,232 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-16 09:22:09,232 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-16 09:22:09,233 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-16 09:22:09,238 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-16 09:22:09,240 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-16 09:22:09,241 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-16 09:22:09,259 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-16 09:22:09,259 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-16 09:22:09,259 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:09,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:09,261 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-16 09:22:09,261 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-16 09:22:09,262 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-16 09:22:09,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-16 09:22:09,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-16 09:22:09,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-16 09:22:09,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-16 09:22:09,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-16 09:22:09,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-16 09:22:09,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-16 09:22:09,273 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-16 09:22:09,275 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-16 09:22:09,275 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2021-12-16 09:22:09,275 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-16 09:22:09,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:09,276 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-16 09:22:09,276 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-16 09:22:09,277 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-16 09:22:09,277 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-16 09:22:09,277 INFO L513 LassoAnalysis]: Proved termination. [2021-12-16 09:22:09,277 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2021-12-16 09:22:09,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2021-12-16 09:22:09,293 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-16 09:22:09,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:22:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:22:09,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 09:22:09,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:22:09,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:22:09,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 09:22:09,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:22:09,555 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-16 09:22:09,555 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-16 09:22:09,555 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2478 states and 5175 transitions. cyclomatic complexity: 2728 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-16 09:22:09,692 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2478 states and 5175 transitions. cyclomatic complexity: 2728. 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 2545 states and 5267 transitions. Complement of second has 13 states. [2021-12-16 09:22:09,693 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-16 09:22:09,693 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-16 09:22:09,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2021-12-16 09:22:09,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 37 letters. Loop has 3 letters. [2021-12-16 09:22:09,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:22:09,693 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:22:09,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:22:09,711 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-16 09:22:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:22:09,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 09:22:09,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:22:09,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:22:09,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 09:22:09,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:22:09,981 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-16 09:22:09,982 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-16 09:22:09,982 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2478 states and 5175 transitions. cyclomatic complexity: 2728 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-16 09:22:10,062 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2478 states and 5175 transitions. cyclomatic complexity: 2728. 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 2545 states and 5267 transitions. Complement of second has 13 states. [2021-12-16 09:22:10,063 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-16 09:22:10,063 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-16 09:22:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2021-12-16 09:22:10,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 37 letters. Loop has 3 letters. [2021-12-16 09:22:10,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:22:10,064 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2021-12-16 09:22:10,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:22:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:22:10,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-16 09:22:10,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:22:10,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:22:10,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 09:22:10,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:22:10,308 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-16 09:22:10,308 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-16 09:22:10,309 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2478 states and 5175 transitions. cyclomatic complexity: 2728 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-16 09:22:10,408 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2478 states and 5175 transitions. cyclomatic complexity: 2728. 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 2795 states and 5606 transitions. Complement of second has 16 states. [2021-12-16 09:22:10,408 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-16 09:22:10,409 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-16 09:22:10,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2021-12-16 09:22:10,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 37 letters. Loop has 3 letters. [2021-12-16 09:22:10,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:22:10,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 40 letters. Loop has 3 letters. [2021-12-16 09:22:10,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:22:10,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 37 letters. Loop has 6 letters. [2021-12-16 09:22:10,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-16 09:22:10,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2795 states and 5606 transitions. [2021-12-16 09:22:10,428 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 222 [2021-12-16 09:22:10,446 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2795 states to 2213 states and 4703 transitions. [2021-12-16 09:22:10,446 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 504 [2021-12-16 09:22:10,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 507 [2021-12-16 09:22:10,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2213 states and 4703 transitions. [2021-12-16 09:22:10,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:22:10,447 INFO L681 BuchiCegarLoop]: Abstraction has 2213 states and 4703 transitions. [2021-12-16 09:22:10,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2213 states and 4703 transitions. [2021-12-16 09:22:10,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2213 to 2136. [2021-12-16 09:22:10,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2136 states, 1214 states have (on average 1.1046128500823724) internal successors, (1341), 1203 states have internal predecessors, (1341), 674 states have call successors, (674), 228 states have call predecessors, (674), 248 states have return successors, (2536), 704 states have call predecessors, (2536), 674 states have call successors, (2536) [2021-12-16 09:22:10,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4551 transitions. [2021-12-16 09:22:10,495 INFO L704 BuchiCegarLoop]: Abstraction has 2136 states and 4551 transitions. [2021-12-16 09:22:10,496 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:22:10,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 09:22:10,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-16 09:22:10,496 INFO L87 Difference]: Start difference. First operand 2136 states and 4551 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-16 09:22:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:22:10,614 INFO L93 Difference]: Finished difference Result 2282 states and 4824 transitions. [2021-12-16 09:22:10,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-16 09:22:10,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2282 states and 4824 transitions. [2021-12-16 09:22:10,631 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 243 [2021-12-16 09:22:10,649 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2282 states to 2282 states and 4824 transitions. [2021-12-16 09:22:10,649 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 539 [2021-12-16 09:22:10,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 539 [2021-12-16 09:22:10,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2282 states and 4824 transitions. [2021-12-16 09:22:10,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:22:10,650 INFO L681 BuchiCegarLoop]: Abstraction has 2282 states and 4824 transitions. [2021-12-16 09:22:10,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2282 states and 4824 transitions. [2021-12-16 09:22:10,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2282 to 2167. [2021-12-16 09:22:10,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2167 states, 1222 states have (on average 1.1039279869067102) internal successors, (1349), 1217 states have internal predecessors, (1349), 697 states have call successors, (697), 228 states have call predecessors, (697), 248 states have return successors, (2578), 721 states have call predecessors, (2578), 697 states have call successors, (2578) [2021-12-16 09:22:10,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 4624 transitions. [2021-12-16 09:22:10,718 INFO L704 BuchiCegarLoop]: Abstraction has 2167 states and 4624 transitions. [2021-12-16 09:22:10,718 INFO L587 BuchiCegarLoop]: Abstraction has 2167 states and 4624 transitions. [2021-12-16 09:22:10,718 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-12-16 09:22:10,719 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2167 states and 4624 transitions. [2021-12-16 09:22:10,725 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 228 [2021-12-16 09:22:10,725 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:22:10,725 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:22:10,726 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-16 09:22:10,726 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [39, 39, 30, 30, 30, 30, 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-16 09:22:10,726 INFO L791 eck$LassoCheckResult]: Stem: 73765#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 73734#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; 73735#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 73764#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; 73749#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 73750#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 74748#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; 74743#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74744#factENTRY ~n := #in~n; 74746#L25 assume ~n <= 0;#res := 1; 74745#factFINAL assume true; 74742#factEXIT >#68#return; 74736#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74738#factENTRY ~n := #in~n; 74740#L25 assume ~n <= 0;#res := 1; 74739#factFINAL assume true; 74734#factEXIT >#70#return; 74735#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74738#factENTRY ~n := #in~n; 74740#L25 assume ~n <= 0;#res := 1; 74739#factFINAL assume true; 74734#factEXIT >#72#return; 74731#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; 74698#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 74697#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 74369#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 74370#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; 74336#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74364#factENTRY ~n := #in~n; 74931#L25 assume ~n <= 0;#res := 1; 74932#factFINAL assume true; 74936#factEXIT >#74#return; 74916#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74934#factENTRY ~n := #in~n; 74937#L25 assume ~n <= 0;#res := 1; 74935#factFINAL assume true; 74933#factEXIT >#76#return; 74915#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74930#factENTRY ~n := #in~n; 74920#L25 assume !(~n <= 0); 74774#L26 call #t~ret0 := fact(~n - 1);< 74809#factENTRY ~n := #in~n; 74922#L25 assume ~n <= 0;#res := 1; 74919#factFINAL assume true; 74806#factEXIT >#66#return; 74805#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74929#factFINAL assume true; 74914#factEXIT >#78#return; 74307#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; 74304#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 74301#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 74299#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 74297#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 74293#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 73911#L42-3 [2021-12-16 09:22:10,727 INFO L793 eck$LassoCheckResult]: Loop: 73911#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 73909#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; 73855#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 73871#factENTRY ~n := #in~n; 73950#L25 assume !(~n <= 0); 73887#L26 call #t~ret0 := fact(~n - 1);< 73943#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73983#L25 assume ~n <= 0;#res := 1; 73981#factFINAL assume true; 73977#factEXIT >#66#return; 73974#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73972#factFINAL assume true; 73962#factEXIT >#66#return; 73952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73947#factFINAL assume true; 73918#factEXIT >#66#return; 73936#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73971#factFINAL assume true; 73953#factEXIT >#66#return; 73954#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73996#factFINAL assume true; 73988#factEXIT >#66#return; 73987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73986#factFINAL assume true; 73913#factEXIT >#68#return; 73856#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 73871#factENTRY ~n := #in~n; 73950#L25 assume ~n <= 0;#res := 1; 73870#factFINAL assume true; 73843#factEXIT >#70#return; 73862#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 73979#factENTRY ~n := #in~n; 73975#L25 assume !(~n <= 0); 73932#L26 call #t~ret0 := fact(~n - 1);< 73741#factENTRY ~n := #in~n; 73980#L25 assume !(~n <= 0); 73933#L26 call #t~ret0 := fact(~n - 1);< 73948#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73983#L25 assume ~n <= 0;#res := 1; 73981#factFINAL assume true; 73977#factEXIT >#66#return; 73974#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73972#factFINAL assume true; 73962#factEXIT >#66#return; 73952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73947#factFINAL assume true; 73918#factEXIT >#66#return; 73936#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73971#factFINAL assume true; 73953#factEXIT >#66#return; 73954#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73996#factFINAL assume true; 73988#factEXIT >#66#return; 73987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73986#factFINAL assume true; 73913#factEXIT >#72#return; 73864#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; 73999#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 73997#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 73985#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 73876#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; 73853#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 73871#factENTRY ~n := #in~n; 73950#L25 assume !(~n <= 0); 73887#L26 call #t~ret0 := fact(~n - 1);< 73943#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73983#L25 assume ~n <= 0;#res := 1; 73981#factFINAL assume true; 73977#factEXIT >#66#return; 73974#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73972#factFINAL assume true; 73962#factEXIT >#66#return; 73952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73947#factFINAL assume true; 73918#factEXIT >#66#return; 73936#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73971#factFINAL assume true; 73953#factEXIT >#66#return; 73949#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73945#factFINAL assume true; 73944#factEXIT >#68#return; 73857#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 73871#factENTRY ~n := #in~n; 73950#L25 assume !(~n <= 0); 73887#L26 call #t~ret0 := fact(~n - 1);< 73943#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73983#L25 assume ~n <= 0;#res := 1; 73981#factFINAL assume true; 73977#factEXIT >#66#return; 73974#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73972#factFINAL assume true; 73962#factEXIT >#66#return; 73952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73947#factFINAL assume true; 73918#factEXIT >#66#return; 73936#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73971#factFINAL assume true; 73953#factEXIT >#66#return; 73954#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73996#factFINAL assume true; 73988#factEXIT >#66#return; 73987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73986#factFINAL assume true; 73913#factEXIT >#70#return; 73845#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 73869#factENTRY ~n := #in~n; 73872#L25 assume ~n <= 0;#res := 1; 73870#factFINAL assume true; 73843#factEXIT >#72#return; 73842#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; 73841#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 73840#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 73839#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 73837#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; 73808#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 73836#factENTRY ~n := #in~n; 74012#L25 assume !(~n <= 0); 73895#L26 call #t~ret0 := fact(~n - 1);< 73943#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73983#L25 assume ~n <= 0;#res := 1; 73981#factFINAL assume true; 73977#factEXIT >#66#return; 73974#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73972#factFINAL assume true; 73962#factEXIT >#66#return; 73952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73947#factFINAL assume true; 73918#factEXIT >#66#return; 73936#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73971#factFINAL assume true; 73953#factEXIT >#66#return; 73954#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73996#factFINAL assume true; 73988#factEXIT >#66#return; 73989#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74019#factFINAL assume true; 74017#factEXIT >#74#return; 73809#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 73836#factENTRY ~n := #in~n; 74012#L25 assume !(~n <= 0); 73895#L26 call #t~ret0 := fact(~n - 1);< 73943#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73982#L25 assume !(~n <= 0); 73920#L26 call #t~ret0 := fact(~n - 1);< 73978#factENTRY ~n := #in~n; 73983#L25 assume ~n <= 0;#res := 1; 73981#factFINAL assume true; 73977#factEXIT >#66#return; 73974#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73972#factFINAL assume true; 73962#factEXIT >#66#return; 73952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73947#factFINAL assume true; 73918#factEXIT >#66#return; 73936#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73971#factFINAL assume true; 73953#factEXIT >#66#return; 73954#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 73996#factFINAL assume true; 73988#factEXIT >#66#return; 73989#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74019#factFINAL assume true; 74017#factEXIT >#76#return; 73814#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74016#factENTRY ~n := #in~n; 74024#L25 assume !(~n <= 0); 73895#L26 call #t~ret0 := fact(~n - 1);< 73943#factENTRY ~n := #in~n; 73910#L25 assume ~n <= 0;#res := 1; 73907#factFINAL assume true; 73882#factEXIT >#66#return; 73899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74020#factFINAL assume true; 74015#factEXIT >#78#return; 73803#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; 73802#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 73801#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 73799#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 73760#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 73761#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 73911#L42-3 [2021-12-16 09:22:10,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:22:10,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1078509977, now seen corresponding path program 1 times [2021-12-16 09:22:10,727 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:22:10,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583776296] [2021-12-16 09:22:10,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:22:10,728 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:22:10,731 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:22:10,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1399308725] [2021-12-16 09:22:10,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:22:10,731 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:22:10,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:10,732 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:22:10,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2021-12-16 09:22:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-16 09:22:10,802 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-16 09:22:10,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:22:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-12-16 09:22:10,880 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-16 09:22:10,880 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:22:10,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583776296] [2021-12-16 09:22:10,880 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 09:22:10,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399308725] [2021-12-16 09:22:10,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399308725] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-16 09:22:10,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-16 09:22:10,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-16 09:22:10,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547970377] [2021-12-16 09:22:10,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-16 09:22:10,881 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-16 09:22:10,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:22:10,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1391101475, now seen corresponding path program 5 times [2021-12-16 09:22:10,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:22:10,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997119670] [2021-12-16 09:22:10,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:22:10,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:22:10,887 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:22:10,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2089043235] [2021-12-16 09:22:10,888 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-16 09:22:10,888 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:22:10,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:10,889 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:22:10,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2021-12-16 09:22:11,045 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2021-12-16 09:22:11,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:22:11,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-16 09:22:11,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:22:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3851 backedges. 2072 proven. 68 refuted. 0 times theorem prover too weak. 1711 trivial. 0 not checked. [2021-12-16 09:22:11,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:22:11,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3851 backedges. 214 proven. 248 refuted. 0 times theorem prover too weak. 3389 trivial. 0 not checked. [2021-12-16 09:22:11,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:22:11,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997119670] [2021-12-16 09:22:11,977 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 09:22:11,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089043235] [2021-12-16 09:22:11,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089043235] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:22:11,978 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 09:22:11,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2021-12-16 09:22:11,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168431253] [2021-12-16 09:22:11,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 09:22:11,978 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:22:11,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:22:11,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-16 09:22:11,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-16 09:22:11,979 INFO L87 Difference]: Start difference. First operand 2167 states and 4624 transitions. cyclomatic complexity: 2477 Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-16 09:22:12,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:22:12,110 INFO L93 Difference]: Finished difference Result 2157 states and 4483 transitions. [2021-12-16 09:22:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-16 09:22:12,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2157 states and 4483 transitions. [2021-12-16 09:22:12,125 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 237 [2021-12-16 09:22:12,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2157 states to 2115 states and 4427 transitions. [2021-12-16 09:22:12,143 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 533 [2021-12-16 09:22:12,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 533 [2021-12-16 09:22:12,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2115 states and 4427 transitions. [2021-12-16 09:22:12,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2021-12-16 09:22:12,144 INFO L681 BuchiCegarLoop]: Abstraction has 2115 states and 4427 transitions. [2021-12-16 09:22:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states and 4427 transitions. [2021-12-16 09:22:12,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 1909. [2021-12-16 09:22:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1909 states, 1083 states have (on average 1.0932594644506002) internal successors, (1184), 1070 states have internal predecessors, (1184), 604 states have call successors, (604), 203 states have call predecessors, (604), 222 states have return successors, (2209), 635 states have call predecessors, (2209), 604 states have call successors, (2209) [2021-12-16 09:22:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1909 states to 1909 states and 3997 transitions. [2021-12-16 09:22:12,219 INFO L704 BuchiCegarLoop]: Abstraction has 1909 states and 3997 transitions. [2021-12-16 09:22:12,219 INFO L587 BuchiCegarLoop]: Abstraction has 1909 states and 3997 transitions. [2021-12-16 09:22:12,219 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-12-16 09:22:12,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1909 states and 3997 transitions. [2021-12-16 09:22:12,225 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 168 [2021-12-16 09:22:12,225 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-16 09:22:12,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-16 09:22:12,227 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 6, 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, 1] [2021-12-16 09:22:12,227 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [26, 26, 17, 17, 17, 17, 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-16 09:22:12,227 INFO L791 eck$LassoCheckResult]: Stem: 79737#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 79709#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; 79710#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 79736#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; 79723#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 79724#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 80543#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; 80540#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 80541#factENTRY ~n := #in~n; 80544#L25 assume ~n <= 0;#res := 1; 80542#factFINAL assume true; 80539#factEXIT >#68#return; 80464#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 80466#factENTRY ~n := #in~n; 80538#L25 assume ~n <= 0;#res := 1; 80537#factFINAL assume true; 80463#factEXIT >#70#return; 80465#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 80466#factENTRY ~n := #in~n; 80538#L25 assume ~n <= 0;#res := 1; 80537#factFINAL assume true; 80463#factEXIT >#72#return; 80460#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; 80459#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 80449#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 80441#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 80439#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; 80440#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 80653#factENTRY ~n := #in~n; 80724#L25 assume !(~n <= 0); 80656#L26 call #t~ret0 := fact(~n - 1);< 80693#factENTRY ~n := #in~n; 80731#L25 assume ~n <= 0;#res := 1; 80730#factFINAL assume true; 80655#factEXIT >#66#return; 80654#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80646#factFINAL assume true; 80632#factEXIT >#74#return; 80180#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 80547#factENTRY ~n := #in~n; 80630#L25 assume ~n <= 0;#res := 1; 80629#factFINAL assume true; 80628#factEXIT >#76#return; 80178#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 80650#factENTRY ~n := #in~n; 80717#L25 assume !(~n <= 0); 80631#L26 call #t~ret0 := fact(~n - 1);< 80684#factENTRY ~n := #in~n; 80722#L25 assume ~n <= 0;#res := 1; 80721#factFINAL assume true; 80665#factEXIT >#66#return; 80659#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80648#factFINAL assume true; 80644#factEXIT >#78#return; 80183#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; 80152#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 80153#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 80127#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 80125#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 80121#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 79832#L42-3 [2021-12-16 09:22:12,227 INFO L793 eck$LassoCheckResult]: Loop: 79832#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 79831#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; 79815#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 79829#factENTRY ~n := #in~n; 79899#L25 assume !(~n <= 0); 79859#L26 call #t~ret0 := fact(~n - 1);< 79896#factENTRY ~n := #in~n; 79867#L25 assume ~n <= 0;#res := 1; 79865#factFINAL assume true; 79847#factEXIT >#66#return; 79846#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79844#factFINAL assume true; 79843#factEXIT >#68#return; 79813#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 79829#factENTRY ~n := #in~n; 79899#L25 assume ~n <= 0;#res := 1; 79828#factFINAL assume true; 79803#factEXIT >#70#return; 79824#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 79845#factENTRY ~n := #in~n; 79900#L25 assume !(~n <= 0); 79859#L26 call #t~ret0 := fact(~n - 1);< 79896#factENTRY ~n := #in~n; 79920#L25 assume !(~n <= 0); 79887#L26 call #t~ret0 := fact(~n - 1);< 79915#factENTRY ~n := #in~n; 79920#L25 assume !(~n <= 0); 79887#L26 call #t~ret0 := fact(~n - 1);< 79915#factENTRY ~n := #in~n; 79920#L25 assume !(~n <= 0); 79887#L26 call #t~ret0 := fact(~n - 1);< 79915#factENTRY ~n := #in~n; 79920#L25 assume !(~n <= 0); 79887#L26 call #t~ret0 := fact(~n - 1);< 79915#factENTRY ~n := #in~n; 79921#L25 assume ~n <= 0;#res := 1; 79918#factFINAL assume true; 79914#factEXIT >#66#return; 79912#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79909#factFINAL assume true; 79902#factEXIT >#66#return; 79901#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79897#factFINAL assume true; 79876#factEXIT >#66#return; 79895#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79931#factFINAL assume true; 79924#factEXIT >#66#return; 79930#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79958#factFINAL assume true; 79950#factEXIT >#66#return; 79942#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79938#factFINAL assume true; 79840#factEXIT >#72#return; 79842#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; 79933#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 79869#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 79868#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 79838#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; 79797#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 79829#factENTRY ~n := #in~n; 79899#L25 assume !(~n <= 0); 79859#L26 call #t~ret0 := fact(~n - 1);< 79896#factENTRY ~n := #in~n; 79867#L25 assume ~n <= 0;#res := 1; 79865#factFINAL assume true; 79847#factEXIT >#66#return; 79846#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79844#factFINAL assume true; 79843#factEXIT >#68#return; 79809#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 79829#factENTRY ~n := #in~n; 79899#L25 assume !(~n <= 0); 79859#L26 call #t~ret0 := fact(~n - 1);< 79896#factENTRY ~n := #in~n; 79920#L25 assume !(~n <= 0); 79887#L26 call #t~ret0 := fact(~n - 1);< 79915#factENTRY ~n := #in~n; 79920#L25 assume !(~n <= 0); 79887#L26 call #t~ret0 := fact(~n - 1);< 79915#factENTRY ~n := #in~n; 79920#L25 assume !(~n <= 0); 79887#L26 call #t~ret0 := fact(~n - 1);< 79915#factENTRY ~n := #in~n; 79920#L25 assume !(~n <= 0); 79887#L26 call #t~ret0 := fact(~n - 1);< 79915#factENTRY ~n := #in~n; 79921#L25 assume ~n <= 0;#res := 1; 79918#factFINAL assume true; 79914#factEXIT >#66#return; 79912#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79909#factFINAL assume true; 79902#factEXIT >#66#return; 79901#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79897#factFINAL assume true; 79876#factEXIT >#66#return; 79895#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79931#factFINAL assume true; 79924#factEXIT >#66#return; 79930#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79958#factFINAL assume true; 79950#factEXIT >#66#return; 79942#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79938#factFINAL assume true; 79840#factEXIT >#70#return; 79816#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 79827#factENTRY ~n := #in~n; 79830#L25 assume ~n <= 0;#res := 1; 79828#factFINAL assume true; 79803#factEXIT >#72#return; 79802#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; 79801#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 79800#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 79798#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 79799#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; 79772#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 79796#factENTRY ~n := #in~n; 79943#L25 assume !(~n <= 0); 79855#L26 call #t~ret0 := fact(~n - 1);< 79896#factENTRY ~n := #in~n; 79920#L25 assume !(~n <= 0); 79887#L26 call #t~ret0 := fact(~n - 1);< 79915#factENTRY ~n := #in~n; 79920#L25 assume !(~n <= 0); 79887#L26 call #t~ret0 := fact(~n - 1);< 79915#factENTRY ~n := #in~n; 79921#L25 assume ~n <= 0;#res := 1; 79918#factFINAL assume true; 79914#factEXIT >#66#return; 79912#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79909#factFINAL assume true; 79902#factEXIT >#66#return; 79901#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79897#factFINAL assume true; 79876#factEXIT >#66#return; 79892#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79794#factFINAL assume true; 79795#factEXIT >#74#return; 79764#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 79796#factENTRY ~n := #in~n; 79943#L25 assume !(~n <= 0); 79855#L26 call #t~ret0 := fact(~n - 1);< 79896#factENTRY ~n := #in~n; 79867#L25 assume ~n <= 0;#res := 1; 79865#factFINAL assume true; 79847#factEXIT >#66#return; 79863#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79948#factFINAL assume true; 79944#factEXIT >#76#return; 79771#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 79945#factENTRY ~n := #in~n; 79955#L25 assume !(~n <= 0); 79855#L26 call #t~ret0 := fact(~n - 1);< 79896#factENTRY ~n := #in~n; 79867#L25 assume ~n <= 0;#res := 1; 79865#factFINAL assume true; 79847#factEXIT >#66#return; 79863#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 79948#factFINAL assume true; 79944#factEXIT >#78#return; 79762#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; 79761#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 79760#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 79758#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 79732#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 79733#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 79832#L42-3 [2021-12-16 09:22:12,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:22:12,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 2 times [2021-12-16 09:22:12,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:22:12,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232038899] [2021-12-16 09:22:12,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:22:12,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:22:12,232 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:22:12,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [958806889] [2021-12-16 09:22:12,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-16 09:22:12,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:22:12,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:12,234 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:22:12,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2021-12-16 09:22:12,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-16 09:22:12,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-16 09:22:12,307 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-16 09:22:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-16 09:22:12,332 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-16 09:22:12,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-16 09:22:12,333 INFO L85 PathProgramCache]: Analyzing trace with hash -413388885, now seen corresponding path program 6 times [2021-12-16 09:22:12,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-16 09:22:12,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936166516] [2021-12-16 09:22:12,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-16 09:22:12,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-16 09:22:12,338 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-16 09:22:12,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [816651321] [2021-12-16 09:22:12,338 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2021-12-16 09:22:12,339 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-16 09:22:12,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-16 09:22:12,340 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-16 09:22:12,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2021-12-16 09:22:12,417 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-12-16 09:22:12,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-16 09:22:12,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 15 conjunts are in the unsatisfiable core [2021-12-16 09:22:12,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-16 09:22:12,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 52 proven. 173 refuted. 0 times theorem prover too weak. 1364 trivial. 0 not checked. [2021-12-16 09:22:12,743 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-16 09:22:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1589 backedges. 52 proven. 174 refuted. 0 times theorem prover too weak. 1363 trivial. 0 not checked. [2021-12-16 09:22:13,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-16 09:22:13,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936166516] [2021-12-16 09:22:13,199 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-16 09:22:13,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816651321] [2021-12-16 09:22:13,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816651321] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-16 09:22:13,199 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-16 09:22:13,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 14 [2021-12-16 09:22:13,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894731253] [2021-12-16 09:22:13,200 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-16 09:22:13,200 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-16 09:22:13,200 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-16 09:22:13,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-16 09:22:13,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2021-12-16 09:22:13,200 INFO L87 Difference]: Start difference. First operand 1909 states and 3997 transitions. cyclomatic complexity: 2105 Second operand has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 15 states have internal predecessors, (35), 8 states have call successors, (16), 1 states have call predecessors, (16), 3 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2021-12-16 09:22:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-16 09:22:13,652 INFO L93 Difference]: Finished difference Result 2406 states and 5435 transitions. [2021-12-16 09:22:13,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-16 09:22:13,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2406 states and 5435 transitions. [2021-12-16 09:22:13,680 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 297