./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-numeric/Binomial.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:42:45,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:42:45,617 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:42:45,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:42:45,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:42:45,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:42:45,654 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:42:45,656 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:42:45,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:42:45,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:42:45,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:42:45,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:42:45,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:42:45,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:42:45,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:42:45,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:42:45,669 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:42:45,670 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:42:45,672 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:42:45,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:42:45,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:42:45,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:42:45,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:42:45,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:42:45,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:42:45,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:42:45,688 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:42:45,689 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:42:45,690 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:42:45,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:42:45,691 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:42:45,693 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:42:45,694 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:42:45,695 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:42:45,696 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:42:45,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:42:45,697 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:42:45,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:42:45,698 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:42:45,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:42:45,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:42:45,702 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-11-02 20:42:45,729 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:42:45,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:42:45,730 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:42:45,731 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:42:45,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:42:45,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:42:45,733 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:42:45,733 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-02 20:42:45,733 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-02 20:42:45,734 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-02 20:42:45,734 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-02 20:42:45,734 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-02 20:42:45,735 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-02 20:42:45,735 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:42:45,735 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:42:45,736 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:42:45,736 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:42:45,736 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-02 20:42:45,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-02 20:42:45,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-02 20:42:45,737 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:42:45,737 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-02 20:42:45,738 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:42:45,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-02 20:42:45,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:42:45,738 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:42:45,739 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:42:45,739 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:42:45,740 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-02 20:42:45,741 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc 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 [2022-11-02 20:42:46,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:42:46,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:42:46,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:42:46,143 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:42:46,146 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:42:46,147 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/termination-numeric/Binomial.c [2022-11-02 20:42:46,241 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/data/b490c8c48/8fcc846504ee4a88865047137ff736fa/FLAG9f1d580cb [2022-11-02 20:42:46,877 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:42:46,878 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/sv-benchmarks/c/termination-numeric/Binomial.c [2022-11-02 20:42:46,887 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/data/b490c8c48/8fcc846504ee4a88865047137ff736fa/FLAG9f1d580cb [2022-11-02 20:42:47,222 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/data/b490c8c48/8fcc846504ee4a88865047137ff736fa [2022-11-02 20:42:47,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:42:47,231 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:42:47,238 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:42:47,238 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:42:47,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:42:47,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:42:47" (1/1) ... [2022-11-02 20:42:47,249 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74fa0ef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:47, skipping insertion in model container [2022-11-02 20:42:47,250 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:42:47" (1/1) ... [2022-11-02 20:42:47,265 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:42:47,284 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:42:47,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:42:47,566 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:42:47,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:42:47,610 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:42:47,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:47 WrapperNode [2022-11-02 20:42:47,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:42:47,613 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:42:47,613 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:42:47,613 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:42:47,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:47" (1/1) ... [2022-11-02 20:42:47,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:47" (1/1) ... [2022-11-02 20:42:47,664 INFO L138 Inliner]: procedures = 6, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2022-11-02 20:42:47,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:42:47,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:42:47,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:42:47,667 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:42:47,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:47" (1/1) ... [2022-11-02 20:42:47,678 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:47" (1/1) ... [2022-11-02 20:42:47,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:47" (1/1) ... [2022-11-02 20:42:47,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:47" (1/1) ... [2022-11-02 20:42:47,691 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:47" (1/1) ... [2022-11-02 20:42:47,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:47" (1/1) ... [2022-11-02 20:42:47,705 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:47" (1/1) ... [2022-11-02 20:42:47,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:47" (1/1) ... [2022-11-02 20:42:47,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:42:47,712 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:42:47,712 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:42:47,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:42:47,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:47" (1/1) ... [2022-11-02 20:42:47,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:47,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:47,750 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:47,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-02 20:42:47,808 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2022-11-02 20:42:47,808 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2022-11-02 20:42:47,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:42:47,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:42:47,887 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:42:47,893 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:42:48,070 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:42:48,079 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:42:48,079 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-02 20:42:48,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:42:48 BoogieIcfgContainer [2022-11-02 20:42:48,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:42:48,084 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-02 20:42:48,084 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-02 20:42:48,089 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-02 20:42:48,090 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:42:48,091 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.11 08:42:47" (1/3) ... [2022-11-02 20:42:48,093 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3735eafd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 08:42:48, skipping insertion in model container [2022-11-02 20:42:48,093 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:42:48,093 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:42:47" (2/3) ... [2022-11-02 20:42:48,094 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3735eafd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.11 08:42:48, skipping insertion in model container [2022-11-02 20:42:48,094 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-02 20:42:48,094 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:42:48" (3/3) ... [2022-11-02 20:42:48,096 INFO L332 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2022-11-02 20:42:48,165 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-02 20:42:48,173 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-02 20:42:48,173 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-02 20:42:48,173 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-02 20:42:48,173 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-02 20:42:48,173 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-02 20:42:48,173 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-02 20:42:48,174 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-02 20:42:48,179 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) [2022-11-02 20:42:48,219 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-11-02 20:42:48,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:42:48,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:42:48,227 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-02 20:42:48,227 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:42:48,227 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-02 20:42:48,228 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) [2022-11-02 20:42:48,231 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-11-02 20:42:48,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:42:48,232 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:42:48,232 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-02 20:42:48,232 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:42:48,242 INFO L748 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#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; 17#L35true assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 27#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; 13#L41-3true [2022-11-02 20:42:48,242 INFO L750 eck$LassoCheckResult]: Loop: 13#L41-3true assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 22#L42-3true assume !(main_~k~0#1 <= main_~x~0#1); 14#L41-2true main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 13#L41-3true [2022-11-02 20:42:48,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:48,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 1 times [2022-11-02 20:42:48,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:48,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076031769] [2022-11-02 20:42:48,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:48,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:42:48,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:42:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:42:48,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:42:48,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:48,387 INFO L85 PathProgramCache]: Analyzing trace with hash 57812, now seen corresponding path program 1 times [2022-11-02 20:42:48,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:48,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946780690] [2022-11-02 20:42:48,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:48,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:42:48,401 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:42:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:42:48,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:42:48,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:48,410 INFO L85 PathProgramCache]: Analyzing trace with hash 553673357, now seen corresponding path program 1 times [2022-11-02 20:42:48,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:48,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089700098] [2022-11-02 20:42:48,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:48,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:48,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:48,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:48,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089700098] [2022-11-02 20:42:48,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089700098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:48,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:48,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:42:48,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281143886] [2022-11-02 20:42:48,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:48,659 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:42:48,660 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:42:48,660 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:42:48,661 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:42:48,661 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-02 20:42:48,661 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:48,661 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:42:48,661 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:42:48,662 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2022-11-02 20:42:48,662 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:42:48,662 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:42:48,683 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:48,696 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:48,773 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:42:48,774 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-02 20:42:48,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:48,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:48,781 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:48,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:42:48,801 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:42:48,809 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-11-02 20:42:48,836 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:42:48,837 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: [] [2022-11-02 20:42:48,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:48,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:48,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:48,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:48,891 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:42:48,891 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:42:48,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-11-02 20:42:48,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:48,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:48,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:48,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:48,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-02 20:42:48,972 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:42:48,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-11-02 20:42:49,249 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-02 20:42:49,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:49,259 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:42:49,259 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:42:49,259 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:42:49,260 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:42:49,260 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:42:49,260 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:49,260 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:42:49,260 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:42:49,260 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2022-11-02 20:42:49,260 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:42:49,277 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:42:49,279 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:49,293 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:49,385 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:42:49,391 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:42:49,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:49,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:49,402 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:49,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-11-02 20:42:49,411 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 [2022-11-02 20:42:49,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:49,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:49,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:49,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:49,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:42:49,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:42:49,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:49,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:49,489 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:49,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:49,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:49,492 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:49,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-11-02 20:42:49,495 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 [2022-11-02 20:42:49,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:49,508 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:49,508 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:49,508 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:49,508 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:42:49,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:42:49,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:49,552 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:42:49,559 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-11-02 20:42:49,560 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-11-02 20:42:49,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:49,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:49,563 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:49,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-11-02 20:42:49,566 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:42:49,566 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-02 20:42:49,567 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:42:49,567 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 [] [2022-11-02 20:42:49,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:49,599 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-02 20:42:49,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:49,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:49,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:42:49,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:42:49,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:49,696 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:42:49,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:42:49,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:42:49,820 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-11-02 20:42:49,822 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) [2022-11-02 20:42:49,955 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. [2022-11-02 20:42:49,960 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 [2022-11-02 20:42:49,968 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) [2022-11-02 20:42:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 54 transitions. [2022-11-02 20:42:49,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 3 letters. [2022-11-02 20:42:49,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:42:49,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 7 letters. Loop has 3 letters. [2022-11-02 20:42:49,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:42:49,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 54 transitions. Stem has 4 letters. Loop has 6 letters. [2022-11-02 20:42:49,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:42:49,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 106 transitions. [2022-11-02 20:42:50,004 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-11-02 20:42:50,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 33 states and 48 transitions. [2022-11-02 20:42:50,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-11-02 20:42:50,019 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2022-11-02 20:42:50,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 48 transitions. [2022-11-02 20:42:50,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:42:50,021 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 48 transitions. [2022-11-02 20:42:50,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 48 transitions. [2022-11-02 20:42:50,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-11-02 20:42:50,064 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) [2022-11-02 20:42:50,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 42 transitions. [2022-11-02 20:42:50,071 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 42 transitions. [2022-11-02 20:42:50,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:50,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:42:50,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:42:50,076 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) [2022-11-02 20:42:50,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:50,198 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2022-11-02 20:42:50,198 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 38 transitions. [2022-11-02 20:42:50,200 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-11-02 20:42:50,201 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 28 states and 37 transitions. [2022-11-02 20:42:50,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-11-02 20:42:50,202 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2022-11-02 20:42:50,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2022-11-02 20:42:50,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:50,203 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-11-02 20:42:50,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2022-11-02 20:42:50,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-11-02 20:42:50,206 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) [2022-11-02 20:42:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-11-02 20:42:50,207 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-11-02 20:42:50,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:42:50,208 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-11-02 20:42:50,208 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-02 20:42:50,209 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2022-11-02 20:42:50,210 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-11-02 20:42:50,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:42:50,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:42:50,211 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-02 20:42:50,211 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:50,212 INFO L748 eck$LassoCheckResult]: Stem: 241#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 232#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; 233#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 240#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; 236#L41-3 [2022-11-02 20:42:50,212 INFO L750 eck$LassoCheckResult]: Loop: 236#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 237#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 242#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; 218#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 219#factENTRY ~n := #in~n; 231#L25 assume ~n <= 0;#res := 1; 230#factFINAL assume true; 220#factEXIT >#74#return; 225#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 219#factENTRY ~n := #in~n; 231#L25 assume ~n <= 0;#res := 1; 230#factFINAL assume true; 220#factEXIT >#76#return; 221#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 219#factENTRY ~n := #in~n; 231#L25 assume ~n <= 0;#res := 1; 230#factFINAL assume true; 220#factEXIT >#78#return; 227#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; 234#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 235#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 243#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 239#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 236#L41-3 [2022-11-02 20:42:50,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:50,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 2 times [2022-11-02 20:42:50,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:50,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733451535] [2022-11-02 20:42:50,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:50,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:42:50,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:42:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:42:50,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:42:50,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:50,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1284911041, now seen corresponding path program 1 times [2022-11-02 20:42:50,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:50,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642522505] [2022-11-02 20:42:50,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:50,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:50,297 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:42:50,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1651576096] [2022-11-02 20:42:50,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:50,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:50,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:50,314 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:42:50,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:42:50,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:50,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 20:42:50,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:42:50,528 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:42:50,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:42:50,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:50,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642522505] [2022-11-02 20:42:50,529 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:42:50,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651576096] [2022-11-02 20:42:50,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651576096] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:50,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:50,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:42:50,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538150964] [2022-11-02 20:42:50,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:50,531 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:42:50,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:50,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:42:50,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:42:50,533 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:42:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:50,651 INFO L93 Difference]: Finished difference Result 34 states and 50 transitions. [2022-11-02 20:42:50,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 50 transitions. [2022-11-02 20:42:50,657 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 25 [2022-11-02 20:42:50,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 50 transitions. [2022-11-02 20:42:50,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-11-02 20:42:50,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-11-02 20:42:50,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2022-11-02 20:42:50,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:50,660 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 50 transitions. [2022-11-02 20:42:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2022-11-02 20:42:50,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-11-02 20:42:50,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-02 20:42:50,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-11-02 20:42:50,665 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 42 transitions. [2022-11-02 20:42:50,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:42:50,671 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 42 transitions. [2022-11-02 20:42:50,672 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-02 20:42:50,672 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 42 transitions. [2022-11-02 20:42:50,674 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2022-11-02 20:42:50,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:42:50,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:42:50,677 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-02 20:42:50,677 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:50,678 INFO L748 eck$LassoCheckResult]: Stem: 377#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 367#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; 368#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 376#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; 372#L41-3 [2022-11-02 20:42:50,679 INFO L750 eck$LassoCheckResult]: Loop: 372#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 373#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 378#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; 354#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 355#factENTRY ~n := #in~n; 366#L25 assume ~n <= 0;#res := 1; 365#factFINAL assume true; 356#factEXIT >#74#return; 362#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 355#factENTRY ~n := #in~n; 366#L25 assume ~n <= 0;#res := 1; 365#factFINAL assume true; 356#factEXIT >#76#return; 358#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 355#factENTRY ~n := #in~n; 366#L25 assume !(~n <= 0); 360#L26 call #t~ret0 := fact(~n - 1);< 355#factENTRY ~n := #in~n; 366#L25 assume ~n <= 0;#res := 1; 365#factFINAL assume true; 356#factEXIT >#66#return; 364#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 379#factFINAL assume true; 381#factEXIT >#78#return; 369#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; 370#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 371#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 380#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 375#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 372#L41-3 [2022-11-02 20:42:50,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:50,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 3 times [2022-11-02 20:42:50,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:50,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521631704] [2022-11-02 20:42:50,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:50,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:50,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:42:50,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:42:50,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:42:50,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:42:50,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:50,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1183838151, now seen corresponding path program 1 times [2022-11-02 20:42:50,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:50,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358368037] [2022-11-02 20:42:50,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:50,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:50,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:50,782 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:42:50,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355966793] [2022-11-02 20:42:50,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:50,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:50,784 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:50,790 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:42:50,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:42:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:42:50,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:42:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:42:50,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:42:50,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:50,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2107943858, now seen corresponding path program 1 times [2022-11-02 20:42:50,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:50,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969025170] [2022-11-02 20:42:50,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:50,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:50,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:50,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969025170] [2022-11-02 20:42:50,913 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-11-02 20:42:50,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477774881] [2022-11-02 20:42:50,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:50,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:50,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:50,943 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:42:50,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:42:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:51,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 20:42:51,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:42:51,102 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:42:51,103 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:42:51,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477774881] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:42:51,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:42:51,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:42:51,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329893910] [2022-11-02 20:42:51,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:42:51,671 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:42:51,671 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:42:51,671 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:42:51,671 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:42:51,672 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-02 20:42:51,672 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:51,672 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:42:51,672 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:42:51,672 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2022-11-02 20:42:51,673 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:42:51,673 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:42:51,675 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:51,679 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:51,717 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:51,721 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:51,724 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:51,728 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:51,731 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:52,095 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:42:52,096 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-02 20:42:52,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:52,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:52,105 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:52,112 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:42:52,112 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:42:52,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-11-02 20:42:52,138 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:42:52,138 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: [] [2022-11-02 20:42:52,203 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:52,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:52,203 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:52,205 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:52,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-11-02 20:42:52,210 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:42:52,211 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:42:52,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:52,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:52,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:52,290 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:52,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-11-02 20:42:52,295 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-02 20:42:52,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:42:52,343 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-02 20:42:52,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:52,392 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:42:52,392 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:42:52,393 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:42:52,393 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:42:52,393 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:42:52,393 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:52,393 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:42:52,393 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:42:52,393 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration3_Loop [2022-11-02 20:42:52,393 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:42:52,394 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:42:52,395 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:52,401 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:52,404 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:52,407 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:52,410 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:52,414 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:52,418 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:52,861 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:42:52,862 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:42:52,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:52,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:52,864 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:52,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-11-02 20:42:52,870 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 [2022-11-02 20:42:52,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:52,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:52,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:52,883 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:52,883 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:42:52,883 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:42:52,884 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:52,885 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:52,911 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:52,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:52,912 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:52,913 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:52,916 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-11-02 20:42:52,917 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 [2022-11-02 20:42:52,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:52,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:52,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:52,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:52,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:42:52,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:42:52,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:52,961 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:53,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:53,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:53,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:53,014 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:53,029 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 [2022-11-02 20:42:53,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-02 20:42:53,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:53,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:53,045 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:53,045 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:53,045 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:42:53,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:42:53,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:53,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:53,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:53,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:53,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:53,112 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:53,121 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 [2022-11-02 20:42:53,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-02 20:42:53,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:53,137 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:53,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:53,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:53,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:42:53,139 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:42:53,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:53,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:53,205 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:53,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:53,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:53,207 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:53,216 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 [2022-11-02 20:42:53,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-02 20:42:53,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:53,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:53,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:53,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:53,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:42:53,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:42:53,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:53,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:53,290 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:53,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:53,291 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:53,293 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:53,303 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 [2022-11-02 20:42:53,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-02 20:42:53,318 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:53,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:53,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:53,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:53,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:42:53,320 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:42:53,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:53,329 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:53,381 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:53,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:53,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:53,384 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:53,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-02 20:42:53,392 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 [2022-11-02 20:42:53,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:53,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:53,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:53,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:53,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:42:53,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:42:53,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:53,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:53,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:53,490 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-11-02 20:42:53,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:53,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:53,491 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:53,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-02 20:42:53,498 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 [2022-11-02 20:42:53,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:53,511 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:53,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:53,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:53,511 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-02 20:42:53,512 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-02 20:42:53,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:53,522 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:53,564 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:53,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:53,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:53,566 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:53,579 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 [2022-11-02 20:42:53,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-02 20:42:53,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:53,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:53,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:53,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:53,596 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-02 20:42:53,596 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-02 20:42:53,597 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:53,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:53,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:53,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:53,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:53,664 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:53,670 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 [2022-11-02 20:42:53,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-02 20:42:53,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:53,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:53,687 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:53,687 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:53,687 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-02 20:42:53,688 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-02 20:42:53,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:53,702 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:53,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:53,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:53,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:53,751 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:53,753 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 [2022-11-02 20:42:53,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-11-02 20:42:53,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:53,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:53,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:53,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:53,770 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-02 20:42:53,772 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-02 20:42:53,772 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:53,778 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:53,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:53,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:53,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:53,812 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:53,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-02 20:42:53,816 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 [2022-11-02 20:42:53,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:53,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:53,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:53,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:53,828 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-02 20:42:53,830 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-02 20:42:53,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:53,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:53,878 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:53,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:53,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:53,880 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:53,886 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 [2022-11-02 20:42:53,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-11-02 20:42:53,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:53,902 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:53,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:53,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:53,902 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-02 20:42:53,903 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-02 20:42:53,903 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:53,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:53,959 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-11-02 20:42:53,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:53,959 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:53,961 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:53,963 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 [2022-11-02 20:42:53,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-11-02 20:42:53,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:53,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:53,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:53,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:53,979 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-02 20:42:53,985 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-02 20:42:53,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:53,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:54,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:54,046 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-11-02 20:42:54,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:54,046 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:54,048 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:54,055 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 [2022-11-02 20:42:54,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-11-02 20:42:54,071 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:54,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:54,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:54,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:54,072 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:54,074 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:54,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:54,089 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:54,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:54,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:54,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:54,139 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:54,144 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 [2022-11-02 20:42:54,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-11-02 20:42:54,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:54,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:54,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:54,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:54,162 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:54,163 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:54,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:54,181 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:54,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:54,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:54,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:54,231 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:54,234 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 [2022-11-02 20:42:54,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-11-02 20:42:54,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:54,249 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:54,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:54,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:54,250 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:54,251 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:54,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:54,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:54,312 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:54,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:54,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:54,314 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:54,318 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 [2022-11-02 20:42:54,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-11-02 20:42:54,334 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:54,334 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:54,334 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:54,334 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:54,334 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:54,335 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:54,336 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:54,361 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:54,400 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-11-02 20:42:54,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:54,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:54,402 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:54,405 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 [2022-11-02 20:42:54,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-11-02 20:42:54,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:54,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:54,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:54,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:54,418 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:54,420 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:54,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:54,425 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:54,450 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-11-02 20:42:54,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:54,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:54,452 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:54,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-11-02 20:42:54,453 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 [2022-11-02 20:42:54,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:54,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:54,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:54,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:54,466 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:54,467 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:54,467 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:54,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:54,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:54,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:54,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:54,498 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:54,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-11-02 20:42:54,500 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 [2022-11-02 20:42:54,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:54,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:54,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:54,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:54,515 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:54,523 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:54,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:54,538 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:54,577 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-11-02 20:42:54,578 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-11-02 20:42:54,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:54,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:54,579 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:54,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-11-02 20:42:54,583 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 [2022-11-02 20:42:54,596 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:54,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:54,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:54,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:54,597 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-02 20:42:54,598 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-02 20:42:54,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:54,625 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:54,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:54,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:54,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:54,659 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:54,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 [2022-11-02 20:42:54,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-11-02 20:42:54,675 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:54,675 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:54,675 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:54,676 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:54,676 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-02 20:42:54,677 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-02 20:42:54,677 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:54,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:54,749 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:54,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:54,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:54,751 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:54,760 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 [2022-11-02 20:42:54,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-11-02 20:42:54,772 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:54,773 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:54,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:54,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:54,773 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-02 20:42:54,774 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-02 20:42:54,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:54,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:54,810 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:54,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:54,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:54,811 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:54,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-11-02 20:42:54,819 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 [2022-11-02 20:42:54,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:54,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:54,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:54,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:54,833 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-02 20:42:54,834 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-02 20:42:54,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:54,837 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:54,862 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-11-02 20:42:54,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:54,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:54,864 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:54,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-11-02 20:42:54,866 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 [2022-11-02 20:42:54,879 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:54,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:54,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:54,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:54,879 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-02 20:42:54,880 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-02 20:42:54,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:54,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:54,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-11-02 20:42:54,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:54,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:54,920 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:54,927 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-11-02 20:42:54,927 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:42:54,940 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:54,941 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:54,941 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:54,941 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:54,941 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-02 20:42:54,942 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-02 20:42:54,942 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:54,969 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:55,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:55,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:55,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:55,019 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:55,022 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-11-02 20:42:55,023 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 [2022-11-02 20:42:55,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:42:55,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:55,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:55,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:55,038 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-02 20:42:55,049 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-02 20:42:55,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:55,073 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:55,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:55,116 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-11-02 20:42:55,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:55,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:55,118 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:55,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:42:55,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-11-02 20:42:55,135 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:55,135 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-02 20:42:55,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:55,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:55,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:55,136 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-02 20:42:55,137 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-02 20:42:55,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:55,148 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:55,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:55,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:55,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:55,197 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:55,202 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 [2022-11-02 20:42:55,205 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-11-02 20:42:55,215 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:55,215 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-02 20:42:55,215 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:55,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:55,216 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:55,216 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-02 20:42:55,217 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-02 20:42:55,217 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:55,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:55,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:55,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:55,276 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:55,277 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:55,282 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 [2022-11-02 20:42:55,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-11-02 20:42:55,298 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:55,298 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-02 20:42:55,298 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:55,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:55,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:55,298 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-02 20:42:55,300 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-02 20:42:55,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:55,325 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:55,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:55,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:55,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:55,371 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:55,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-11-02 20:42:55,375 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 [2022-11-02 20:42:55,387 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:55,388 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-02 20:42:55,388 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:55,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:55,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:55,388 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-02 20:42:55,389 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-02 20:42:55,390 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:55,425 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:55,462 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:55,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:55,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:55,464 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:55,466 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-11-02 20:42:55,466 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 [2022-11-02 20:42:55,478 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:55,479 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-02 20:42:55,479 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:55,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:55,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:55,479 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-02 20:42:55,480 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-02 20:42:55,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:55,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:55,510 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-11-02 20:42:55,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:55,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:55,511 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:55,513 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 [2022-11-02 20:42:55,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-11-02 20:42:55,527 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:55,527 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-02 20:42:55,527 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:55,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:55,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:55,527 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-02 20:42:55,528 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-02 20:42:55,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:55,539 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:55,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:55,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:55,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:55,573 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:55,574 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-11-02 20:42:55,575 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 [2022-11-02 20:42:55,588 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:55,588 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-02 20:42:55,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:55,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:55,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:55,589 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-02 20:42:55,601 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-02 20:42:55,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:55,620 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:55,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:55,663 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-11-02 20:42:55,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:55,663 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:55,664 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:55,694 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 [2022-11-02 20:42:55,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-11-02 20:42:55,711 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:55,711 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-02 20:42:55,711 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:55,711 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:55,711 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:55,711 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:55,713 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:55,713 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:55,733 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:55,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:55,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:55,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:55,779 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:55,782 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 [2022-11-02 20:42:55,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-11-02 20:42:55,798 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:55,798 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-02 20:42:55,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:55,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:55,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:55,799 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:55,800 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:55,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:55,821 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:55,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:55,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:55,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:55,865 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:55,870 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 [2022-11-02 20:42:55,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-11-02 20:42:55,886 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:55,886 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-02 20:42:55,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:55,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:55,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:55,887 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:55,888 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:55,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:55,917 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:55,961 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:55,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:55,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:55,963 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:55,970 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 [2022-11-02 20:42:55,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-11-02 20:42:55,986 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:55,986 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-02 20:42:55,986 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:55,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:55,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:55,987 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:55,988 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:55,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:56,017 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:56,059 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:56,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:56,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:56,061 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:56,066 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 [2022-11-02 20:42:56,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-11-02 20:42:56,082 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:56,082 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-02 20:42:56,082 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:56,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:56,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:56,083 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:56,084 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:56,084 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:56,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:56,137 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:56,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:56,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:56,140 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:56,146 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 [2022-11-02 20:42:56,149 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-11-02 20:42:56,159 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:56,159 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-02 20:42:56,159 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:56,159 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:56,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:56,160 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:56,161 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:56,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:56,173 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:56,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:56,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:56,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:56,216 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:56,222 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 [2022-11-02 20:42:56,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-11-02 20:42:56,240 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:56,240 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-02 20:42:56,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:56,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:56,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:56,240 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:56,250 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:56,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:56,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:56,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:56,331 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-11-02 20:42:56,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:56,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:56,333 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:56,338 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 [2022-11-02 20:42:56,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-11-02 20:42:56,354 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:56,355 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-02 20:42:56,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:56,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:56,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:56,355 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-02 20:42:56,357 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-02 20:42:56,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:56,377 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:56,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:56,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:56,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:56,421 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:56,430 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 [2022-11-02 20:42:56,446 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-11-02 20:42:56,447 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:56,447 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-02 20:42:56,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:56,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:56,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:56,448 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-02 20:42:56,450 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-02 20:42:56,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:56,464 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:56,505 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:56,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:56,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:56,509 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:56,514 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 [2022-11-02 20:42:56,529 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-11-02 20:42:56,530 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:56,530 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-02 20:42:56,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:56,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:56,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:56,531 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-02 20:42:56,533 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-02 20:42:56,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:56,541 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:56,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:56,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:56,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:56,568 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:56,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-11-02 20:42:56,570 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 [2022-11-02 20:42:56,586 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:56,586 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-02 20:42:56,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:56,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:56,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:56,586 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-02 20:42:56,588 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-02 20:42:56,588 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:56,617 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:56,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:56,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:56,658 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:56,659 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:56,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-11-02 20:42:56,661 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 [2022-11-02 20:42:56,673 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:56,674 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-02 20:42:56,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:56,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:56,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:56,674 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-02 20:42:56,676 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-02 20:42:56,676 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:56,681 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:56,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:56,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:56,709 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:56,710 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:56,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-11-02 20:42:56,712 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 [2022-11-02 20:42:56,725 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:56,725 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-02 20:42:56,725 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:56,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:56,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:56,725 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-02 20:42:56,727 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-02 20:42:56,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:56,749 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:56,793 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:56,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:56,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:56,795 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:56,802 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 [2022-11-02 20:42:56,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-11-02 20:42:56,821 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:56,821 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-02 20:42:56,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:56,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:56,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:56,822 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-02 20:42:56,834 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-02 20:42:56,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:56,881 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:56,922 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:56,922 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-11-02 20:42:56,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:56,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:56,924 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:56,930 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 [2022-11-02 20:42:56,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-11-02 20:42:56,946 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:56,946 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-02 20:42:56,947 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:56,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:56,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:56,947 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:56,948 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:56,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:56,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:56,995 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-11-02 20:42:56,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:56,996 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:56,997 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:56,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-11-02 20:42:56,998 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 [2022-11-02 20:42:57,012 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:57,012 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-02 20:42:57,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:57,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:57,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:57,012 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:57,013 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:57,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:57,016 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:57,044 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-11-02 20:42:57,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:57,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:57,046 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:57,048 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-11-02 20:42:57,048 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 [2022-11-02 20:42:57,062 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:57,062 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-02 20:42:57,062 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:57,062 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:57,062 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:57,063 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:57,063 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:57,064 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:57,098 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:57,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:57,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:57,140 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:57,141 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:57,146 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 [2022-11-02 20:42:57,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-11-02 20:42:57,162 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:57,162 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-02 20:42:57,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:57,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:57,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:57,162 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:57,163 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:57,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:57,181 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:57,222 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:57,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:57,223 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:57,224 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:57,230 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 [2022-11-02 20:42:57,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-11-02 20:42:57,246 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:57,246 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-02 20:42:57,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:57,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:57,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:57,246 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:57,247 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:57,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:57,273 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:57,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-11-02 20:42:57,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:57,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:57,316 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:57,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-11-02 20:42:57,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:42:57,337 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:57,337 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-02 20:42:57,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:57,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:57,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:57,338 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:57,339 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:57,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:57,349 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:57,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:57,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:57,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:57,393 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:57,398 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 [2022-11-02 20:42:57,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-11-02 20:42:57,415 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:57,415 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-02 20:42:57,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:57,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:57,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:57,415 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-02 20:42:57,423 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-02 20:42:57,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:57,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:57,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-11-02 20:42:57,491 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-11-02 20:42:57,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:57,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:57,492 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:57,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-11-02 20:42:57,494 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 [2022-11-02 20:42:57,507 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:57,507 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-02 20:42:57,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:57,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:57,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:57,507 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-02 20:42:57,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:42:57,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:57,514 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:57,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-11-02 20:42:57,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:57,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:57,542 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:57,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-11-02 20:42:57,544 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 [2022-11-02 20:42:57,557 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:57,557 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-02 20:42:57,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:57,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:57,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:57,558 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-02 20:42:57,559 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:42:57,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:57,581 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:57,618 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:57,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:57,619 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:57,620 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:57,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-11-02 20:42:57,622 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 [2022-11-02 20:42:57,635 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:57,635 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-02 20:42:57,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:57,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:57,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:57,636 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-02 20:42:57,637 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:42:57,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:57,642 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:57,667 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-11-02 20:42:57,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:57,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:57,668 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:57,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-11-02 20:42:57,670 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 [2022-11-02 20:42:57,683 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:57,683 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-02 20:42:57,683 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:57,683 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:57,683 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:57,683 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-02 20:42:57,685 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:42:57,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:57,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:57,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:57,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:57,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:57,717 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:57,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-11-02 20:42:57,719 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 [2022-11-02 20:42:57,732 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:57,732 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-02 20:42:57,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:57,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:57,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:57,732 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-02 20:42:57,734 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:42:57,734 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:57,738 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:57,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-11-02 20:42:57,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:57,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:57,767 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:57,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-11-02 20:42:57,769 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 [2022-11-02 20:42:57,782 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:57,782 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-02 20:42:57,782 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:57,783 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:57,783 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:57,783 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-02 20:42:57,784 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:42:57,784 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:57,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:57,828 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-11-02 20:42:57,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:57,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:57,829 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:57,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-11-02 20:42:57,834 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 [2022-11-02 20:42:57,848 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-02 20:42:57,848 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-02 20:42:57,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:42:57,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:42:57,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:42:57,849 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-02 20:42:57,861 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-02 20:42:57,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:42:57,906 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:42:57,947 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-11-02 20:42:57,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:57,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:42:57,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:42:57,948 INFO L87 Difference]: Start difference. First operand 28 states and 42 transitions. cyclomatic complexity: 16 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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) [2022-11-02 20:42:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:58,012 INFO L93 Difference]: Finished difference Result 35 states and 55 transitions. [2022-11-02 20:42:58,012 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 55 transitions. [2022-11-02 20:42:58,021 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2022-11-02 20:42:58,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 55 transitions. [2022-11-02 20:42:58,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-11-02 20:42:58,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-11-02 20:42:58,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 55 transitions. [2022-11-02 20:42:58,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:58,033 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 55 transitions. [2022-11-02 20:42:58,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 55 transitions. [2022-11-02 20:42:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2022-11-02 20:42:58,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 7 states have call successors, (7), 1 states have call predecessors, (7), 2 states have return successors, (13), 7 states have call predecessors, (13), 7 states have call successors, (13) [2022-11-02 20:42:58,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-11-02 20:42:58,044 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 43 transitions. [2022-11-02 20:42:58,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:42:58,046 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 43 transitions. [2022-11-02 20:42:58,047 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-02 20:42:58,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 43 transitions. [2022-11-02 20:42:58,050 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-11-02 20:42:58,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:42:58,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:42:58,054 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-02 20:42:58,054 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:58,054 INFO L748 eck$LassoCheckResult]: Stem: 545#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 535#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; 536#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 544#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; 540#L41-3 [2022-11-02 20:42:58,055 INFO L750 eck$LassoCheckResult]: Loop: 540#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 541#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 546#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; 530#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 523#factENTRY ~n := #in~n; 534#L25 assume !(~n <= 0); 527#L26 call #t~ret0 := fact(~n - 1);< 523#factENTRY ~n := #in~n; 534#L25 assume ~n <= 0;#res := 1; 533#factFINAL assume true; 525#factEXIT >#66#return; 531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 547#factFINAL assume true; 550#factEXIT >#68#return; 528#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 523#factENTRY ~n := #in~n; 534#L25 assume !(~n <= 0); 527#L26 call #t~ret0 := fact(~n - 1);< 523#factENTRY ~n := #in~n; 534#L25 assume ~n <= 0;#res := 1; 533#factFINAL assume true; 525#factEXIT >#66#return; 531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 547#factFINAL assume true; 550#factEXIT >#70#return; 524#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 523#factENTRY ~n := #in~n; 534#L25 assume !(~n <= 0); 527#L26 call #t~ret0 := fact(~n - 1);< 523#factENTRY ~n := #in~n; 534#L25 assume ~n <= 0;#res := 1; 533#factFINAL assume true; 525#factEXIT >#66#return; 531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 547#factFINAL assume true; 550#factEXIT >#72#return; 532#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; 542#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 539#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 548#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 543#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 540#L41-3 [2022-11-02 20:42:58,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:58,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 4 times [2022-11-02 20:42:58,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:58,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305692632] [2022-11-02 20:42:58,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:58,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:58,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:42:58,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:42:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:42:58,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:42:58,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:58,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1909923709, now seen corresponding path program 1 times [2022-11-02 20:42:58,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:58,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470852747] [2022-11-02 20:42:58,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:58,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:58,101 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:42:58,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1253554557] [2022-11-02 20:42:58,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:58,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:58,102 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:58,104 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:42:58,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2022-11-02 20:42:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:42:58,171 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:42:58,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:42:58,242 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 47 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 20:42:58,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:42:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-02 20:42:58,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:42:58,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470852747] [2022-11-02 20:42:58,366 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:42:58,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253554557] [2022-11-02 20:42:58,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253554557] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:42:58,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:42:58,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-11-02 20:42:58,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902365231] [2022-11-02 20:42:58,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:42:58,369 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:42:58,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:42:58,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:42:58,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:42:58,370 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. cyclomatic complexity: 16 Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-02 20:42:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:42:58,584 INFO L93 Difference]: Finished difference Result 41 states and 62 transitions. [2022-11-02 20:42:58,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 62 transitions. [2022-11-02 20:42:58,588 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 32 [2022-11-02 20:42:58,596 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 62 transitions. [2022-11-02 20:42:58,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2022-11-02 20:42:58,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2022-11-02 20:42:58,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 62 transitions. [2022-11-02 20:42:58,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-02 20:42:58,604 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 62 transitions. [2022-11-02 20:42:58,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 62 transitions. [2022-11-02 20:42:58,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2022-11-02 20:42:58,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2022-11-02 20:42:58,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2022-11-02 20:42:58,616 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 48 transitions. [2022-11-02 20:42:58,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:42:58,617 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 48 transitions. [2022-11-02 20:42:58,619 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-02 20:42:58,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 48 transitions. [2022-11-02 20:42:58,621 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2022-11-02 20:42:58,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:42:58,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:42:58,623 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-11-02 20:42:58,624 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:42:58,625 INFO L748 eck$LassoCheckResult]: Stem: 871#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 861#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; 862#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 870#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; 866#L41-3 [2022-11-02 20:42:58,625 INFO L750 eck$LassoCheckResult]: Loop: 866#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 867#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 872#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; 855#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 847#factENTRY ~n := #in~n; 860#L25 assume ~n <= 0;#res := 1; 859#factFINAL assume true; 849#factEXIT >#68#return; 851#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 847#factENTRY ~n := #in~n; 860#L25 assume ~n <= 0;#res := 1; 859#factFINAL assume true; 849#factEXIT >#70#return; 848#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 847#factENTRY ~n := #in~n; 860#L25 assume ~n <= 0;#res := 1; 859#factFINAL assume true; 849#factEXIT >#72#return; 858#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; 868#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 865#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 874#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 869#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 866#L41-3 [2022-11-02 20:42:58,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:58,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1171944, now seen corresponding path program 5 times [2022-11-02 20:42:58,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:58,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164947029] [2022-11-02 20:42:58,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:58,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:58,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:42:58,632 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:42:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:42:58,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:42:58,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:58,639 INFO L85 PathProgramCache]: Analyzing trace with hash -743603515, now seen corresponding path program 1 times [2022-11-02 20:42:58,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:58,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240323673] [2022-11-02 20:42:58,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:58,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:58,652 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:42:58,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1850358359] [2022-11-02 20:42:58,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:58,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:58,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:58,659 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:42:58,660 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2022-11-02 20:42:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:42:58,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:42:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:42:58,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:42:58,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:42:58,732 INFO L85 PathProgramCache]: Analyzing trace with hash 343305470, now seen corresponding path program 1 times [2022-11-02 20:42:58,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:42:58,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740711806] [2022-11-02 20:42:58,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:58,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:42:58,743 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:42:58,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [451083887] [2022-11-02 20:42:58,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:42:58,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:42:58,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:58,747 INFO L229 MonitoredProcess]: Starting monitored process 79 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:42:58,769 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2022-11-02 20:42:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:42:58,805 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:42:58,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:42:58,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:42:59,221 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:42:59,221 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:42:59,222 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:42:59,222 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:42:59,222 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-02 20:42:59,222 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:59,222 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:42:59,222 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:42:59,223 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2022-11-02 20:42:59,223 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:42:59,223 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:42:59,224 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:59,228 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:59,253 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:59,256 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:59,258 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:59,261 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:59,264 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:59,266 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:42:59,409 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:42:59,409 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-02 20:42:59,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:59,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:59,412 INFO L229 MonitoredProcess]: Starting monitored process 80 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:59,421 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:42:59,421 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:42:59,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-11-02 20:42:59,448 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:42:59,448 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: [] [2022-11-02 20:42:59,489 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2022-11-02 20:42:59,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:59,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:59,490 INFO L229 MonitoredProcess]: Starting monitored process 81 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:59,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-11-02 20:42:59,492 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:42:59,492 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:42:59,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-11-02 20:42:59,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:42:59,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:42:59,553 INFO L229 MonitoredProcess]: Starting monitored process 82 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:42:59,558 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-02 20:42:59,558 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:42:59,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-11-02 20:43:00,624 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-02 20:43:00,629 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2022-11-02 20:43:00,630 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:43:00,630 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:43:00,630 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:43:00,630 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:43:00,630 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:43:00,630 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:00,630 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:43:00,630 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:43:00,630 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration5_Loop [2022-11-02 20:43:00,631 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:43:00,631 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:43:00,632 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:00,636 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:00,661 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:00,664 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:00,672 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:00,676 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:00,678 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:00,681 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:00,827 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:43:00,828 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:43:00,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:00,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:00,830 INFO L229 MonitoredProcess]: Starting monitored process 83 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:00,834 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 [2022-11-02 20:43:00,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-11-02 20:43:00,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:00,850 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:00,850 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:00,850 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:00,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:00,851 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:00,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:00,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:43:00,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:00,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:00,907 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:00,909 INFO L229 MonitoredProcess]: Starting monitored process 84 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:00,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-11-02 20:43:00,914 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 [2022-11-02 20:43:00,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:00,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:00,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:00,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:00,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:00,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:00,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:00,941 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:43:00,947 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-02 20:43:00,947 INFO L444 ModelExtractionUtils]: 6 out of 9 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-02 20:43:00,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:00,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:00,956 INFO L229 MonitoredProcess]: Starting monitored process 85 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:00,958 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:43:00,958 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-02 20:43:00,959 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:43:00,959 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 [] [2022-11-02 20:43:00,985 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-11-02 20:43:01,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:01,001 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-02 20:43:01,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:01,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:43:01,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:01,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:43:01,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:01,320 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-02 20:43:01,321 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2022-11-02 20:43:01,322 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 48 transitions. cyclomatic complexity: 19 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) [2022-11-02 20:43:01,726 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 48 transitions. cyclomatic complexity: 19. 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 123 states and 190 transitions. Complement of second has 26 states. [2022-11-02 20:43:01,727 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 [2022-11-02 20:43:01,728 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) [2022-11-02 20:43:01,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 71 transitions. [2022-11-02 20:43:01,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 4 letters. Loop has 23 letters. [2022-11-02 20:43:01,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:01,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 27 letters. Loop has 23 letters. [2022-11-02 20:43:01,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:01,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 71 transitions. Stem has 4 letters. Loop has 46 letters. [2022-11-02 20:43:01,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:01,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 190 transitions. [2022-11-02 20:43:01,735 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2022-11-02 20:43:01,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 122 states and 189 transitions. [2022-11-02 20:43:01,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2022-11-02 20:43:01,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 63 [2022-11-02 20:43:01,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 122 states and 189 transitions. [2022-11-02 20:43:01,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:01,741 INFO L218 hiAutomatonCegarLoop]: Abstraction has 122 states and 189 transitions. [2022-11-02 20:43:01,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states and 189 transitions. [2022-11-02 20:43:01,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2022-11-02 20:43:01,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 76 states have internal predecessors, (86), 36 states have call successors, (36), 6 states have call predecessors, (36), 10 states have return successors, (58), 34 states have call predecessors, (58), 36 states have call successors, (58) [2022-11-02 20:43:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2022-11-02 20:43:01,759 INFO L240 hiAutomatonCegarLoop]: Abstraction has 117 states and 180 transitions. [2022-11-02 20:43:01,759 INFO L428 stractBuchiCegarLoop]: Abstraction has 117 states and 180 transitions. [2022-11-02 20:43:01,759 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-02 20:43:01,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 180 transitions. [2022-11-02 20:43:01,761 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 35 [2022-11-02 20:43:01,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:43:01,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:43:01,763 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-02 20:43:01,763 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:01,763 INFO L748 eck$LassoCheckResult]: Stem: 1203#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1181#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; 1182#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1202#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; 1213#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1192#L42-3 [2022-11-02 20:43:01,763 INFO L750 eck$LassoCheckResult]: Loop: 1192#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1209#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; 1171#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1152#factENTRY ~n := #in~n; 1234#L25 assume !(~n <= 0); 1138#L26 call #t~ret0 := fact(~n - 1);< 1187#factENTRY ~n := #in~n; 1230#L25 assume ~n <= 0;#res := 1; 1229#factFINAL assume true; 1137#factEXIT >#66#return; 1141#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1232#factFINAL assume true; 1221#factEXIT >#68#return; 1210#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1152#factENTRY ~n := #in~n; 1234#L25 assume ~n <= 0;#res := 1; 1233#factFINAL assume true; 1228#factEXIT >#70#return; 1151#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1152#factENTRY ~n := #in~n; 1234#L25 assume !(~n <= 0); 1138#L26 call #t~ret0 := fact(~n - 1);< 1187#factENTRY ~n := #in~n; 1230#L25 assume ~n <= 0;#res := 1; 1229#factFINAL assume true; 1137#factEXIT >#66#return; 1141#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1232#factFINAL assume true; 1221#factEXIT >#72#return; 1220#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; 1218#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1216#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1214#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1200#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1191#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1192#L42-3 [2022-11-02 20:43:01,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:01,764 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 1 times [2022-11-02 20:43:01,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:01,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795099961] [2022-11-02 20:43:01,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:01,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:01,769 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:01,773 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:01,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:01,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1403101825, now seen corresponding path program 2 times [2022-11-02 20:43:01,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:01,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393665218] [2022-11-02 20:43:01,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:01,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:01,782 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:01,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [229537300] [2022-11-02 20:43:01,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:43:01,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:01,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:01,785 INFO L229 MonitoredProcess]: Starting monitored process 86 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:01,801 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2022-11-02 20:43:01,839 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:43:01,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:43:01,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:43:01,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:02,070 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 20:43:02,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:02,407 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-02 20:43:02,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:02,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393665218] [2022-11-02 20:43:02,409 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:43:02,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229537300] [2022-11-02 20:43:02,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229537300] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:02,410 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:43:02,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-11-02 20:43:02,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498743625] [2022-11-02 20:43:02,410 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:02,411 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:43:02,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:02,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 20:43:02,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:43:02,414 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. cyclomatic complexity: 68 Second operand has 20 states, 15 states have (on average 2.066666666666667) internal successors, (31), 18 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-02 20:43:02,583 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:03,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:03,668 INFO L93 Difference]: Finished difference Result 284 states and 438 transitions. [2022-11-02 20:43:03,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 284 states and 438 transitions. [2022-11-02 20:43:03,674 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2022-11-02 20:43:03,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 284 states to 271 states and 424 transitions. [2022-11-02 20:43:03,685 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2022-11-02 20:43:03,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2022-11-02 20:43:03,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 424 transitions. [2022-11-02 20:43:03,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:03,687 INFO L218 hiAutomatonCegarLoop]: Abstraction has 271 states and 424 transitions. [2022-11-02 20:43:03,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 424 transitions. [2022-11-02 20:43:03,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 153. [2022-11-02 20:43:03,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 97 states have (on average 1.1546391752577319) internal successors, (112), 102 states have internal predecessors, (112), 46 states have call successors, (46), 6 states have call predecessors, (46), 10 states have return successors, (78), 44 states have call predecessors, (78), 46 states have call successors, (78) [2022-11-02 20:43:03,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 236 transitions. [2022-11-02 20:43:03,747 INFO L240 hiAutomatonCegarLoop]: Abstraction has 153 states and 236 transitions. [2022-11-02 20:43:03,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:43:03,748 INFO L428 stractBuchiCegarLoop]: Abstraction has 153 states and 236 transitions. [2022-11-02 20:43:03,749 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-02 20:43:03,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 153 states and 236 transitions. [2022-11-02 20:43:03,751 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 52 [2022-11-02 20:43:03,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:43:03,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:43:03,753 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-02 20:43:03,756 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 9, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:03,757 INFO L748 eck$LassoCheckResult]: Stem: 1867#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1844#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; 1845#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 1866#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; 1886#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1856#L42-3 [2022-11-02 20:43:03,757 INFO L750 eck$LassoCheckResult]: Loop: 1856#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1913#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; 1803#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume !(~n <= 0); 1849#L26 call #t~ret0 := fact(~n - 1);< 1850#factENTRY ~n := #in~n; 1905#L25 assume ~n <= 0;#res := 1; 1904#factFINAL assume true; 1900#factEXIT >#66#return; 1903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1909#factFINAL assume true; 1908#factEXIT >#68#return; 1796#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume ~n <= 0;#res := 1; 1828#factFINAL assume true; 1795#factEXIT >#70#return; 1799#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume ~n <= 0;#res := 1; 1828#factFINAL assume true; 1795#factEXIT >#72#return; 1808#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; 1859#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1885#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1877#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1868#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; 1805#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume !(~n <= 0); 1849#L26 call #t~ret0 := fact(~n - 1);< 1850#factENTRY ~n := #in~n; 1905#L25 assume ~n <= 0;#res := 1; 1904#factFINAL assume true; 1900#factEXIT >#66#return; 1903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1909#factFINAL assume true; 1908#factEXIT >#68#return; 1804#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume !(~n <= 0); 1849#L26 call #t~ret0 := fact(~n - 1);< 1850#factENTRY ~n := #in~n; 1905#L25 assume ~n <= 0;#res := 1; 1904#factFINAL assume true; 1900#factEXIT >#66#return; 1903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1909#factFINAL assume true; 1908#factEXIT >#70#return; 1801#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume ~n <= 0;#res := 1; 1828#factFINAL assume true; 1795#factEXIT >#72#return; 1809#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; 1923#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 1922#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1921#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 1888#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; 1798#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume !(~n <= 0); 1849#L26 call #t~ret0 := fact(~n - 1);< 1850#factENTRY ~n := #in~n; 1905#L25 assume ~n <= 0;#res := 1; 1904#factFINAL assume true; 1900#factEXIT >#66#return; 1903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1909#factFINAL assume true; 1908#factEXIT >#74#return; 1802#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume ~n <= 0;#res := 1; 1828#factFINAL assume true; 1795#factEXIT >#76#return; 1800#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 1840#factENTRY ~n := #in~n; 1841#L25 assume !(~n <= 0); 1849#L26 call #t~ret0 := fact(~n - 1);< 1850#factENTRY ~n := #in~n; 1905#L25 assume ~n <= 0;#res := 1; 1904#factFINAL assume true; 1900#factEXIT >#66#return; 1903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1909#factFINAL assume true; 1908#factEXIT >#78#return; 1907#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; 1906#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 1889#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 1887#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 1863#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 1855#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 1856#L42-3 [2022-11-02 20:43:03,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:03,758 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 2 times [2022-11-02 20:43:03,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:03,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112729672] [2022-11-02 20:43:03,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:03,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:03,766 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:03,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:03,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:03,787 INFO L85 PathProgramCache]: Analyzing trace with hash 885226027, now seen corresponding path program 1 times [2022-11-02 20:43:03,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:03,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623251120] [2022-11-02 20:43:03,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:03,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:03,799 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:03,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [6687925] [2022-11-02 20:43:03,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:03,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:03,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:03,810 INFO L229 MonitoredProcess]: Starting monitored process 87 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:03,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2022-11-02 20:43:03,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:03,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:43:03,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:04,038 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 184 proven. 7 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2022-11-02 20:43:04,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:04,305 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 16 proven. 105 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-11-02 20:43:04,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:04,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623251120] [2022-11-02 20:43:04,306 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:43:04,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6687925] [2022-11-02 20:43:04,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6687925] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:04,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:43:04,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-11-02 20:43:04,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212152166] [2022-11-02 20:43:04,307 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:04,310 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:43:04,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:04,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:43:04,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:43:04,312 INFO L87 Difference]: Start difference. First operand 153 states and 236 transitions. cyclomatic complexity: 88 Second operand has 11 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 6 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (20), 6 states have call predecessors, (20), 6 states have call successors, (20) [2022-11-02 20:43:04,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:04,693 INFO L93 Difference]: Finished difference Result 285 states and 408 transitions. [2022-11-02 20:43:04,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 285 states and 408 transitions. [2022-11-02 20:43:04,698 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 105 [2022-11-02 20:43:04,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 285 states to 285 states and 408 transitions. [2022-11-02 20:43:04,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 140 [2022-11-02 20:43:04,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 140 [2022-11-02 20:43:04,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 285 states and 408 transitions. [2022-11-02 20:43:04,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:04,706 INFO L218 hiAutomatonCegarLoop]: Abstraction has 285 states and 408 transitions. [2022-11-02 20:43:04,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states and 408 transitions. [2022-11-02 20:43:04,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 165. [2022-11-02 20:43:04,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 105 states have (on average 1.1428571428571428) internal successors, (120), 106 states have internal predecessors, (120), 50 states have call successors, (50), 10 states have call predecessors, (50), 10 states have return successors, (82), 48 states have call predecessors, (82), 50 states have call successors, (82) [2022-11-02 20:43:04,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 252 transitions. [2022-11-02 20:43:04,729 INFO L240 hiAutomatonCegarLoop]: Abstraction has 165 states and 252 transitions. [2022-11-02 20:43:04,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:43:04,731 INFO L428 stractBuchiCegarLoop]: Abstraction has 165 states and 252 transitions. [2022-11-02 20:43:04,731 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-02 20:43:04,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 165 states and 252 transitions. [2022-11-02 20:43:04,733 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 54 [2022-11-02 20:43:04,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:43:04,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:43:04,736 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-02 20:43:04,736 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 17, 9, 8, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:04,737 INFO L748 eck$LassoCheckResult]: Stem: 2870#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 2846#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; 2847#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 2869#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; 2891#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 2860#L42-3 [2022-11-02 20:43:04,737 INFO L750 eck$LassoCheckResult]: Loop: 2860#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2923#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; 2903#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#68#return; 2904#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume ~n <= 0;#res := 1; 2921#factFINAL assume true; 2920#factEXIT >#70#return; 2908#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2911#factENTRY ~n := #in~n; 2919#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#72#return; 2910#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; 2929#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 2928#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2927#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2926#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; 2907#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#68#return; 2905#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#70#return; 2906#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#72#return; 2909#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; 2937#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 2936#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2935#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 2894#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; 2896#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#74#return; 2901#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 2913#factENTRY ~n := #in~n; 2922#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#76#return; 2902#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 2911#factENTRY ~n := #in~n; 2919#L25 assume !(~n <= 0); 2916#L26 call #t~ret0 := fact(~n - 1);< 2853#factENTRY ~n := #in~n; 2925#L25 assume ~n <= 0;#res := 1; 2924#factFINAL assume true; 2915#factEXIT >#66#return; 2914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2912#factFINAL assume true; 2900#factEXIT >#78#return; 2899#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; 2898#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 2897#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 2893#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 2867#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 2859#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 2860#L42-3 [2022-11-02 20:43:04,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:04,738 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 3 times [2022-11-02 20:43:04,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:04,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552468455] [2022-11-02 20:43:04,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:04,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:04,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:04,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:04,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:04,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1877972557, now seen corresponding path program 2 times [2022-11-02 20:43:04,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:04,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917201751] [2022-11-02 20:43:04,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:04,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:04,761 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:04,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1638323312] [2022-11-02 20:43:04,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:43:04,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:04,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:04,765 INFO L229 MonitoredProcess]: Starting monitored process 88 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:04,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-11-02 20:43:04,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:43:04,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:43:04,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 20:43:04,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 355 proven. 48 refuted. 0 times theorem prover too weak. 214 trivial. 0 not checked. [2022-11-02 20:43:05,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:05,556 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 61 proven. 115 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-11-02 20:43:05,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:05,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917201751] [2022-11-02 20:43:05,556 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:43:05,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638323312] [2022-11-02 20:43:05,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638323312] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:05,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:43:05,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2022-11-02 20:43:05,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958715027] [2022-11-02 20:43:05,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:05,562 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:43:05,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:05,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:43:05,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:43:05,564 INFO L87 Difference]: Start difference. First operand 165 states and 252 transitions. cyclomatic complexity: 92 Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 15 states have internal predecessors, (44), 8 states have call successors, (20), 2 states have call predecessors, (20), 5 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2022-11-02 20:43:06,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:06,191 INFO L93 Difference]: Finished difference Result 300 states and 489 transitions. [2022-11-02 20:43:06,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 300 states and 489 transitions. [2022-11-02 20:43:06,198 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 93 [2022-11-02 20:43:06,205 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 300 states to 288 states and 477 transitions. [2022-11-02 20:43:06,206 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 145 [2022-11-02 20:43:06,206 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 145 [2022-11-02 20:43:06,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 288 states and 477 transitions. [2022-11-02 20:43:06,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:06,207 INFO L218 hiAutomatonCegarLoop]: Abstraction has 288 states and 477 transitions. [2022-11-02 20:43:06,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states and 477 transitions. [2022-11-02 20:43:06,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 251. [2022-11-02 20:43:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 163 states have (on average 1.116564417177914) internal successors, (182), 162 states have internal predecessors, (182), 72 states have call successors, (72), 14 states have call predecessors, (72), 16 states have return successors, (178), 74 states have call predecessors, (178), 72 states have call successors, (178) [2022-11-02 20:43:06,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 432 transitions. [2022-11-02 20:43:06,237 INFO L240 hiAutomatonCegarLoop]: Abstraction has 251 states and 432 transitions. [2022-11-02 20:43:06,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:43:06,239 INFO L428 stractBuchiCegarLoop]: Abstraction has 251 states and 432 transitions. [2022-11-02 20:43:06,239 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-02 20:43:06,239 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 251 states and 432 transitions. [2022-11-02 20:43:06,242 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 85 [2022-11-02 20:43:06,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:43:06,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:43:06,245 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-02 20:43:06,245 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [16, 16, 9, 7, 7, 7, 7, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:06,245 INFO L748 eck$LassoCheckResult]: Stem: 4038#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4012#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; 4013#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 4037#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; 4053#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4024#L42-3 [2022-11-02 20:43:06,246 INFO L750 eck$LassoCheckResult]: Loop: 4024#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4098#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; 4082#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3964#factENTRY ~n := #in~n; 4150#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4018#factENTRY ~n := #in~n; 4116#L25 assume ~n <= 0;#res := 1; 4115#factFINAL assume true; 4113#factEXIT >#66#return; 4112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4111#factFINAL assume true; 4080#factEXIT >#68#return; 4085#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3964#factENTRY ~n := #in~n; 4150#L25 assume ~n <= 0;#res := 1; 4095#factFINAL assume true; 4091#factEXIT >#70#return; 3981#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3982#factENTRY ~n := #in~n; 4149#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4018#factENTRY ~n := #in~n; 4116#L25 assume ~n <= 0;#res := 1; 4115#factFINAL assume true; 4113#factEXIT >#66#return; 4112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4111#factFINAL assume true; 4080#factEXIT >#72#return; 4088#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; 4165#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 4154#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4155#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4039#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; 4040#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3964#factENTRY ~n := #in~n; 4150#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4018#factENTRY ~n := #in~n; 4116#L25 assume ~n <= 0;#res := 1; 4115#factFINAL assume true; 4113#factEXIT >#66#return; 4112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4111#factFINAL assume true; 4080#factEXIT >#68#return; 4049#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3964#factENTRY ~n := #in~n; 4150#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4018#factENTRY ~n := #in~n; 4116#L25 assume ~n <= 0;#res := 1; 4115#factFINAL assume true; 4113#factEXIT >#66#return; 4112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4111#factFINAL assume true; 4080#factEXIT >#70#return; 4089#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 4096#factENTRY ~n := #in~n; 4097#L25 assume ~n <= 0;#res := 1; 4095#factFINAL assume true; 4091#factEXIT >#72#return; 4027#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; 4028#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 4167#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4166#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 4056#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; 3963#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 3964#factENTRY ~n := #in~n; 4150#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4018#factENTRY ~n := #in~n; 4116#L25 assume ~n <= 0;#res := 1; 4115#factFINAL assume true; 4113#factEXIT >#66#return; 4112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4111#factFINAL assume true; 4080#factEXIT >#74#return; 4083#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 3964#factENTRY ~n := #in~n; 4150#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4018#factENTRY ~n := #in~n; 4116#L25 assume ~n <= 0;#res := 1; 4115#factFINAL assume true; 4113#factEXIT >#66#return; 4112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4111#factFINAL assume true; 4080#factEXIT >#76#return; 4054#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 3982#factENTRY ~n := #in~n; 4149#L25 assume !(~n <= 0); 3970#L26 call #t~ret0 := fact(~n - 1);< 4018#factENTRY ~n := #in~n; 4116#L25 assume ~n <= 0;#res := 1; 4115#factFINAL assume true; 4113#factEXIT >#66#return; 4112#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 4111#factFINAL assume true; 4080#factEXIT >#78#return; 4014#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; 4015#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 4057#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 4055#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 4034#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 4023#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 4024#L42-3 [2022-11-02 20:43:06,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:06,247 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 4 times [2022-11-02 20:43:06,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:06,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549516137] [2022-11-02 20:43:06,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:06,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:06,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:06,256 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:06,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:06,257 INFO L85 PathProgramCache]: Analyzing trace with hash -77194901, now seen corresponding path program 3 times [2022-11-02 20:43:06,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:06,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076359760] [2022-11-02 20:43:06,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:06,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:06,268 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:06,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [792259295] [2022-11-02 20:43:06,269 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:43:06,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:06,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:06,272 INFO L229 MonitoredProcess]: Starting monitored process 89 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:06,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2022-11-02 20:43:06,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-11-02 20:43:06,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:43:06,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-02 20:43:06,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:06,639 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 96 proven. 66 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-11-02 20:43:06,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 94 proven. 69 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2022-11-02 20:43:07,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:07,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076359760] [2022-11-02 20:43:07,204 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:43:07,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792259295] [2022-11-02 20:43:07,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792259295] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:07,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:43:07,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-11-02 20:43:07,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654730623] [2022-11-02 20:43:07,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:07,206 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:43:07,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:07,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 20:43:07,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:43:07,207 INFO L87 Difference]: Start difference. First operand 251 states and 432 transitions. cyclomatic complexity: 188 Second operand has 23 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 23 states have internal predecessors, (46), 11 states have call successors, (17), 1 states have call predecessors, (17), 4 states have return successors, (17), 6 states have call predecessors, (17), 11 states have call successors, (17) [2022-11-02 20:43:09,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:09,453 INFO L93 Difference]: Finished difference Result 673 states and 1222 transitions. [2022-11-02 20:43:09,453 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 673 states and 1222 transitions. [2022-11-02 20:43:09,465 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 248 [2022-11-02 20:43:09,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 673 states to 667 states and 1216 transitions. [2022-11-02 20:43:09,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 332 [2022-11-02 20:43:09,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 332 [2022-11-02 20:43:09,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 667 states and 1216 transitions. [2022-11-02 20:43:09,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:09,487 INFO L218 hiAutomatonCegarLoop]: Abstraction has 667 states and 1216 transitions. [2022-11-02 20:43:09,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states and 1216 transitions. [2022-11-02 20:43:09,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 292. [2022-11-02 20:43:09,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 187 states have (on average 1.1229946524064172) internal successors, (210), 184 states have internal predecessors, (210), 89 states have call successors, (89), 14 states have call predecessors, (89), 16 states have return successors, (221), 93 states have call predecessors, (221), 89 states have call successors, (221) [2022-11-02 20:43:09,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 520 transitions. [2022-11-02 20:43:09,530 INFO L240 hiAutomatonCegarLoop]: Abstraction has 292 states and 520 transitions. [2022-11-02 20:43:09,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:43:09,531 INFO L428 stractBuchiCegarLoop]: Abstraction has 292 states and 520 transitions. [2022-11-02 20:43:09,532 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-02 20:43:09,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 292 states and 520 transitions. [2022-11-02 20:43:09,535 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 89 [2022-11-02 20:43:09,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:43:09,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:43:09,537 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-02 20:43:09,538 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 20, 11, 11, 11, 11, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:09,538 INFO L748 eck$LassoCheckResult]: Stem: 5663#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5641#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; 5642#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 5662#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; 5681#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 5652#L42-3 [2022-11-02 20:43:09,538 INFO L750 eck$LassoCheckResult]: Loop: 5652#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 5733#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; 5692#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 5712#factENTRY ~n := #in~n; 5718#L25 assume !(~n <= 0); 5719#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume !(~n <= 0); 5725#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume ~n <= 0;#res := 1; 5730#factFINAL assume true; 5727#factEXIT >#66#return; 5726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5732#factFINAL assume true; 5724#factEXIT >#66#return; 5722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5721#factFINAL assume true; 5689#factEXIT >#68#return; 5703#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 5712#factENTRY ~n := #in~n; 5718#L25 assume ~n <= 0;#res := 1; 5715#factFINAL assume true; 5713#factEXIT >#70#return; 5699#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 5709#factENTRY ~n := #in~n; 5729#L25 assume !(~n <= 0); 5719#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume ~n <= 0;#res := 1; 5730#factFINAL assume true; 5727#factEXIT >#66#return; 5723#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5710#factFINAL assume true; 5711#factEXIT >#72#return; 5717#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; 5825#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 5823#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 5822#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 5816#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; 5698#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 5712#factENTRY ~n := #in~n; 5718#L25 assume !(~n <= 0); 5719#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume !(~n <= 0); 5725#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume ~n <= 0;#res := 1; 5730#factFINAL assume true; 5727#factEXIT >#66#return; 5726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5732#factFINAL assume true; 5724#factEXIT >#66#return; 5722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5721#factFINAL assume true; 5689#factEXIT >#68#return; 5691#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 5712#factENTRY ~n := #in~n; 5718#L25 assume !(~n <= 0); 5719#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume !(~n <= 0); 5725#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume ~n <= 0;#res := 1; 5730#factFINAL assume true; 5727#factEXIT >#66#return; 5726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5732#factFINAL assume true; 5724#factEXIT >#66#return; 5722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5721#factFINAL assume true; 5689#factEXIT >#70#return; 5705#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 5716#factENTRY ~n := #in~n; 5720#L25 assume ~n <= 0;#res := 1; 5715#factFINAL assume true; 5713#factEXIT >#72#return; 5714#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; 5811#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 5752#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 5745#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 5683#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; 5704#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 5712#factENTRY ~n := #in~n; 5718#L25 assume !(~n <= 0); 5719#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume !(~n <= 0); 5725#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume ~n <= 0;#res := 1; 5730#factFINAL assume true; 5727#factEXIT >#66#return; 5726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5732#factFINAL assume true; 5724#factEXIT >#66#return; 5722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5721#factFINAL assume true; 5689#factEXIT >#74#return; 5701#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 5712#factENTRY ~n := #in~n; 5718#L25 assume ~n <= 0;#res := 1; 5715#factFINAL assume true; 5713#factEXIT >#76#return; 5694#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 5709#factENTRY ~n := #in~n; 5729#L25 assume !(~n <= 0); 5719#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume !(~n <= 0); 5725#L26 call #t~ret0 := fact(~n - 1);< 5646#factENTRY ~n := #in~n; 5731#L25 assume ~n <= 0;#res := 1; 5730#factFINAL assume true; 5727#factEXIT >#66#return; 5726#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5732#factFINAL assume true; 5724#factEXIT >#66#return; 5722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5721#factFINAL assume true; 5689#factEXIT >#78#return; 5688#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; 5687#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 5684#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 5682#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 5659#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 5651#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 5652#L42-3 [2022-11-02 20:43:09,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:09,539 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 5 times [2022-11-02 20:43:09,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:09,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208520127] [2022-11-02 20:43:09,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:09,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:09,544 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:09,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:09,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:09,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1233557403, now seen corresponding path program 4 times [2022-11-02 20:43:09,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:09,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123631087] [2022-11-02 20:43:09,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:09,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:09,564 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:09,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1718321065] [2022-11-02 20:43:09,565 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:43:09,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:09,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:09,568 INFO L229 MonitoredProcess]: Starting monitored process 90 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:09,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2022-11-02 20:43:09,714 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:43:09,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:43:09,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-02 20:43:09,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 408 proven. 29 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2022-11-02 20:43:09,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:10,443 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 24 proven. 290 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2022-11-02 20:43:10,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:10,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123631087] [2022-11-02 20:43:10,443 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:43:10,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718321065] [2022-11-02 20:43:10,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718321065] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:10,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:43:10,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 15 [2022-11-02 20:43:10,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486526336] [2022-11-02 20:43:10,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:10,448 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:43:10,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:10,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:43:10,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:43:10,450 INFO L87 Difference]: Start difference. First operand 292 states and 520 transitions. cyclomatic complexity: 236 Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 10 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (24), 8 states have call predecessors, (24), 10 states have call successors, (24) [2022-11-02 20:43:11,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:11,014 INFO L93 Difference]: Finished difference Result 527 states and 864 transitions. [2022-11-02 20:43:11,014 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 527 states and 864 transitions. [2022-11-02 20:43:11,022 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 174 [2022-11-02 20:43:11,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 527 states to 527 states and 864 transitions. [2022-11-02 20:43:11,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 230 [2022-11-02 20:43:11,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 230 [2022-11-02 20:43:11,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 527 states and 864 transitions. [2022-11-02 20:43:11,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:11,034 INFO L218 hiAutomatonCegarLoop]: Abstraction has 527 states and 864 transitions. [2022-11-02 20:43:11,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states and 864 transitions. [2022-11-02 20:43:11,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 325. [2022-11-02 20:43:11,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 199 states have (on average 1.1155778894472361) internal successors, (222), 194 states have internal predecessors, (222), 110 states have call successors, (110), 20 states have call predecessors, (110), 16 states have return successors, (254), 110 states have call predecessors, (254), 110 states have call successors, (254) [2022-11-02 20:43:11,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 586 transitions. [2022-11-02 20:43:11,061 INFO L240 hiAutomatonCegarLoop]: Abstraction has 325 states and 586 transitions. [2022-11-02 20:43:11,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:43:11,062 INFO L428 stractBuchiCegarLoop]: Abstraction has 325 states and 586 transitions. [2022-11-02 20:43:11,062 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-02 20:43:11,063 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 325 states and 586 transitions. [2022-11-02 20:43:11,066 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 97 [2022-11-02 20:43:11,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:43:11,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:43:11,068 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-11-02 20:43:11,069 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [19, 19, 10, 10, 10, 10, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:11,069 INFO L748 eck$LassoCheckResult]: Stem: 7293#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7268#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; 7269#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 7292#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; 7325#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 7281#L42-3 [2022-11-02 20:43:11,070 INFO L750 eck$LassoCheckResult]: Loop: 7281#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7316#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; 7338#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7359#factENTRY ~n := #in~n; 7381#L25 assume !(~n <= 0); 7371#L26 call #t~ret0 := fact(~n - 1);< 7378#factENTRY ~n := #in~n; 7382#L25 assume ~n <= 0;#res := 1; 7379#factFINAL assume true; 7376#factEXIT >#66#return; 7375#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7357#factFINAL assume true; 7358#factEXIT >#68#return; 7346#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7359#factENTRY ~n := #in~n; 7381#L25 assume ~n <= 0;#res := 1; 7363#factFINAL assume true; 7362#factEXIT >#70#return; 7347#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7360#factENTRY ~n := #in~n; 7380#L25 assume !(~n <= 0); 7371#L26 call #t~ret0 := fact(~n - 1);< 7378#factENTRY ~n := #in~n; 7382#L25 assume ~n <= 0;#res := 1; 7379#factFINAL assume true; 7376#factEXIT >#66#return; 7375#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7357#factFINAL assume true; 7358#factEXIT >#72#return; 7365#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; 7404#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 7402#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 7399#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7398#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; 7335#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7359#factENTRY ~n := #in~n; 7381#L25 assume !(~n <= 0); 7371#L26 call #t~ret0 := fact(~n - 1);< 7378#factENTRY ~n := #in~n; 7382#L25 assume !(~n <= 0); 7370#L26 call #t~ret0 := fact(~n - 1);< 7378#factENTRY ~n := #in~n; 7382#L25 assume ~n <= 0;#res := 1; 7379#factFINAL assume true; 7376#factEXIT >#66#return; 7374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7384#factFINAL assume true; 7369#factEXIT >#66#return; 7368#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7367#factFINAL assume true; 7334#factEXIT >#68#return; 7342#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7359#factENTRY ~n := #in~n; 7381#L25 assume !(~n <= 0); 7371#L26 call #t~ret0 := fact(~n - 1);< 7378#factENTRY ~n := #in~n; 7382#L25 assume !(~n <= 0); 7370#L26 call #t~ret0 := fact(~n - 1);< 7378#factENTRY ~n := #in~n; 7382#L25 assume ~n <= 0;#res := 1; 7379#factFINAL assume true; 7376#factEXIT >#66#return; 7374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7384#factFINAL assume true; 7369#factEXIT >#66#return; 7368#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7367#factFINAL assume true; 7334#factEXIT >#70#return; 7354#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7364#factENTRY ~n := #in~n; 7366#L25 assume ~n <= 0;#res := 1; 7363#factFINAL assume true; 7362#factEXIT >#72#return; 7287#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; 7288#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 7419#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 7418#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 7326#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; 7328#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 7359#factENTRY ~n := #in~n; 7381#L25 assume !(~n <= 0); 7371#L26 call #t~ret0 := fact(~n - 1);< 7378#factENTRY ~n := #in~n; 7382#L25 assume !(~n <= 0); 7370#L26 call #t~ret0 := fact(~n - 1);< 7378#factENTRY ~n := #in~n; 7382#L25 assume ~n <= 0;#res := 1; 7379#factFINAL assume true; 7376#factEXIT >#66#return; 7374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7384#factFINAL assume true; 7369#factEXIT >#66#return; 7368#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7367#factFINAL assume true; 7334#factEXIT >#74#return; 7344#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 7359#factENTRY ~n := #in~n; 7381#L25 assume ~n <= 0;#res := 1; 7363#factFINAL assume true; 7362#factEXIT >#76#return; 7349#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 7356#factENTRY ~n := #in~n; 7383#L25 assume !(~n <= 0); 7373#L26 call #t~ret0 := fact(~n - 1);< 7273#factENTRY ~n := #in~n; 7389#L25 assume !(~n <= 0); 7370#L26 call #t~ret0 := fact(~n - 1);< 7378#factENTRY ~n := #in~n; 7382#L25 assume ~n <= 0;#res := 1; 7379#factFINAL assume true; 7376#factEXIT >#66#return; 7374#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7384#factFINAL assume true; 7369#factEXIT >#66#return; 7368#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 7367#factFINAL assume true; 7334#factEXIT >#78#return; 7333#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; 7332#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 7331#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 7330#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 7284#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 7280#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 7281#L42-3 [2022-11-02 20:43:11,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:11,070 INFO L85 PathProgramCache]: Analyzing trace with hash 36330292, now seen corresponding path program 6 times [2022-11-02 20:43:11,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:11,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119276354] [2022-11-02 20:43:11,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:11,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:11,075 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:11,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:11,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:11,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1601053981, now seen corresponding path program 5 times [2022-11-02 20:43:11,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:11,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388701878] [2022-11-02 20:43:11,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:11,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:11,092 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:11,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [843201006] [2022-11-02 20:43:11,093 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 20:43:11,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:11,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:11,104 INFO L229 MonitoredProcess]: Starting monitored process 91 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:11,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2022-11-02 20:43:11,211 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-11-02 20:43:11,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:43:11,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 20:43:11,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 468 proven. 71 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2022-11-02 20:43:11,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 68 proven. 193 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2022-11-02 20:43:11,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:11,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388701878] [2022-11-02 20:43:11,921 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:43:11,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [843201006] [2022-11-02 20:43:11,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [843201006] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:11,922 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:43:11,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 16 [2022-11-02 20:43:11,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859780364] [2022-11-02 20:43:11,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:11,923 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:43:11,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:11,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:43:11,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:43:11,924 INFO L87 Difference]: Start difference. First operand 325 states and 586 transitions. cyclomatic complexity: 269 Second operand has 16 states, 13 states have (on average 3.769230769230769) internal successors, (49), 16 states have internal predecessors, (49), 11 states have call successors, (21), 2 states have call predecessors, (21), 6 states have return successors, (21), 7 states have call predecessors, (21), 11 states have call successors, (21) [2022-11-02 20:43:12,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:12,833 INFO L93 Difference]: Finished difference Result 539 states and 948 transitions. [2022-11-02 20:43:12,833 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 539 states and 948 transitions. [2022-11-02 20:43:12,844 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 168 [2022-11-02 20:43:12,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 539 states to 539 states and 948 transitions. [2022-11-02 20:43:12,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 253 [2022-11-02 20:43:12,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 253 [2022-11-02 20:43:12,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 539 states and 948 transitions. [2022-11-02 20:43:12,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:12,855 INFO L218 hiAutomatonCegarLoop]: Abstraction has 539 states and 948 transitions. [2022-11-02 20:43:12,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states and 948 transitions. [2022-11-02 20:43:12,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 431. [2022-11-02 20:43:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 253 states have (on average 1.1304347826086956) internal successors, (286), 248 states have internal predecessors, (286), 162 states have call successors, (162), 26 states have call predecessors, (162), 16 states have return successors, (340), 156 states have call predecessors, (340), 162 states have call successors, (340) [2022-11-02 20:43:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 788 transitions. [2022-11-02 20:43:12,888 INFO L240 hiAutomatonCegarLoop]: Abstraction has 431 states and 788 transitions. [2022-11-02 20:43:12,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:43:12,891 INFO L428 stractBuchiCegarLoop]: Abstraction has 431 states and 788 transitions. [2022-11-02 20:43:12,892 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-02 20:43:12,892 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 431 states and 788 transitions. [2022-11-02 20:43:12,896 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 132 [2022-11-02 20:43:12,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:43:12,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:43:12,898 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:12,898 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:43:12,898 INFO L748 eck$LassoCheckResult]: Stem: 8914#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 8874#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; 8875#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 8913#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; 8899#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 8900#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 9046#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; 8970#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 9001#factENTRY ~n := #in~n; 9036#L25 assume !(~n <= 0); 9020#L26 call #t~ret0 := fact(~n - 1);< 9034#factENTRY [2022-11-02 20:43:12,898 INFO L750 eck$LassoCheckResult]: Loop: 9034#factENTRY ~n := #in~n; 9049#L25 assume !(~n <= 0); 9023#L26 call #t~ret0 := fact(~n - 1);< 9034#factENTRY [2022-11-02 20:43:12,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:12,899 INFO L85 PathProgramCache]: Analyzing trace with hash 271623377, now seen corresponding path program 1 times [2022-11-02 20:43:12,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:12,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646809588] [2022-11-02 20:43:12,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:12,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:13,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:13,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:13,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646809588] [2022-11-02 20:43:13,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646809588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:13,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:13,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:43:13,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984943169] [2022-11-02 20:43:13,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:13,017 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:43:13,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:13,018 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 1 times [2022-11-02 20:43:13,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:13,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296679111] [2022-11-02 20:43:13,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:13,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:13,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:13,031 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:13,066 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:43:13,067 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:43:13,067 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:43:13,067 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:43:13,067 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-02 20:43:13,067 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:13,067 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:43:13,068 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:43:13,068 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2022-11-02 20:43:13,068 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:43:13,068 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:43:13,069 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:13,072 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:13,080 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:13,082 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:13,111 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:43:13,112 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-02 20:43:13,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:13,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:13,115 INFO L229 MonitoredProcess]: Starting monitored process 92 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:13,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:13,122 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:13,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-11-02 20:43:13,147 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:43:13,148 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-02 20:43:13,189 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:13,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:13,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:13,191 INFO L229 MonitoredProcess]: Starting monitored process 93 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:13,193 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:13,193 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:13,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-11-02 20:43:13,261 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:13,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:13,261 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:13,263 INFO L229 MonitoredProcess]: Starting monitored process 94 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:13,265 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-02 20:43:13,265 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:13,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-11-02 20:43:13,375 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-02 20:43:13,378 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2022-11-02 20:43:13,378 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:43:13,379 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:43:13,379 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:43:13,379 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:43:13,379 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:43:13,379 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:13,379 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:43:13,379 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:43:13,379 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration12_Loop [2022-11-02 20:43:13,379 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:43:13,379 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:43:13,380 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:13,382 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:13,389 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:13,392 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:13,424 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:43:13,424 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:43:13,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:13,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:13,426 INFO L229 MonitoredProcess]: Starting monitored process 95 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:13,428 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-11-02 20:43:13,429 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 [2022-11-02 20:43:13,440 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:13,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:13,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:13,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:13,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:13,441 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:13,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:13,443 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:43:13,470 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:13,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:13,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:13,471 INFO L229 MonitoredProcess]: Starting monitored process 96 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:13,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2022-11-02 20:43:13,473 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 [2022-11-02 20:43:13,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:13,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:13,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:13,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:13,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:13,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:13,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:13,489 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:43:13,491 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-11-02 20:43:13,492 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-02 20:43:13,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:13,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:13,494 INFO L229 MonitoredProcess]: Starting monitored process 97 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:13,502 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:43:13,502 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-02 20:43:13,502 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:43:13,502 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2022-11-02 20:43:13,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-11-02 20:43:13,550 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Ended with exit code 0 [2022-11-02 20:43:13,550 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-02 20:43:13,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:13,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:13,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:43:13,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:13,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:43:13,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:13,662 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-11-02 20:43:13,663 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 431 states and 788 transitions. cyclomatic complexity: 365 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) [2022-11-02 20:43:13,765 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 431 states and 788 transitions. cyclomatic complexity: 365. 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 531 states and 944 transitions. Complement of second has 13 states. [2022-11-02 20:43:13,766 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 [2022-11-02 20:43:13,767 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) [2022-11-02 20:43:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-11-02 20:43:13,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 3 letters. [2022-11-02 20:43:13,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:13,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 14 letters. Loop has 3 letters. [2022-11-02 20:43:13,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:13,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 6 letters. [2022-11-02 20:43:13,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:13,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 531 states and 944 transitions. [2022-11-02 20:43:13,784 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 140 [2022-11-02 20:43:13,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 531 states to 517 states and 928 transitions. [2022-11-02 20:43:13,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 234 [2022-11-02 20:43:13,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 237 [2022-11-02 20:43:13,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 517 states and 928 transitions. [2022-11-02 20:43:13,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:13,798 INFO L218 hiAutomatonCegarLoop]: Abstraction has 517 states and 928 transitions. [2022-11-02 20:43:13,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states and 928 transitions. [2022-11-02 20:43:13,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 511. [2022-11-02 20:43:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 303 states have (on average 1.1485148514851484) internal successors, (348), 300 states have internal predecessors, (348), 184 states have call successors, (184), 42 states have call predecessors, (184), 24 states have return successors, (386), 168 states have call predecessors, (386), 184 states have call successors, (386) [2022-11-02 20:43:13,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 918 transitions. [2022-11-02 20:43:13,850 INFO L240 hiAutomatonCegarLoop]: Abstraction has 511 states and 918 transitions. [2022-11-02 20:43:13,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:13,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:43:13,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:43:13,852 INFO L87 Difference]: Start difference. First operand 511 states and 918 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) [2022-11-02 20:43:13,924 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:13,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:13,959 INFO L93 Difference]: Finished difference Result 574 states and 1006 transitions. [2022-11-02 20:43:13,959 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 574 states and 1006 transitions. [2022-11-02 20:43:13,971 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 166 [2022-11-02 20:43:13,982 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 574 states to 574 states and 1006 transitions. [2022-11-02 20:43:13,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 267 [2022-11-02 20:43:13,983 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 267 [2022-11-02 20:43:13,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 574 states and 1006 transitions. [2022-11-02 20:43:13,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:13,984 INFO L218 hiAutomatonCegarLoop]: Abstraction has 574 states and 1006 transitions. [2022-11-02 20:43:13,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states and 1006 transitions. [2022-11-02 20:43:14,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 569. [2022-11-02 20:43:14,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 341 states have (on average 1.1407624633431086) internal successors, (389), 336 states have internal predecessors, (389), 200 states have call successors, (200), 46 states have call predecessors, (200), 28 states have return successors, (410), 186 states have call predecessors, (410), 200 states have call successors, (410) [2022-11-02 20:43:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 999 transitions. [2022-11-02 20:43:14,015 INFO L240 hiAutomatonCegarLoop]: Abstraction has 569 states and 999 transitions. [2022-11-02 20:43:14,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:43:14,016 INFO L428 stractBuchiCegarLoop]: Abstraction has 569 states and 999 transitions. [2022-11-02 20:43:14,017 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-11-02 20:43:14,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 569 states and 999 transitions. [2022-11-02 20:43:14,022 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 163 [2022-11-02 20:43:14,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:43:14,023 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:43:14,024 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:14,024 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:14,025 INFO L748 eck$LassoCheckResult]: Stem: 11013#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 10981#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; 10982#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 11012#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; 10997#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 10998#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 11279#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; 11277#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 11278#factENTRY ~n := #in~n; 11281#L25 assume ~n <= 0;#res := 1; 11280#factFINAL assume true; 11276#factEXIT >#68#return; 10990#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 11088#factENTRY ~n := #in~n; 11274#L25 assume ~n <= 0;#res := 1; 11270#factFINAL assume true; 11268#factEXIT >#70#return; 11029#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 10954#factENTRY ~n := #in~n; 11272#L25 assume !(~n <= 0); 11217#L26 call #t~ret0 := fact(~n - 1);< 11236#factENTRY ~n := #in~n; 11233#L25 assume !(~n <= 0); 11216#L26 call #t~ret0 := fact(~n - 1);< 11227#factENTRY ~n := #in~n; 11235#L25 assume ~n <= 0;#res := 1; 11234#factFINAL assume true; 11231#factEXIT >#66#return; 11172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11226#factFINAL assume true; 11215#factEXIT >#66#return; 11019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11041#factFINAL assume true; 11254#factEXIT >#72#return; 11257#L30-3 [2022-11-02 20:43:14,025 INFO L750 eck$LassoCheckResult]: Loop: 11257#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; 11294#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 11293#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 11292#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 11291#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; 10958#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 10971#factENTRY ~n := #in~n; 10978#L25 assume ~n <= 0;#res := 1; 10973#factFINAL assume true; 10957#factEXIT >#68#return; 10960#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 11230#factENTRY ~n := #in~n; 11228#L25 assume ~n <= 0;#res := 1; 11229#factFINAL assume true; 11242#factEXIT >#70#return; 11027#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 11248#factENTRY ~n := #in~n; 11250#L25 assume !(~n <= 0); 11166#L26 call #t~ret0 := fact(~n - 1);< 11211#factENTRY ~n := #in~n; 11212#L25 assume !(~n <= 0); 11168#L26 call #t~ret0 := fact(~n - 1);< 11211#factENTRY ~n := #in~n; 11212#L25 assume !(~n <= 0); 11168#L26 call #t~ret0 := fact(~n - 1);< 11211#factENTRY ~n := #in~n; 11212#L25 assume ~n <= 0;#res := 1; 11174#factFINAL assume true; 11165#factEXIT >#66#return; 11172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11226#factFINAL assume true; 11215#factEXIT >#66#return; 11172#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11226#factFINAL assume true; 11215#factEXIT >#66#return; 11019#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 11041#factFINAL assume true; 11254#factEXIT >#72#return; 11257#L30-3 [2022-11-02 20:43:14,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:14,026 INFO L85 PathProgramCache]: Analyzing trace with hash 914152944, now seen corresponding path program 1 times [2022-11-02 20:43:14,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:14,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185339001] [2022-11-02 20:43:14,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:14,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:14,038 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:14,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1399094892] [2022-11-02 20:43:14,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:14,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:14,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:14,041 INFO L229 MonitoredProcess]: Starting monitored process 98 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:14,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2022-11-02 20:43:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:14,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:43:14,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-02 20:43:14,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-02 20:43:14,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:14,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185339001] [2022-11-02 20:43:14,335 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:43:14,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399094892] [2022-11-02 20:43:14,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399094892] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:14,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:43:14,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-11-02 20:43:14,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228034626] [2022-11-02 20:43:14,336 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:14,336 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:43:14,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:14,337 INFO L85 PathProgramCache]: Analyzing trace with hash -40834696, now seen corresponding path program 1 times [2022-11-02 20:43:14,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:14,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719281933] [2022-11-02 20:43:14,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:14,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:14,343 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:14,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1927682695] [2022-11-02 20:43:14,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:14,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:14,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:14,350 INFO L229 MonitoredProcess]: Starting monitored process 99 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:14,371 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2022-11-02 20:43:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:14,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:14,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:16,200 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:43:16,201 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:43:16,201 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:43:16,201 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:43:16,201 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-02 20:43:16,201 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:16,201 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:43:16,201 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:43:16,201 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2022-11-02 20:43:16,201 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:43:16,202 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:43:16,203 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:16,206 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:16,209 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:16,212 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:16,215 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:16,217 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:16,424 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:43:16,424 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-02 20:43:16,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:16,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:16,429 INFO L229 MonitoredProcess]: Starting monitored process 100 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:16,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:16,435 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:16,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-11-02 20:43:16,449 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:43:16,449 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: [] [2022-11-02 20:43:16,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2022-11-02 20:43:16,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:16,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:16,485 INFO L229 MonitoredProcess]: Starting monitored process 101 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:16,488 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-11-02 20:43:16,489 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:16,489 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:16,503 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:43:16,504 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-02 20:43:16,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2022-11-02 20:43:16,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:16,533 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:16,534 INFO L229 MonitoredProcess]: Starting monitored process 102 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:16,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2022-11-02 20:43:16,536 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:16,537 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:16,551 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:43:16,551 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: [] [2022-11-02 20:43:16,576 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2022-11-02 20:43:16,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:16,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:16,578 INFO L229 MonitoredProcess]: Starting monitored process 103 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:16,579 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2022-11-02 20:43:16,579 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:16,580 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:16,593 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:43:16,593 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-02 20:43:16,623 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2022-11-02 20:43:16,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:16,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:16,625 INFO L229 MonitoredProcess]: Starting monitored process 104 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:16,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2022-11-02 20:43:16,626 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:16,626 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:16,640 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:43:16,640 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-02 20:43:16,666 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:16,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:16,666 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:16,667 INFO L229 MonitoredProcess]: Starting monitored process 105 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:16,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-11-02 20:43:16,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:16,669 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:16,711 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:16,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:16,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:16,712 INFO L229 MonitoredProcess]: Starting monitored process 106 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:16,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-11-02 20:43:16,714 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-02 20:43:16,714 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:16,740 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-02 20:43:16,766 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2022-11-02 20:43:16,766 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:43:16,767 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:43:16,767 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:43:16,767 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:43:16,767 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:43:16,767 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:16,767 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:43:16,767 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:43:16,767 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration13_Loop [2022-11-02 20:43:16,767 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:43:16,767 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:43:16,769 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:16,773 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:16,814 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:16,817 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:16,820 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:16,823 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:17,015 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:43:17,015 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:43:17,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:17,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:17,017 INFO L229 MonitoredProcess]: Starting monitored process 107 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:17,020 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 [2022-11-02 20:43:17,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-11-02 20:43:17,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:17,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:17,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:17,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:17,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:17,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:17,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:17,053 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:43:17,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:17,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:17,095 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:17,096 INFO L229 MonitoredProcess]: Starting monitored process 108 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:17,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-11-02 20:43:17,098 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 [2022-11-02 20:43:17,115 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:17,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:17,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:17,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:17,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:17,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:17,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:17,124 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:43:17,127 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-11-02 20:43:17,128 INFO L444 ModelExtractionUtils]: 8 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-02 20:43:17,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:17,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:17,129 INFO L229 MonitoredProcess]: Starting monitored process 109 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:17,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2022-11-02 20:43:17,130 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:43:17,131 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-02 20:43:17,131 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:43:17,131 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -1*ULTIMATE.start_main_~k~0#1 Supporting invariants [] [2022-11-02 20:43:17,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2022-11-02 20:43:17,184 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-02 20:43:17,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:17,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:43:17,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:17,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:17,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-02 20:43:17,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:17,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:18,106 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 24 proven. 20 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-02 20:43:18,107 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2022-11-02 20:43:18,107 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 569 states and 999 transitions. cyclomatic complexity: 446 Second operand has 14 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-02 20:43:18,899 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 569 states and 999 transitions. cyclomatic complexity: 446. Second operand has 14 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) Result 1116 states and 1735 transitions. Complement of second has 67 states. [2022-11-02 20:43:18,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2022-11-02 20:43:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2022-11-02 20:43:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 77 transitions. [2022-11-02 20:43:18,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 77 transitions. Stem has 34 letters. Loop has 38 letters. [2022-11-02 20:43:18,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:18,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 77 transitions. Stem has 72 letters. Loop has 38 letters. [2022-11-02 20:43:18,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:18,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 77 transitions. Stem has 34 letters. Loop has 76 letters. [2022-11-02 20:43:18,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:18,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1116 states and 1735 transitions. [2022-11-02 20:43:18,939 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 151 [2022-11-02 20:43:18,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1116 states to 1093 states and 1703 transitions. [2022-11-02 20:43:18,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 364 [2022-11-02 20:43:18,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 370 [2022-11-02 20:43:18,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1093 states and 1703 transitions. [2022-11-02 20:43:18,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:18,958 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1093 states and 1703 transitions. [2022-11-02 20:43:18,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states and 1703 transitions. [2022-11-02 20:43:19,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1005. [2022-11-02 20:43:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1005 states, 634 states have (on average 1.1577287066246056) internal successors, (734), 625 states have internal predecessors, (734), 274 states have call successors, (280), 123 states have call predecessors, (280), 97 states have return successors, (536), 256 states have call predecessors, (536), 273 states have call successors, (536) [2022-11-02 20:43:19,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1550 transitions. [2022-11-02 20:43:19,012 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1005 states and 1550 transitions. [2022-11-02 20:43:19,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:19,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:43:19,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:43:19,013 INFO L87 Difference]: Start difference. First operand 1005 states and 1550 transitions. Second operand has 10 states, 7 states have (on average 3.0) internal successors, (21), 9 states have internal predecessors, (21), 4 states have call successors, (8), 1 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-02 20:43:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:19,401 INFO L93 Difference]: Finished difference Result 1013 states and 1577 transitions. [2022-11-02 20:43:19,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1013 states and 1577 transitions. [2022-11-02 20:43:19,417 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 186 [2022-11-02 20:43:19,434 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1013 states to 973 states and 1533 transitions. [2022-11-02 20:43:19,434 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 349 [2022-11-02 20:43:19,435 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 349 [2022-11-02 20:43:19,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 973 states and 1533 transitions. [2022-11-02 20:43:19,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:19,436 INFO L218 hiAutomatonCegarLoop]: Abstraction has 973 states and 1533 transitions. [2022-11-02 20:43:19,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states and 1533 transitions. [2022-11-02 20:43:19,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 881. [2022-11-02 20:43:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 551 states have (on average 1.1415607985480944) internal successors, (629), 546 states have internal predecessors, (629), 252 states have call successors, (256), 110 states have call predecessors, (256), 78 states have return successors, (486), 224 states have call predecessors, (486), 252 states have call successors, (486) [2022-11-02 20:43:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1371 transitions. [2022-11-02 20:43:19,525 INFO L240 hiAutomatonCegarLoop]: Abstraction has 881 states and 1371 transitions. [2022-11-02 20:43:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:43:19,527 INFO L428 stractBuchiCegarLoop]: Abstraction has 881 states and 1371 transitions. [2022-11-02 20:43:19,527 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-11-02 20:43:19,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 881 states and 1371 transitions. [2022-11-02 20:43:19,535 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 150 [2022-11-02 20:43:19,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:43:19,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:43:19,536 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:19,537 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 5, 5, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:19,537 INFO L748 eck$LassoCheckResult]: Stem: 15245#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 15214#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; 15215#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 15244#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; 15230#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 15231#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 15635#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; 15630#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 15631#factENTRY ~n := #in~n; 15642#L25 assume ~n <= 0;#res := 1; 15634#factFINAL assume true; 15629#factEXIT >#68#return; 15267#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 15268#factENTRY ~n := #in~n; 15633#L25 assume ~n <= 0;#res := 1; 15628#factFINAL assume true; 15612#factEXIT >#70#return; 15613#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 15268#factENTRY ~n := #in~n; 15633#L25 assume ~n <= 0;#res := 1; 15628#factFINAL assume true; 15612#factEXIT >#72#return; 15614#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; 15680#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 15677#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 15674#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 15671#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; 15190#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 15191#factENTRY ~n := #in~n; 15706#L25 assume !(~n <= 0); 15254#L26 call #t~ret0 := fact(~n - 1);< 15683#factENTRY ~n := #in~n; 15650#L25 assume ~n <= 0;#res := 1; 15651#factFINAL assume true; 15636#factEXIT >#66#return; 15639#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 15675#factFINAL assume true; 15672#factEXIT >#74#return; 15646#L30-6 [2022-11-02 20:43:19,537 INFO L750 eck$LassoCheckResult]: Loop: 15646#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 15665#factENTRY ~n := #in~n; 15670#L25 assume !(~n <= 0); 15644#L26 call #t~ret0 := fact(~n - 1);< 15641#factENTRY ~n := #in~n; 15700#L25 assume ~n <= 0;#res := 1; 15643#factFINAL assume true; 15645#factEXIT >#66#return; 15639#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 15675#factFINAL assume true; 15672#factEXIT >#76#return; 15664#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 15695#factENTRY ~n := #in~n; 15693#L25 assume !(~n <= 0); 15253#L26 call #t~ret0 := fact(~n - 1);< 15679#factENTRY ~n := #in~n; 15686#L25 assume !(~n <= 0); 15252#L26 call #t~ret0 := fact(~n - 1);< 15679#factENTRY ~n := #in~n; 15686#L25 assume !(~n <= 0); 15252#L26 call #t~ret0 := fact(~n - 1);< 15679#factENTRY ~n := #in~n; 15686#L25 assume ~n <= 0;#res := 1; 15643#factFINAL assume true; 15645#factEXIT >#66#return; 15250#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 15255#factFINAL assume true; 15678#factEXIT >#66#return; 15250#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 15255#factFINAL assume true; 15678#factEXIT >#66#return; 15676#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 15673#factFINAL assume true; 15668#factEXIT >#78#return; 15669#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; 15823#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 15822#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 15820#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 15449#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; 15451#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 15667#factENTRY ~n := #in~n; 15692#L25 assume !(~n <= 0); 15253#L26 call #t~ret0 := fact(~n - 1);< 15679#factENTRY ~n := #in~n; 15686#L25 assume ~n <= 0;#res := 1; 15643#factFINAL assume true; 15645#factEXIT >#66#return; 15639#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 15675#factFINAL assume true; 15672#factEXIT >#74#return; 15646#L30-6 [2022-11-02 20:43:19,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:19,538 INFO L85 PathProgramCache]: Analyzing trace with hash -426322681, now seen corresponding path program 1 times [2022-11-02 20:43:19,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:19,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016217589] [2022-11-02 20:43:19,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:19,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:19,546 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:19,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1624266752] [2022-11-02 20:43:19,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:19,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:19,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:19,549 INFO L229 MonitoredProcess]: Starting monitored process 110 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:19,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2022-11-02 20:43:19,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:19,614 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:19,643 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:19,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:19,644 INFO L85 PathProgramCache]: Analyzing trace with hash -978256132, now seen corresponding path program 1 times [2022-11-02 20:43:19,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:19,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861544489] [2022-11-02 20:43:19,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:19,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:19,650 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:19,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1106152194] [2022-11-02 20:43:19,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:19,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:19,650 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:19,654 INFO L229 MonitoredProcess]: Starting monitored process 111 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:19,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2022-11-02 20:43:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:19,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:19,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:19,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:19,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:19,761 INFO L85 PathProgramCache]: Analyzing trace with hash -271890814, now seen corresponding path program 1 times [2022-11-02 20:43:19,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:19,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662200849] [2022-11-02 20:43:19,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:19,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:19,781 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:19,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581846286] [2022-11-02 20:43:19,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:19,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:19,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:19,789 INFO L229 MonitoredProcess]: Starting monitored process 112 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:19,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2022-11-02 20:43:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:19,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:43:19,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:19,937 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 209 proven. 1 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2022-11-02 20:43:19,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:20,113 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 25 proven. 27 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2022-11-02 20:43:20,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:20,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662200849] [2022-11-02 20:43:20,113 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:43:20,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581846286] [2022-11-02 20:43:20,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581846286] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:20,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:43:20,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-11-02 20:43:20,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381083111] [2022-11-02 20:43:20,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:21,178 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:43:21,178 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:43:21,178 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:43:21,178 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:43:21,178 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-02 20:43:21,178 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:21,178 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:43:21,178 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:43:21,178 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2022-11-02 20:43:21,179 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:43:21,179 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:43:21,196 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:21,200 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:21,203 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:21,206 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:21,253 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:21,256 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:21,394 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:43:21,394 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-02 20:43:21,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:21,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:21,398 INFO L229 MonitoredProcess]: Starting monitored process 113 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:21,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2022-11-02 20:43:21,400 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:21,400 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:21,414 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:43:21,414 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: [] [2022-11-02 20:43:21,440 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2022-11-02 20:43:21,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:21,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:21,442 INFO L229 MonitoredProcess]: Starting monitored process 114 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:21,450 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:21,450 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:21,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-11-02 20:43:21,465 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:43:21,466 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: [] [2022-11-02 20:43:21,498 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:21,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:21,498 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:21,499 INFO L229 MonitoredProcess]: Starting monitored process 115 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:21,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2022-11-02 20:43:21,501 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:21,501 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:21,515 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:43:21,515 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: [] [2022-11-02 20:43:21,544 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2022-11-02 20:43:21,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:21,545 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:21,546 INFO L229 MonitoredProcess]: Starting monitored process 116 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:21,547 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-11-02 20:43:21,547 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:21,548 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:21,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2022-11-02 20:43:21,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:21,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:21,596 INFO L229 MonitoredProcess]: Starting monitored process 117 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:21,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2022-11-02 20:43:21,598 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-02 20:43:21,598 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:22,299 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-02 20:43:22,305 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2022-11-02 20:43:22,305 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:43:22,305 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:43:22,305 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:43:22,305 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:43:22,306 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:43:22,306 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:22,306 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:43:22,306 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:43:22,306 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration14_Loop [2022-11-02 20:43:22,306 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:43:22,306 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:43:22,307 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:22,310 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:22,312 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:22,315 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:22,363 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:22,365 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:22,498 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:43:22,498 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:43:22,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:22,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:22,500 INFO L229 MonitoredProcess]: Starting monitored process 118 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:22,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2022-11-02 20:43:22,503 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 [2022-11-02 20:43:22,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:22,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:22,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:22,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:22,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:22,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:22,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:22,518 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:43:22,546 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:22,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:22,546 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:22,547 INFO L229 MonitoredProcess]: Starting monitored process 119 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:22,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2022-11-02 20:43:22,549 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 [2022-11-02 20:43:22,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:22,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:22,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:22,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:22,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:22,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:22,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:22,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:43:22,593 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2022-11-02 20:43:22,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:22,594 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:22,595 INFO L229 MonitoredProcess]: Starting monitored process 120 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:22,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2022-11-02 20:43:22,596 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 [2022-11-02 20:43:22,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:22,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:22,610 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:22,610 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:22,610 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:22,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:22,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:22,612 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:43:22,641 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:22,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:22,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:22,643 INFO L229 MonitoredProcess]: Starting monitored process 121 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:22,644 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2022-11-02 20:43:22,644 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 [2022-11-02 20:43:22,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:22,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:22,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:22,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:22,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:22,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:22,661 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:22,667 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:43:22,672 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-02 20:43:22,672 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-02 20:43:22,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:22,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:22,675 INFO L229 MonitoredProcess]: Starting monitored process 122 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:22,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2022-11-02 20:43:22,676 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:43:22,677 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-02 20:43:22,677 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:43:22,677 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 [] [2022-11-02 20:43:22,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2022-11-02 20:43:22,705 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-02 20:43:22,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:22,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:43:22,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:23,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-02 20:43:23,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:23,344 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-11-02 20:43:23,345 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2022-11-02 20:43:23,345 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 881 states and 1371 transitions. cyclomatic complexity: 512 Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-02 20:43:23,568 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 881 states and 1371 transitions. cyclomatic complexity: 512. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Result 1543 states and 2229 transitions. Complement of second has 15 states. [2022-11-02 20:43:23,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2022-11-02 20:43:23,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 6 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2022-11-02 20:43:23,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-11-02 20:43:23,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 57 transitions. Stem has 38 letters. Loop has 50 letters. [2022-11-02 20:43:23,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:23,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 57 transitions. Stem has 88 letters. Loop has 50 letters. [2022-11-02 20:43:23,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:23,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 57 transitions. Stem has 38 letters. Loop has 100 letters. [2022-11-02 20:43:23,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:23,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1543 states and 2229 transitions. [2022-11-02 20:43:23,633 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 146 [2022-11-02 20:43:23,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1543 states to 1292 states and 1892 transitions. [2022-11-02 20:43:23,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:23,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 339 [2022-11-02 20:43:23,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2022-11-02 20:43:23,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1292 states and 1892 transitions. [2022-11-02 20:43:23,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:23,664 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1292 states and 1892 transitions. [2022-11-02 20:43:23,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states and 1892 transitions. [2022-11-02 20:43:23,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1288. [2022-11-02 20:43:23,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 809 states have (on average 1.145859085290482) internal successors, (927), 826 states have internal predecessors, (927), 327 states have call successors, (339), 177 states have call predecessors, (339), 152 states have return successors, (621), 284 states have call predecessors, (621), 324 states have call successors, (621) [2022-11-02 20:43:23,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 1887 transitions. [2022-11-02 20:43:23,722 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1288 states and 1887 transitions. [2022-11-02 20:43:23,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:23,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:43:23,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:43:23,723 INFO L87 Difference]: Start difference. First operand 1288 states and 1887 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 5 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-11-02 20:43:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:23,938 INFO L93 Difference]: Finished difference Result 1136 states and 1646 transitions. [2022-11-02 20:43:23,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1136 states and 1646 transitions. [2022-11-02 20:43:23,956 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 135 [2022-11-02 20:43:23,969 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1136 states to 1005 states and 1478 transitions. [2022-11-02 20:43:23,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 281 [2022-11-02 20:43:23,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 281 [2022-11-02 20:43:23,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1005 states and 1478 transitions. [2022-11-02 20:43:23,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:23,972 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1005 states and 1478 transitions. [2022-11-02 20:43:23,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1005 states and 1478 transitions. [2022-11-02 20:43:24,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1005 to 999. [2022-11-02 20:43:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 629 states have (on average 1.1192368839427662) internal successors, (704), 630 states have internal predecessors, (704), 259 states have call successors, (268), 120 states have call predecessors, (268), 111 states have return successors, (499), 248 states have call predecessors, (499), 256 states have call successors, (499) [2022-11-02 20:43:24,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1471 transitions. [2022-11-02 20:43:24,019 INFO L240 hiAutomatonCegarLoop]: Abstraction has 999 states and 1471 transitions. [2022-11-02 20:43:24,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:43:24,021 INFO L428 stractBuchiCegarLoop]: Abstraction has 999 states and 1471 transitions. [2022-11-02 20:43:24,021 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-11-02 20:43:24,021 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 999 states and 1471 transitions. [2022-11-02 20:43:24,030 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 135 [2022-11-02 20:43:24,031 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:43:24,031 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:43:24,032 INFO L148 hiAutomatonCegarLoop]: 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] [2022-11-02 20:43:24,033 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [19, 19, 10, 10, 10, 10, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:24,033 INFO L748 eck$LassoCheckResult]: Stem: 20925#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 20896#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; 20897#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 20924#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; 20909#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 20910#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 21471#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; 21467#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 21468#factENTRY ~n := #in~n; 21472#L25 assume ~n <= 0;#res := 1; 21470#factFINAL assume true; 21466#factEXIT >#68#return; 21463#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 21461#factENTRY ~n := #in~n; 21469#L25 assume ~n <= 0;#res := 1; 21465#factFINAL assume true; 21462#factEXIT >#70#return; 21460#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 21461#factENTRY ~n := #in~n; 21469#L25 assume ~n <= 0;#res := 1; 21465#factFINAL assume true; 21462#factEXIT >#72#return; 21464#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; 21604#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 21605#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 21697#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 20927#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; 20928#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 21754#factENTRY ~n := #in~n; 21757#L25 assume ~n <= 0;#res := 1; 21756#factFINAL assume true; 21753#factEXIT >#74#return; 21740#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 21741#factENTRY ~n := #in~n; 21745#L25 assume ~n <= 0;#res := 1; 21744#factFINAL assume true; 21739#factEXIT >#76#return; 21690#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 21735#factENTRY ~n := #in~n; 21733#L25 assume !(~n <= 0); 21708#L26 call #t~ret0 := fact(~n - 1);< 21729#factENTRY ~n := #in~n; 21725#L25 assume ~n <= 0;#res := 1; 21726#factFINAL assume true; 21707#factEXIT >#66#return; 21701#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 21698#factFINAL assume true; 21689#factEXIT >#78#return; 21606#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; 21607#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 21688#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 20937#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 20922#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 20923#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 21045#L42-3 [2022-11-02 20:43:24,034 INFO L750 eck$LassoCheckResult]: Loop: 21045#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 21044#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; 20990#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 21036#factENTRY ~n := #in~n; 21153#L25 assume !(~n <= 0); 21137#L26 call #t~ret0 := fact(~n - 1);< 21144#factENTRY ~n := #in~n; 21156#L25 assume ~n <= 0;#res := 1; 21150#factFINAL assume true; 21146#factEXIT >#66#return; 21149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 21182#factFINAL assume true; 20987#factEXIT >#68#return; 20994#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 21036#factENTRY ~n := #in~n; 21153#L25 assume ~n <= 0;#res := 1; 21035#factFINAL assume true; 21023#factEXIT >#70#return; 21002#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 20986#factENTRY ~n := #in~n; 21154#L25 assume !(~n <= 0); 21137#L26 call #t~ret0 := fact(~n - 1);< 21144#factENTRY ~n := #in~n; 21156#L25 assume !(~n <= 0); 21140#L26 call #t~ret0 := fact(~n - 1);< 21144#factENTRY ~n := #in~n; 21156#L25 assume ~n <= 0;#res := 1; 21150#factFINAL assume true; 21146#factEXIT >#66#return; 21141#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 21143#factFINAL assume true; 21135#factEXIT >#66#return; 21134#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 21123#factFINAL assume true; 21118#factEXIT >#72#return; 21120#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; 21132#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 21130#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 21128#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 21126#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; 21006#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 21036#factENTRY ~n := #in~n; 21153#L25 assume !(~n <= 0); 21137#L26 call #t~ret0 := fact(~n - 1);< 21144#factENTRY ~n := #in~n; 21156#L25 assume ~n <= 0;#res := 1; 21150#factFINAL assume true; 21146#factEXIT >#66#return; 21149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 21182#factFINAL assume true; 20987#factEXIT >#68#return; 21015#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 20941#factENTRY ~n := #in~n; 21177#L25 assume !(~n <= 0); 21147#L26 call #t~ret0 := fact(~n - 1);< 21151#factENTRY ~n := #in~n; 21155#L25 assume ~n <= 0;#res := 1; 21150#factFINAL assume true; 21146#factEXIT >#66#return; 21149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 21182#factFINAL assume true; 20987#factEXIT >#70#return; 21011#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 21036#factENTRY ~n := #in~n; 21153#L25 assume !(~n <= 0); 21137#L26 call #t~ret0 := fact(~n - 1);< 21144#factENTRY ~n := #in~n; 21156#L25 assume ~n <= 0;#res := 1; 21150#factFINAL assume true; 21146#factEXIT >#66#return; 21149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 21182#factFINAL assume true; 20987#factEXIT >#72#return; 21020#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; 21181#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 21179#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 21178#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 20954#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; 20992#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 21036#factENTRY ~n := #in~n; 21153#L25 assume !(~n <= 0); 21137#L26 call #t~ret0 := fact(~n - 1);< 21144#factENTRY ~n := #in~n; 21156#L25 assume !(~n <= 0); 21140#L26 call #t~ret0 := fact(~n - 1);< 21144#factENTRY ~n := #in~n; 21156#L25 assume ~n <= 0;#res := 1; 21150#factFINAL assume true; 21146#factEXIT >#66#return; 21141#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 21143#factFINAL assume true; 21135#factEXIT >#66#return; 21134#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 21123#factFINAL assume true; 21118#factEXIT >#74#return; 21004#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 20941#factENTRY ~n := #in~n; 21177#L25 assume !(~n <= 0); 21147#L26 call #t~ret0 := fact(~n - 1);< 21151#factENTRY ~n := #in~n; 21155#L25 assume ~n <= 0;#res := 1; 21150#factFINAL assume true; 21146#factEXIT >#66#return; 21149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 21182#factFINAL assume true; 20987#factEXIT >#76#return; 20993#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 20986#factENTRY ~n := #in~n; 21154#L25 assume !(~n <= 0); 21137#L26 call #t~ret0 := fact(~n - 1);< 21144#factENTRY ~n := #in~n; 21156#L25 assume ~n <= 0;#res := 1; 21150#factFINAL assume true; 21146#factEXIT >#66#return; 21149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 21182#factFINAL assume true; 20987#factEXIT >#78#return; 21017#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; 21163#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 21161#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 20953#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 20920#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 20921#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 21045#L42-3 [2022-11-02 20:43:24,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:24,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1078509977, now seen corresponding path program 1 times [2022-11-02 20:43:24,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:24,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697687679] [2022-11-02 20:43:24,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:24,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:24,047 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:24,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1912576829] [2022-11-02 20:43:24,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:24,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:24,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:24,049 INFO L229 MonitoredProcess]: Starting monitored process 123 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:24,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2022-11-02 20:43:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:24,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:43:24,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:24,188 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-02 20:43:24,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:43:24,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:24,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697687679] [2022-11-02 20:43:24,189 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:43:24,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912576829] [2022-11-02 20:43:24,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912576829] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:43:24,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:43:24,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:43:24,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469666871] [2022-11-02 20:43:24,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:43:24,190 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:43:24,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:24,191 INFO L85 PathProgramCache]: Analyzing trace with hash 414266915, now seen corresponding path program 6 times [2022-11-02 20:43:24,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:24,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114598528] [2022-11-02 20:43:24,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:24,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:24,210 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:24,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [132662724] [2022-11-02 20:43:24,215 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-02 20:43:24,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:24,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:24,217 INFO L229 MonitoredProcess]: Starting monitored process 124 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:24,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2022-11-02 20:43:24,338 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-11-02 20:43:24,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:43:24,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 20:43:24,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 34 proven. 121 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2022-11-02 20:43:24,638 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 34 proven. 122 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2022-11-02 20:43:25,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:25,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114598528] [2022-11-02 20:43:25,187 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:43:25,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132662724] [2022-11-02 20:43:25,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132662724] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:25,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:43:25,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 14 [2022-11-02 20:43:25,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964864043] [2022-11-02 20:43:25,188 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:25,189 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:43:25,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:25,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:43:25,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:43:25,190 INFO L87 Difference]: Start difference. First operand 999 states and 1471 transitions. cyclomatic complexity: 501 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) [2022-11-02 20:43:25,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:25,417 INFO L93 Difference]: Finished difference Result 871 states and 1227 transitions. [2022-11-02 20:43:25,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 871 states and 1227 transitions. [2022-11-02 20:43:25,428 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 140 [2022-11-02 20:43:25,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 871 states to 701 states and 1029 transitions. [2022-11-02 20:43:25,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 288 [2022-11-02 20:43:25,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 288 [2022-11-02 20:43:25,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 701 states and 1029 transitions. [2022-11-02 20:43:25,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:25,439 INFO L218 hiAutomatonCegarLoop]: Abstraction has 701 states and 1029 transitions. [2022-11-02 20:43:25,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states and 1029 transitions. [2022-11-02 20:43:25,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 632. [2022-11-02 20:43:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 411 states have (on average 1.1143552311435523) internal successors, (458), 393 states have internal predecessors, (458), 167 states have call successors, (171), 64 states have call predecessors, (171), 54 states have return successors, (290), 174 states have call predecessors, (290), 164 states have call successors, (290) [2022-11-02 20:43:25,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 919 transitions. [2022-11-02 20:43:25,470 INFO L240 hiAutomatonCegarLoop]: Abstraction has 632 states and 919 transitions. [2022-11-02 20:43:25,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:43:25,471 INFO L428 stractBuchiCegarLoop]: Abstraction has 632 states and 919 transitions. [2022-11-02 20:43:25,471 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-11-02 20:43:25,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 632 states and 919 transitions. [2022-11-02 20:43:25,476 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 119 [2022-11-02 20:43:25,477 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:43:25,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:43:25,479 INFO L148 hiAutomatonCegarLoop]: 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] [2022-11-02 20:43:25,479 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [19, 19, 10, 10, 10, 10, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:25,479 INFO L748 eck$LassoCheckResult]: Stem: 23724#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 23695#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; 23696#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 23723#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; 23708#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 23709#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 24168#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; 23681#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 23682#factENTRY ~n := #in~n; 24144#L25 assume ~n <= 0;#res := 1; 24143#factFINAL assume true; 24142#factEXIT >#68#return; 23735#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 23667#factENTRY ~n := #in~n; 24160#L25 assume ~n <= 0;#res := 1; 24159#factFINAL assume true; 24157#factEXIT >#70#return; 23666#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 23667#factENTRY ~n := #in~n; 24160#L25 assume ~n <= 0;#res := 1; 24159#factFINAL assume true; 24157#factEXIT >#72#return; 24158#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; 24196#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 24197#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 24192#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 24191#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; 23662#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 23663#factENTRY ~n := #in~n; 24256#L25 assume !(~n <= 0); 24254#L26 call #t~ret0 := fact(~n - 1);< 24255#factENTRY ~n := #in~n; 24258#L25 assume ~n <= 0;#res := 1; 24257#factFINAL assume true; 24253#factEXIT >#66#return; 24252#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24250#factFINAL assume true; 24249#factEXIT >#74#return; 24242#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 24244#factENTRY ~n := #in~n; 24273#L25 assume ~n <= 0;#res := 1; 24247#factFINAL assume true; 24241#factEXIT >#76#return; 23741#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 23742#factENTRY ~n := #in~n; 24238#L25 assume !(~n <= 0); 24226#L26 call #t~ret0 := fact(~n - 1);< 24229#factENTRY ~n := #in~n; 24235#L25 assume ~n <= 0;#res := 1; 24236#factFINAL assume true; 24224#factEXIT >#66#return; 24228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 24251#factFINAL assume true; 24248#factEXIT >#78#return; 24218#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; 24291#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 24290#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 24210#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 23721#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 23722#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 23850#L42-3 [2022-11-02 20:43:25,480 INFO L750 eck$LassoCheckResult]: Loop: 23850#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 23849#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; 23786#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 23810#factENTRY ~n := #in~n; 23860#L25 assume !(~n <= 0); 23832#L26 call #t~ret0 := fact(~n - 1);< 23844#factENTRY ~n := #in~n; 23859#L25 assume !(~n <= 0); 23829#L26 call #t~ret0 := fact(~n - 1);< 23844#factENTRY ~n := #in~n; 23859#L25 assume ~n <= 0;#res := 1; 23856#factFINAL assume true; 23839#factEXIT >#66#return; 23833#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23838#factFINAL assume true; 23827#factEXIT >#66#return; 23834#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23816#factFINAL assume true; 23820#factEXIT >#68#return; 23792#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 23810#factENTRY ~n := #in~n; 23860#L25 assume ~n <= 0;#res := 1; 23836#factFINAL assume true; 23824#factEXIT >#70#return; 23818#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 23800#factENTRY ~n := #in~n; 23864#L25 assume !(~n <= 0); 23828#L26 call #t~ret0 := fact(~n - 1);< 23835#factENTRY ~n := #in~n; 23853#L25 assume !(~n <= 0); 23829#L26 call #t~ret0 := fact(~n - 1);< 23844#factENTRY ~n := #in~n; 23859#L25 assume ~n <= 0;#res := 1; 23856#factFINAL assume true; 23839#factEXIT >#66#return; 23833#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23838#factFINAL assume true; 23827#factEXIT >#66#return; 23834#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23816#factFINAL assume true; 23820#factEXIT >#72#return; 23865#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; 23985#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 23982#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 23979#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 23900#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; 23775#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 23810#factENTRY ~n := #in~n; 23860#L25 assume !(~n <= 0); 23832#L26 call #t~ret0 := fact(~n - 1);< 23844#factENTRY ~n := #in~n; 23859#L25 assume ~n <= 0;#res := 1; 23856#factFINAL assume true; 23839#factEXIT >#66#return; 23842#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23869#factFINAL assume true; 23766#factEXIT >#68#return; 23784#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 23810#factENTRY ~n := #in~n; 23860#L25 assume !(~n <= 0); 23832#L26 call #t~ret0 := fact(~n - 1);< 23844#factENTRY ~n := #in~n; 23859#L25 assume ~n <= 0;#res := 1; 23856#factFINAL assume true; 23839#factEXIT >#66#return; 23842#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23869#factFINAL assume true; 23766#factEXIT >#70#return; 23783#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 23810#factENTRY ~n := #in~n; 23860#L25 assume ~n <= 0;#res := 1; 23836#factFINAL assume true; 23824#factEXIT >#72#return; 23798#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; 23885#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 23884#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 23874#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 23875#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; 23773#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 23810#factENTRY ~n := #in~n; 23860#L25 assume !(~n <= 0); 23832#L26 call #t~ret0 := fact(~n - 1);< 23844#factENTRY ~n := #in~n; 23859#L25 assume !(~n <= 0); 23829#L26 call #t~ret0 := fact(~n - 1);< 23844#factENTRY ~n := #in~n; 23859#L25 assume ~n <= 0;#res := 1; 23856#factFINAL assume true; 23839#factEXIT >#66#return; 23833#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23838#factFINAL assume true; 23827#factEXIT >#66#return; 23834#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23816#factFINAL assume true; 23820#factEXIT >#74#return; 23767#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 23863#factENTRY ~n := #in~n; 23862#L25 assume ~n <= 0;#res := 1; 23836#factFINAL assume true; 23824#factEXIT >#76#return; 23799#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 23800#factENTRY ~n := #in~n; 23864#L25 assume !(~n <= 0); 23828#L26 call #t~ret0 := fact(~n - 1);< 23835#factENTRY ~n := #in~n; 23853#L25 assume !(~n <= 0); 23829#L26 call #t~ret0 := fact(~n - 1);< 23844#factENTRY ~n := #in~n; 23859#L25 assume ~n <= 0;#res := 1; 23856#factFINAL assume true; 23839#factEXIT >#66#return; 23833#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23838#factFINAL assume true; 23827#factEXIT >#66#return; 23834#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 23816#factFINAL assume true; 23820#factEXIT >#78#return; 23697#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; 23698#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 23745#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 23746#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 23719#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 23720#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 23850#L42-3 [2022-11-02 20:43:25,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:25,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 2 times [2022-11-02 20:43:25,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:25,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271806657] [2022-11-02 20:43:25,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:25,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:25,488 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:25,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [800137636] [2022-11-02 20:43:25,489 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:43:25,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:25,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:25,492 INFO L229 MonitoredProcess]: Starting monitored process 125 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:25,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2022-11-02 20:43:25,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:43:25,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-02 20:43:25,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:25,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:25,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:25,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2100990317, now seen corresponding path program 7 times [2022-11-02 20:43:25,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:25,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299670318] [2022-11-02 20:43:25,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:25,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:25,633 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:25,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1853860033] [2022-11-02 20:43:25,633 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-02 20:43:25,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:25,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:25,637 INFO L229 MonitoredProcess]: Starting monitored process 126 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:25,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2022-11-02 20:43:25,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:25,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:43:25,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 465 proven. 54 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2022-11-02 20:43:25,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:26,520 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 55 proven. 206 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2022-11-02 20:43:26,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:26,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299670318] [2022-11-02 20:43:26,521 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:43:26,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853860033] [2022-11-02 20:43:26,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853860033] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:26,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:43:26,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 16 [2022-11-02 20:43:26,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404908129] [2022-11-02 20:43:26,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:26,522 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:43:26,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:26,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:43:26,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:43:26,523 INFO L87 Difference]: Start difference. First operand 632 states and 919 transitions. cyclomatic complexity: 302 Second operand has 16 states, 13 states have (on average 3.769230769230769) internal successors, (49), 16 states have internal predecessors, (49), 11 states have call successors, (22), 2 states have call predecessors, (22), 6 states have return successors, (22), 6 states have call predecessors, (22), 11 states have call successors, (22) [2022-11-02 20:43:27,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:27,316 INFO L93 Difference]: Finished difference Result 844 states and 1224 transitions. [2022-11-02 20:43:27,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 844 states and 1224 transitions. [2022-11-02 20:43:27,326 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 193 [2022-11-02 20:43:27,336 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 844 states to 772 states and 1097 transitions. [2022-11-02 20:43:27,336 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 348 [2022-11-02 20:43:27,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 350 [2022-11-02 20:43:27,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 772 states and 1097 transitions. [2022-11-02 20:43:27,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:27,338 INFO L218 hiAutomatonCegarLoop]: Abstraction has 772 states and 1097 transitions. [2022-11-02 20:43:27,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states and 1097 transitions. [2022-11-02 20:43:27,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 679. [2022-11-02 20:43:27,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 451 states have (on average 1.1152993348115299) internal successors, (503), 432 states have internal predecessors, (503), 174 states have call successors, (178), 64 states have call predecessors, (178), 54 states have return successors, (278), 182 states have call predecessors, (278), 171 states have call successors, (278) [2022-11-02 20:43:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 959 transitions. [2022-11-02 20:43:27,368 INFO L240 hiAutomatonCegarLoop]: Abstraction has 679 states and 959 transitions. [2022-11-02 20:43:27,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:43:27,370 INFO L428 stractBuchiCegarLoop]: Abstraction has 679 states and 959 transitions. [2022-11-02 20:43:27,370 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-11-02 20:43:27,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 679 states and 959 transitions. [2022-11-02 20:43:27,376 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 175 [2022-11-02 20:43:27,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:43:27,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:43:27,378 INFO L148 hiAutomatonCegarLoop]: 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] [2022-11-02 20:43:27,378 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 20, 11, 11, 11, 11, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:27,379 INFO L748 eck$LassoCheckResult]: Stem: 25959#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 25933#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; 25934#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 25958#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; 25984#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 26148#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 26146#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; 25919#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 25920#factENTRY ~n := #in~n; 26153#L25 assume ~n <= 0;#res := 1; 26151#factFINAL assume true; 26147#factEXIT >#68#return; 25976#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 25916#factENTRY ~n := #in~n; 26256#L25 assume ~n <= 0;#res := 1; 26255#factFINAL assume true; 26241#factEXIT >#70#return; 25915#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 25916#factENTRY ~n := #in~n; 26256#L25 assume ~n <= 0;#res := 1; 26255#factFINAL assume true; 26241#factEXIT >#72#return; 26242#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; 25953#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 25954#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 26512#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 25961#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; 25905#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 25906#factENTRY ~n := #in~n; 26550#L25 assume !(~n <= 0); 25973#L26 call #t~ret0 := fact(~n - 1);< 26549#factENTRY ~n := #in~n; 25972#L25 assume ~n <= 0;#res := 1; 25974#factFINAL assume true; 26575#factEXIT >#66#return; 26543#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26544#factFINAL assume true; 26539#factEXIT >#74#return; 26517#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 26529#factENTRY ~n := #in~n; 26533#L25 assume ~n <= 0;#res := 1; 26531#factFINAL assume true; 26527#factEXIT >#76#return; 26505#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 26580#factENTRY ~n := #in~n; 26579#L25 assume !(~n <= 0); 25923#L26 call #t~ret0 := fact(~n - 1);< 25941#factENTRY ~n := #in~n; 26569#L25 assume ~n <= 0;#res := 1; 26577#factFINAL assume true; 26515#factEXIT >#66#return; 26513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26514#factFINAL assume true; 26504#factEXIT >#78#return; 26503#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; 26501#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 25982#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 25983#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 25956#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 25957#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 25945#L42-3 [2022-11-02 20:43:27,379 INFO L750 eck$LassoCheckResult]: Loop: 25945#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 26262#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; 26173#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 26254#factENTRY ~n := #in~n; 26285#L25 assume !(~n <= 0); 26266#L26 call #t~ret0 := fact(~n - 1);< 26281#factENTRY ~n := #in~n; 26344#L25 assume ~n <= 0;#res := 1; 26272#factFINAL assume true; 26263#factEXIT >#66#return; 26260#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26257#factFINAL assume true; 26243#factEXIT >#68#return; 26194#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 26254#factENTRY ~n := #in~n; 26285#L25 assume ~n <= 0;#res := 1; 26258#factFINAL assume true; 26252#factEXIT >#70#return; 26195#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 26235#factENTRY ~n := #in~n; 26286#L25 assume !(~n <= 0); 26266#L26 call #t~ret0 := fact(~n - 1);< 26281#factENTRY ~n := #in~n; 26344#L25 assume !(~n <= 0); 26268#L26 call #t~ret0 := fact(~n - 1);< 26281#factENTRY ~n := #in~n; 26344#L25 assume ~n <= 0;#res := 1; 26272#factFINAL assume true; 26263#factEXIT >#66#return; 26270#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26318#factFINAL assume true; 26276#factEXIT >#66#return; 26275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26274#factFINAL assume true; 26166#factEXIT >#72#return; 26210#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; 26313#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 26309#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 26305#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 26300#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; 26169#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 26254#factENTRY ~n := #in~n; 26285#L25 assume !(~n <= 0); 26266#L26 call #t~ret0 := fact(~n - 1);< 26281#factENTRY ~n := #in~n; 26344#L25 assume ~n <= 0;#res := 1; 26272#factFINAL assume true; 26263#factEXIT >#66#return; 26260#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26257#factFINAL assume true; 26243#factEXIT >#68#return; 26245#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 26253#factENTRY ~n := #in~n; 26293#L25 assume !(~n <= 0); 26265#L26 call #t~ret0 := fact(~n - 1);< 26271#factENTRY ~n := #in~n; 26273#L25 assume ~n <= 0;#res := 1; 26272#factFINAL assume true; 26263#factEXIT >#66#return; 26260#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26257#factFINAL assume true; 26243#factEXIT >#70#return; 26175#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 26254#factENTRY ~n := #in~n; 26285#L25 assume !(~n <= 0); 26266#L26 call #t~ret0 := fact(~n - 1);< 26281#factENTRY ~n := #in~n; 26344#L25 assume !(~n <= 0); 26268#L26 call #t~ret0 := fact(~n - 1);< 26281#factENTRY ~n := #in~n; 26344#L25 assume ~n <= 0;#res := 1; 26272#factFINAL assume true; 26263#factEXIT >#66#return; 26270#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26318#factFINAL assume true; 26276#factEXIT >#66#return; 26275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26274#factFINAL assume true; 26166#factEXIT >#72#return; 26202#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; 26312#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 26308#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 26304#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 26299#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; 26191#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 26254#factENTRY ~n := #in~n; 26285#L25 assume !(~n <= 0); 26266#L26 call #t~ret0 := fact(~n - 1);< 26281#factENTRY ~n := #in~n; 26344#L25 assume !(~n <= 0); 26268#L26 call #t~ret0 := fact(~n - 1);< 26281#factENTRY ~n := #in~n; 26344#L25 assume ~n <= 0;#res := 1; 26272#factFINAL assume true; 26263#factEXIT >#66#return; 26270#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26318#factFINAL assume true; 26276#factEXIT >#66#return; 26275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26274#factFINAL assume true; 26166#factEXIT >#74#return; 26208#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 26253#factENTRY ~n := #in~n; 26293#L25 assume ~n <= 0;#res := 1; 26258#factFINAL assume true; 26252#factEXIT >#76#return; 26177#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 26211#factENTRY ~n := #in~n; 26317#L25 assume !(~n <= 0); 26278#L26 call #t~ret0 := fact(~n - 1);< 26280#factENTRY ~n := #in~n; 26343#L25 assume !(~n <= 0); 26268#L26 call #t~ret0 := fact(~n - 1);< 26281#factENTRY ~n := #in~n; 26344#L25 assume ~n <= 0;#res := 1; 26272#factFINAL assume true; 26263#factEXIT >#66#return; 26270#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26318#factFINAL assume true; 26276#factEXIT >#66#return; 26275#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 26274#factFINAL assume true; 26166#factEXIT >#78#return; 26163#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; 26161#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 26159#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 25987#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 25955#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 25944#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 25945#L42-3 [2022-11-02 20:43:27,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:27,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 3 times [2022-11-02 20:43:27,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:27,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232743048] [2022-11-02 20:43:27,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:27,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:27,388 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:27,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1924558590] [2022-11-02 20:43:27,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:43:27,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:27,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:27,393 INFO L229 MonitoredProcess]: Starting monitored process 127 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:27,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2022-11-02 20:43:27,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-11-02 20:43:27,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-02 20:43:27,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:27,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:27,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:27,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2067057563, now seen corresponding path program 8 times [2022-11-02 20:43:27,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:27,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246058249] [2022-11-02 20:43:27,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:27,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:27,545 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:27,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1784185287] [2022-11-02 20:43:27,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:43:27,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:27,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:27,553 INFO L229 MonitoredProcess]: Starting monitored process 128 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:27,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2022-11-02 20:43:27,681 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:43:27,681 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:43:27,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-02 20:43:27,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 502 proven. 90 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2022-11-02 20:43:27,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 42 proven. 291 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2022-11-02 20:43:28,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:28,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246058249] [2022-11-02 20:43:28,680 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:43:28,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784185287] [2022-11-02 20:43:28,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784185287] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:28,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:43:28,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 19 [2022-11-02 20:43:28,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052885340] [2022-11-02 20:43:28,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:28,681 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:43:28,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:28,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 20:43:28,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:43:28,683 INFO L87 Difference]: Start difference. First operand 679 states and 959 transitions. cyclomatic complexity: 301 Second operand has 19 states, 14 states have (on average 3.5) internal successors, (49), 17 states have internal predecessors, (49), 12 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (23), 9 states have call predecessors, (23), 12 states have call successors, (23) [2022-11-02 20:43:29,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:29,744 INFO L93 Difference]: Finished difference Result 901 states and 1238 transitions. [2022-11-02 20:43:29,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 901 states and 1238 transitions. [2022-11-02 20:43:29,754 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 229 [2022-11-02 20:43:29,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 901 states to 901 states and 1238 transitions. [2022-11-02 20:43:29,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 406 [2022-11-02 20:43:29,766 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 406 [2022-11-02 20:43:29,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 901 states and 1238 transitions. [2022-11-02 20:43:29,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:29,767 INFO L218 hiAutomatonCegarLoop]: Abstraction has 901 states and 1238 transitions. [2022-11-02 20:43:29,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states and 1238 transitions. [2022-11-02 20:43:29,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 677. [2022-11-02 20:43:29,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 441 states have (on average 1.1133786848072562) internal successors, (491), 427 states have internal predecessors, (491), 182 states have call successors, (186), 64 states have call predecessors, (186), 54 states have return successors, (281), 185 states have call predecessors, (281), 179 states have call successors, (281) [2022-11-02 20:43:29,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 958 transitions. [2022-11-02 20:43:29,832 INFO L240 hiAutomatonCegarLoop]: Abstraction has 677 states and 958 transitions. [2022-11-02 20:43:29,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:43:29,834 INFO L428 stractBuchiCegarLoop]: Abstraction has 677 states and 958 transitions. [2022-11-02 20:43:29,834 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-11-02 20:43:29,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 677 states and 958 transitions. [2022-11-02 20:43:29,839 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 162 [2022-11-02 20:43:29,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:43:29,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:43:29,841 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 5, 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] [2022-11-02 20:43:29,841 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-11-02 20:43:29,841 INFO L748 eck$LassoCheckResult]: Stem: 28360#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 28335#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; 28336#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 28359#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; 28382#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 28560#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28628#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; 28625#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 28626#factENTRY ~n := #in~n; 28629#L25 assume ~n <= 0;#res := 1; 28627#factFINAL assume true; 28624#factEXIT >#68#return; 28619#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 28621#factENTRY ~n := #in~n; 28623#L25 assume ~n <= 0;#res := 1; 28622#factFINAL assume true; 28618#factEXIT >#70#return; 28620#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 28621#factENTRY ~n := #in~n; 28623#L25 assume ~n <= 0;#res := 1; 28622#factFINAL assume true; 28618#factEXIT >#72#return; 28617#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; 28616#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 28615#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 28614#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 28613#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; 28611#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 28612#factENTRY ~n := #in~n; 28655#L25 assume !(~n <= 0); 28653#L26 call #t~ret0 := fact(~n - 1);< 28654#factENTRY ~n := #in~n; 28695#L25 assume ~n <= 0;#res := 1; 28715#factFINAL assume true; 28652#factEXIT >#66#return; 28649#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 28630#factFINAL assume true; 28631#factEXIT >#74#return; 28596#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 28601#factENTRY ~n := #in~n; 28954#L25 assume ~n <= 0;#res := 1; 28952#factFINAL assume true; 28948#factEXIT >#76#return; 28949#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 28967#factENTRY ~n := #in~n; 28966#L25 assume !(~n <= 0); 28306#L26 call #t~ret0 := fact(~n - 1);< 28965#factENTRY [2022-11-02 20:43:29,841 INFO L750 eck$LassoCheckResult]: Loop: 28965#factENTRY ~n := #in~n; 28970#L25 assume !(~n <= 0); 28305#L26 call #t~ret0 := fact(~n - 1);< 28965#factENTRY [2022-11-02 20:43:29,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:29,842 INFO L85 PathProgramCache]: Analyzing trace with hash 172884444, now seen corresponding path program 1 times [2022-11-02 20:43:29,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:29,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453635540] [2022-11-02 20:43:29,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:29,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:29,858 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:29,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [522659764] [2022-11-02 20:43:29,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:29,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:29,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:29,865 INFO L229 MonitoredProcess]: Starting monitored process 129 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:29,881 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2022-11-02 20:43:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:29,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:29,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:29,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:29,973 INFO L85 PathProgramCache]: Analyzing trace with hash 29980, now seen corresponding path program 2 times [2022-11-02 20:43:29,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:29,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329981611] [2022-11-02 20:43:29,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:29,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:29,976 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:29,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:29,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:29,979 INFO L85 PathProgramCache]: Analyzing trace with hash 734683489, now seen corresponding path program 2 times [2022-11-02 20:43:29,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:29,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291188079] [2022-11-02 20:43:29,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:29,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:29,991 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:29,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1137565098] [2022-11-02 20:43:29,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:43:29,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:29,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:29,995 INFO L229 MonitoredProcess]: Starting monitored process 130 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:30,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2022-11-02 20:43:30,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:43:30,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:43:30,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:43:30,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-02 20:43:30,185 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:30,348 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-02 20:43:30,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:30,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291188079] [2022-11-02 20:43:30,348 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:43:30,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137565098] [2022-11-02 20:43:30,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137565098] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:30,349 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:43:30,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2022-11-02 20:43:30,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417091777] [2022-11-02 20:43:30,349 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:30,393 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:43:30,393 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:43:30,393 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:43:30,393 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:43:30,393 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-02 20:43:30,394 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:30,394 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:43:30,394 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:43:30,394 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration18_Loop [2022-11-02 20:43:30,394 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:43:30,394 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:43:30,395 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:30,398 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:30,401 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:30,403 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:30,444 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:43:30,444 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-02 20:43:30,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:30,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:30,446 INFO L229 MonitoredProcess]: Starting monitored process 131 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:30,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2022-11-02 20:43:30,448 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:30,448 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:30,462 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:43:30,462 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#t~ret0=0} Honda state: {fact_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-02 20:43:30,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:30,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:30,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:30,496 INFO L229 MonitoredProcess]: Starting monitored process 132 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:30,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2022-11-02 20:43:30,497 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:30,497 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:30,511 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:43:30,511 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_#res=0} Honda state: {fact_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-02 20:43:30,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Ended with exit code 0 [2022-11-02 20:43:30,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:30,538 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:30,539 INFO L229 MonitoredProcess]: Starting monitored process 133 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:30,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2022-11-02 20:43:30,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:30,540 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:30,554 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:43:30,554 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fact_~n=0} Honda state: {fact_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-02 20:43:30,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:30,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:30,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:30,588 INFO L229 MonitoredProcess]: Starting monitored process 134 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:30,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2022-11-02 20:43:30,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:30,590 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:30,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2022-11-02 20:43:30,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:30,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:30,632 INFO L229 MonitoredProcess]: Starting monitored process 135 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:30,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2022-11-02 20:43:30,634 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-02 20:43:30,634 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:30,681 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-02 20:43:30,684 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2022-11-02 20:43:30,684 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:43:30,685 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:43:30,685 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:43:30,685 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:43:30,685 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:43:30,685 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:30,685 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:43:30,685 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:43:30,685 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration18_Loop [2022-11-02 20:43:30,685 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:43:30,685 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:43:30,686 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:30,688 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:30,691 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:30,693 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:30,730 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:43:30,730 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:43:30,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:30,730 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:30,731 INFO L229 MonitoredProcess]: Starting monitored process 136 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:30,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2022-11-02 20:43:30,733 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 [2022-11-02 20:43:30,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:30,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:30,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:30,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:30,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:30,746 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:30,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:30,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:43:30,777 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2022-11-02 20:43:30,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:30,777 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:30,779 INFO L229 MonitoredProcess]: Starting monitored process 137 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:30,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2022-11-02 20:43:30,780 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 [2022-11-02 20:43:30,792 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:30,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:30,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:30,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:30,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:30,793 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:30,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:30,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:43:30,822 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:30,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:30,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:30,824 INFO L229 MonitoredProcess]: Starting monitored process 138 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:30,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2022-11-02 20:43:30,825 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 [2022-11-02 20:43:30,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:30,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:30,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:30,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:30,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:30,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:30,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:30,840 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:43:30,867 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:30,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:30,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:30,868 INFO L229 MonitoredProcess]: Starting monitored process 139 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:30,871 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2022-11-02 20:43:30,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-02 20:43:30,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:30,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:30,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:30,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:30,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:30,885 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:30,885 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:30,895 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:43:30,898 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-02 20:43:30,898 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-11-02 20:43:30,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:30,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:30,903 INFO L229 MonitoredProcess]: Starting monitored process 140 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:30,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2022-11-02 20:43:30,904 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:43:30,905 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-02 20:43:30,905 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:43:30,905 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fact_#in~n) = 1*fact_#in~n Supporting invariants [] [2022-11-02 20:43:30,931 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2022-11-02 20:43:30,931 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-02 20:43:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:31,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-02 20:43:31,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:31,329 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2022-11-02 20:43:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:31,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:43:31,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:31,404 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-11-02 20:43:31,405 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 677 states and 958 transitions. cyclomatic complexity: 302 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, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:43:31,568 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 677 states and 958 transitions. cyclomatic complexity: 302. 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, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Result 701 states and 986 transitions. Complement of second has 13 states. [2022-11-02 20:43:31,569 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 [2022-11-02 20:43:31,570 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, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:43:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-11-02 20:43:31,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 47 letters. Loop has 3 letters. [2022-11-02 20:43:31,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:31,571 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-02 20:43:31,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:31,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-02 20:43:31,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:31,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:43:31,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:32,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:32,036 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2022-11-02 20:43:32,036 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 677 states and 958 transitions. cyclomatic complexity: 302 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, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:43:32,192 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 677 states and 958 transitions. cyclomatic complexity: 302. 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, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Result 701 states and 986 transitions. Complement of second has 13 states. [2022-11-02 20:43:32,193 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 [2022-11-02 20:43:32,194 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, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:43:32,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-11-02 20:43:32,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 47 letters. Loop has 3 letters. [2022-11-02 20:43:32,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:32,195 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-02 20:43:32,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-02 20:43:32,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:32,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:43:32,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:32,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:43:32,659 INFO L141 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 [2022-11-02 20:43:32,659 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 677 states and 958 transitions. cyclomatic complexity: 302 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, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:43:32,864 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 677 states and 958 transitions. cyclomatic complexity: 302. 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, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Result 811 states and 1116 transitions. Complement of second has 16 states. [2022-11-02 20:43:32,865 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 [2022-11-02 20:43:32,866 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, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-02 20:43:32,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-11-02 20:43:32,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 47 letters. Loop has 3 letters. [2022-11-02 20:43:32,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:32,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 50 letters. Loop has 3 letters. [2022-11-02 20:43:32,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:32,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 47 letters. Loop has 6 letters. [2022-11-02 20:43:32,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:32,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 811 states and 1116 transitions. [2022-11-02 20:43:32,880 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 156 [2022-11-02 20:43:32,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 811 states to 585 states and 852 transitions. [2022-11-02 20:43:32,888 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 230 [2022-11-02 20:43:32,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 233 [2022-11-02 20:43:32,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 585 states and 852 transitions. [2022-11-02 20:43:32,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:32,890 INFO L218 hiAutomatonCegarLoop]: Abstraction has 585 states and 852 transitions. [2022-11-02 20:43:32,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states and 852 transitions. [2022-11-02 20:43:32,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 569. [2022-11-02 20:43:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 372 states have (on average 1.1236559139784945) internal successors, (418), 357 states have internal predecessors, (418), 158 states have call successors, (160), 49 states have call predecessors, (160), 39 states have return successors, (248), 162 states have call predecessors, (248), 158 states have call successors, (248) [2022-11-02 20:43:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 826 transitions. [2022-11-02 20:43:32,914 INFO L240 hiAutomatonCegarLoop]: Abstraction has 569 states and 826 transitions. [2022-11-02 20:43:32,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:32,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:43:32,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:43:32,916 INFO L87 Difference]: Start difference. First operand 569 states and 826 transitions. Second operand has 13 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 7 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-11-02 20:43:33,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:33,509 INFO L93 Difference]: Finished difference Result 941 states and 1340 transitions. [2022-11-02 20:43:33,509 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 941 states and 1340 transitions. [2022-11-02 20:43:33,519 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 272 [2022-11-02 20:43:33,530 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 941 states to 910 states and 1301 transitions. [2022-11-02 20:43:33,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 412 [2022-11-02 20:43:33,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 412 [2022-11-02 20:43:33,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 910 states and 1301 transitions. [2022-11-02 20:43:33,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:33,534 INFO L218 hiAutomatonCegarLoop]: Abstraction has 910 states and 1301 transitions. [2022-11-02 20:43:33,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 910 states and 1301 transitions. [2022-11-02 20:43:33,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 910 to 672. [2022-11-02 20:43:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 429 states have (on average 1.1282051282051282) internal successors, (484), 422 states have internal predecessors, (484), 197 states have call successors, (198), 58 states have call predecessors, (198), 46 states have return successors, (290), 191 states have call predecessors, (290), 197 states have call successors, (290) [2022-11-02 20:43:33,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 972 transitions. [2022-11-02 20:43:33,565 INFO L240 hiAutomatonCegarLoop]: Abstraction has 672 states and 972 transitions. [2022-11-02 20:43:33,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:43:33,566 INFO L428 stractBuchiCegarLoop]: Abstraction has 672 states and 972 transitions. [2022-11-02 20:43:33,566 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-11-02 20:43:33,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 672 states and 972 transitions. [2022-11-02 20:43:33,571 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 185 [2022-11-02 20:43:33,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:43:33,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:43:33,573 INFO L148 hiAutomatonCegarLoop]: 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] [2022-11-02 20:43:33,573 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [17, 17, 9, 8, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:33,574 INFO L748 eck$LassoCheckResult]: Stem: 33623#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 33591#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; 33592#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 33622#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; 33646#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 33846#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 33835#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; 33582#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 33583#factENTRY ~n := #in~n; 33819#L25 assume ~n <= 0;#res := 1; 33818#factFINAL assume true; 33817#factEXIT >#68#return; 33641#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 33575#factENTRY ~n := #in~n; 33844#L25 assume ~n <= 0;#res := 1; 33841#factFINAL assume true; 33830#factEXIT >#70#return; 33574#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 33575#factENTRY ~n := #in~n; 33844#L25 assume ~n <= 0;#res := 1; 33841#factFINAL assume true; 33830#factEXIT >#72#return; 33831#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; 33869#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 33870#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 33891#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 33626#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; 33627#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 33905#factENTRY ~n := #in~n; 33914#L25 assume !(~n <= 0); 33911#L26 call #t~ret0 := fact(~n - 1);< 33912#factENTRY ~n := #in~n; 33915#L25 assume ~n <= 0;#res := 1; 33913#factFINAL assume true; 33910#factEXIT >#66#return; 33909#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 33908#factFINAL assume true; 33904#factEXIT >#74#return; 33893#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 33901#factENTRY ~n := #in~n; 33906#L25 assume ~n <= 0;#res := 1; 33902#factFINAL assume true; 33897#factEXIT >#76#return; 33571#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 33648#factENTRY ~n := #in~n; 33966#L25 assume !(~n <= 0); 33589#L26 call #t~ret0 := fact(~n - 1);< 33588#factENTRY ~n := #in~n; 33590#L25 assume ~n <= 0;#res := 1; 33634#factFINAL assume true; 33999#factEXIT >#66#return; 33629#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 33630#factFINAL assume true; 33570#factEXIT >#78#return; 33572#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; 34026#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 34023#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 33637#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 33638#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 34160#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 33610#L42-3 [2022-11-02 20:43:33,574 INFO L750 eck$LassoCheckResult]: Loop: 33610#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 34118#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; 34077#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 33640#factENTRY ~n := #in~n; 34142#L25 assume !(~n <= 0); 33631#L26 call #t~ret0 := fact(~n - 1);< 33985#factENTRY ~n := #in~n; 33587#L25 assume ~n <= 0;#res := 1; 33633#factFINAL assume true; 34161#factEXIT >#66#return; 34162#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34163#factFINAL assume true; 34153#factEXIT >#68#return; 34070#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 34098#factENTRY ~n := #in~n; 34143#L25 assume ~n <= 0;#res := 1; 34001#factFINAL assume true; 34062#factEXIT >#70#return; 34082#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 34120#factENTRY ~n := #in~n; 34149#L25 assume !(~n <= 0); 33631#L26 call #t~ret0 := fact(~n - 1);< 33985#factENTRY ~n := #in~n; 33587#L25 assume ~n <= 0;#res := 1; 33633#factFINAL assume true; 34161#factEXIT >#66#return; 34162#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34163#factFINAL assume true; 34153#factEXIT >#72#return; 34154#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; 34225#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 34224#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 34221#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 33624#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; 33625#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 33640#factENTRY ~n := #in~n; 34142#L25 assume !(~n <= 0); 33631#L26 call #t~ret0 := fact(~n - 1);< 33985#factENTRY ~n := #in~n; 33587#L25 assume ~n <= 0;#res := 1; 33633#factFINAL assume true; 34161#factEXIT >#66#return; 34162#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34163#factFINAL assume true; 34153#factEXIT >#68#return; 33597#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 34006#factENTRY ~n := #in~n; 34000#L25 assume !(~n <= 0); 33585#L26 call #t~ret0 := fact(~n - 1);< 33584#factENTRY ~n := #in~n; 33587#L25 assume ~n <= 0;#res := 1; 33633#factFINAL assume true; 34161#factEXIT >#66#return; 34162#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34163#factFINAL assume true; 34153#factEXIT >#70#return; 34071#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 34098#factENTRY ~n := #in~n; 34143#L25 assume ~n <= 0;#res := 1; 34001#factFINAL assume true; 34062#factEXIT >#72#return; 34083#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; 34222#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 34219#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 34218#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 34217#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; 34063#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 33640#factENTRY ~n := #in~n; 34142#L25 assume !(~n <= 0); 33631#L26 call #t~ret0 := fact(~n - 1);< 33985#factENTRY ~n := #in~n; 33961#L25 assume !(~n <= 0); 33963#L26 call #t~ret0 := fact(~n - 1);< 33986#factENTRY ~n := #in~n; 33987#L25 assume ~n <= 0;#res := 1; 34128#factFINAL assume true; 34127#factEXIT >#66#return; 34125#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34126#factFINAL assume true; 34123#factEXIT >#66#return; 34122#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34119#factFINAL assume true; 34100#factEXIT >#74#return; 33600#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 34006#factENTRY ~n := #in~n; 34000#L25 assume !(~n <= 0); 33585#L26 call #t~ret0 := fact(~n - 1);< 33584#factENTRY ~n := #in~n; 33587#L25 assume ~n <= 0;#res := 1; 33633#factFINAL assume true; 34161#factEXIT >#66#return; 34162#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 34163#factFINAL assume true; 34153#factEXIT >#76#return; 33564#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 34009#factENTRY ~n := #in~n; 34140#L25 assume !(~n <= 0); 34134#L26 call #t~ret0 := fact(~n - 1);< 34136#factENTRY ~n := #in~n; 34139#L25 assume ~n <= 0;#res := 1; 34137#factFINAL assume true; 34133#factEXIT >#66#return; 33628#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 33576#factFINAL assume true; 33561#factEXIT >#78#return; 33569#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; 34189#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 34188#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 34187#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 33620#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 33609#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 33610#L42-3 [2022-11-02 20:43:33,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:33,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1978773599, now seen corresponding path program 4 times [2022-11-02 20:43:33,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:33,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170939064] [2022-11-02 20:43:33,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:33,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:33,582 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:33,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [78357851] [2022-11-02 20:43:33,582 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:43:33,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:33,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:33,586 INFO L229 MonitoredProcess]: Starting monitored process 141 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:33,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2022-11-02 20:43:33,673 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:43:33,673 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-02 20:43:33,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:33,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:33,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:33,718 INFO L85 PathProgramCache]: Analyzing trace with hash 590406435, now seen corresponding path program 9 times [2022-11-02 20:43:33,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:33,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049431819] [2022-11-02 20:43:33,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:33,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:33,727 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:33,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [967529108] [2022-11-02 20:43:33,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:43:33,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:33,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:33,730 INFO L229 MonitoredProcess]: Starting monitored process 142 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:33,737 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2022-11-02 20:43:33,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-11-02 20:43:33,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-02 20:43:33,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:33,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:33,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:33,921 INFO L85 PathProgramCache]: Analyzing trace with hash 736681859, now seen corresponding path program 5 times [2022-11-02 20:43:33,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:33,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313653546] [2022-11-02 20:43:33,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:33,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:33,933 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:33,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1783304569] [2022-11-02 20:43:33,934 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 20:43:33,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:33,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:33,937 INFO L229 MonitoredProcess]: Starting monitored process 143 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:33,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2022-11-02 20:43:34,091 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2022-11-02 20:43:34,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:43:34,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-02 20:43:34,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:34,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 628 proven. 95 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2022-11-02 20:43:34,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:34,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1355 backedges. 76 proven. 146 refuted. 0 times theorem prover too weak. 1133 trivial. 0 not checked. [2022-11-02 20:43:34,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:34,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313653546] [2022-11-02 20:43:34,844 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:43:34,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783304569] [2022-11-02 20:43:34,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783304569] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:34,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:43:34,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 18 [2022-11-02 20:43:34,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831354079] [2022-11-02 20:43:34,845 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:41,335 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:43:41,335 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:43:41,335 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:43:41,335 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:43:41,335 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-02 20:43:41,336 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:41,336 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:43:41,336 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:43:41,336 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration19_Loop [2022-11-02 20:43:41,336 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:43:41,336 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:43:41,338 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:41,340 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:41,342 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:41,465 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:41,468 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:41,470 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:41,476 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:41,480 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:41,951 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:43:41,952 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-02 20:43:41,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:41,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:41,953 INFO L229 MonitoredProcess]: Starting monitored process 144 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:41,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2022-11-02 20:43:41,955 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:41,955 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:41,972 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:43:41,972 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: [] [2022-11-02 20:43:42,004 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2022-11-02 20:43:42,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:42,004 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:42,006 INFO L229 MonitoredProcess]: Starting monitored process 145 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:42,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2022-11-02 20:43:42,008 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:42,008 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:42,024 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:43:42,025 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: [] [2022-11-02 20:43:42,052 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2022-11-02 20:43:42,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:42,053 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:42,054 INFO L229 MonitoredProcess]: Starting monitored process 146 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:42,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2022-11-02 20:43:42,056 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:42,056 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:42,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Ended with exit code 0 [2022-11-02 20:43:42,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:42,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:42,120 INFO L229 MonitoredProcess]: Starting monitored process 147 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:42,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2022-11-02 20:43:42,122 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-02 20:43:42,122 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:42,151 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-02 20:43:42,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:42,178 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:43:42,178 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:43:42,178 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:43:42,178 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:43:42,178 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:43:42,178 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:42,178 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:43:42,178 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:43:42,179 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration19_Loop [2022-11-02 20:43:42,179 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:43:42,179 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:43:42,180 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:42,183 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:42,186 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:42,189 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:42,195 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:42,320 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:42,323 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:42,325 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:42,933 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:43:42,934 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:43:42,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:42,934 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:42,940 INFO L229 MonitoredProcess]: Starting monitored process 148 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:42,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2022-11-02 20:43:42,942 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 [2022-11-02 20:43:42,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:42,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:42,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:42,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:42,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:42,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:42,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:42,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:43:42,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:42,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:42,986 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:42,987 INFO L229 MonitoredProcess]: Starting monitored process 149 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:42,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2022-11-02 20:43:42,990 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 [2022-11-02 20:43:43,002 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:43,002 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:43,002 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:43,002 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:43,002 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:43,003 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:43,003 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:43,004 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:43:43,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2022-11-02 20:43:43,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:43,032 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:43,034 INFO L229 MonitoredProcess]: Starting monitored process 150 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:43,035 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2022-11-02 20:43:43,036 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 [2022-11-02 20:43:43,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:43,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:43,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:43,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:43,048 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:43,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:43,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:43,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:43:43,076 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2022-11-02 20:43:43,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:43,077 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:43,078 INFO L229 MonitoredProcess]: Starting monitored process 151 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:43,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2022-11-02 20:43:43,080 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 [2022-11-02 20:43:43,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:43,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:43,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:43,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:43,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:43,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:43,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:43,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:43:43,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2022-11-02 20:43:43,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:43,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:43,122 INFO L229 MonitoredProcess]: Starting monitored process 152 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:43,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2022-11-02 20:43:43,123 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 [2022-11-02 20:43:43,136 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:43,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:43,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:43,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:43,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:43,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:43,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:43,148 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:43:43,153 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-02 20:43:43,154 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-02 20:43:43,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:43,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:43,156 INFO L229 MonitoredProcess]: Starting monitored process 153 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:43,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2022-11-02 20:43:43,157 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:43:43,157 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-02 20:43:43,157 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:43:43,158 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 [] [2022-11-02 20:43:43,185 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2022-11-02 20:43:43,186 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-02 20:43:43,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:43,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:43,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-02 20:43:43,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:43,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-02 20:43:43,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:44,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:44,499 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 5 proven. 107 refuted. 0 times theorem prover too weak. 505 trivial. 0 not checked. [2022-11-02 20:43:44,500 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2022-11-02 20:43:44,500 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 672 states and 972 transitions. cyclomatic complexity: 316 Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2022-11-02 20:43:45,102 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 672 states and 972 transitions. cyclomatic complexity: 316. Second operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) Result 1481 states and 2148 transitions. Complement of second has 32 states. [2022-11-02 20:43:45,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2022-11-02 20:43:45,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 4.5) internal successors, (45), 11 states have internal predecessors, (45), 6 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (16), 5 states have call predecessors, (16), 6 states have call successors, (16) [2022-11-02 20:43:45,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-11-02 20:43:45,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 82 transitions. Stem has 60 letters. Loop has 111 letters. [2022-11-02 20:43:45,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:45,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 82 transitions. Stem has 171 letters. Loop has 111 letters. [2022-11-02 20:43:45,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:45,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 82 transitions. Stem has 60 letters. Loop has 222 letters. [2022-11-02 20:43:45,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:45,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1481 states and 2148 transitions. [2022-11-02 20:43:45,124 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 195 [2022-11-02 20:43:45,136 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1481 states to 879 states and 1272 transitions. [2022-11-02 20:43:45,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 332 [2022-11-02 20:43:45,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 336 [2022-11-02 20:43:45,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 879 states and 1272 transitions. [2022-11-02 20:43:45,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:45,138 INFO L218 hiAutomatonCegarLoop]: Abstraction has 879 states and 1272 transitions. [2022-11-02 20:43:45,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states and 1272 transitions. [2022-11-02 20:43:45,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 853. [2022-11-02 20:43:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 543 states have (on average 1.134438305709024) internal successors, (616), 536 states have internal predecessors, (616), 249 states have call successors, (250), 77 states have call predecessors, (250), 61 states have return successors, (361), 239 states have call predecessors, (361), 249 states have call successors, (361) [2022-11-02 20:43:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1227 transitions. [2022-11-02 20:43:45,177 INFO L240 hiAutomatonCegarLoop]: Abstraction has 853 states and 1227 transitions. [2022-11-02 20:43:45,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:45,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:43:45,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:43:45,178 INFO L87 Difference]: Start difference. First operand 853 states and 1227 transitions. Second operand has 18 states, 16 states have (on average 4.25) internal successors, (68), 18 states have internal predecessors, (68), 11 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (29), 8 states have call predecessors, (29), 11 states have call successors, (29) [2022-11-02 20:43:46,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:46,320 INFO L93 Difference]: Finished difference Result 1275 states and 1851 transitions. [2022-11-02 20:43:46,320 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1275 states and 1851 transitions. [2022-11-02 20:43:46,335 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 242 [2022-11-02 20:43:46,350 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1275 states to 989 states and 1471 transitions. [2022-11-02 20:43:46,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 396 [2022-11-02 20:43:46,352 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 396 [2022-11-02 20:43:46,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 989 states and 1471 transitions. [2022-11-02 20:43:46,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:46,353 INFO L218 hiAutomatonCegarLoop]: Abstraction has 989 states and 1471 transitions. [2022-11-02 20:43:46,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states and 1471 transitions. [2022-11-02 20:43:46,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 794. [2022-11-02 20:43:46,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 507 states have (on average 1.1301775147928994) internal successors, (573), 499 states have internal predecessors, (573), 231 states have call successors, (231), 72 states have call predecessors, (231), 56 states have return successors, (331), 222 states have call predecessors, (331), 231 states have call successors, (331) [2022-11-02 20:43:46,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1135 transitions. [2022-11-02 20:43:46,429 INFO L240 hiAutomatonCegarLoop]: Abstraction has 794 states and 1135 transitions. [2022-11-02 20:43:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:43:46,431 INFO L428 stractBuchiCegarLoop]: Abstraction has 794 states and 1135 transitions. [2022-11-02 20:43:46,431 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2022-11-02 20:43:46,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 794 states and 1135 transitions. [2022-11-02 20:43:46,436 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 189 [2022-11-02 20:43:46,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:43:46,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:43:46,438 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [17, 17, 10, 7, 7, 7, 7, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:46,438 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:46,439 INFO L748 eck$LassoCheckResult]: Stem: 39540#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 39505#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; 39506#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 39539#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; 39524#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 39525#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 40178#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; 39495#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 39496#factENTRY ~n := #in~n; 40181#L25 assume ~n <= 0;#res := 1; 40180#factFINAL assume true; 40177#factEXIT >#68#return; 39560#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 39482#factENTRY ~n := #in~n; 40175#L25 assume ~n <= 0;#res := 1; 40173#factFINAL assume true; 40168#factEXIT >#70#return; 39481#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 39482#factENTRY ~n := #in~n; 40175#L25 assume ~n <= 0;#res := 1; 40173#factFINAL assume true; 40168#factEXIT >#72#return; 39530#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; 39531#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 40193#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 40204#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 39542#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; 39478#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 39479#factENTRY ~n := #in~n; 39504#L25 assume !(~n <= 0); 39520#L26 call #t~ret0 := fact(~n - 1);< 39521#factENTRY ~n := #in~n; 40245#L25 assume ~n <= 0;#res := 1; 40243#factFINAL assume true; 40238#factEXIT >#66#return; 40239#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40255#factFINAL assume true; 40253#factEXIT >#74#return; 40250#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 40251#factENTRY ~n := #in~n; 40254#L25 assume ~n <= 0;#res := 1; 40252#factFINAL assume true; 40249#factEXIT >#76#return; 40198#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 40248#factENTRY ~n := #in~n; 40247#L25 assume !(~n <= 0); 40231#L26 call #t~ret0 := fact(~n - 1);< 40232#factENTRY ~n := #in~n; 40266#L25 assume ~n <= 0;#res := 1; 40234#factFINAL assume true; 40230#factEXIT >#66#return; 40228#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40229#factFINAL assume true; 40197#factEXIT >#78#return; 40196#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; 40192#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 40191#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 40189#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 40190#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; 40203#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 40212#factENTRY ~n := #in~n; 40223#L25 assume !(~n <= 0); 40216#L26 call #t~ret0 := fact(~n - 1);< 40219#factENTRY ~n := #in~n; 40222#L25 assume !(~n <= 0); 40217#L26 call #t~ret0 := fact(~n - 1);< 40221#factENTRY ~n := #in~n; 40226#L25 assume ~n <= 0;#res := 1; 40225#factFINAL assume true; 40224#factEXIT >#66#return; 40218#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40220#factFINAL assume true; 40215#factEXIT >#66#return; 40214#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40213#factFINAL assume true; 40210#factEXIT >#74#return; 40206#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 40207#factENTRY ~n := #in~n; 40209#L25 assume ~n <= 0;#res := 1; 40208#factFINAL assume true; 40205#factEXIT >#76#return; 39567#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 39568#factENTRY ~n := #in~n; 40227#L25 assume !(~n <= 0); 40216#L26 call #t~ret0 := fact(~n - 1);< 40219#factENTRY ~n := #in~n; 40222#L25 assume !(~n <= 0); 40217#L26 call #t~ret0 := fact(~n - 1);< 40221#factENTRY ~n := #in~n; 40226#L25 assume ~n <= 0;#res := 1; 40225#factFINAL assume true; 40224#factEXIT >#66#return; 40218#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40220#factFINAL assume true; 40215#factEXIT >#66#return; 40214#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 40213#factFINAL assume true; 40210#factEXIT >#78#return; 40211#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; 40269#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 40268#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 40001#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 40000#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 39999#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 39647#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 39645#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; 39594#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 39632#factENTRY ~n := #in~n; 39683#L25 assume !(~n <= 0); 39635#L26 call #t~ret0 := fact(~n - 1);< 39660#factENTRY ~n := #in~n; 39681#L25 assume ~n <= 0;#res := 1; 39665#factFINAL assume true; 39654#factEXIT >#66#return; 39652#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39591#factFINAL assume true; 39604#factEXIT >#68#return; 39554#L30-1 [2022-11-02 20:43:46,439 INFO L750 eck$LassoCheckResult]: Loop: 39554#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 39559#factENTRY ~n := #in~n; 39553#L25 assume ~n <= 0;#res := 1; 39558#factFINAL assume true; 39810#factEXIT >#70#return; 39502#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 39499#factENTRY ~n := #in~n; 39503#L25 assume !(~n <= 0); 39637#L26 call #t~ret0 := fact(~n - 1);< 39660#factENTRY ~n := #in~n; 39714#L25 assume !(~n <= 0); 39640#L26 call #t~ret0 := fact(~n - 1);< 39713#factENTRY ~n := #in~n; 39715#L25 assume ~n <= 0;#res := 1; 39772#factFINAL assume true; 39769#factEXIT >#66#return; 39643#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39710#factFINAL assume true; 39634#factEXIT >#66#return; 39641#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39809#factFINAL assume true; 39802#factEXIT >#72#return; 39801#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; 39800#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 39799#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 39798#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 39797#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; 39712#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 39477#factENTRY ~n := #in~n; 39812#L25 assume !(~n <= 0); 39637#L26 call #t~ret0 := fact(~n - 1);< 39660#factENTRY ~n := #in~n; 39681#L25 assume ~n <= 0;#res := 1; 39665#factFINAL assume true; 39654#factEXIT >#66#return; 39658#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 39808#factFINAL assume true; 39794#factEXIT >#68#return; 39554#L30-1 [2022-11-02 20:43:46,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:46,440 INFO L85 PathProgramCache]: Analyzing trace with hash -896424588, now seen corresponding path program 6 times [2022-11-02 20:43:46,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:46,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2845496] [2022-11-02 20:43:46,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:46,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:46,450 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:46,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1549585189] [2022-11-02 20:43:46,451 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-02 20:43:46,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:46,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:46,453 INFO L229 MonitoredProcess]: Starting monitored process 154 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:46,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (154)] Waiting until timeout for monitored process [2022-11-02 20:43:46,604 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-11-02 20:43:46,604 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-02 20:43:46,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:46,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:46,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:46,686 INFO L85 PathProgramCache]: Analyzing trace with hash -471330376, now seen corresponding path program 2 times [2022-11-02 20:43:46,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:46,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611463627] [2022-11-02 20:43:46,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:46,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:46,691 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:46,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [7575347] [2022-11-02 20:43:46,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:43:46,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:46,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:46,694 INFO L229 MonitoredProcess]: Starting monitored process 155 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:46,709 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (155)] Waiting until timeout for monitored process [2022-11-02 20:43:46,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:43:46,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-02 20:43:46,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:46,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:46,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:46,792 INFO L85 PathProgramCache]: Analyzing trace with hash 612698347, now seen corresponding path program 7 times [2022-11-02 20:43:46,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:46,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093472367] [2022-11-02 20:43:46,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:46,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:46,803 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:46,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1909912846] [2022-11-02 20:43:46,803 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-02 20:43:46,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:46,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:46,809 INFO L229 MonitoredProcess]: Starting monitored process 156 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:46,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (156)] Waiting until timeout for monitored process [2022-11-02 20:43:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:46,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:43:46,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 345 proven. 14 refuted. 0 times theorem prover too weak. 787 trivial. 0 not checked. [2022-11-02 20:43:47,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1146 backedges. 159 proven. 31 refuted. 0 times theorem prover too weak. 956 trivial. 0 not checked. [2022-11-02 20:43:47,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:47,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093472367] [2022-11-02 20:43:47,624 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:43:47,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909912846] [2022-11-02 20:43:47,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909912846] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:47,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:43:47,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2022-11-02 20:43:47,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746591594] [2022-11-02 20:43:47,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:48,416 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:43:48,416 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:43:48,416 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:43:48,417 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:43:48,417 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-02 20:43:48,417 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:48,417 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:43:48,417 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:43:48,417 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration20_Loop [2022-11-02 20:43:48,418 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:43:48,418 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:43:48,419 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:48,423 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:48,426 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:48,428 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:48,431 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:48,433 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:48,602 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:43:48,602 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-02 20:43:48,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:48,602 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:48,604 INFO L229 MonitoredProcess]: Starting monitored process 157 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:48,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2022-11-02 20:43:48,605 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:48,606 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:48,619 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:43:48,619 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8#1=0} Honda state: {ULTIMATE.start_main_#t~post8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-02 20:43:48,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Ended with exit code 0 [2022-11-02 20:43:48,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:48,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:48,656 INFO L229 MonitoredProcess]: Starting monitored process 158 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:48,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2022-11-02 20:43:48,658 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:48,658 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:48,671 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:43:48,671 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: [] [2022-11-02 20:43:48,698 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:48,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:48,699 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:48,700 INFO L229 MonitoredProcess]: Starting monitored process 159 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:48,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2022-11-02 20:43:48,701 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:48,701 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:48,715 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:43:48,715 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-02 20:43:48,746 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Ended with exit code 0 [2022-11-02 20:43:48,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:48,746 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:48,747 INFO L229 MonitoredProcess]: Starting monitored process 160 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:48,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Waiting until timeout for monitored process [2022-11-02 20:43:48,749 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:48,749 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:48,762 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:43:48,762 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: [] [2022-11-02 20:43:48,790 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (160)] Ended with exit code 0 [2022-11-02 20:43:48,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:48,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:48,792 INFO L229 MonitoredProcess]: Starting monitored process 161 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:48,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Waiting until timeout for monitored process [2022-11-02 20:43:48,794 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:48,794 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:48,808 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-02 20:43:48,808 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: [] [2022-11-02 20:43:48,836 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (161)] Ended with exit code 0 [2022-11-02 20:43:48,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:48,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:48,839 INFO L229 MonitoredProcess]: Starting monitored process 162 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:48,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Waiting until timeout for monitored process [2022-11-02 20:43:48,840 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:43:48,841 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:48,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (162)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:48,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:48,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:48,884 INFO L229 MonitoredProcess]: Starting monitored process 163 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:48,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Waiting until timeout for monitored process [2022-11-02 20:43:48,885 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-02 20:43:48,885 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:43:49,870 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-02 20:43:49,876 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (163)] Ended with exit code 0 [2022-11-02 20:43:49,877 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:43:49,877 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:43:49,877 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:43:49,877 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:43:49,877 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:43:49,877 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:49,877 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:43:49,877 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:43:49,878 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration20_Loop [2022-11-02 20:43:49,878 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:43:49,878 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:43:49,879 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:49,884 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:49,886 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:49,927 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:49,929 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:49,932 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:43:50,070 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:43:50,070 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:43:50,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:50,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:50,072 INFO L229 MonitoredProcess]: Starting monitored process 164 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:50,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Waiting until timeout for monitored process [2022-11-02 20:43:50,073 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 [2022-11-02 20:43:50,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:50,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:50,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:50,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:50,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:50,086 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:50,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:50,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:43:50,113 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (164)] Ended with exit code 0 [2022-11-02 20:43:50,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:50,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:50,115 INFO L229 MonitoredProcess]: Starting monitored process 165 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:50,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Waiting until timeout for monitored process [2022-11-02 20:43:50,117 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 [2022-11-02 20:43:50,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:50,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:50,129 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:50,129 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:50,129 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:50,129 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:50,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:50,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-02 20:43:50,157 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (165)] Ended with exit code 0 [2022-11-02 20:43:50,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:50,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:50,159 INFO L229 MonitoredProcess]: Starting monitored process 166 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:50,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Waiting until timeout for monitored process [2022-11-02 20:43:50,160 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 [2022-11-02 20:43:50,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:43:50,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:43:50,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:43:50,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:43:50,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:43:50,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:43:50,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:43:50,183 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:43:50,188 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-02 20:43:50,188 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-02 20:43:50,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:43:50,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:50,190 INFO L229 MonitoredProcess]: Starting monitored process 167 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:43:50,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Waiting until timeout for monitored process [2022-11-02 20:43:50,192 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:43:50,192 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-02 20:43:50,192 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:43:50,192 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 [] [2022-11-02 20:43:50,220 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (166)] Ended with exit code 0 [2022-11-02 20:43:50,220 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-02 20:43:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:50,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-02 20:43:50,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:51,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (167)] Forceful destruction successful, exit code 0 [2022-11-02 20:43:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:51,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-02 20:43:51,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:51,564 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-02 20:43:51,565 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2022-11-02 20:43:51,565 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 794 states and 1135 transitions. cyclomatic complexity: 362 Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-02 20:43:51,723 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 794 states and 1135 transitions. cyclomatic complexity: 362. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Result 912 states and 1268 transitions. Complement of second has 14 states. [2022-11-02 20:43:51,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2022-11-02 20:43:51,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-02 20:43:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-11-02 20:43:51,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 38 transitions. Stem has 117 letters. Loop has 38 letters. [2022-11-02 20:43:51,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:51,736 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-02 20:43:51,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:51,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-02 20:43:51,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:52,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-02 20:43:52,812 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-02 20:43:53,052 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2022-11-02 20:43:53,052 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 794 states and 1135 transitions. cyclomatic complexity: 362 Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-02 20:43:53,220 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 794 states and 1135 transitions. cyclomatic complexity: 362. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Result 914 states and 1270 transitions. Complement of second has 18 states. [2022-11-02 20:43:53,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2022-11-02 20:43:53,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-02 20:43:53,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-11-02 20:43:53,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 117 letters. Loop has 38 letters. [2022-11-02 20:43:53,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:53,224 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-11-02 20:43:53,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:53,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-02 20:43:53,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:43:54,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-02 20:43:54,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:54,608 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-11-02 20:43:54,608 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2022-11-02 20:43:54,608 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 794 states and 1135 transitions. cyclomatic complexity: 362 Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-02 20:43:54,823 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 794 states and 1135 transitions. cyclomatic complexity: 362. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Result 1782 states and 2473 transitions. Complement of second has 20 states. [2022-11-02 20:43:54,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2022-11-02 20:43:54,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-11-02 20:43:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2022-11-02 20:43:54,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 117 letters. Loop has 38 letters. [2022-11-02 20:43:54,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:54,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 155 letters. Loop has 38 letters. [2022-11-02 20:43:54,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:54,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 117 letters. Loop has 76 letters. [2022-11-02 20:43:54,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:43:54,831 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1782 states and 2473 transitions. [2022-11-02 20:43:54,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 83 [2022-11-02 20:43:54,860 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1782 states to 913 states and 1225 transitions. [2022-11-02 20:43:54,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2022-11-02 20:43:54,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2022-11-02 20:43:54,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 913 states and 1225 transitions. [2022-11-02 20:43:54,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:54,862 INFO L218 hiAutomatonCegarLoop]: Abstraction has 913 states and 1225 transitions. [2022-11-02 20:43:54,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states and 1225 transitions. [2022-11-02 20:43:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 864. [2022-11-02 20:43:54,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 546 states have (on average 1.1465201465201464) internal successors, (626), 551 states have internal predecessors, (626), 224 states have call successors, (224), 112 states have call predecessors, (224), 94 states have return successors, (311), 200 states have call predecessors, (311), 224 states have call successors, (311) [2022-11-02 20:43:54,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1161 transitions. [2022-11-02 20:43:54,894 INFO L240 hiAutomatonCegarLoop]: Abstraction has 864 states and 1161 transitions. [2022-11-02 20:43:54,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:54,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:43:54,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:43:54,895 INFO L87 Difference]: Start difference. First operand 864 states and 1161 transitions. Second operand has 13 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 13 states have internal predecessors, (47), 8 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (19), 7 states have call predecessors, (19), 8 states have call successors, (19) [2022-11-02 20:43:55,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:55,641 INFO L93 Difference]: Finished difference Result 1086 states and 1549 transitions. [2022-11-02 20:43:55,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1086 states and 1549 transitions. [2022-11-02 20:43:55,650 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 92 [2022-11-02 20:43:55,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1086 states to 1083 states and 1545 transitions. [2022-11-02 20:43:55,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2022-11-02 20:43:55,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2022-11-02 20:43:55,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1083 states and 1545 transitions. [2022-11-02 20:43:55,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:55,663 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1083 states and 1545 transitions. [2022-11-02 20:43:55,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states and 1545 transitions. [2022-11-02 20:43:55,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 937. [2022-11-02 20:43:55,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 586 states have (on average 1.1535836177474403) internal successors, (676), 593 states have internal predecessors, (676), 257 states have call successors, (257), 112 states have call predecessors, (257), 94 states have return successors, (358), 231 states have call predecessors, (358), 257 states have call successors, (358) [2022-11-02 20:43:55,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1291 transitions. [2022-11-02 20:43:55,701 INFO L240 hiAutomatonCegarLoop]: Abstraction has 937 states and 1291 transitions. [2022-11-02 20:43:55,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:43:55,703 INFO L428 stractBuchiCegarLoop]: Abstraction has 937 states and 1291 transitions. [2022-11-02 20:43:55,704 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2022-11-02 20:43:55,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 937 states and 1291 transitions. [2022-11-02 20:43:55,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 76 [2022-11-02 20:43:55,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:43:55,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:43:55,711 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-02 20:43:55,711 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [24, 24, 15, 15, 15, 15, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:55,711 INFO L748 eck$LassoCheckResult]: Stem: 48308#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 48288#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; 48289#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 48307#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; 48297#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 48298#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 49011#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; 49006#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 49007#factENTRY ~n := #in~n; 49010#L25 assume ~n <= 0;#res := 1; 49009#factFINAL assume true; 49005#factEXIT >#68#return; 49001#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 49002#factENTRY ~n := #in~n; 49008#L25 assume ~n <= 0;#res := 1; 49004#factFINAL assume true; 49000#factEXIT >#70#return; 48996#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 48997#factENTRY ~n := #in~n; 49003#L25 assume ~n <= 0;#res := 1; 48999#factFINAL assume true; 48995#factEXIT >#72#return; 48994#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; 48993#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 48983#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 48979#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 48975#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; 48969#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 48971#factENTRY ~n := #in~n; 48990#L25 assume !(~n <= 0); 48981#L26 call #t~ret0 := fact(~n - 1);< 48982#factENTRY ~n := #in~n; 48992#L25 assume ~n <= 0;#res := 1; 48989#factFINAL assume true; 48980#factEXIT >#66#return; 48976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48972#factFINAL assume true; 48968#factEXIT >#74#return; 48420#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 48978#factENTRY ~n := #in~n; 48987#L25 assume ~n <= 0;#res := 1; 48419#factFINAL assume true; 48421#factEXIT >#76#return; 48389#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 48974#factENTRY ~n := #in~n; 48998#L25 assume !(~n <= 0); 48985#L26 call #t~ret0 := fact(~n - 1);< 48986#factENTRY ~n := #in~n; 48991#L25 assume ~n <= 0;#res := 1; 48988#factFINAL assume true; 48984#factEXIT >#66#return; 48977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48973#factFINAL assume true; 48388#factEXIT >#78#return; 48387#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; 48384#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 48382#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 48380#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 48373#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; 48365#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 48369#factENTRY ~n := #in~n; 48386#L25 assume !(~n <= 0); 48377#L26 call #t~ret0 := fact(~n - 1);< 48379#factENTRY ~n := #in~n; 48402#L25 assume !(~n <= 0); 48376#L26 call #t~ret0 := fact(~n - 1);< 48401#factENTRY ~n := #in~n; 48413#L25 assume ~n <= 0;#res := 1; 48412#factFINAL assume true; 48411#factEXIT >#66#return; 48378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48400#factFINAL assume true; 48375#factEXIT >#66#return; 48372#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48368#factFINAL assume true; 48363#factEXIT >#74#return; 48366#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 48371#factENTRY ~n := #in~n; 48385#L25 assume ~n <= 0;#res := 1; 48383#factFINAL assume true; 48370#factEXIT >#76#return; 48364#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 48367#factENTRY ~n := #in~n; 48381#L25 assume !(~n <= 0); 48377#L26 call #t~ret0 := fact(~n - 1);< 48379#factENTRY ~n := #in~n; 48402#L25 assume !(~n <= 0); 48376#L26 call #t~ret0 := fact(~n - 1);< 48401#factENTRY ~n := #in~n; 48413#L25 assume ~n <= 0;#res := 1; 48412#factFINAL assume true; 48411#factEXIT >#66#return; 48378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48400#factFINAL assume true; 48375#factEXIT >#66#return; 48372#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48368#factFINAL assume true; 48363#factEXIT >#78#return; 48362#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; 48361#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 48360#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 48359#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 48358#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 48355#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 48312#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 48313#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; 48895#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 48897#factENTRY ~n := #in~n; 48919#L25 assume !(~n <= 0); 48917#L26 call #t~ret0 := fact(~n - 1);< 48918#factENTRY ~n := #in~n; 48922#L25 assume ~n <= 0;#res := 1; 48920#factFINAL assume true; 48916#factEXIT >#66#return; 48915#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48914#factFINAL assume true; 48894#factEXIT >#68#return; 48892#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 48893#factENTRY ~n := #in~n; 48901#L25 assume ~n <= 0;#res := 1; 48899#factFINAL assume true; 48890#factEXIT >#70#return; 48822#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 48679#factENTRY ~n := #in~n; 48903#L25 assume !(~n <= 0); 48857#L26 call #t~ret0 := fact(~n - 1);< 48878#factENTRY ~n := #in~n; 48888#L25 assume ~n <= 0;#res := 1; 48877#factFINAL assume true; 48870#factEXIT >#66#return; 48873#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48913#factFINAL assume true; 48819#factEXIT >#72#return; 48826#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; 48911#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 48909#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 48907#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 48906#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; 48808#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 48846#factENTRY ~n := #in~n; 48902#L25 assume !(~n <= 0); 48857#L26 call #t~ret0 := fact(~n - 1);< 48878#factENTRY ~n := #in~n; 48888#L25 assume ~n <= 0;#res := 1; 48877#factFINAL assume true; 48870#factEXIT >#66#return; 48873#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48913#factFINAL assume true; 48819#factEXIT >#68#return; 48825#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 48850#factENTRY ~n := #in~n; 48879#L25 assume !(~n <= 0); 48871#L26 call #t~ret0 := fact(~n - 1);< 48874#factENTRY ~n := #in~n; 48888#L25 assume ~n <= 0;#res := 1; 48877#factFINAL assume true; 48870#factEXIT >#66#return; 48861#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48860#factFINAL assume true; 48849#factEXIT >#70#return; 48801#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 48829#factENTRY ~n := #in~n; 48842#L25 assume ~n <= 0;#res := 1; 48831#factFINAL assume true; 48795#factEXIT >#72#return; 48816#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; 48925#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 48924#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 48923#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 48904#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; 48594#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 48600#factENTRY ~n := #in~n; 48662#L25 assume !(~n <= 0); 48650#L26 call #t~ret0 := fact(~n - 1);< 48658#factENTRY ~n := #in~n; 48666#L25 assume !(~n <= 0); 48655#L26 call #t~ret0 := fact(~n - 1);< 48665#factENTRY ~n := #in~n; 48672#L25 assume ~n <= 0;#res := 1; 48671#factFINAL assume true; 48670#factEXIT >#66#return; 48657#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48664#factFINAL assume true; 48654#factEXIT >#66#return; 48652#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48591#factFINAL assume true; 48599#factEXIT >#74#return; 48601#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 48602#factENTRY ~n := #in~n; 48627#L25 assume !(~n <= 0); 48628#L26 call #t~ret0 := fact(~n - 1);< 48651#factENTRY ~n := #in~n; 48660#L25 assume ~n <= 0;#res := 1; 48653#factFINAL assume true; 48649#factEXIT >#66#return; 48623#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48618#factFINAL assume true; 48613#factEXIT >#76#return; 48405#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 48343#factENTRY ~n := #in~n; 48639#L25 assume !(~n <= 0); 48635#L26 call #t~ret0 := fact(~n - 1);< 48636#factENTRY ~n := #in~n; 48648#L25 assume ~n <= 0;#res := 1; 48638#factFINAL assume true; 48634#factEXIT >#66#return; 48622#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48621#factFINAL assume true; 48404#factEXIT >#78#return; 48403#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; 48398#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 48396#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 48392#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 48357#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 48346#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 48345#L42-3 [2022-11-02 20:43:55,712 INFO L750 eck$LassoCheckResult]: Loop: 48345#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 48309#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; 48270#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 48271#factENTRY ~n := #in~n; 48344#L25 assume !(~n <= 0); 48334#L26 call #t~ret0 := fact(~n - 1);< 48337#factENTRY ~n := #in~n; 48350#L25 assume !(~n <= 0); 48335#L26 call #t~ret0 := fact(~n - 1);< 48349#factENTRY ~n := #in~n; 48351#L25 assume ~n <= 0;#res := 1; 48395#factFINAL assume true; 48394#factEXIT >#66#return; 48336#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48348#factFINAL assume true; 48333#factEXIT >#66#return; 48332#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48331#factFINAL assume true; 48330#factEXIT >#68#return; 48318#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 48319#factENTRY ~n := #in~n; 48541#L25 assume ~n <= 0;#res := 1; 48540#factFINAL assume true; 48536#factEXIT >#70#return; 48514#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 48520#factENTRY ~n := #in~n; 48575#L25 assume !(~n <= 0); 48528#L26 call #t~ret0 := fact(~n - 1);< 48533#factENTRY ~n := #in~n; 48584#L25 assume !(~n <= 0); 48530#L26 call #t~ret0 := fact(~n - 1);< 48583#factENTRY ~n := #in~n; 48588#L25 assume ~n <= 0;#res := 1; 48587#factFINAL assume true; 48586#factEXIT >#66#return; 48532#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48582#factFINAL assume true; 48526#factEXIT >#66#return; 48525#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48521#factFINAL assume true; 48512#factEXIT >#72#return; 48519#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; 48549#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 48546#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 48545#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 48543#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; 48513#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 48520#factENTRY ~n := #in~n; 48575#L25 assume !(~n <= 0); 48528#L26 call #t~ret0 := fact(~n - 1);< 48533#factENTRY ~n := #in~n; 48584#L25 assume !(~n <= 0); 48530#L26 call #t~ret0 := fact(~n - 1);< 48583#factENTRY ~n := #in~n; 48588#L25 assume ~n <= 0;#res := 1; 48587#factFINAL assume true; 48586#factEXIT >#66#return; 48532#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48582#factFINAL assume true; 48526#factEXIT >#66#return; 48525#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48521#factFINAL assume true; 48512#factEXIT >#68#return; 48516#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 48535#factENTRY ~n := #in~n; 48547#L25 assume !(~n <= 0); 48529#L26 call #t~ret0 := fact(~n - 1);< 48544#factENTRY ~n := #in~n; 48584#L25 assume !(~n <= 0); 48530#L26 call #t~ret0 := fact(~n - 1);< 48583#factENTRY ~n := #in~n; 48588#L25 assume ~n <= 0;#res := 1; 48587#factFINAL assume true; 48586#factEXIT >#66#return; 48532#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48582#factFINAL assume true; 48526#factEXIT >#66#return; 48531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48539#factFINAL assume true; 48538#factEXIT >#70#return; 48466#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 48522#factENTRY ~n := #in~n; 48573#L25 assume !(~n <= 0); 48527#L26 call #t~ret0 := fact(~n - 1);< 48544#factENTRY ~n := #in~n; 48584#L25 assume !(~n <= 0); 48530#L26 call #t~ret0 := fact(~n - 1);< 48583#factENTRY ~n := #in~n; 48588#L25 assume ~n <= 0;#res := 1; 48587#factFINAL assume true; 48586#factEXIT >#66#return; 48532#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48582#factFINAL assume true; 48526#factEXIT >#66#return; 48525#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48521#factFINAL assume true; 48512#factEXIT >#72#return; 48515#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; 48555#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 48553#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 48550#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 48542#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; 48436#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 48260#factENTRY ~n := #in~n; 48485#L25 assume !(~n <= 0); 48480#L26 call #t~ret0 := fact(~n - 1);< 48482#factENTRY ~n := #in~n; 48493#L25 assume !(~n <= 0); 48479#L26 call #t~ret0 := fact(~n - 1);< 48492#factENTRY ~n := #in~n; 48494#L25 assume ~n <= 0;#res := 1; 48498#factFINAL assume true; 48497#factEXIT >#66#return; 48481#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48491#factFINAL assume true; 48478#factEXIT >#66#return; 48475#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48434#factFINAL assume true; 48438#factEXIT >#74#return; 48426#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 48441#factENTRY ~n := #in~n; 48487#L25 assume !(~n <= 0); 48449#L26 call #t~ret0 := fact(~n - 1);< 48483#factENTRY ~n := #in~n; 48493#L25 assume !(~n <= 0); 48479#L26 call #t~ret0 := fact(~n - 1);< 48492#factENTRY ~n := #in~n; 48494#L25 assume ~n <= 0;#res := 1; 48498#factFINAL assume true; 48497#factEXIT >#66#return; 48481#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48491#factFINAL assume true; 48478#factEXIT >#66#return; 48475#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48434#factFINAL assume true; 48438#factEXIT >#76#return; 48274#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 48430#factENTRY ~n := #in~n; 48490#L25 assume !(~n <= 0); 48264#L26 call #t~ret0 := fact(~n - 1);< 48281#factENTRY ~n := #in~n; 48282#L25 assume ~n <= 0;#res := 1; 48315#factFINAL assume true; 48263#factEXIT >#66#return; 48265#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 48273#factFINAL assume true; 48275#factEXIT >#78#return; 48290#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; 48291#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 48295#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 48325#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 48304#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 48305#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 48345#L42-3 [2022-11-02 20:43:55,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:55,713 INFO L85 PathProgramCache]: Analyzing trace with hash 52177008, now seen corresponding path program 8 times [2022-11-02 20:43:55,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:55,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337113393] [2022-11-02 20:43:55,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:55,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:55,725 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:55,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2014766698] [2022-11-02 20:43:55,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:43:55,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:55,726 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:55,728 INFO L229 MonitoredProcess]: Starting monitored process 168 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:55,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (168)] Waiting until timeout for monitored process [2022-11-02 20:43:56,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:43:56,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-02 20:43:56,018 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:56,161 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:56,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:56,162 INFO L85 PathProgramCache]: Analyzing trace with hash -103094629, now seen corresponding path program 10 times [2022-11-02 20:43:56,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:56,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789336236] [2022-11-02 20:43:56,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:56,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:56,174 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:56,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1536520744] [2022-11-02 20:43:56,174 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:43:56,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:56,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:56,176 INFO L229 MonitoredProcess]: Starting monitored process 169 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:56,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (169)] Waiting until timeout for monitored process [2022-11-02 20:43:56,308 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:43:56,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:43:56,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-02 20:43:56,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 791 proven. 32 refuted. 0 times theorem prover too weak. 508 trivial. 0 not checked. [2022-11-02 20:43:56,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:57,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 107 proven. 160 refuted. 0 times theorem prover too weak. 1064 trivial. 0 not checked. [2022-11-02 20:43:57,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:57,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789336236] [2022-11-02 20:43:57,041 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:43:57,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536520744] [2022-11-02 20:43:57,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536520744] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:57,041 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:43:57,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 15 [2022-11-02 20:43:57,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884585924] [2022-11-02 20:43:57,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:57,042 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:43:57,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:57,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:43:57,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:43:57,043 INFO L87 Difference]: Start difference. First operand 937 states and 1291 transitions. cyclomatic complexity: 373 Second operand has 15 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 15 states have internal predecessors, (44), 9 states have call successors, (20), 2 states have call predecessors, (20), 5 states have return successors, (20), 8 states have call predecessors, (20), 9 states have call successors, (20) [2022-11-02 20:43:57,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:43:57,805 INFO L93 Difference]: Finished difference Result 1160 states and 1643 transitions. [2022-11-02 20:43:57,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1160 states and 1643 transitions. [2022-11-02 20:43:57,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 112 [2022-11-02 20:43:57,829 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1160 states to 1160 states and 1643 transitions. [2022-11-02 20:43:57,829 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2022-11-02 20:43:57,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2022-11-02 20:43:57,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1160 states and 1643 transitions. [2022-11-02 20:43:57,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:43:57,830 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1160 states and 1643 transitions. [2022-11-02 20:43:57,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states and 1643 transitions. [2022-11-02 20:43:57,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 939. [2022-11-02 20:43:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 586 states have (on average 1.1535836177474403) internal successors, (676), 594 states have internal predecessors, (676), 259 states have call successors, (259), 112 states have call predecessors, (259), 94 states have return successors, (361), 232 states have call predecessors, (361), 259 states have call successors, (361) [2022-11-02 20:43:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1296 transitions. [2022-11-02 20:43:57,871 INFO L240 hiAutomatonCegarLoop]: Abstraction has 939 states and 1296 transitions. [2022-11-02 20:43:57,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:43:57,873 INFO L428 stractBuchiCegarLoop]: Abstraction has 939 states and 1296 transitions. [2022-11-02 20:43:57,873 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2022-11-02 20:43:57,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 939 states and 1296 transitions. [2022-11-02 20:43:57,877 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-11-02 20:43:57,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:43:57,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:43:57,880 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-02 20:43:57,880 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [21, 21, 12, 12, 12, 12, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:43:57,881 INFO L748 eck$LassoCheckResult]: Stem: 51357#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 51333#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; 51334#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 51356#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; 51345#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 51346#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 52163#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; 51318#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 51319#factENTRY ~n := #in~n; 52221#L25 assume ~n <= 0;#res := 1; 52219#factFINAL assume true; 52206#factEXIT >#68#return; 51372#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 51373#factENTRY ~n := #in~n; 52140#L25 assume ~n <= 0;#res := 1; 52136#factFINAL assume true; 52133#factEXIT >#70#return; 51308#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 51309#factENTRY ~n := #in~n; 52161#L25 assume ~n <= 0;#res := 1; 52160#factFINAL assume true; 52159#factEXIT >#72#return; 52158#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; 52157#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 52156#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 52155#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 52154#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; 51306#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 51307#factENTRY ~n := #in~n; 52228#L25 assume !(~n <= 0); 52212#L26 call #t~ret0 := fact(~n - 1);< 52213#factENTRY ~n := #in~n; 52227#L25 assume ~n <= 0;#res := 1; 52226#factFINAL assume true; 52211#factEXIT >#66#return; 52210#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52208#factFINAL assume true; 52199#factEXIT >#74#return; 52200#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 52215#factENTRY ~n := #in~n; 52225#L25 assume ~n <= 0;#res := 1; 52224#factFINAL assume true; 52214#factEXIT >#76#return; 51619#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 52204#factENTRY ~n := #in~n; 52220#L25 assume !(~n <= 0); 52217#L26 call #t~ret0 := fact(~n - 1);< 52218#factENTRY ~n := #in~n; 52223#L25 assume ~n <= 0;#res := 1; 52222#factFINAL assume true; 52216#factEXIT >#66#return; 52205#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52203#factFINAL assume true; 51618#factEXIT >#78#return; 51614#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; 51593#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 51590#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 51588#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 51586#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; 51573#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 51577#factENTRY ~n := #in~n; 51592#L25 assume !(~n <= 0); 51582#L26 call #t~ret0 := fact(~n - 1);< 51585#factENTRY ~n := #in~n; 51617#L25 assume !(~n <= 0); 51583#L26 call #t~ret0 := fact(~n - 1);< 51616#factENTRY ~n := #in~n; 51624#L25 assume ~n <= 0;#res := 1; 51623#factFINAL assume true; 51622#factEXIT >#66#return; 51584#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51615#factFINAL assume true; 51581#factEXIT >#66#return; 51580#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51576#factFINAL assume true; 51571#factEXIT >#74#return; 51574#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 51579#factENTRY ~n := #in~n; 51591#L25 assume ~n <= 0;#res := 1; 51589#factFINAL assume true; 51578#factEXIT >#76#return; 51572#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 51575#factENTRY ~n := #in~n; 51587#L25 assume !(~n <= 0); 51582#L26 call #t~ret0 := fact(~n - 1);< 51585#factENTRY ~n := #in~n; 51617#L25 assume !(~n <= 0); 51583#L26 call #t~ret0 := fact(~n - 1);< 51616#factENTRY ~n := #in~n; 51624#L25 assume ~n <= 0;#res := 1; 51623#factFINAL assume true; 51622#factEXIT >#66#return; 51584#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51615#factFINAL assume true; 51581#factEXIT >#66#return; 51580#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51576#factFINAL assume true; 51571#factEXIT >#78#return; 51570#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; 51569#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 51568#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 51567#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 51566#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 51563#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 51565#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 52127#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; 52110#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 52111#factENTRY ~n := #in~n; 52142#L25 assume !(~n <= 0); 52138#L26 call #t~ret0 := fact(~n - 1);< 52139#factENTRY ~n := #in~n; 52143#L25 assume ~n <= 0;#res := 1; 52141#factFINAL assume true; 52137#factEXIT >#66#return; 52134#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52131#factFINAL assume true; 52108#factEXIT >#68#return; 52103#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 52105#factENTRY ~n := #in~n; 52124#L25 assume ~n <= 0;#res := 1; 52123#factFINAL assume true; 52102#factEXIT >#70#return; 52071#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 52082#factENTRY ~n := #in~n; 52146#L25 assume !(~n <= 0); 52097#L26 call #t~ret0 := fact(~n - 1);< 52122#factENTRY ~n := #in~n; 52115#L25 assume ~n <= 0;#res := 1; 52112#factFINAL assume true; 52095#factEXIT >#66#return; 52093#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52080#factFINAL assume true; 52068#factEXIT >#72#return; 52076#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; 52177#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 52175#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 52172#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 52171#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; 51986#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 52081#factENTRY ~n := #in~n; 52145#L25 assume !(~n <= 0); 52097#L26 call #t~ret0 := fact(~n - 1);< 52122#factENTRY ~n := #in~n; 52115#L25 assume ~n <= 0;#res := 1; 52112#factFINAL assume true; 52095#factEXIT >#66#return; 52093#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52080#factFINAL assume true; 52068#factEXIT >#68#return; 52072#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 52116#factENTRY ~n := #in~n; 52113#L25 assume !(~n <= 0); 52096#L26 call #t~ret0 := fact(~n - 1);< 52100#factENTRY ~n := #in~n; 52115#L25 assume ~n <= 0;#res := 1; 52112#factFINAL assume true; 52095#factEXIT >#66#return; 52099#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52164#factFINAL assume true; 52162#factEXIT >#70#return; 52049#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 52079#factENTRY ~n := #in~n; 52092#L25 assume ~n <= 0;#res := 1; 52078#factFINAL assume true; 52042#factEXIT >#72#return; 52064#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; 52197#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 52195#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 52193#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 51985#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; 51963#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 51978#factENTRY ~n := #in~n; 52012#L25 assume !(~n <= 0); 51996#L26 call #t~ret0 := fact(~n - 1);< 52007#factENTRY ~n := #in~n; 52024#L25 assume !(~n <= 0); 51995#L26 call #t~ret0 := fact(~n - 1);< 52023#factENTRY ~n := #in~n; 52028#L25 assume ~n <= 0;#res := 1; 52027#factFINAL assume true; 52026#factEXIT >#66#return; 51998#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52022#factFINAL assume true; 51994#factEXIT >#66#return; 51993#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51989#factFINAL assume true; 51975#factEXIT >#74#return; 51970#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 51974#factENTRY ~n := #in~n; 51983#L25 assume !(~n <= 0); 51984#L26 call #t~ret0 := fact(~n - 1);< 52008#factENTRY ~n := #in~n; 52010#L25 assume ~n <= 0;#res := 1; 52009#factFINAL assume true; 52006#factEXIT >#66#return; 52001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51980#factFINAL assume true; 51962#factEXIT >#76#return; 51607#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 51608#factENTRY ~n := #in~n; 52020#L25 assume !(~n <= 0); 52017#L26 call #t~ret0 := fact(~n - 1);< 52018#factENTRY ~n := #in~n; 52021#L25 assume ~n <= 0;#res := 1; 52019#factFINAL assume true; 52016#factEXIT >#66#return; 52015#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 52014#factFINAL assume true; 51605#factEXIT >#78#return; 51603#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; 51600#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 51597#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 51595#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 51594#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 51404#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 51403#L42-3 [2022-11-02 20:43:57,882 INFO L750 eck$LassoCheckResult]: Loop: 51403#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 51358#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; 51316#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 51317#factENTRY ~n := #in~n; 51389#L25 assume !(~n <= 0); 51386#L26 call #t~ret0 := fact(~n - 1);< 51388#factENTRY ~n := #in~n; 51392#L25 assume !(~n <= 0); 51385#L26 call #t~ret0 := fact(~n - 1);< 51391#factENTRY ~n := #in~n; 51393#L25 assume ~n <= 0;#res := 1; 51402#factFINAL assume true; 51401#factEXIT >#66#return; 51387#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51390#factFINAL assume true; 51384#factEXIT >#66#return; 51383#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51382#factFINAL assume true; 51381#factEXIT >#68#return; 51370#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 51371#factENTRY ~n := #in~n; 51519#L25 assume ~n <= 0;#res := 1; 51507#factFINAL assume true; 51495#factEXIT >#70#return; 51478#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 51491#factENTRY ~n := #in~n; 51532#L25 assume !(~n <= 0); 51500#L26 call #t~ret0 := fact(~n - 1);< 51506#factENTRY ~n := #in~n; 51541#L25 assume !(~n <= 0); 51501#L26 call #t~ret0 := fact(~n - 1);< 51540#factENTRY ~n := #in~n; 51546#L25 assume ~n <= 0;#res := 1; 51545#factFINAL assume true; 51544#factEXIT >#66#return; 51504#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51539#factFINAL assume true; 51499#factEXIT >#66#return; 51494#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51492#factFINAL assume true; 51477#factEXIT >#72#return; 51484#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; 51517#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 51515#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 51514#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 51508#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; 51480#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 51491#factENTRY ~n := #in~n; 51532#L25 assume !(~n <= 0); 51500#L26 call #t~ret0 := fact(~n - 1);< 51506#factENTRY ~n := #in~n; 51541#L25 assume !(~n <= 0); 51501#L26 call #t~ret0 := fact(~n - 1);< 51540#factENTRY ~n := #in~n; 51546#L25 assume ~n <= 0;#res := 1; 51545#factFINAL assume true; 51544#factEXIT >#66#return; 51504#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51539#factFINAL assume true; 51499#factEXIT >#66#return; 51494#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51492#factFINAL assume true; 51477#factEXIT >#68#return; 51490#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 51497#factENTRY ~n := #in~n; 51518#L25 assume !(~n <= 0); 51503#L26 call #t~ret0 := fact(~n - 1);< 51516#factENTRY ~n := #in~n; 51531#L25 assume ~n <= 0;#res := 1; 51530#factFINAL assume true; 51526#factEXIT >#66#return; 51525#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51523#factFINAL assume true; 51522#factEXIT >#70#return; 51465#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 51493#factENTRY ~n := #in~n; 51521#L25 assume !(~n <= 0); 51502#L26 call #t~ret0 := fact(~n - 1);< 51516#factENTRY ~n := #in~n; 51531#L25 assume ~n <= 0;#res := 1; 51530#factFINAL assume true; 51526#factEXIT >#66#return; 51528#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51537#factFINAL assume true; 51535#factEXIT >#72#return; 51469#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; 51561#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 51560#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 51559#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 51513#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; 51425#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 51305#factENTRY ~n := #in~n; 51448#L25 assume !(~n <= 0); 51361#L26 call #t~ret0 := fact(~n - 1);< 51441#factENTRY ~n := #in~n; 51455#L25 assume !(~n <= 0); 51311#L26 call #t~ret0 := fact(~n - 1);< 51450#factENTRY ~n := #in~n; 51456#L25 assume ~n <= 0;#res := 1; 51457#factFINAL assume true; 51310#factEXIT >#66#return; 51312#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51362#factFINAL assume true; 51440#factEXIT >#66#return; 51437#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51427#factFINAL assume true; 51423#factEXIT >#74#return; 51409#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 51428#factENTRY ~n := #in~n; 51416#L25 assume !(~n <= 0); 51321#L26 call #t~ret0 := fact(~n - 1);< 51452#factENTRY ~n := #in~n; 51329#L25 assume ~n <= 0;#res := 1; 51320#factFINAL assume true; 51323#factEXIT >#66#return; 51454#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51406#factFINAL assume true; 51410#factEXIT >#76#return; 51395#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 51413#factENTRY ~n := #in~n; 51421#L25 assume !(~n <= 0); 51418#L26 call #t~ret0 := fact(~n - 1);< 51419#factENTRY ~n := #in~n; 51422#L25 assume ~n <= 0;#res := 1; 51420#factFINAL assume true; 51417#factEXIT >#66#return; 51415#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 51412#factFINAL assume true; 51394#factEXIT >#78#return; 51335#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; 51336#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 51343#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 51377#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 51352#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 51353#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 51403#L42-3 [2022-11-02 20:43:57,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:57,882 INFO L85 PathProgramCache]: Analyzing trace with hash 52177008, now seen corresponding path program 9 times [2022-11-02 20:43:57,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:57,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884872931] [2022-11-02 20:43:57,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:57,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:57,894 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:57,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [843300987] [2022-11-02 20:43:57,895 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:43:57,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:57,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:57,898 INFO L229 MonitoredProcess]: Starting monitored process 170 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:57,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (170)] Waiting until timeout for monitored process [2022-11-02 20:43:58,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2022-11-02 20:43:58,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-02 20:43:58,306 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:43:58,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:43:58,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:43:58,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:43:58,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1421429331, now seen corresponding path program 11 times [2022-11-02 20:43:58,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:43:58,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985305441] [2022-11-02 20:43:58,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:43:58,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:43:58,492 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:43:58,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1747819295] [2022-11-02 20:43:58,492 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 20:43:58,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:43:58,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:43:58,499 INFO L229 MonitoredProcess]: Starting monitored process 171 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:43:58,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (171)] Waiting until timeout for monitored process [2022-11-02 20:43:58,646 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-11-02 20:43:58,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:43:58,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 20:43:58,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:43:58,895 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 386 proven. 49 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2022-11-02 20:43:58,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:43:59,557 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 212 proven. 80 refuted. 0 times theorem prover too weak. 697 trivial. 0 not checked. [2022-11-02 20:43:59,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:43:59,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985305441] [2022-11-02 20:43:59,557 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:43:59,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747819295] [2022-11-02 20:43:59,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747819295] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:43:59,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:43:59,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2022-11-02 20:43:59,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40073249] [2022-11-02 20:43:59,558 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:43:59,559 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:43:59,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:43:59,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:43:59,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:43:59,559 INFO L87 Difference]: Start difference. First operand 939 states and 1296 transitions. cyclomatic complexity: 376 Second operand has 16 states, 11 states have (on average 4.0) internal successors, (44), 14 states have internal predecessors, (44), 10 states have call successors, (18), 2 states have call predecessors, (18), 5 states have return successors, (18), 10 states have call predecessors, (18), 10 states have call successors, (18) [2022-11-02 20:44:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:00,578 INFO L93 Difference]: Finished difference Result 1225 states and 1748 transitions. [2022-11-02 20:44:00,578 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1748 transitions. [2022-11-02 20:44:00,586 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 98 [2022-11-02 20:44:00,598 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1028 states and 1418 transitions. [2022-11-02 20:44:00,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2022-11-02 20:44:00,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2022-11-02 20:44:00,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1028 states and 1418 transitions. [2022-11-02 20:44:00,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:44:00,599 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1028 states and 1418 transitions. [2022-11-02 20:44:00,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states and 1418 transitions. [2022-11-02 20:44:00,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 947. [2022-11-02 20:44:00,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 587 states have (on average 1.1448040885860307) internal successors, (672), 598 states have internal predecessors, (672), 266 states have call successors, (266), 111 states have call predecessors, (266), 94 states have return successors, (350), 237 states have call predecessors, (350), 266 states have call successors, (350) [2022-11-02 20:44:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1288 transitions. [2022-11-02 20:44:00,636 INFO L240 hiAutomatonCegarLoop]: Abstraction has 947 states and 1288 transitions. [2022-11-02 20:44:00,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:44:00,638 INFO L428 stractBuchiCegarLoop]: Abstraction has 947 states and 1288 transitions. [2022-11-02 20:44:00,638 INFO L335 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2022-11-02 20:44:00,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 947 states and 1288 transitions. [2022-11-02 20:44:00,642 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 98 [2022-11-02 20:44:00,643 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:44:00,643 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:44:00,645 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-02 20:44:00,645 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 20, 11, 11, 11, 11, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:00,646 INFO L748 eck$LassoCheckResult]: Stem: 54369#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 54345#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; 54346#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 54368#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; 54357#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 54358#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 55042#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; 55038#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 55039#factENTRY ~n := #in~n; 55043#L25 assume ~n <= 0;#res := 1; 55041#factFINAL assume true; 55037#factEXIT >#68#return; 55033#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 55034#factENTRY ~n := #in~n; 55040#L25 assume ~n <= 0;#res := 1; 55036#factFINAL assume true; 55032#factEXIT >#70#return; 55029#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 55030#factENTRY ~n := #in~n; 55035#L25 assume ~n <= 0;#res := 1; 55031#factFINAL assume true; 55028#factEXIT >#72#return; 55027#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; 55025#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 55022#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 55017#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 55014#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; 55006#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 55008#factENTRY ~n := #in~n; 55024#L25 assume !(~n <= 0); 55020#L26 call #t~ret0 := fact(~n - 1);< 55021#factENTRY ~n := #in~n; 55026#L25 assume ~n <= 0;#res := 1; 55023#factFINAL assume true; 55019#factEXIT >#66#return; 55016#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55013#factFINAL assume true; 55005#factEXIT >#74#return; 54507#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 55045#factENTRY ~n := #in~n; 55046#L25 assume ~n <= 0;#res := 1; 54506#factFINAL assume true; 54508#factEXIT >#76#return; 54498#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 55044#factENTRY ~n := #in~n; 55056#L25 assume !(~n <= 0); 55053#L26 call #t~ret0 := fact(~n - 1);< 55054#factENTRY ~n := #in~n; 55057#L25 assume ~n <= 0;#res := 1; 55055#factFINAL assume true; 55052#factEXIT >#66#return; 55051#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55050#factFINAL assume true; 54497#factEXIT >#78#return; 54496#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; 54492#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 54489#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 54485#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 54468#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; 54458#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54465#factENTRY ~n := #in~n; 54477#L25 assume !(~n <= 0); 54472#L26 call #t~ret0 := fact(~n - 1);< 54475#factENTRY ~n := #in~n; 54488#L25 assume !(~n <= 0); 54473#L26 call #t~ret0 := fact(~n - 1);< 54487#factENTRY ~n := #in~n; 54495#L25 assume ~n <= 0;#res := 1; 54494#factFINAL assume true; 54493#factEXIT >#66#return; 54474#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54486#factFINAL assume true; 54471#factEXIT >#66#return; 54467#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54464#factFINAL assume true; 54457#factEXIT >#74#return; 54460#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54463#factENTRY ~n := #in~n; 54470#L25 assume ~n <= 0;#res := 1; 54466#factFINAL assume true; 54462#factEXIT >#76#return; 54459#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 54461#factENTRY ~n := #in~n; 54478#L25 assume !(~n <= 0); 54472#L26 call #t~ret0 := fact(~n - 1);< 54475#factENTRY ~n := #in~n; 54488#L25 assume !(~n <= 0); 54473#L26 call #t~ret0 := fact(~n - 1);< 54487#factENTRY ~n := #in~n; 54495#L25 assume ~n <= 0;#res := 1; 54494#factFINAL assume true; 54493#factEXIT >#66#return; 54474#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54486#factFINAL assume true; 54471#factEXIT >#66#return; 54467#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54464#factFINAL assume true; 54457#factEXIT >#78#return; 54452#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; 54450#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 54447#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 54444#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 54441#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 54436#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 54438#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 55221#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; 55220#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54333#factENTRY ~n := #in~n; 55227#L25 assume !(~n <= 0); 55225#L26 call #t~ret0 := fact(~n - 1);< 55226#factENTRY ~n := #in~n; 55229#L25 assume ~n <= 0;#res := 1; 55228#factFINAL assume true; 55224#factEXIT >#66#return; 55223#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55222#factFINAL assume true; 55219#factEXIT >#68#return; 55215#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 55217#factENTRY ~n := #in~n; 55231#L25 assume ~n <= 0;#res := 1; 55230#factFINAL assume true; 55214#factEXIT >#70#return; 55168#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 55174#factENTRY ~n := #in~n; 55193#L25 assume !(~n <= 0); 55157#L26 call #t~ret0 := fact(~n - 1);< 55189#factENTRY ~n := #in~n; 55165#L25 assume ~n <= 0;#res := 1; 55162#factFINAL assume true; 55156#factEXIT >#66#return; 55160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55173#factFINAL assume true; 55166#factEXIT >#72#return; 55171#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; 54363#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 54364#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 55207#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 55194#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; 55087#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 55172#factENTRY ~n := #in~n; 55192#L25 assume !(~n <= 0); 55157#L26 call #t~ret0 := fact(~n - 1);< 55189#factENTRY ~n := #in~n; 55165#L25 assume ~n <= 0;#res := 1; 55162#factFINAL assume true; 55156#factEXIT >#66#return; 55160#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55173#factFINAL assume true; 55166#factEXIT >#68#return; 55149#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 55153#factENTRY ~n := #in~n; 55163#L25 assume !(~n <= 0); 55159#L26 call #t~ret0 := fact(~n - 1);< 55161#factENTRY ~n := #in~n; 55165#L25 assume ~n <= 0;#res := 1; 55162#factFINAL assume true; 55156#factEXIT >#66#return; 55155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55154#factFINAL assume true; 55148#factEXIT >#70#return; 54343#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 54340#factENTRY ~n := #in~n; 54344#L25 assume ~n <= 0;#res := 1; 55128#factFINAL assume true; 55097#factEXIT >#72#return; 55120#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; 55213#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 55212#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 55211#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 55210#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; 54707#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54708#factENTRY ~n := #in~n; 55140#L25 assume !(~n <= 0); 55122#L26 call #t~ret0 := fact(~n - 1);< 55137#factENTRY ~n := #in~n; 55146#L25 assume !(~n <= 0); 55123#L26 call #t~ret0 := fact(~n - 1);< 55145#factENTRY ~n := #in~n; 55255#L25 assume ~n <= 0;#res := 1; 55253#factFINAL assume true; 55251#factEXIT >#66#return; 55125#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55144#factFINAL assume true; 55121#factEXIT >#66#return; 55095#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55091#factFINAL assume true; 55079#factEXIT >#74#return; 54709#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54710#factENTRY ~n := #in~n; 55082#L25 assume !(~n <= 0); 55083#L26 call #t~ret0 := fact(~n - 1);< 55138#factENTRY ~n := #in~n; 55143#L25 assume ~n <= 0;#res := 1; 55142#factFINAL assume true; 55136#factEXIT >#66#return; 55135#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 55131#factFINAL assume true; 55074#factEXIT >#76#return; 54455#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 54456#factENTRY ~n := #in~n; 55141#L25 assume !(~n <= 0); 55066#L26 call #t~ret0 := fact(~n - 1);< 55067#factENTRY ~n := #in~n; 55246#L25 assume ~n <= 0;#res := 1; 55245#factFINAL assume true; 55065#factEXIT >#66#return; 55010#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54706#factFINAL assume true; 54453#factEXIT >#78#return; 54451#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; 54448#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 54445#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 54442#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 54439#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 54432#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 54433#L42-3 [2022-11-02 20:44:00,646 INFO L750 eck$LassoCheckResult]: Loop: 54433#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 54370#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; 54330#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54331#factENTRY ~n := #in~n; 54406#L25 assume !(~n <= 0); 54402#L26 call #t~ret0 := fact(~n - 1);< 54405#factENTRY ~n := #in~n; 54409#L25 assume !(~n <= 0); 54403#L26 call #t~ret0 := fact(~n - 1);< 54408#factENTRY ~n := #in~n; 54410#L25 assume ~n <= 0;#res := 1; 54412#factFINAL assume true; 54411#factEXIT >#66#return; 54404#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54407#factFINAL assume true; 54401#factEXIT >#66#return; 54400#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54399#factFINAL assume true; 54396#factEXIT >#68#return; 54398#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54385#factENTRY ~n := #in~n; 54980#L25 assume ~n <= 0;#res := 1; 54979#factFINAL assume true; 54927#factEXIT >#70#return; 54887#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 54903#factENTRY ~n := #in~n; 54978#L25 assume !(~n <= 0); 54911#L26 call #t~ret0 := fact(~n - 1);< 54916#factENTRY ~n := #in~n; 54999#L25 assume !(~n <= 0); 54913#L26 call #t~ret0 := fact(~n - 1);< 54998#factENTRY ~n := #in~n; 55012#L25 assume ~n <= 0;#res := 1; 55003#factFINAL assume true; 55002#factEXIT >#66#return; 54915#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54997#factFINAL assume true; 54909#factEXIT >#66#return; 54908#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54904#factFINAL assume true; 54885#factEXIT >#72#return; 54895#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; 54925#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 54924#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 54922#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 54919#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; 54893#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54903#factENTRY ~n := #in~n; 54978#L25 assume !(~n <= 0); 54911#L26 call #t~ret0 := fact(~n - 1);< 54916#factENTRY ~n := #in~n; 54999#L25 assume !(~n <= 0); 54913#L26 call #t~ret0 := fact(~n - 1);< 54998#factENTRY ~n := #in~n; 55012#L25 assume ~n <= 0;#res := 1; 55003#factFINAL assume true; 55002#factEXIT >#66#return; 54915#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54997#factFINAL assume true; 54909#factEXIT >#66#return; 54908#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54904#factFINAL assume true; 54885#factEXIT >#68#return; 54901#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54918#factENTRY ~n := #in~n; 54992#L25 assume !(~n <= 0); 54912#L26 call #t~ret0 := fact(~n - 1);< 54945#factENTRY ~n := #in~n; 54950#L25 assume ~n <= 0;#res := 1; 54944#factFINAL assume true; 54932#factEXIT >#66#return; 54931#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54920#factFINAL assume true; 54917#factEXIT >#70#return; 54854#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 54905#factENTRY ~n := #in~n; 54948#L25 assume ~n <= 0;#res := 1; 54882#factFINAL assume true; 54877#factEXIT >#72#return; 54876#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; 54875#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 54874#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 54873#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 54871#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; 54312#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 54313#factENTRY ~n := #in~n; 54976#L25 assume !(~n <= 0); 54373#L26 call #t~ret0 := fact(~n - 1);< 54868#factENTRY ~n := #in~n; 54866#L25 assume !(~n <= 0); 54317#L26 call #t~ret0 := fact(~n - 1);< 54836#factENTRY ~n := #in~n; 54376#L25 assume ~n <= 0;#res := 1; 54377#factFINAL assume true; 54316#factEXIT >#66#return; 54318#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54375#factFINAL assume true; 54870#factEXIT >#66#return; 54869#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54867#factFINAL assume true; 54838#factEXIT >#74#return; 54388#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 54389#factENTRY ~n := #in~n; 54962#L25 assume !(~n <= 0); 54963#L26 call #t~ret0 := fact(~n - 1);< 54968#factENTRY ~n := #in~n; 54972#L25 assume ~n <= 0;#res := 1; 54970#factFINAL assume true; 54966#factEXIT >#66#return; 54965#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54964#factFINAL assume true; 54959#factEXIT >#76#return; 54352#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 54393#factENTRY ~n := #in~n; 54993#L25 assume !(~n <= 0); 54324#L26 call #t~ret0 := fact(~n - 1);< 54353#factENTRY ~n := #in~n; 54977#L25 assume ~n <= 0;#res := 1; 54323#factFINAL assume true; 54325#factEXIT >#66#return; 54704#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 54703#factFINAL assume true; 54413#factEXIT >#78#return; 54414#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; 54958#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 54957#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 54956#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 54955#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 54954#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 54433#L42-3 [2022-11-02 20:44:00,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:00,647 INFO L85 PathProgramCache]: Analyzing trace with hash 52177008, now seen corresponding path program 10 times [2022-11-02 20:44:00,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:00,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674066577] [2022-11-02 20:44:00,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:00,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:00,659 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:44:00,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [736031652] [2022-11-02 20:44:00,660 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:44:00,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:00,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:00,663 INFO L229 MonitoredProcess]: Starting monitored process 172 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:00,689 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (172)] Waiting until timeout for monitored process [2022-11-02 20:44:00,941 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:44:00,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-02 20:44:00,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:44:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:44:01,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:44:01,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:01,108 INFO L85 PathProgramCache]: Analyzing trace with hash 192421387, now seen corresponding path program 12 times [2022-11-02 20:44:01,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:01,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551415110] [2022-11-02 20:44:01,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:01,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:01,116 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:44:01,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1612249296] [2022-11-02 20:44:01,117 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-02 20:44:01,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:01,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:01,120 INFO L229 MonitoredProcess]: Starting monitored process 173 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:01,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (173)] Waiting until timeout for monitored process [2022-11-02 20:44:01,272 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-11-02 20:44:01,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:44:01,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-02 20:44:01,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 15 proven. 201 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2022-11-02 20:44:01,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:02,544 INFO L134 CoverageAnalysis]: Checked inductivity of 887 backedges. 15 proven. 202 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2022-11-02 20:44:02,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:02,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551415110] [2022-11-02 20:44:02,545 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:44:02,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612249296] [2022-11-02 20:44:02,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612249296] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:02,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:44:02,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 25 [2022-11-02 20:44:02,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168390207] [2022-11-02 20:44:02,546 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:02,546 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:44:02,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:02,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-02 20:44:02,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:44:02,547 INFO L87 Difference]: Start difference. First operand 947 states and 1288 transitions. cyclomatic complexity: 361 Second operand has 26 states, 21 states have (on average 2.6666666666666665) internal successors, (56), 24 states have internal predecessors, (56), 14 states have call successors, (22), 1 states have call predecessors, (22), 4 states have return successors, (22), 11 states have call predecessors, (22), 14 states have call successors, (22) [2022-11-02 20:44:05,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:05,526 INFO L93 Difference]: Finished difference Result 1244 states and 1697 transitions. [2022-11-02 20:44:05,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1244 states and 1697 transitions. [2022-11-02 20:44:05,534 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 213 [2022-11-02 20:44:05,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1244 states to 1244 states and 1697 transitions. [2022-11-02 20:44:05,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 119 [2022-11-02 20:44:05,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 119 [2022-11-02 20:44:05,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1244 states and 1697 transitions. [2022-11-02 20:44:05,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:44:05,548 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1244 states and 1697 transitions. [2022-11-02 20:44:05,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states and 1697 transitions. [2022-11-02 20:44:05,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 965. [2022-11-02 20:44:05,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 607 states have (on average 1.1350906095551894) internal successors, (689), 613 states have internal predecessors, (689), 264 states have call successors, (264), 111 states have call predecessors, (264), 94 states have return successors, (348), 240 states have call predecessors, (348), 264 states have call successors, (348) [2022-11-02 20:44:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1301 transitions. [2022-11-02 20:44:05,585 INFO L240 hiAutomatonCegarLoop]: Abstraction has 965 states and 1301 transitions. [2022-11-02 20:44:05,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-02 20:44:05,587 INFO L428 stractBuchiCegarLoop]: Abstraction has 965 states and 1301 transitions. [2022-11-02 20:44:05,587 INFO L335 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2022-11-02 20:44:05,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 965 states and 1301 transitions. [2022-11-02 20:44:05,590 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 108 [2022-11-02 20:44:05,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:44:05,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:44:05,593 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-02 20:44:05,593 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [26, 26, 14, 14, 14, 14, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:05,594 INFO L748 eck$LassoCheckResult]: Stem: 57412#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 57390#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; 57391#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 57411#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; 57399#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 57400#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 57550#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; 57546#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 57547#factENTRY ~n := #in~n; 57551#L25 assume ~n <= 0;#res := 1; 57549#factFINAL assume true; 57545#factEXIT >#68#return; 57541#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 57542#factENTRY ~n := #in~n; 57548#L25 assume ~n <= 0;#res := 1; 57544#factFINAL assume true; 57540#factEXIT >#70#return; 57537#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 57538#factENTRY ~n := #in~n; 57543#L25 assume ~n <= 0;#res := 1; 57539#factFINAL assume true; 57536#factEXIT >#72#return; 57535#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; 57534#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 57533#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 57532#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 57531#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; 57528#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 57530#factENTRY ~n := #in~n; 57573#L25 assume !(~n <= 0); 57567#L26 call #t~ret0 := fact(~n - 1);< 57568#factENTRY ~n := #in~n; 57574#L25 assume ~n <= 0;#res := 1; 57572#factFINAL assume true; 57566#factEXIT >#66#return; 57562#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57560#factFINAL assume true; 57527#factEXIT >#74#return; 57521#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 57555#factENTRY ~n := #in~n; 57556#L25 assume ~n <= 0;#res := 1; 57520#factFINAL assume true; 57522#factEXIT >#76#return; 57512#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 57513#factENTRY ~n := #in~n; 57571#L25 assume !(~n <= 0); 57564#L26 call #t~ret0 := fact(~n - 1);< 57565#factENTRY ~n := #in~n; 57570#L25 assume ~n <= 0;#res := 1; 57569#factFINAL assume true; 57563#factEXIT >#66#return; 57561#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57559#factFINAL assume true; 57511#factEXIT >#78#return; 57507#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; 57506#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 57502#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 57498#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 57490#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; 57482#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 57486#factENTRY ~n := #in~n; 57500#L25 assume !(~n <= 0); 57495#L26 call #t~ret0 := fact(~n - 1);< 57497#factENTRY ~n := #in~n; 57505#L25 assume !(~n <= 0); 57494#L26 call #t~ret0 := fact(~n - 1);< 57504#factENTRY ~n := #in~n; 57510#L25 assume ~n <= 0;#res := 1; 57509#factFINAL assume true; 57508#factEXIT >#66#return; 57496#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57503#factFINAL assume true; 57493#factEXIT >#66#return; 57489#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57485#factFINAL assume true; 57480#factEXIT >#74#return; 57483#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 57488#factENTRY ~n := #in~n; 57499#L25 assume ~n <= 0;#res := 1; 57492#factFINAL assume true; 57487#factEXIT >#76#return; 57481#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 57484#factENTRY ~n := #in~n; 57501#L25 assume !(~n <= 0); 57495#L26 call #t~ret0 := fact(~n - 1);< 57497#factENTRY ~n := #in~n; 57505#L25 assume !(~n <= 0); 57494#L26 call #t~ret0 := fact(~n - 1);< 57504#factENTRY ~n := #in~n; 57510#L25 assume ~n <= 0;#res := 1; 57509#factFINAL assume true; 57508#factEXIT >#66#return; 57496#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57503#factFINAL assume true; 57493#factEXIT >#66#return; 57489#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57485#factFINAL assume true; 57480#factEXIT >#78#return; 57479#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; 57478#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 57469#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 57470#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 57463#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 57464#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 57476#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 57796#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; 57793#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 57795#factENTRY ~n := #in~n; 57804#L25 assume !(~n <= 0); 57801#L26 call #t~ret0 := fact(~n - 1);< 57802#factENTRY ~n := #in~n; 57805#L25 assume ~n <= 0;#res := 1; 57803#factFINAL assume true; 57800#factEXIT >#66#return; 57799#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57798#factFINAL assume true; 57792#factEXIT >#68#return; 57783#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 57785#factENTRY ~n := #in~n; 57797#L25 assume ~n <= 0;#res := 1; 57791#factFINAL assume true; 57782#factEXIT >#70#return; 57723#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 57732#factENTRY ~n := #in~n; 57772#L25 assume !(~n <= 0); 57712#L26 call #t~ret0 := fact(~n - 1);< 57768#factENTRY ~n := #in~n; 57720#L25 assume ~n <= 0;#res := 1; 57717#factFINAL assume true; 57711#factEXIT >#66#return; 57715#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57731#factFINAL assume true; 57721#factEXIT >#72#return; 57728#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; 57789#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 57788#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 57787#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 57781#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; 57634#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 57730#factENTRY ~n := #in~n; 57771#L25 assume !(~n <= 0); 57712#L26 call #t~ret0 := fact(~n - 1);< 57768#factENTRY ~n := #in~n; 57720#L25 assume ~n <= 0;#res := 1; 57717#factFINAL assume true; 57711#factEXIT >#66#return; 57715#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57731#factFINAL assume true; 57721#factEXIT >#68#return; 57704#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 57708#factENTRY ~n := #in~n; 57718#L25 assume !(~n <= 0); 57713#L26 call #t~ret0 := fact(~n - 1);< 57716#factENTRY ~n := #in~n; 57720#L25 assume ~n <= 0;#res := 1; 57717#factFINAL assume true; 57711#factEXIT >#66#return; 57710#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57709#factFINAL assume true; 57703#factEXIT >#70#return; 57685#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 57699#factENTRY ~n := #in~n; 57702#L25 assume ~n <= 0;#res := 1; 57700#factFINAL assume true; 57672#factEXIT >#72#return; 57696#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; 57778#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 57777#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 57776#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 57636#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; 57611#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 57624#factENTRY ~n := #in~n; 57625#L25 assume !(~n <= 0); 57626#L26 call #t~ret0 := fact(~n - 1);< 57649#factENTRY ~n := #in~n; 57656#L25 assume !(~n <= 0); 57647#L26 call #t~ret0 := fact(~n - 1);< 57655#factENTRY ~n := #in~n; 57663#L25 assume ~n <= 0;#res := 1; 57661#factFINAL assume true; 57660#factEXIT >#66#return; 57648#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57654#factFINAL assume true; 57645#factEXIT >#66#return; 57642#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57632#factFINAL assume true; 57621#factEXIT >#74#return; 57609#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 57617#factENTRY ~n := #in~n; 57651#L25 assume !(~n <= 0); 57630#L26 call #t~ret0 := fact(~n - 1);< 57631#factENTRY ~n := #in~n; 57644#L25 assume ~n <= 0;#res := 1; 57641#factFINAL assume true; 57629#factEXIT >#66#return; 57628#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57619#factFINAL assume true; 57614#factEXIT >#76#return; 57590#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 57592#factENTRY ~n := #in~n; 57761#L25 assume !(~n <= 0); 57757#L26 call #t~ret0 := fact(~n - 1);< 57758#factENTRY ~n := #in~n; 57763#L25 assume ~n <= 0;#res := 1; 57760#factFINAL assume true; 57756#factEXIT >#66#return; 57754#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57752#factFINAL assume true; 57589#factEXIT >#78#return; 57587#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; 57582#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 57477#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 57467#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 57468#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 57459#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 57460#L42-3 [2022-11-02 20:44:05,595 INFO L750 eck$LassoCheckResult]: Loop: 57460#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 57413#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; 57414#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 57370#factENTRY ~n := #in~n; 57448#L25 assume !(~n <= 0); 57445#L26 call #t~ret0 := fact(~n - 1);< 57447#factENTRY ~n := #in~n; 57453#L25 assume !(~n <= 0); 57444#L26 call #t~ret0 := fact(~n - 1);< 57452#factENTRY ~n := #in~n; 57454#L25 assume ~n <= 0;#res := 1; 57456#factFINAL assume true; 57455#factEXIT >#66#return; 57446#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57451#factFINAL assume true; 57443#factEXIT >#66#return; 57442#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57441#factFINAL assume true; 57439#factEXIT >#68#return; 57427#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 57428#factENTRY ~n := #in~n; 58246#L25 assume ~n <= 0;#res := 1; 58245#factFINAL assume true; 58243#factEXIT >#70#return; 58069#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 58091#factENTRY ~n := #in~n; 58161#L25 assume !(~n <= 0); 58153#L26 call #t~ret0 := fact(~n - 1);< 58157#factENTRY ~n := #in~n; 58232#L25 assume !(~n <= 0); 58154#L26 call #t~ret0 := fact(~n - 1);< 58230#factENTRY ~n := #in~n; 58241#L25 assume ~n <= 0;#res := 1; 58240#factFINAL assume true; 58239#factEXIT >#66#return; 58155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58229#factFINAL assume true; 58152#factEXIT >#66#return; 58151#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58147#factFINAL assume true; 58059#factEXIT >#72#return; 58078#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; 58288#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 58287#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 58286#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 58285#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; 58063#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 58091#factENTRY ~n := #in~n; 58161#L25 assume !(~n <= 0); 58153#L26 call #t~ret0 := fact(~n - 1);< 58157#factENTRY ~n := #in~n; 58232#L25 assume !(~n <= 0); 58154#L26 call #t~ret0 := fact(~n - 1);< 58230#factENTRY ~n := #in~n; 58241#L25 assume ~n <= 0;#res := 1; 58240#factFINAL assume true; 58239#factEXIT >#66#return; 58155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58229#factFINAL assume true; 58152#factEXIT >#66#return; 58151#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58147#factFINAL assume true; 58059#factEXIT >#68#return; 58073#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 58117#factENTRY ~n := #in~n; 58233#L25 assume !(~n <= 0); 58124#L26 call #t~ret0 := fact(~n - 1);< 58158#factENTRY ~n := #in~n; 58145#L25 assume ~n <= 0;#res := 1; 58144#factFINAL assume true; 58120#factEXIT >#66#return; 58119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58116#factFINAL assume true; 58114#factEXIT >#70#return; 58066#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 58083#factENTRY ~n := #in~n; 58159#L25 assume ~n <= 0;#res := 1; 58127#factFINAL assume true; 58107#factEXIT >#72#return; 58111#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; 58284#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 58283#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 58282#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 58281#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; 57906#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 58091#factENTRY ~n := #in~n; 58161#L25 assume !(~n <= 0); 58153#L26 call #t~ret0 := fact(~n - 1);< 58157#factENTRY ~n := #in~n; 58232#L25 assume !(~n <= 0); 58154#L26 call #t~ret0 := fact(~n - 1);< 58230#factENTRY ~n := #in~n; 58241#L25 assume ~n <= 0;#res := 1; 58240#factFINAL assume true; 58239#factEXIT >#66#return; 58155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58229#factFINAL assume true; 58152#factEXIT >#66#return; 58151#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58147#factFINAL assume true; 58059#factEXIT >#68#return; 58076#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 58115#factENTRY ~n := #in~n; 58238#L25 assume !(~n <= 0); 58122#L26 call #t~ret0 := fact(~n - 1);< 58126#factENTRY ~n := #in~n; 58145#L25 assume ~n <= 0;#res := 1; 58144#factFINAL assume true; 58120#factEXIT >#66#return; 58119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 58116#factFINAL assume true; 58114#factEXIT >#70#return; 58109#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 58112#factENTRY ~n := #in~n; 58129#L25 assume ~n <= 0;#res := 1; 58127#factFINAL assume true; 58107#factEXIT >#72#return; 58105#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; 58103#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 58101#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 58100#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 58092#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; 57355#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 57356#factENTRY ~n := #in~n; 57386#L25 assume !(~n <= 0); 57395#L26 call #t~ret0 := fact(~n - 1);< 57396#factENTRY ~n := #in~n; 57813#L25 assume !(~n <= 0); 57812#L26 call #t~ret0 := fact(~n - 1);< 57811#factENTRY ~n := #in~n; 57814#L25 assume ~n <= 0;#res := 1; 57925#factFINAL assume true; 57924#factEXIT >#66#return; 57909#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57920#factFINAL assume true; 57908#factEXIT >#66#return; 57900#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57898#factFINAL assume true; 57892#factEXIT >#74#return; 57374#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 57836#factENTRY ~n := #in~n; 57837#L25 assume !(~n <= 0); 57911#L26 call #t~ret0 := fact(~n - 1);< 57912#factENTRY ~n := #in~n; 57844#L25 assume ~n <= 0;#res := 1; 57917#factFINAL assume true; 57910#factEXIT >#66#return; 57901#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57899#factFINAL assume true; 57893#factEXIT >#76#return; 57361#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 57848#factENTRY ~n := #in~n; 57832#L25 assume !(~n <= 0); 57424#L26 call #t~ret0 := fact(~n - 1);< 57810#factENTRY ~n := #in~n; 57423#L25 assume ~n <= 0;#res := 1; 57425#factFINAL assume true; 58142#factEXIT >#66#return; 57417#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 57418#factFINAL assume true; 57359#factEXIT >#78#return; 57363#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; 57392#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 57397#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 57449#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 57450#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 57462#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 57460#L42-3 [2022-11-02 20:44:05,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:05,595 INFO L85 PathProgramCache]: Analyzing trace with hash 52177008, now seen corresponding path program 11 times [2022-11-02 20:44:05,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:05,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238177581] [2022-11-02 20:44:05,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:05,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:05,607 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:44:05,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1087353386] [2022-11-02 20:44:05,607 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 20:44:05,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:05,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:05,613 INFO L229 MonitoredProcess]: Starting monitored process 174 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:05,638 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (174)] Waiting until timeout for monitored process [2022-11-02 20:44:05,825 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-11-02 20:44:05,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-02 20:44:05,825 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:44:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:44:05,933 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:44:05,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:05,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2119049678, now seen corresponding path program 13 times [2022-11-02 20:44:05,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:05,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211843130] [2022-11-02 20:44:05,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:05,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:05,941 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:44:05,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [491138375] [2022-11-02 20:44:05,942 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-02 20:44:05,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:05,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:05,953 INFO L229 MonitoredProcess]: Starting monitored process 175 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:05,954 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (175)] Waiting until timeout for monitored process [2022-11-02 20:44:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:44:06,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 20 conjunts are in the unsatisfiable core [2022-11-02 20:44:06,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:06,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1519 backedges. 836 proven. 110 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2022-11-02 20:44:06,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:06,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1519 backedges. 62 proven. 295 refuted. 0 times theorem prover too weak. 1162 trivial. 0 not checked. [2022-11-02 20:44:06,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:06,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211843130] [2022-11-02 20:44:06,942 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:44:06,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491138375] [2022-11-02 20:44:06,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491138375] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:06,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:44:06,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2022-11-02 20:44:06,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793971452] [2022-11-02 20:44:06,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:06,947 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:44:06,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:06,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 20:44:06,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:44:06,948 INFO L87 Difference]: Start difference. First operand 965 states and 1301 transitions. cyclomatic complexity: 356 Second operand has 20 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 18 states have internal predecessors, (50), 13 states have call successors, (29), 2 states have call predecessors, (29), 5 states have return successors, (29), 10 states have call predecessors, (29), 13 states have call successors, (29) [2022-11-02 20:44:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:08,796 INFO L93 Difference]: Finished difference Result 1058 states and 1413 transitions. [2022-11-02 20:44:08,797 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1058 states and 1413 transitions. [2022-11-02 20:44:08,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2022-11-02 20:44:08,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1058 states to 1012 states and 1349 transitions. [2022-11-02 20:44:08,811 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2022-11-02 20:44:08,811 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2022-11-02 20:44:08,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1012 states and 1349 transitions. [2022-11-02 20:44:08,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:44:08,812 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1012 states and 1349 transitions. [2022-11-02 20:44:08,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states and 1349 transitions. [2022-11-02 20:44:08,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 868. [2022-11-02 20:44:08,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 548 states have (on average 1.135036496350365) internal successors, (622), 556 states have internal predecessors, (622), 227 states have call successors, (227), 105 states have call predecessors, (227), 93 states have return successors, (298), 206 states have call predecessors, (298), 227 states have call successors, (298) [2022-11-02 20:44:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1147 transitions. [2022-11-02 20:44:08,838 INFO L240 hiAutomatonCegarLoop]: Abstraction has 868 states and 1147 transitions. [2022-11-02 20:44:08,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-02 20:44:08,840 INFO L428 stractBuchiCegarLoop]: Abstraction has 868 states and 1147 transitions. [2022-11-02 20:44:08,840 INFO L335 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2022-11-02 20:44:08,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 868 states and 1147 transitions. [2022-11-02 20:44:08,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2022-11-02 20:44:08,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:44:08,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:44:08,845 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-02 20:44:08,845 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [29, 29, 17, 17, 17, 17, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:08,845 INFO L748 eck$LassoCheckResult]: Stem: 60497#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 60475#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; 60476#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 60496#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; 60486#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 60487#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 61186#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; 60466#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60467#factENTRY ~n := #in~n; 61181#L25 assume ~n <= 0;#res := 1; 61180#factFINAL assume true; 61170#factEXIT >#68#return; 60514#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60515#factENTRY ~n := #in~n; 61185#L25 assume ~n <= 0;#res := 1; 61184#factFINAL assume true; 61175#factEXIT >#70#return; 61176#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 61213#factENTRY ~n := #in~n; 61215#L25 assume ~n <= 0;#res := 1; 61214#factFINAL assume true; 61212#factEXIT >#72#return; 61211#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; 61209#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 61207#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 61206#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 61204#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; 61205#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 61244#factENTRY ~n := #in~n; 61251#L25 assume !(~n <= 0); 61248#L26 call #t~ret0 := fact(~n - 1);< 61249#factENTRY ~n := #in~n; 61262#L25 assume ~n <= 0;#res := 1; 61260#factFINAL assume true; 61247#factEXIT >#66#return; 61246#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61245#factFINAL assume true; 61240#factEXIT >#74#return; 61241#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 61265#factENTRY ~n := #in~n; 61271#L25 assume ~n <= 0;#res := 1; 61267#factFINAL assume true; 61264#factEXIT >#76#return; 60664#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 61250#factENTRY ~n := #in~n; 61273#L25 assume !(~n <= 0); 61269#L26 call #t~ret0 := fact(~n - 1);< 61270#factENTRY ~n := #in~n; 61274#L25 assume ~n <= 0;#res := 1; 61272#factFINAL assume true; 61268#factEXIT >#66#return; 61266#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61263#factFINAL assume true; 60663#factEXIT >#78#return; 60662#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; 60661#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 60660#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 60656#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60649#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; 60641#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60645#factENTRY ~n := #in~n; 60658#L25 assume !(~n <= 0); 60652#L26 call #t~ret0 := fact(~n - 1);< 60655#factENTRY ~n := #in~n; 60684#L25 assume !(~n <= 0); 60653#L26 call #t~ret0 := fact(~n - 1);< 60683#factENTRY ~n := #in~n; 60697#L25 assume ~n <= 0;#res := 1; 60696#factFINAL assume true; 60695#factEXIT >#66#return; 60654#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60682#factFINAL assume true; 60651#factEXIT >#66#return; 60648#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60644#factFINAL assume true; 60639#factEXIT >#74#return; 60642#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60647#factENTRY ~n := #in~n; 60657#L25 assume ~n <= 0;#res := 1; 60650#factFINAL assume true; 60646#factEXIT >#76#return; 60640#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60643#factENTRY ~n := #in~n; 60659#L25 assume !(~n <= 0); 60652#L26 call #t~ret0 := fact(~n - 1);< 60655#factENTRY ~n := #in~n; 60684#L25 assume !(~n <= 0); 60653#L26 call #t~ret0 := fact(~n - 1);< 60683#factENTRY ~n := #in~n; 60697#L25 assume ~n <= 0;#res := 1; 60696#factFINAL assume true; 60695#factEXIT >#66#return; 60654#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60682#factFINAL assume true; 60651#factEXIT >#66#return; 60648#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60644#factFINAL assume true; 60639#factEXIT >#78#return; 60638#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; 60637#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 60635#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 60632#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 60629#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 60624#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 60626#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 61172#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; 61156#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 61171#factENTRY ~n := #in~n; 61296#L25 assume !(~n <= 0); 61202#L26 call #t~ret0 := fact(~n - 1);< 61203#factENTRY ~n := #in~n; 61210#L25 assume ~n <= 0;#res := 1; 61208#factFINAL assume true; 61201#factEXIT >#66#return; 61199#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61197#factFINAL assume true; 61154#factEXIT >#68#return; 61158#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 61177#factENTRY ~n := #in~n; 61183#L25 assume ~n <= 0;#res := 1; 61182#factFINAL assume true; 61174#factEXIT >#70#return; 60453#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60454#factENTRY ~n := #in~n; 61219#L25 assume !(~n <= 0); 61137#L26 call #t~ret0 := fact(~n - 1);< 61227#factENTRY ~n := #in~n; 61298#L25 assume ~n <= 0;#res := 1; 61144#factFINAL assume true; 61136#factEXIT >#66#return; 61140#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61307#factFINAL assume true; 61161#factEXIT >#72#return; 61163#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; 61239#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 61238#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 61237#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60499#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; 60500#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 61159#factENTRY ~n := #in~n; 61230#L25 assume !(~n <= 0); 61137#L26 call #t~ret0 := fact(~n - 1);< 61227#factENTRY ~n := #in~n; 61298#L25 assume ~n <= 0;#res := 1; 61144#factFINAL assume true; 61136#factEXIT >#66#return; 61140#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61307#factFINAL assume true; 61161#factEXIT >#68#return; 60473#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60470#factENTRY ~n := #in~n; 60474#L25 assume !(~n <= 0); 61138#L26 call #t~ret0 := fact(~n - 1);< 61141#factENTRY ~n := #in~n; 61298#L25 assume ~n <= 0;#res := 1; 61144#factFINAL assume true; 61136#factEXIT >#66#return; 61128#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61127#factFINAL assume true; 61126#factEXIT >#70#return; 61083#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 61103#factENTRY ~n := #in~n; 61113#L25 assume ~n <= 0;#res := 1; 61107#factFINAL assume true; 61076#factEXIT >#72#return; 61101#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; 61169#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 61168#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 61167#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 61112#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; 61047#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 61070#factENTRY ~n := #in~n; 61067#L25 assume !(~n <= 0); 61061#L26 call #t~ret0 := fact(~n - 1);< 61118#factENTRY ~n := #in~n; 61125#L25 assume !(~n <= 0); 61115#L26 call #t~ret0 := fact(~n - 1);< 61124#factENTRY ~n := #in~n; 61179#L25 assume ~n <= 0;#res := 1; 61178#factFINAL assume true; 61166#factEXIT >#66#return; 61117#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61123#factFINAL assume true; 61114#factEXIT >#66#return; 61111#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61069#factFINAL assume true; 61055#factEXIT >#74#return; 61044#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 61051#factENTRY ~n := #in~n; 61121#L25 assume !(~n <= 0); 61062#L26 call #t~ret0 := fact(~n - 1);< 61063#factENTRY ~n := #in~n; 61301#L25 assume ~n <= 0;#res := 1; 61110#factFINAL assume true; 61060#factEXIT >#66#return; 61059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61052#factFINAL assume true; 61039#factEXIT >#76#return; 60462#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60693#factENTRY ~n := #in~n; 61282#L25 assume !(~n <= 0); 60482#L26 call #t~ret0 := fact(~n - 1);< 60483#factENTRY ~n := #in~n; 61302#L25 assume ~n <= 0;#res := 1; 61304#factFINAL assume true; 61303#factEXIT >#66#return; 60503#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60460#factFINAL assume true; 60463#factEXIT >#78#return; 60692#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; 60689#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 60634#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 60631#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 60628#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 60619#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 60617#L42-3 [2022-11-02 20:44:08,846 INFO L750 eck$LassoCheckResult]: Loop: 60617#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60498#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; 60464#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60465#factENTRY ~n := #in~n; 60530#L25 assume !(~n <= 0); 60527#L26 call #t~ret0 := fact(~n - 1);< 60529#factENTRY ~n := #in~n; 60533#L25 assume !(~n <= 0); 60526#L26 call #t~ret0 := fact(~n - 1);< 60532#factENTRY ~n := #in~n; 60534#L25 assume ~n <= 0;#res := 1; 60623#factFINAL assume true; 60622#factEXIT >#66#return; 60528#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60531#factFINAL assume true; 60525#factEXIT >#66#return; 60524#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60523#factFINAL assume true; 60522#factEXIT >#68#return; 60507#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60513#factENTRY ~n := #in~n; 60506#L25 assume ~n <= 0;#res := 1; 60508#factFINAL assume true; 61305#factEXIT >#70#return; 60452#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60579#factENTRY ~n := #in~n; 60667#L25 assume !(~n <= 0); 60598#L26 call #t~ret0 := fact(~n - 1);< 60604#factENTRY ~n := #in~n; 60608#L25 assume !(~n <= 0); 60599#L26 call #t~ret0 := fact(~n - 1);< 60699#factENTRY ~n := #in~n; 60702#L25 assume ~n <= 0;#res := 1; 60701#factFINAL assume true; 60700#factEXIT >#66#return; 60601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60698#factFINAL assume true; 60597#factEXIT >#66#return; 60600#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60585#factFINAL assume true; 60571#factEXIT >#72#return; 60493#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; 60494#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 60495#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 60511#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60512#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; 60572#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60579#factENTRY ~n := #in~n; 60667#L25 assume !(~n <= 0); 60598#L26 call #t~ret0 := fact(~n - 1);< 60604#factENTRY ~n := #in~n; 60608#L25 assume !(~n <= 0); 60599#L26 call #t~ret0 := fact(~n - 1);< 60699#factENTRY ~n := #in~n; 60702#L25 assume ~n <= 0;#res := 1; 60701#factFINAL assume true; 60700#factEXIT >#66#return; 60601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60698#factFINAL assume true; 60597#factEXIT >#66#return; 60600#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60585#factFINAL assume true; 60571#factEXIT >#68#return; 60449#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60567#factENTRY ~n := #in~n; 60602#L25 assume !(~n <= 0); 60593#L26 call #t~ret0 := fact(~n - 1);< 60595#factENTRY ~n := #in~n; 60607#L25 assume ~n <= 0;#res := 1; 60605#factFINAL assume true; 60591#factEXIT >#66#return; 60594#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 61306#factFINAL assume true; 61308#factEXIT >#70#return; 60566#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60581#factENTRY ~n := #in~n; 60596#L25 assume !(~n <= 0); 60592#L26 call #t~ret0 := fact(~n - 1);< 60595#factENTRY ~n := #in~n; 60607#L25 assume ~n <= 0;#res := 1; 60605#factFINAL assume true; 60591#factEXIT >#66#return; 60590#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60588#factFINAL assume true; 60586#factEXIT >#72#return; 60587#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; 60694#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 60621#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 60618#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60583#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; 60549#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60579#factENTRY ~n := #in~n; 60667#L25 assume !(~n <= 0); 60598#L26 call #t~ret0 := fact(~n - 1);< 60604#factENTRY ~n := #in~n; 60608#L25 assume !(~n <= 0); 60599#L26 call #t~ret0 := fact(~n - 1);< 60699#factENTRY ~n := #in~n; 60702#L25 assume ~n <= 0;#res := 1; 60701#factFINAL assume true; 60700#factEXIT >#66#return; 60601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60698#factFINAL assume true; 60597#factEXIT >#66#return; 60600#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60585#factFINAL assume true; 60571#factEXIT >#68#return; 60450#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60567#factENTRY ~n := #in~n; 60602#L25 assume !(~n <= 0); 60593#L26 call #t~ret0 := fact(~n - 1);< 60595#factENTRY ~n := #in~n; 60608#L25 assume !(~n <= 0); 60599#L26 call #t~ret0 := fact(~n - 1);< 60699#factENTRY ~n := #in~n; 60702#L25 assume ~n <= 0;#res := 1; 60701#factFINAL assume true; 60700#factEXIT >#66#return; 60601#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60698#factFINAL assume true; 60597#factEXIT >#66#return; 60584#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60570#factFINAL assume true; 60565#factEXIT >#70#return; 60561#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60562#factENTRY ~n := #in~n; 60569#L25 assume ~n <= 0;#res := 1; 60564#factFINAL assume true; 60560#factEXIT >#72#return; 60558#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; 60556#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 60553#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 60552#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 60548#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; 60536#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 60442#factENTRY ~n := #in~n; 61027#L25 assume !(~n <= 0); 60540#L26 call #t~ret0 := fact(~n - 1);< 60544#factENTRY ~n := #in~n; 60547#L25 assume !(~n <= 0); 60542#L26 call #t~ret0 := fact(~n - 1);< 60546#factENTRY ~n := #in~n; 60551#L25 assume ~n <= 0;#res := 1; 60691#factFINAL assume true; 60690#factEXIT >#66#return; 60543#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60545#factFINAL assume true; 60539#factEXIT >#66#return; 60538#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60537#factFINAL assume true; 60535#factEXIT >#74#return; 60457#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 60468#factENTRY ~n := #in~n; 60469#L25 assume !(~n <= 0); 60541#L26 call #t~ret0 := fact(~n - 1);< 61025#factENTRY ~n := #in~n; 60547#L25 assume !(~n <= 0); 60542#L26 call #t~ret0 := fact(~n - 1);< 60546#factENTRY ~n := #in~n; 60551#L25 assume ~n <= 0;#res := 1; 60691#factFINAL assume true; 60690#factEXIT >#66#return; 60543#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60545#factFINAL assume true; 60539#factEXIT >#66#return; 60538#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60537#factFINAL assume true; 60535#factEXIT >#76#return; 60446#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 60519#factENTRY ~n := #in~n; 60589#L25 assume !(~n <= 0); 60480#L26 call #t~ret0 := fact(~n - 1);< 60481#factENTRY ~n := #in~n; 60504#L25 assume ~n <= 0;#res := 1; 60505#factFINAL assume true; 61024#factEXIT >#66#return; 60501#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 60502#factFINAL assume true; 60445#factEXIT >#78#return; 60447#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; 60477#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 60484#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 60518#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 60490#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 60491#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 60617#L42-3 [2022-11-02 20:44:08,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:08,847 INFO L85 PathProgramCache]: Analyzing trace with hash 52177008, now seen corresponding path program 12 times [2022-11-02 20:44:08,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:08,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944786564] [2022-11-02 20:44:08,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:08,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:08,856 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:44:08,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1035725134] [2022-11-02 20:44:08,857 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-02 20:44:08,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:08,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:08,859 INFO L229 MonitoredProcess]: Starting monitored process 176 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:08,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (176)] Waiting until timeout for monitored process [2022-11-02 20:44:09,092 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2022-11-02 20:44:09,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-02 20:44:09,092 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:44:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:44:09,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:44:09,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:09,221 INFO L85 PathProgramCache]: Analyzing trace with hash -2118586678, now seen corresponding path program 14 times [2022-11-02 20:44:09,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:09,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718359364] [2022-11-02 20:44:09,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:09,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:09,230 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:44:09,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1891391973] [2022-11-02 20:44:09,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:44:09,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:09,231 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:09,237 INFO L229 MonitoredProcess]: Starting monitored process 177 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:09,253 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (177)] Waiting until timeout for monitored process [2022-11-02 20:44:09,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:44:09,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:44:09,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-02 20:44:09,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:09,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 803 proven. 362 refuted. 0 times theorem prover too weak. 768 trivial. 0 not checked. [2022-11-02 20:44:09,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:11,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 245 proven. 529 refuted. 0 times theorem prover too weak. 1159 trivial. 0 not checked. [2022-11-02 20:44:11,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:11,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718359364] [2022-11-02 20:44:11,124 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:44:11,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891391973] [2022-11-02 20:44:11,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891391973] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:11,124 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:44:11,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 23 [2022-11-02 20:44:11,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879667990] [2022-11-02 20:44:11,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:11,125 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:44:11,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:44:11,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 20:44:11,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:44:11,127 INFO L87 Difference]: Start difference. First operand 868 states and 1147 transitions. cyclomatic complexity: 296 Second operand has 23 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 21 states have internal predecessors, (59), 15 states have call successors, (25), 2 states have call predecessors, (25), 7 states have return successors, (26), 11 states have call predecessors, (26), 15 states have call successors, (26) [2022-11-02 20:44:12,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:44:12,887 INFO L93 Difference]: Finished difference Result 1209 states and 1695 transitions. [2022-11-02 20:44:12,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1209 states and 1695 transitions. [2022-11-02 20:44:12,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2022-11-02 20:44:12,905 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1209 states to 1167 states and 1627 transitions. [2022-11-02 20:44:12,905 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2022-11-02 20:44:12,905 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2022-11-02 20:44:12,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1167 states and 1627 transitions. [2022-11-02 20:44:12,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:44:12,906 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1167 states and 1627 transitions. [2022-11-02 20:44:12,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states and 1627 transitions. [2022-11-02 20:44:12,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 961. [2022-11-02 20:44:12,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 961 states, 615 states have (on average 1.1073170731707318) internal successors, (681), 632 states have internal predecessors, (681), 237 states have call successors, (237), 102 states have call predecessors, (237), 109 states have return successors, (381), 226 states have call predecessors, (381), 237 states have call successors, (381) [2022-11-02 20:44:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1299 transitions. [2022-11-02 20:44:12,936 INFO L240 hiAutomatonCegarLoop]: Abstraction has 961 states and 1299 transitions. [2022-11-02 20:44:12,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:44:12,937 INFO L428 stractBuchiCegarLoop]: Abstraction has 961 states and 1299 transitions. [2022-11-02 20:44:12,938 INFO L335 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2022-11-02 20:44:12,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 961 states and 1299 transitions. [2022-11-02 20:44:12,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 84 [2022-11-02 20:44:12,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:44:12,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:44:12,943 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [32, 32, 18, 14, 14, 14, 14, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-02 20:44:12,943 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [30, 30, 18, 18, 18, 18, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:44:12,944 INFO L748 eck$LassoCheckResult]: Stem: 63733#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 63713#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; 63714#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 63732#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; 63722#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 63723#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 64566#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; 63699#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 63700#factENTRY ~n := #in~n; 64536#L25 assume ~n <= 0;#res := 1; 64535#factFINAL assume true; 64534#factEXIT >#68#return; 63749#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63750#factENTRY ~n := #in~n; 64576#L25 assume ~n <= 0;#res := 1; 64575#factFINAL assume true; 64574#factEXIT >#70#return; 63689#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63690#factENTRY ~n := #in~n; 64587#L25 assume ~n <= 0;#res := 1; 64582#factFINAL assume true; 64581#factEXIT >#72#return; 63726#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; 63727#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 63728#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 64567#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 63735#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; 63736#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 64612#factENTRY ~n := #in~n; 64621#L25 assume !(~n <= 0); 64616#L26 call #t~ret0 := fact(~n - 1);< 64617#factENTRY ~n := #in~n; 64620#L25 assume ~n <= 0;#res := 1; 64619#factFINAL assume true; 64615#factEXIT >#66#return; 64614#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64613#factFINAL assume true; 64611#factEXIT >#74#return; 63753#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63754#factENTRY ~n := #in~n; 64605#L25 assume ~n <= 0;#res := 1; 64606#factFINAL assume true; 64601#factEXIT >#76#return; 63695#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63758#factENTRY ~n := #in~n; 64628#L25 assume !(~n <= 0); 63711#L26 call #t~ret0 := fact(~n - 1);< 63710#factENTRY ~n := #in~n; 63712#L25 assume ~n <= 0;#res := 1; 64633#factFINAL assume true; 64632#factEXIT >#66#return; 64630#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64631#factFINAL assume true; 63694#factEXIT >#78#return; 63696#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; 64644#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 64643#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 64641#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 64557#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; 64402#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 64405#factENTRY ~n := #in~n; 64565#L25 assume !(~n <= 0); 64561#L26 call #t~ret0 := fact(~n - 1);< 64564#factENTRY ~n := #in~n; 64596#L25 assume !(~n <= 0); 64562#L26 call #t~ret0 := fact(~n - 1);< 64595#factENTRY ~n := #in~n; 64600#L25 assume ~n <= 0;#res := 1; 64599#factFINAL assume true; 64597#factEXIT >#66#return; 64598#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64642#factFINAL assume true; 64640#factEXIT >#66#return; 64639#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64637#factFINAL assume true; 64400#factEXIT >#74#return; 64404#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 64586#factENTRY ~n := #in~n; 64589#L25 assume ~n <= 0;#res := 1; 64588#factFINAL assume true; 64585#factEXIT >#76#return; 64401#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 64405#factENTRY ~n := #in~n; 64565#L25 assume !(~n <= 0); 64561#L26 call #t~ret0 := fact(~n - 1);< 64564#factENTRY ~n := #in~n; 64596#L25 assume !(~n <= 0); 64562#L26 call #t~ret0 := fact(~n - 1);< 64595#factENTRY ~n := #in~n; 64600#L25 assume ~n <= 0;#res := 1; 64599#factFINAL assume true; 64597#factEXIT >#66#return; 64598#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64642#factFINAL assume true; 64640#factEXIT >#66#return; 64639#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64637#factFINAL assume true; 64400#factEXIT >#78#return; 64398#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; 64396#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 64394#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 64294#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 64293#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 64291#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 63740#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 63741#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; 64498#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 64500#factENTRY ~n := #in~n; 64523#L25 assume !(~n <= 0); 64520#L26 call #t~ret0 := fact(~n - 1);< 64521#factENTRY ~n := #in~n; 64526#L25 assume ~n <= 0;#res := 1; 64525#factFINAL assume true; 64519#factEXIT >#66#return; 64518#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64517#factFINAL assume true; 64497#factEXIT >#68#return; 64494#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 64495#factENTRY ~n := #in~n; 64524#L25 assume ~n <= 0;#res := 1; 64522#factFINAL assume true; 64492#factEXIT >#70#return; 64447#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 64459#factENTRY ~n := #in~n; 64515#L25 assume !(~n <= 0); 64438#L26 call #t~ret0 := fact(~n - 1);< 64481#factENTRY ~n := #in~n; 64445#L25 assume ~n <= 0;#res := 1; 64442#factFINAL assume true; 64436#factEXIT >#66#return; 64440#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64458#factFINAL assume true; 64446#factEXIT >#72#return; 64453#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; 64550#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 64548#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 64545#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 64541#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; 64407#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 64457#factENTRY ~n := #in~n; 64553#L25 assume !(~n <= 0); 64438#L26 call #t~ret0 := fact(~n - 1);< 64481#factENTRY ~n := #in~n; 64445#L25 assume ~n <= 0;#res := 1; 64442#factFINAL assume true; 64436#factEXIT >#66#return; 64440#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64458#factFINAL assume true; 64446#factEXIT >#68#return; 64430#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 64431#factENTRY ~n := #in~n; 64443#L25 assume !(~n <= 0); 64439#L26 call #t~ret0 := fact(~n - 1);< 64441#factENTRY ~n := #in~n; 64445#L25 assume ~n <= 0;#res := 1; 64442#factFINAL assume true; 64436#factEXIT >#66#return; 64435#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64434#factFINAL assume true; 64427#factEXIT >#70#return; 64414#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 64424#factENTRY ~n := #in~n; 64552#L25 assume ~n <= 0;#res := 1; 64425#factFINAL assume true; 64406#factEXIT >#72#return; 64399#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; 64397#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 64395#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 64393#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 64170#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; 63969#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 64113#factENTRY ~n := #in~n; 64592#L25 assume !(~n <= 0); 63998#L26 call #t~ret0 := fact(~n - 1);< 64067#factENTRY ~n := #in~n; 64199#L25 assume !(~n <= 0); 63999#L26 call #t~ret0 := fact(~n - 1);< 64068#factENTRY ~n := #in~n; 64198#L25 assume ~n <= 0;#res := 1; 64197#factFINAL assume true; 64195#factEXIT >#66#return; 64194#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64065#factFINAL assume true; 63996#factEXIT >#66#return; 64001#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64123#factFINAL assume true; 64112#factEXIT >#74#return; 63972#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63953#factENTRY ~n := #in~n; 64135#L25 assume !(~n <= 0); 64022#L26 call #t~ret0 := fact(~n - 1);< 64026#factENTRY ~n := #in~n; 64177#L25 assume ~n <= 0;#res := 1; 64174#factFINAL assume true; 64021#factEXIT >#66#return; 64023#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64129#factFINAL assume true; 64126#factEXIT >#76#return; 64128#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 64354#factENTRY ~n := #in~n; 64362#L25 assume !(~n <= 0); 64360#L26 call #t~ret0 := fact(~n - 1);< 64361#factENTRY ~n := #in~n; 64364#L25 assume ~n <= 0;#res := 1; 64363#factFINAL assume true; 64359#factEXIT >#66#return; 64358#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 64357#factFINAL assume true; 64353#factEXIT >#78#return; 63970#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; 64352#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 64351#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 64348#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 64347#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 63897#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 63895#L42-3 [2022-11-02 20:44:12,944 INFO L750 eck$LassoCheckResult]: Loop: 63895#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 63734#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; 63697#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 63698#factENTRY ~n := #in~n; 63810#L25 assume !(~n <= 0); 63702#L26 call #t~ret0 := fact(~n - 1);< 63719#factENTRY ~n := #in~n; 63814#L25 assume !(~n <= 0); 63692#L26 call #t~ret0 := fact(~n - 1);< 63813#factENTRY ~n := #in~n; 63744#L25 assume ~n <= 0;#res := 1; 63745#factFINAL assume true; 63691#factEXIT >#66#return; 63693#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63701#factFINAL assume true; 63703#factEXIT >#66#return; 63892#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63887#factFINAL assume true; 63759#factEXIT >#68#return; 63747#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63748#factENTRY ~n := #in~n; 63920#L25 assume ~n <= 0;#res := 1; 63919#factFINAL assume true; 63918#factEXIT >#70#return; 63835#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63851#factENTRY ~n := #in~n; 63890#L25 assume !(~n <= 0); 63874#L26 call #t~ret0 := fact(~n - 1);< 63877#factENTRY ~n := #in~n; 63882#L25 assume !(~n <= 0); 63873#L26 call #t~ret0 := fact(~n - 1);< 63884#factENTRY ~n := #in~n; 63889#L25 assume ~n <= 0;#res := 1; 63888#factFINAL assume true; 63886#factEXIT >#66#return; 63885#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63883#factFINAL assume true; 63881#factEXIT >#66#return; 63879#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63867#factFINAL assume true; 63827#factEXIT >#72#return; 63844#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; 63917#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 63916#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 63915#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 63914#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; 63832#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 63851#factENTRY ~n := #in~n; 63890#L25 assume !(~n <= 0); 63874#L26 call #t~ret0 := fact(~n - 1);< 63877#factENTRY ~n := #in~n; 63882#L25 assume !(~n <= 0); 63873#L26 call #t~ret0 := fact(~n - 1);< 63884#factENTRY ~n := #in~n; 63889#L25 assume ~n <= 0;#res := 1; 63888#factFINAL assume true; 63886#factEXIT >#66#return; 63885#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63883#factFINAL assume true; 63881#factEXIT >#66#return; 63879#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63867#factFINAL assume true; 63827#factEXIT >#68#return; 63842#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63878#factENTRY ~n := #in~n; 63870#L25 assume !(~n <= 0); 63855#L26 call #t~ret0 := fact(~n - 1);< 63858#factENTRY ~n := #in~n; 63880#L25 assume ~n <= 0;#res := 1; 63868#factFINAL assume true; 63854#factEXIT >#66#return; 63857#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63913#factFINAL assume true; 63912#factEXIT >#70#return; 63820#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63846#factENTRY ~n := #in~n; 63860#L25 assume !(~n <= 0); 63856#L26 call #t~ret0 := fact(~n - 1);< 63858#factENTRY ~n := #in~n; 63880#L25 assume ~n <= 0;#res := 1; 63868#factFINAL assume true; 63854#factEXIT >#66#return; 63853#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63852#factFINAL assume true; 63817#factEXIT >#72#return; 63823#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; 63911#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 63910#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 63909#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 63908#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; 63829#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 63851#factENTRY ~n := #in~n; 63890#L25 assume !(~n <= 0); 63874#L26 call #t~ret0 := fact(~n - 1);< 63877#factENTRY ~n := #in~n; 63882#L25 assume !(~n <= 0); 63873#L26 call #t~ret0 := fact(~n - 1);< 63884#factENTRY ~n := #in~n; 63889#L25 assume ~n <= 0;#res := 1; 63888#factFINAL assume true; 63886#factEXIT >#66#return; 63885#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63883#factFINAL assume true; 63881#factEXIT >#66#return; 63879#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63867#factFINAL assume true; 63827#factEXIT >#68#return; 63839#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63878#factENTRY ~n := #in~n; 63870#L25 assume !(~n <= 0); 63855#L26 call #t~ret0 := fact(~n - 1);< 63858#factENTRY ~n := #in~n; 63882#L25 assume !(~n <= 0); 63873#L26 call #t~ret0 := fact(~n - 1);< 63884#factENTRY ~n := #in~n; 63889#L25 assume ~n <= 0;#res := 1; 63888#factFINAL assume true; 63886#factEXIT >#66#return; 63885#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63883#factFINAL assume true; 63881#factEXIT >#66#return; 63876#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63906#factFINAL assume true; 63905#factEXIT >#70#return; 63901#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63902#factENTRY ~n := #in~n; 63904#L25 assume ~n <= 0;#res := 1; 63903#factFINAL assume true; 63900#factEXIT >#72#return; 63899#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; 63896#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 63894#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 63893#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 63783#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; 63768#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 63686#factENTRY ~n := #in~n; 63800#L25 assume !(~n <= 0); 63708#L26 call #t~ret0 := fact(~n - 1);< 63707#factENTRY ~n := #in~n; 63709#L25 assume !(~n <= 0); 63775#L26 call #t~ret0 := fact(~n - 1);< 63799#factENTRY ~n := #in~n; 63709#L25 assume !(~n <= 0); 63775#L26 call #t~ret0 := fact(~n - 1);< 63799#factENTRY ~n := #in~n; 63806#L25 assume ~n <= 0;#res := 1; 63805#factFINAL assume true; 63803#factEXIT >#66#return; 63802#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63798#factFINAL assume true; 63786#factEXIT >#66#return; 63777#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63812#factFINAL assume true; 63774#factEXIT >#66#return; 63773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63771#factFINAL assume true; 63767#factEXIT >#74#return; 63769#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 63752#factENTRY ~n := #in~n; 63801#L25 assume !(~n <= 0); 63776#L26 call #t~ret0 := fact(~n - 1);< 63787#factENTRY ~n := #in~n; 63709#L25 assume !(~n <= 0); 63775#L26 call #t~ret0 := fact(~n - 1);< 63799#factENTRY ~n := #in~n; 63806#L25 assume ~n <= 0;#res := 1; 63805#factFINAL assume true; 63803#factEXIT >#66#return; 63802#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63798#factFINAL assume true; 63786#factEXIT >#66#return; 63781#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63780#factFINAL assume true; 63778#factEXIT >#76#return; 63756#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 63757#factENTRY ~n := #in~n; 63804#L25 assume !(~n <= 0); 63789#L26 call #t~ret0 := fact(~n - 1);< 63790#factENTRY ~n := #in~n; 63795#L25 assume ~n <= 0;#res := 1; 63793#factFINAL assume true; 63788#factEXIT >#66#return; 63782#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 63779#factFINAL assume true; 63760#factEXIT >#78#return; 63715#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; 63716#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 63720#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 63755#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 63729#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 63730#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 63895#L42-3 [2022-11-02 20:44:12,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:12,945 INFO L85 PathProgramCache]: Analyzing trace with hash 52177008, now seen corresponding path program 13 times [2022-11-02 20:44:12,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:12,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453867595] [2022-11-02 20:44:12,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:12,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:12,955 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:44:12,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [160826036] [2022-11-02 20:44:12,955 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-02 20:44:12,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:12,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:12,961 INFO L229 MonitoredProcess]: Starting monitored process 178 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:12,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (178)] Waiting until timeout for monitored process [2022-11-02 20:44:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:44:13,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:44:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:44:13,336 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:44:13,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:13,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1676318190, now seen corresponding path program 15 times [2022-11-02 20:44:13,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:13,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865884777] [2022-11-02 20:44:13,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:13,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:13,347 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:44:13,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [678259101] [2022-11-02 20:44:13,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:44:13,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:13,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:13,353 INFO L229 MonitoredProcess]: Starting monitored process 179 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:13,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (179)] Waiting until timeout for monitored process [2022-11-02 20:44:13,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2022-11-02 20:44:13,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-02 20:44:13,552 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 20:44:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 20:44:13,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 20:44:13,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:44:13,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1406721987, now seen corresponding path program 14 times [2022-11-02 20:44:13,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:44:13,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318227671] [2022-11-02 20:44:13,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:44:13,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:44:13,704 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:44:13,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [446645257] [2022-11-02 20:44:13,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:44:13,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:44:13,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:13,707 INFO L229 MonitoredProcess]: Starting monitored process 180 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:44:13,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (180)] Waiting until timeout for monitored process [2022-11-02 20:44:13,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:44:13,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:44:13,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-02 20:44:13,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:44:14,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8838 backedges. 2363 proven. 120 refuted. 0 times theorem prover too weak. 6355 trivial. 0 not checked. [2022-11-02 20:44:14,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:44:14,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8838 backedges. 79 proven. 184 refuted. 0 times theorem prover too weak. 8575 trivial. 0 not checked. [2022-11-02 20:44:14,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:44:14,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318227671] [2022-11-02 20:44:14,915 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:44:14,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446645257] [2022-11-02 20:44:14,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446645257] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:44:14,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:44:14,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-11-02 20:44:14,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275439435] [2022-11-02 20:44:14,917 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:44:33,260 WARN L234 SmtUtils]: Spent 15.23s on a formula simplification. DAG size of input: 252 DAG size of output: 227 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-11-02 20:44:57,801 WARN L234 SmtUtils]: Spent 24.03s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:44:58,011 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:44:58,011 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:44:58,011 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:44:58,011 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:44:58,011 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-02 20:44:58,011 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:44:58,011 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:44:58,011 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:44:58,011 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration26_Loop [2022-11-02 20:44:58,011 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:44:58,011 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:44:58,013 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:44:58,146 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:44:58,148 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:44:58,150 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:44:58,152 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:44:58,154 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:44:58,155 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:44:58,157 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:44:58,163 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:44:59,017 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:44:59,017 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-02 20:44:59,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:44:59,017 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:59,038 INFO L229 MonitoredProcess]: Starting monitored process 181 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:44:59,039 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Waiting until timeout for monitored process [2022-11-02 20:44:59,040 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-02 20:44:59,040 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:44:59,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (181)] Ended with exit code 0 [2022-11-02 20:44:59,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:44:59,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:59,079 INFO L229 MonitoredProcess]: Starting monitored process 182 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:44:59,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Waiting until timeout for monitored process [2022-11-02 20:44:59,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-02 20:44:59,081 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-02 20:44:59,104 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-02 20:44:59,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (182)] Ended with exit code 0 [2022-11-02 20:44:59,127 INFO L210 LassoAnalysis]: Preferences: [2022-11-02 20:44:59,127 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-02 20:44:59,127 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-02 20:44:59,128 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-02 20:44:59,128 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-02 20:44:59,128 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:44:59,128 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-02 20:44:59,128 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-02 20:44:59,128 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration26_Loop [2022-11-02 20:44:59,128 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-02 20:44:59,128 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-02 20:44:59,130 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:44:59,273 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:44:59,275 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:44:59,277 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:44:59,279 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:44:59,281 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:44:59,283 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:44:59,284 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:44:59,291 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-02 20:44:59,970 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-02 20:44:59,970 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-02 20:44:59,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:44:59,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:44:59,971 INFO L229 MonitoredProcess]: Starting monitored process 183 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:44:59,979 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 [2022-11-02 20:44:59,992 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Waiting until timeout for monitored process [2022-11-02 20:44:59,992 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-02 20:44:59,992 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-02 20:44:59,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-02 20:44:59,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-02 20:44:59,993 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-02 20:44:59,995 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-02 20:44:59,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-02 20:45:00,001 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-11-02 20:45:00,005 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-11-02 20:45:00,005 INFO L444 ModelExtractionUtils]: 6 out of 9 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-11-02 20:45:00,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-02 20:45:00,005 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:00,007 INFO L229 MonitoredProcess]: Starting monitored process 184 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-02 20:45:00,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Waiting until timeout for monitored process [2022-11-02 20:45:00,008 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-11-02 20:45:00,008 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-11-02 20:45:00,009 INFO L513 LassoAnalysis]: Proved termination. [2022-11-02 20:45:00,009 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0#1) = -2*ULTIMATE.start_main_~n~0#1 + 5 Supporting invariants [] [2022-11-02 20:45:00,033 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (183)] Ended with exit code 0 [2022-11-02 20:45:00,033 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-11-02 20:45:00,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:00,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 1397 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-02 20:45:00,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:00,587 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (184)] Forceful destruction successful, exit code 0 [2022-11-02 20:45:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:02,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 1268 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-02 20:45:02,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:03,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2083 backedges. 7 proven. 316 refuted. 0 times theorem prover too weak. 1760 trivial. 0 not checked. [2022-11-02 20:45:03,501 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2022-11-02 20:45:03,502 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 961 states and 1299 transitions. cyclomatic complexity: 355 Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 6 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-11-02 20:45:04,295 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 961 states and 1299 transitions. cyclomatic complexity: 355. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 6 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Result 2276 states and 3135 transitions. Complement of second has 38 states. [2022-11-02 20:45:04,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2022-11-02 20:45:04,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 6 states have call successors, (16), 2 states have call predecessors, (16), 5 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-11-02 20:45:04,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-11-02 20:45:04,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 96 transitions. Stem has 215 letters. Loop has 191 letters. [2022-11-02 20:45:04,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:45:04,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 96 transitions. Stem has 406 letters. Loop has 191 letters. [2022-11-02 20:45:04,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:45:04,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 96 transitions. Stem has 215 letters. Loop has 382 letters. [2022-11-02 20:45:04,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-11-02 20:45:04,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2276 states and 3135 transitions. [2022-11-02 20:45:04,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 84 [2022-11-02 20:45:04,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2276 states to 1363 states and 1859 transitions. [2022-11-02 20:45:04,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2022-11-02 20:45:04,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2022-11-02 20:45:04,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1363 states and 1859 transitions. [2022-11-02 20:45:04,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:45:04,341 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1363 states and 1859 transitions. [2022-11-02 20:45:04,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states and 1859 transitions. [2022-11-02 20:45:04,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 1289. [2022-11-02 20:45:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 830 states have (on average 1.1012048192771084) internal successors, (914), 851 states have internal predecessors, (914), 308 states have call successors, (308), 131 states have call predecessors, (308), 151 states have return successors, (512), 306 states have call predecessors, (512), 308 states have call successors, (512) [2022-11-02 20:45:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1734 transitions. [2022-11-02 20:45:04,378 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1289 states and 1734 transitions. [2022-11-02 20:45:04,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:04,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:45:04,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:45:04,380 INFO L87 Difference]: Start difference. First operand 1289 states and 1734 transitions. Second operand has 15 states, 15 states have (on average 5.533333333333333) internal successors, (83), 15 states have internal predecessors, (83), 12 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 12 states have call predecessors, (41), 12 states have call successors, (41) [2022-11-02 20:45:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:05,050 INFO L93 Difference]: Finished difference Result 2168 states and 3165 transitions. [2022-11-02 20:45:05,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2168 states and 3165 transitions. [2022-11-02 20:45:05,067 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2022-11-02 20:45:05,084 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2168 states to 1678 states and 2398 transitions. [2022-11-02 20:45:05,084 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2022-11-02 20:45:05,085 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 99 [2022-11-02 20:45:05,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1678 states and 2398 transitions. [2022-11-02 20:45:05,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:45:05,085 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1678 states and 2398 transitions. [2022-11-02 20:45:05,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states and 2398 transitions. [2022-11-02 20:45:05,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1286. [2022-11-02 20:45:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 836 states have (on average 1.0933014354066986) internal successors, (914), 850 states have internal predecessors, (914), 300 states have call successors, (300), 130 states have call predecessors, (300), 150 states have return successors, (499), 305 states have call predecessors, (499), 300 states have call successors, (499) [2022-11-02 20:45:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1713 transitions. [2022-11-02 20:45:05,130 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1286 states and 1713 transitions. [2022-11-02 20:45:05,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:45:05,131 INFO L428 stractBuchiCegarLoop]: Abstraction has 1286 states and 1713 transitions. [2022-11-02 20:45:05,131 INFO L335 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2022-11-02 20:45:05,131 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1286 states and 1713 transitions. [2022-11-02 20:45:05,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2022-11-02 20:45:05,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:45:05,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:45:05,138 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [48, 48, 24, 24, 24, 24, 24, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-02 20:45:05,138 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [33, 33, 21, 21, 21, 21, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:05,139 INFO L748 eck$LassoCheckResult]: Stem: 74175#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 74152#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; 74153#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 74174#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; 74164#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 74165#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75170#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; 75166#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75167#factENTRY ~n := #in~n; 75171#L25 assume ~n <= 0;#res := 1; 75169#factFINAL assume true; 75165#factEXIT >#68#return; 75161#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 75162#factENTRY ~n := #in~n; 75168#L25 assume ~n <= 0;#res := 1; 75164#factFINAL assume true; 75160#factEXIT >#70#return; 75157#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 75158#factENTRY ~n := #in~n; 75163#L25 assume ~n <= 0;#res := 1; 75159#factFINAL assume true; 75156#factEXIT >#72#return; 75153#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; 75151#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 75147#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 75144#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75141#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; 75135#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75136#factENTRY ~n := #in~n; 75154#L25 assume !(~n <= 0); 75149#L26 call #t~ret0 := fact(~n - 1);< 75150#factENTRY ~n := #in~n; 75155#L25 assume ~n <= 0;#res := 1; 75152#factFINAL assume true; 75148#factEXIT >#66#return; 75146#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75140#factFINAL assume true; 75134#factEXIT >#74#return; 75131#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 75132#factENTRY ~n := #in~n; 75173#L25 assume ~n <= 0;#res := 1; 75172#factFINAL assume true; 75130#factEXIT >#76#return; 75127#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 75128#factENTRY ~n := #in~n; 75143#L25 assume !(~n <= 0); 75138#L26 call #t~ret0 := fact(~n - 1);< 75139#factENTRY ~n := #in~n; 75145#L25 assume ~n <= 0;#res := 1; 75142#factFINAL assume true; 75137#factEXIT >#66#return; 75133#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75129#factFINAL assume true; 75126#factEXIT >#78#return; 75125#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; 75124#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 75123#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 75122#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75121#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; 75094#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75096#factENTRY ~n := #in~n; 75105#L25 assume !(~n <= 0); 75102#L26 call #t~ret0 := fact(~n - 1);< 75104#factENTRY ~n := #in~n; 75109#L25 assume !(~n <= 0); 75101#L26 call #t~ret0 := fact(~n - 1);< 75108#factENTRY ~n := #in~n; 75115#L25 assume ~n <= 0;#res := 1; 75114#factFINAL assume true; 75113#factEXIT >#66#return; 75111#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75106#factFINAL assume true; 75107#factEXIT >#66#return; 75406#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75405#factFINAL assume true; 75092#factEXIT >#74#return; 75095#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 75118#factENTRY ~n := #in~n; 75120#L25 assume ~n <= 0;#res := 1; 75119#factFINAL assume true; 75117#factEXIT >#76#return; 75093#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 75096#factENTRY ~n := #in~n; 75105#L25 assume !(~n <= 0); 75102#L26 call #t~ret0 := fact(~n - 1);< 75104#factENTRY ~n := #in~n; 75109#L25 assume !(~n <= 0); 75101#L26 call #t~ret0 := fact(~n - 1);< 75108#factENTRY ~n := #in~n; 75115#L25 assume ~n <= 0;#res := 1; 75114#factFINAL assume true; 75113#factEXIT >#66#return; 75111#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75106#factFINAL assume true; 75107#factEXIT >#66#return; 75406#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75405#factFINAL assume true; 75092#factEXIT >#78#return; 75091#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; 75090#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 74605#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 74583#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 74579#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; 74575#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74576#factENTRY ~n := #in~n; 74590#L25 assume !(~n <= 0); 74585#L26 call #t~ret0 := fact(~n - 1);< 74589#factENTRY ~n := #in~n; 74594#L25 assume !(~n <= 0); 74586#L26 call #t~ret0 := fact(~n - 1);< 74593#factENTRY ~n := #in~n; 74594#L25 assume !(~n <= 0); 74586#L26 call #t~ret0 := fact(~n - 1);< 74593#factENTRY ~n := #in~n; 74603#L25 assume ~n <= 0;#res := 1; 74598#factFINAL assume true; 74596#factEXIT >#66#return; 74597#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74591#factFINAL assume true; 74592#factEXIT >#66#return; 74588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74595#factFINAL assume true; 74584#factEXIT >#66#return; 74587#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74577#factFINAL assume true; 74578#factEXIT >#74#return; 74607#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74608#factENTRY ~n := #in~n; 74610#L25 assume ~n <= 0;#res := 1; 74609#factFINAL assume true; 74606#factEXIT >#76#return; 74574#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74576#factENTRY ~n := #in~n; 74590#L25 assume !(~n <= 0); 74585#L26 call #t~ret0 := fact(~n - 1);< 74589#factENTRY ~n := #in~n; 74594#L25 assume !(~n <= 0); 74586#L26 call #t~ret0 := fact(~n - 1);< 74593#factENTRY ~n := #in~n; 74603#L25 assume ~n <= 0;#res := 1; 74598#factFINAL assume true; 74596#factEXIT >#66#return; 74597#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74591#factFINAL assume true; 74592#factEXIT >#66#return; 74581#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74582#factFINAL assume true; 74573#factEXIT >#78#return; 74572#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; 74570#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 74561#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 74559#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 74556#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 74551#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 74552#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75346#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; 75290#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75325#factENTRY ~n := #in~n; 75328#L25 assume !(~n <= 0); 75310#L26 call #t~ret0 := fact(~n - 1);< 75317#factENTRY ~n := #in~n; 75318#L25 assume ~n <= 0;#res := 1; 75309#factFINAL assume true; 75311#factEXIT >#66#return; 75298#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75299#factFINAL assume true; 75289#factEXIT >#68#return; 75276#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 75280#factENTRY ~n := #in~n; 75327#L25 assume ~n <= 0;#res := 1; 75326#factFINAL assume true; 75275#factEXIT >#70#return; 75279#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74127#factENTRY ~n := #in~n; 75356#L25 assume !(~n <= 0); 75303#L26 call #t~ret0 := fact(~n - 1);< 75365#factENTRY ~n := #in~n; 75314#L25 assume ~n <= 0;#res := 1; 75315#factFINAL assume true; 75301#factEXIT >#66#return; 75305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75293#factFINAL assume true; 75297#factEXIT >#72#return; 75320#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; 75319#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 75316#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 75308#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75300#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; 75263#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75292#factENTRY ~n := #in~n; 75357#L25 assume !(~n <= 0); 75303#L26 call #t~ret0 := fact(~n - 1);< 75365#factENTRY ~n := #in~n; 75314#L25 assume ~n <= 0;#res := 1; 75315#factFINAL assume true; 75301#factEXIT >#66#return; 75305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75293#factFINAL assume true; 75297#factEXIT >#68#return; 75282#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74193#factENTRY ~n := #in~n; 75312#L25 assume !(~n <= 0); 75304#L26 call #t~ret0 := fact(~n - 1);< 75307#factENTRY ~n := #in~n; 75314#L25 assume ~n <= 0;#res := 1; 75315#factFINAL assume true; 75301#factEXIT >#66#return; 75306#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75382#factFINAL assume true; 75381#factEXIT >#70#return; 75264#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 75272#factENTRY ~n := #in~n; 75274#L25 assume ~n <= 0;#res := 1; 75273#factFINAL assume true; 75253#factEXIT >#72#return; 75271#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; 75400#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 75399#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 75398#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75390#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; 75337#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74125#factENTRY ~n := #in~n; 75366#L25 assume !(~n <= 0); 75359#L26 call #t~ret0 := fact(~n - 1);< 75364#factENTRY ~n := #in~n; 75370#L25 assume !(~n <= 0); 75361#L26 call #t~ret0 := fact(~n - 1);< 75369#factENTRY ~n := #in~n; 75380#L25 assume ~n <= 0;#res := 1; 75379#factFINAL assume true; 75377#factEXIT >#66#return; 75378#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75367#factFINAL assume true; 75368#factEXIT >#66#return; 75354#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75355#factFINAL assume true; 75334#factEXIT >#74#return; 75254#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74196#factENTRY ~n := #in~n; 75288#L25 assume !(~n <= 0); 75302#L26 call #t~ret0 := fact(~n - 1);< 75307#factENTRY ~n := #in~n; 75314#L25 assume ~n <= 0;#res := 1; 75315#factFINAL assume true; 75301#factEXIT >#66#return; 75305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75293#factFINAL assume true; 75297#factEXIT >#76#return; 74149#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74147#factENTRY ~n := #in~n; 74151#L25 assume !(~n <= 0); 74159#L26 call #t~ret0 := fact(~n - 1);< 74160#factENTRY ~n := #in~n; 75376#L25 assume ~n <= 0;#res := 1; 75375#factFINAL assume true; 75374#factEXIT >#66#return; 74184#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74185#factFINAL assume true; 75389#factEXIT >#78#return; 75324#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; 75403#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 75402#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 75401#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75248#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; 75190#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 75186#factENTRY ~n := #in~n; 75216#L25 assume !(~n <= 0); 75202#L26 call #t~ret0 := fact(~n - 1);< 75214#factENTRY ~n := #in~n; 75213#L25 assume !(~n <= 0); 75204#L26 call #t~ret0 := fact(~n - 1);< 75212#factENTRY ~n := #in~n; 75213#L25 assume !(~n <= 0); 75204#L26 call #t~ret0 := fact(~n - 1);< 75212#factENTRY ~n := #in~n; 75246#L25 assume ~n <= 0;#res := 1; 75245#factFINAL assume true; 75244#factEXIT >#66#return; 75242#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75241#factFINAL assume true; 75201#factEXIT >#66#return; 75207#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75210#factFINAL assume true; 75211#factEXIT >#66#return; 75240#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75239#factFINAL assume true; 75238#factEXIT >#74#return; 75221#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 75198#factENTRY ~n := #in~n; 75226#L25 assume ~n <= 0;#res := 1; 75227#factFINAL assume true; 75353#factEXIT >#76#return; 75192#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 75186#factENTRY ~n := #in~n; 75216#L25 assume !(~n <= 0); 75202#L26 call #t~ret0 := fact(~n - 1);< 75214#factENTRY ~n := #in~n; 75213#L25 assume !(~n <= 0); 75204#L26 call #t~ret0 := fact(~n - 1);< 75212#factENTRY ~n := #in~n; 75246#L25 assume ~n <= 0;#res := 1; 75245#factFINAL assume true; 75244#factEXIT >#66#return; 75242#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75241#factFINAL assume true; 75201#factEXIT >#66#return; 75206#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75189#factFINAL assume true; 75194#factEXIT >#78#return; 75232#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; 75352#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 75351#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 75350#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 75349#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 75348#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 74218#L42-3 [2022-11-02 20:45:05,139 INFO L750 eck$LassoCheckResult]: Loop: 74218#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 74176#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; 74142#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74143#factENTRY ~n := #in~n; 74211#L25 assume !(~n <= 0); 74206#L26 call #t~ret0 := fact(~n - 1);< 74208#factENTRY ~n := #in~n; 74212#L25 assume !(~n <= 0); 74205#L26 call #t~ret0 := fact(~n - 1);< 74210#factENTRY ~n := #in~n; 74212#L25 assume !(~n <= 0); 74205#L26 call #t~ret0 := fact(~n - 1);< 74210#factENTRY ~n := #in~n; 74214#L25 assume ~n <= 0;#res := 1; 74219#factFINAL assume true; 74217#factEXIT >#66#return; 74216#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74215#factFINAL assume true; 74213#factEXIT >#66#return; 74207#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74209#factFINAL assume true; 74204#factEXIT >#66#return; 74203#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74202#factFINAL assume true; 74201#factEXIT >#68#return; 74140#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74191#factENTRY ~n := #in~n; 74186#L25 assume ~n <= 0;#res := 1; 74139#factFINAL assume true; 74141#factEXIT >#70#return; 74135#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74380#factENTRY ~n := #in~n; 74415#L25 assume !(~n <= 0); 74388#L26 call #t~ret0 := fact(~n - 1);< 74393#factENTRY ~n := #in~n; 74409#L25 assume !(~n <= 0); 74389#L26 call #t~ret0 := fact(~n - 1);< 74403#factENTRY ~n := #in~n; 74408#L25 assume ~n <= 0;#res := 1; 74406#factFINAL assume true; 74404#factEXIT >#66#return; 74400#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74396#factFINAL assume true; 74386#factEXIT >#66#return; 74382#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74381#factFINAL assume true; 74369#factEXIT >#72#return; 74173#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; 74171#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 74172#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 75180#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 75179#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; 74371#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74380#factENTRY ~n := #in~n; 74415#L25 assume !(~n <= 0); 74388#L26 call #t~ret0 := fact(~n - 1);< 74393#factENTRY ~n := #in~n; 74409#L25 assume !(~n <= 0); 74389#L26 call #t~ret0 := fact(~n - 1);< 74403#factENTRY ~n := #in~n; 74409#L25 assume !(~n <= 0); 74389#L26 call #t~ret0 := fact(~n - 1);< 74403#factENTRY ~n := #in~n; 74408#L25 assume ~n <= 0;#res := 1; 74406#factFINAL assume true; 74404#factEXIT >#66#return; 74400#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74396#factFINAL assume true; 74386#factEXIT >#66#return; 74391#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74399#factFINAL assume true; 74395#factEXIT >#66#return; 74385#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74378#factFINAL assume true; 74379#factEXIT >#68#return; 74134#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74413#factENTRY ~n := #in~n; 74411#L25 assume !(~n <= 0); 74390#L26 call #t~ret0 := fact(~n - 1);< 74397#factENTRY ~n := #in~n; 74407#L25 assume ~n <= 0;#res := 1; 74405#factFINAL assume true; 74401#factEXIT >#66#return; 74402#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 75176#factFINAL assume true; 75175#factEXIT >#70#return; 74370#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74377#factENTRY ~n := #in~n; 74410#L25 assume !(~n <= 0); 74387#L26 call #t~ret0 := fact(~n - 1);< 74397#factENTRY ~n := #in~n; 74407#L25 assume ~n <= 0;#res := 1; 74405#factFINAL assume true; 74401#factEXIT >#66#return; 74398#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74394#factFINAL assume true; 74383#factEXIT >#72#return; 74384#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; 75177#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 74829#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 74828#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 74826#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; 74329#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74380#factENTRY ~n := #in~n; 74415#L25 assume !(~n <= 0); 74388#L26 call #t~ret0 := fact(~n - 1);< 74393#factENTRY ~n := #in~n; 74409#L25 assume !(~n <= 0); 74389#L26 call #t~ret0 := fact(~n - 1);< 74403#factENTRY ~n := #in~n; 74409#L25 assume !(~n <= 0); 74389#L26 call #t~ret0 := fact(~n - 1);< 74403#factENTRY ~n := #in~n; 74408#L25 assume ~n <= 0;#res := 1; 74406#factFINAL assume true; 74404#factEXIT >#66#return; 74400#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74396#factFINAL assume true; 74386#factEXIT >#66#return; 74391#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74399#factFINAL assume true; 74395#factEXIT >#66#return; 74385#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74378#factFINAL assume true; 74379#factEXIT >#68#return; 74132#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74413#factENTRY ~n := #in~n; 74411#L25 assume !(~n <= 0); 74390#L26 call #t~ret0 := fact(~n - 1);< 74397#factENTRY ~n := #in~n; 74409#L25 assume !(~n <= 0); 74389#L26 call #t~ret0 := fact(~n - 1);< 74403#factENTRY ~n := #in~n; 74408#L25 assume ~n <= 0;#res := 1; 74406#factFINAL assume true; 74404#factEXIT >#66#return; 74400#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74396#factFINAL assume true; 74386#factEXIT >#66#return; 74392#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74512#factFINAL assume true; 74511#factEXIT >#70#return; 74506#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74507#factENTRY ~n := #in~n; 74509#L25 assume ~n <= 0;#res := 1; 74508#factFINAL assume true; 74505#factEXIT >#72#return; 74461#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; 74426#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 74366#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 74362#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 74359#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; 74122#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 74123#factENTRY ~n := #in~n; 74346#L25 assume !(~n <= 0); 74335#L26 call #t~ret0 := fact(~n - 1);< 74340#factENTRY ~n := #in~n; 74348#L25 assume !(~n <= 0); 74336#L26 call #t~ret0 := fact(~n - 1);< 74343#factENTRY ~n := #in~n; 74348#L25 assume !(~n <= 0); 74336#L26 call #t~ret0 := fact(~n - 1);< 74343#factENTRY ~n := #in~n; 74350#L25 assume ~n <= 0;#res := 1; 74351#factFINAL assume true; 74349#factEXIT >#66#return; 74347#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74342#factFINAL assume true; 74334#factEXIT >#66#return; 74337#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74345#factFINAL assume true; 74339#factEXIT >#66#return; 74332#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74324#factFINAL assume true; 74326#factEXIT >#74#return; 74180#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 74194#factENTRY ~n := #in~n; 74344#L25 assume !(~n <= 0); 74129#L26 call #t~ret0 := fact(~n - 1);< 74338#factENTRY ~n := #in~n; 74348#L25 assume !(~n <= 0); 74336#L26 call #t~ret0 := fact(~n - 1);< 74343#factENTRY ~n := #in~n; 74350#L25 assume ~n <= 0;#res := 1; 74351#factFINAL assume true; 74349#factEXIT >#66#return; 74347#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74342#factFINAL assume true; 74334#factEXIT >#66#return; 74331#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74327#factFINAL assume true; 74323#factEXIT >#76#return; 74158#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 74223#factENTRY ~n := #in~n; 74353#L25 assume !(~n <= 0); 74137#L26 call #t~ret0 := fact(~n - 1);< 74145#factENTRY ~n := #in~n; 74146#L25 assume ~n <= 0;#res := 1; 74136#factFINAL assume true; 74138#factEXIT >#66#return; 74355#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 74354#factFINAL assume true; 74222#factEXIT >#78#return; 74221#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; 74161#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 74162#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 74197#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 74168#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 74169#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 74218#L42-3 [2022-11-02 20:45:05,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:05,140 INFO L85 PathProgramCache]: Analyzing trace with hash -571425584, now seen corresponding path program 15 times [2022-11-02 20:45:05,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:05,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970495726] [2022-11-02 20:45:05,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:05,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:05,152 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:45:05,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [649203814] [2022-11-02 20:45:05,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:45:05,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:05,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:05,154 INFO L229 MonitoredProcess]: Starting monitored process 185 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:05,175 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (185)] Waiting until timeout for monitored process [2022-11-02 20:45:05,295 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-11-02 20:45:05,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:45:05,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-02 20:45:05,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5234 backedges. 967 proven. 64 refuted. 0 times theorem prover too weak. 4203 trivial. 0 not checked. [2022-11-02 20:45:05,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5234 backedges. 339 proven. 86 refuted. 0 times theorem prover too weak. 4809 trivial. 0 not checked. [2022-11-02 20:45:05,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:05,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970495726] [2022-11-02 20:45:05,974 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:45:05,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649203814] [2022-11-02 20:45:05,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649203814] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:05,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:45:05,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-11-02 20:45:05,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171434091] [2022-11-02 20:45:05,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:05,975 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:45:05,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:05,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1252708074, now seen corresponding path program 16 times [2022-11-02 20:45:05,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:05,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056917236] [2022-11-02 20:45:05,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:05,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:05,983 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:45:05,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1875835093] [2022-11-02 20:45:05,984 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:45:05,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:05,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:05,985 INFO L229 MonitoredProcess]: Starting monitored process 186 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:05,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (186)] Waiting until timeout for monitored process [2022-11-02 20:45:06,106 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:45:06,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:45:06,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 20:45:06,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2569 backedges. 1000 proven. 64 refuted. 0 times theorem prover too weak. 1505 trivial. 0 not checked. [2022-11-02 20:45:06,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2569 backedges. 40 proven. 759 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2022-11-02 20:45:07,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:07,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056917236] [2022-11-02 20:45:07,780 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:45:07,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875835093] [2022-11-02 20:45:07,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875835093] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:07,780 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:45:07,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 16] total 19 [2022-11-02 20:45:07,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239501721] [2022-11-02 20:45:07,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:07,781 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:45:07,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:07,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 20:45:07,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:45:07,782 INFO L87 Difference]: Start difference. First operand 1286 states and 1713 transitions. cyclomatic complexity: 448 Second operand has 19 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 12 states have call successors, (25), 2 states have call predecessors, (25), 8 states have return successors, (28), 10 states have call predecessors, (28), 12 states have call successors, (28) [2022-11-02 20:45:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:08,834 INFO L93 Difference]: Finished difference Result 1774 states and 2381 transitions. [2022-11-02 20:45:08,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1774 states and 2381 transitions. [2022-11-02 20:45:08,844 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2022-11-02 20:45:08,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1774 states to 1763 states and 2366 transitions. [2022-11-02 20:45:08,869 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2022-11-02 20:45:08,869 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2022-11-02 20:45:08,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1763 states and 2366 transitions. [2022-11-02 20:45:08,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:45:08,874 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1763 states and 2366 transitions. [2022-11-02 20:45:08,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states and 2366 transitions. [2022-11-02 20:45:08,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1345. [2022-11-02 20:45:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 868 states have (on average 1.0898617511520738) internal successors, (946), 882 states have internal predecessors, (946), 328 states have call successors, (328), 147 states have call predecessors, (328), 149 states have return successors, (521), 315 states have call predecessors, (521), 328 states have call successors, (521) [2022-11-02 20:45:08,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1795 transitions. [2022-11-02 20:45:08,911 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1345 states and 1795 transitions. [2022-11-02 20:45:08,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:45:08,913 INFO L428 stractBuchiCegarLoop]: Abstraction has 1345 states and 1795 transitions. [2022-11-02 20:45:08,913 INFO L335 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2022-11-02 20:45:08,913 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1345 states and 1795 transitions. [2022-11-02 20:45:08,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 56 [2022-11-02 20:45:08,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:45:08,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:45:08,921 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [50, 50, 26, 26, 26, 26, 24, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-02 20:45:08,921 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [34, 34, 22, 22, 22, 22, 12, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:08,921 INFO L748 eck$LassoCheckResult]: Stem: 80412#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 80391#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; 80392#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 80411#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; 80400#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 80401#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 81441#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; 81437#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 81438#factENTRY ~n := #in~n; 81440#L25 assume ~n <= 0;#res := 1; 81439#factFINAL assume true; 81436#factEXIT >#68#return; 81431#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 81432#factENTRY ~n := #in~n; 81435#L25 assume ~n <= 0;#res := 1; 81434#factFINAL assume true; 81430#factEXIT >#70#return; 81427#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 81428#factENTRY ~n := #in~n; 81433#L25 assume ~n <= 0;#res := 1; 81429#factFINAL assume true; 81426#factEXIT >#72#return; 81424#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; 81423#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 81422#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 81419#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 81416#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; 81404#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 81405#factENTRY ~n := #in~n; 81415#L25 assume !(~n <= 0); 81413#L26 call #t~ret0 := fact(~n - 1);< 81414#factENTRY ~n := #in~n; 81425#L25 assume ~n <= 0;#res := 1; 81418#factFINAL assume true; 81412#factEXIT >#66#return; 81411#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81410#factFINAL assume true; 81403#factEXIT >#74#return; 81399#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 81400#factENTRY ~n := #in~n; 81409#L25 assume ~n <= 0;#res := 1; 81402#factFINAL assume true; 81398#factEXIT >#76#return; 81395#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 81396#factENTRY ~n := #in~n; 81421#L25 assume !(~n <= 0); 81407#L26 call #t~ret0 := fact(~n - 1);< 81408#factENTRY ~n := #in~n; 81420#L25 assume ~n <= 0;#res := 1; 81417#factFINAL assume true; 81406#factEXIT >#66#return; 81401#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81397#factFINAL assume true; 81394#factEXIT >#78#return; 81393#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; 81392#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 81391#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 81390#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 81389#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; 81376#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 81382#factENTRY ~n := #in~n; 81451#L25 assume !(~n <= 0); 81445#L26 call #t~ret0 := fact(~n - 1);< 81449#factENTRY ~n := #in~n; 81453#L25 assume !(~n <= 0); 81446#L26 call #t~ret0 := fact(~n - 1);< 81456#factENTRY ~n := #in~n; 81459#L25 assume ~n <= 0;#res := 1; 81457#factFINAL assume true; 81454#factEXIT >#66#return; 81455#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81463#factFINAL assume true; 81462#factEXIT >#66#return; 81388#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81380#factFINAL assume true; 81381#factEXIT >#74#return; 81384#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 81385#factENTRY ~n := #in~n; 81387#L25 assume ~n <= 0;#res := 1; 81386#factFINAL assume true; 81383#factEXIT >#76#return; 81377#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 81382#factENTRY ~n := #in~n; 81451#L25 assume !(~n <= 0); 81445#L26 call #t~ret0 := fact(~n - 1);< 81449#factENTRY ~n := #in~n; 81453#L25 assume !(~n <= 0); 81446#L26 call #t~ret0 := fact(~n - 1);< 81456#factENTRY ~n := #in~n; 81459#L25 assume ~n <= 0;#res := 1; 81457#factFINAL assume true; 81454#factEXIT >#66#return; 81455#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81463#factFINAL assume true; 81462#factEXIT >#66#return; 81388#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81380#factFINAL assume true; 81381#factEXIT >#78#return; 81371#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; 81370#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 81368#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 81366#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 80811#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; 80802#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 80807#factENTRY ~n := #in~n; 80859#L25 assume !(~n <= 0); 80817#L26 call #t~ret0 := fact(~n - 1);< 80820#factENTRY ~n := #in~n; 80827#L25 assume !(~n <= 0); 80815#L26 call #t~ret0 := fact(~n - 1);< 80864#factENTRY ~n := #in~n; 80827#L25 assume !(~n <= 0); 80815#L26 call #t~ret0 := fact(~n - 1);< 80864#factENTRY ~n := #in~n; 80867#L25 assume ~n <= 0;#res := 1; 80865#factFINAL assume true; 80863#factEXIT >#66#return; 80862#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80861#factFINAL assume true; 80860#factEXIT >#66#return; 80819#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80822#factFINAL assume true; 80814#factEXIT >#66#return; 80810#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80806#factFINAL assume true; 80801#factEXIT >#74#return; 80804#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 80809#factENTRY ~n := #in~n; 80821#L25 assume ~n <= 0;#res := 1; 80813#factFINAL assume true; 80808#factEXIT >#76#return; 80803#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 80805#factENTRY ~n := #in~n; 80826#L25 assume !(~n <= 0); 80818#L26 call #t~ret0 := fact(~n - 1);< 80868#factENTRY ~n := #in~n; 80866#L25 assume !(~n <= 0); 80816#L26 call #t~ret0 := fact(~n - 1);< 80820#factENTRY ~n := #in~n; 80827#L25 assume !(~n <= 0); 80815#L26 call #t~ret0 := fact(~n - 1);< 80864#factENTRY ~n := #in~n; 80867#L25 assume ~n <= 0;#res := 1; 80865#factFINAL assume true; 80863#factEXIT >#66#return; 80862#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80861#factFINAL assume true; 80860#factEXIT >#66#return; 80819#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80822#factFINAL assume true; 80814#factEXIT >#66#return; 80810#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80806#factFINAL assume true; 80801#factEXIT >#78#return; 80800#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; 80799#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 80798#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 80797#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 80796#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 80794#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 80795#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 81637#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; 81622#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 80382#factENTRY ~n := #in~n; 81640#L25 assume !(~n <= 0); 81633#L26 call #t~ret0 := fact(~n - 1);< 81634#factENTRY ~n := #in~n; 81639#L25 assume ~n <= 0;#res := 1; 81638#factFINAL assume true; 81632#factEXIT >#66#return; 81631#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81629#factFINAL assume true; 81621#factEXIT >#68#return; 81617#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 81618#factENTRY ~n := #in~n; 81624#L25 assume ~n <= 0;#res := 1; 81620#factFINAL assume true; 81615#factEXIT >#70#return; 81598#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 80378#factENTRY ~n := #in~n; 81596#L25 assume !(~n <= 0); 81588#L26 call #t~ret0 := fact(~n - 1);< 81657#factENTRY ~n := #in~n; 81594#L25 assume ~n <= 0;#res := 1; 81591#factFINAL assume true; 81585#factEXIT >#66#return; 81589#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81636#factFINAL assume true; 81625#factEXIT >#72#return; 81627#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; 81644#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 81643#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 81642#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 81641#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; 81568#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 81609#factENTRY ~n := #in~n; 81595#L25 assume !(~n <= 0); 81588#L26 call #t~ret0 := fact(~n - 1);< 81657#factENTRY ~n := #in~n; 81594#L25 assume ~n <= 0;#res := 1; 81591#factFINAL assume true; 81585#factEXIT >#66#return; 81589#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81636#factFINAL assume true; 81625#factEXIT >#68#return; 81578#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 81582#factENTRY ~n := #in~n; 81592#L25 assume !(~n <= 0); 81586#L26 call #t~ret0 := fact(~n - 1);< 81590#factENTRY ~n := #in~n; 81594#L25 assume ~n <= 0;#res := 1; 81591#factFINAL assume true; 81585#factEXIT >#66#return; 81584#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81583#factFINAL assume true; 81577#factEXIT >#70#return; 81566#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 81574#factENTRY ~n := #in~n; 81576#L25 assume ~n <= 0;#res := 1; 81575#factFINAL assume true; 81556#factEXIT >#72#return; 81571#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; 81699#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 81696#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 81695#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 80414#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; 80415#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 81675#factENTRY ~n := #in~n; 81680#L25 assume !(~n <= 0); 81650#L26 call #t~ret0 := fact(~n - 1);< 81656#factENTRY ~n := #in~n; 81671#L25 assume !(~n <= 0); 81653#L26 call #t~ret0 := fact(~n - 1);< 81683#factENTRY ~n := #in~n; 81687#L25 assume ~n <= 0;#res := 1; 81684#factFINAL assume true; 81682#factEXIT >#66#return; 81681#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81679#factFINAL assume true; 81678#factEXIT >#66#return; 81645#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81646#factFINAL assume true; 81603#factEXIT >#74#return; 81563#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 80431#factENTRY ~n := #in~n; 81602#L25 assume !(~n <= 0); 81587#L26 call #t~ret0 := fact(~n - 1);< 81590#factENTRY ~n := #in~n; 81594#L25 assume ~n <= 0;#res := 1; 81591#factFINAL assume true; 81585#factEXIT >#66#return; 81589#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81636#factFINAL assume true; 81625#factEXIT >#76#return; 80372#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 80435#factENTRY ~n := #in~n; 81676#L25 assume !(~n <= 0); 80389#L26 call #t~ret0 := fact(~n - 1);< 80388#factENTRY ~n := #in~n; 80390#L25 assume ~n <= 0;#res := 1; 80423#factFINAL assume true; 81698#factEXIT >#66#return; 80417#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80384#factFINAL assume true; 80370#factEXIT >#78#return; 80375#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; 81707#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 81706#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 80420#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 80421#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; 81497#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 81498#factENTRY ~n := #in~n; 81668#L25 assume !(~n <= 0); 81515#L26 call #t~ret0 := fact(~n - 1);< 81521#factENTRY ~n := #in~n; 81538#L25 assume !(~n <= 0); 81516#L26 call #t~ret0 := fact(~n - 1);< 81547#factENTRY ~n := #in~n; 81538#L25 assume !(~n <= 0); 81516#L26 call #t~ret0 := fact(~n - 1);< 81547#factENTRY ~n := #in~n; 81550#L25 assume ~n <= 0;#res := 1; 81548#factFINAL assume true; 81546#factEXIT >#66#return; 81545#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81544#factFINAL assume true; 81542#factEXIT >#66#return; 81520#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81536#factFINAL assume true; 81514#factEXIT >#66#return; 81512#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81510#factFINAL assume true; 81502#factEXIT >#74#return; 81507#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 81500#factENTRY ~n := #in~n; 81533#L25 assume ~n <= 0;#res := 1; 81534#factFINAL assume true; 81555#factEXIT >#76#return; 81506#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 81511#factENTRY ~n := #in~n; 81552#L25 assume !(~n <= 0); 81519#L26 call #t~ret0 := fact(~n - 1);< 81551#factENTRY ~n := #in~n; 81549#L25 assume !(~n <= 0); 81517#L26 call #t~ret0 := fact(~n - 1);< 81521#factENTRY ~n := #in~n; 81538#L25 assume !(~n <= 0); 81516#L26 call #t~ret0 := fact(~n - 1);< 81547#factENTRY ~n := #in~n; 81550#L25 assume ~n <= 0;#res := 1; 81548#factFINAL assume true; 81546#factEXIT >#66#return; 81545#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81544#factFINAL assume true; 81542#factEXIT >#66#return; 81520#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81536#factFINAL assume true; 81514#factEXIT >#66#return; 81512#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 81510#factFINAL assume true; 81502#factEXIT >#78#return; 81509#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; 81484#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 81485#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 81481#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 80409#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 80410#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 80999#L42-3 [2022-11-02 20:45:08,922 INFO L750 eck$LassoCheckResult]: Loop: 80999#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 80413#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; 80379#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 80380#factENTRY ~n := #in~n; 80444#L25 assume !(~n <= 0); 80440#L26 call #t~ret0 := fact(~n - 1);< 80443#factENTRY ~n := #in~n; 80448#L25 assume !(~n <= 0); 80441#L26 call #t~ret0 := fact(~n - 1);< 80447#factENTRY ~n := #in~n; 80448#L25 assume !(~n <= 0); 80441#L26 call #t~ret0 := fact(~n - 1);< 80447#factENTRY ~n := #in~n; 80449#L25 assume ~n <= 0;#res := 1; 80457#factFINAL assume true; 80456#factEXIT >#66#return; 80455#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80454#factFINAL assume true; 80453#factEXIT >#66#return; 80442#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80446#factFINAL assume true; 80439#factEXIT >#66#return; 80438#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80437#factFINAL assume true; 80436#factEXIT >#68#return; 80424#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 80425#factENTRY ~n := #in~n; 80572#L25 assume ~n <= 0;#res := 1; 80571#factFINAL assume true; 80569#factEXIT >#70#return; 80520#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 80529#factENTRY ~n := #in~n; 80591#L25 assume !(~n <= 0); 80537#L26 call #t~ret0 := fact(~n - 1);< 80590#factENTRY ~n := #in~n; 80589#L25 assume !(~n <= 0); 80538#L26 call #t~ret0 := fact(~n - 1);< 80544#factENTRY ~n := #in~n; 80566#L25 assume !(~n <= 0); 80540#L26 call #t~ret0 := fact(~n - 1);< 80579#factENTRY ~n := #in~n; 80585#L25 assume ~n <= 0;#res := 1; 80581#factFINAL assume true; 80578#factEXIT >#66#return; 80575#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80574#factFINAL assume true; 80573#factEXIT >#66#return; 80542#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80592#factFINAL assume true; 80535#factEXIT >#66#return; 80532#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80528#factFINAL assume true; 80518#factEXIT >#72#return; 80526#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; 80561#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 80559#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 80555#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 80553#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; 80524#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 80527#factENTRY ~n := #in~n; 80594#L25 assume !(~n <= 0); 80536#L26 call #t~ret0 := fact(~n - 1);< 80544#factENTRY ~n := #in~n; 80566#L25 assume !(~n <= 0); 80540#L26 call #t~ret0 := fact(~n - 1);< 80579#factENTRY ~n := #in~n; 80566#L25 assume !(~n <= 0); 80540#L26 call #t~ret0 := fact(~n - 1);< 80579#factENTRY ~n := #in~n; 80585#L25 assume ~n <= 0;#res := 1; 80581#factFINAL assume true; 80578#factEXIT >#66#return; 80575#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80574#factFINAL assume true; 80573#factEXIT >#66#return; 80542#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80592#factFINAL assume true; 80535#factEXIT >#66#return; 80532#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80528#factFINAL assume true; 80518#factEXIT >#68#return; 80507#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 80510#factENTRY ~n := #in~n; 80563#L25 assume !(~n <= 0); 80539#L26 call #t~ret0 := fact(~n - 1);< 80558#factENTRY ~n := #in~n; 80565#L25 assume ~n <= 0;#res := 1; 80562#factFINAL assume true; 80556#factEXIT >#66#return; 80557#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80567#factFINAL assume true; 80546#factEXIT >#70#return; 80509#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 80530#factENTRY ~n := #in~n; 80560#L25 assume !(~n <= 0); 80541#L26 call #t~ret0 := fact(~n - 1);< 80558#factENTRY ~n := #in~n; 80565#L25 assume ~n <= 0;#res := 1; 80562#factFINAL assume true; 80556#factEXIT >#66#return; 80554#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80552#factFINAL assume true; 80551#factEXIT >#72#return; 80550#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; 80549#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 80548#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 80534#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 80531#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; 80465#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 80527#factENTRY ~n := #in~n; 80594#L25 assume !(~n <= 0); 80536#L26 call #t~ret0 := fact(~n - 1);< 80544#factENTRY ~n := #in~n; 80566#L25 assume !(~n <= 0); 80540#L26 call #t~ret0 := fact(~n - 1);< 80579#factENTRY ~n := #in~n; 80566#L25 assume !(~n <= 0); 80540#L26 call #t~ret0 := fact(~n - 1);< 80579#factENTRY ~n := #in~n; 80585#L25 assume ~n <= 0;#res := 1; 80581#factFINAL assume true; 80578#factEXIT >#66#return; 80575#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80574#factFINAL assume true; 80573#factEXIT >#66#return; 80542#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80592#factFINAL assume true; 80535#factEXIT >#66#return; 80532#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80528#factFINAL assume true; 80518#factEXIT >#68#return; 80506#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 80510#factENTRY ~n := #in~n; 80563#L25 assume !(~n <= 0); 80539#L26 call #t~ret0 := fact(~n - 1);< 80558#factENTRY ~n := #in~n; 80566#L25 assume !(~n <= 0); 80540#L26 call #t~ret0 := fact(~n - 1);< 80579#factENTRY ~n := #in~n; 80585#L25 assume ~n <= 0;#res := 1; 80581#factFINAL assume true; 80578#factEXIT >#66#return; 80575#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80574#factFINAL assume true; 80573#factEXIT >#66#return; 80543#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80576#factFINAL assume true; 80505#factEXIT >#70#return; 80498#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 80499#factENTRY ~n := #in~n; 80504#L25 assume ~n <= 0;#res := 1; 80503#factFINAL assume true; 80497#factEXIT >#72#return; 80494#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; 80476#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 80475#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 80468#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 80464#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; 80462#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 80364#factENTRY ~n := #in~n; 80491#L25 assume !(~n <= 0); 80471#L26 call #t~ret0 := fact(~n - 1);< 80474#factENTRY ~n := #in~n; 80483#L25 assume !(~n <= 0); 80472#L26 call #t~ret0 := fact(~n - 1);< 80481#factENTRY ~n := #in~n; 80483#L25 assume !(~n <= 0); 80472#L26 call #t~ret0 := fact(~n - 1);< 80481#factENTRY ~n := #in~n; 80485#L25 assume ~n <= 0;#res := 1; 80517#factFINAL assume true; 80515#factEXIT >#66#return; 80513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80512#factFINAL assume true; 80501#factEXIT >#66#return; 80473#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80480#factFINAL assume true; 80469#factEXIT >#66#return; 80467#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80463#factFINAL assume true; 80461#factEXIT >#74#return; 80459#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 80429#factENTRY ~n := #in~n; 80487#L25 assume !(~n <= 0); 80470#L26 call #t~ret0 := fact(~n - 1);< 80502#factENTRY ~n := #in~n; 80483#L25 assume !(~n <= 0); 80472#L26 call #t~ret0 := fact(~n - 1);< 80481#factENTRY ~n := #in~n; 80485#L25 assume ~n <= 0;#res := 1; 80517#factFINAL assume true; 80515#factEXIT >#66#return; 80513#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80512#factFINAL assume true; 80501#factEXIT >#66#return; 80496#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80493#factFINAL assume true; 80458#factEXIT >#76#return; 80451#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 80452#factENTRY ~n := #in~n; 80597#L25 assume !(~n <= 0); 80386#L26 call #t~ret0 := fact(~n - 1);< 80385#factENTRY ~n := #in~n; 80387#L25 assume ~n <= 0;#res := 1; 80422#factFINAL assume true; 80621#factEXIT >#66#return; 80617#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 80607#factFINAL assume true; 80450#factEXIT >#78#return; 80445#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; 80397#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 80398#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 80432#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 80407#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 80408#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 80999#L42-3 [2022-11-02 20:45:08,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:08,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1711259888, now seen corresponding path program 16 times [2022-11-02 20:45:08,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:08,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247367404] [2022-11-02 20:45:08,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:08,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:08,936 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:45:08,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [98435705] [2022-11-02 20:45:08,937 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:45:08,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:08,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:08,939 INFO L229 MonitoredProcess]: Starting monitored process 187 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:08,961 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (187)] Waiting until timeout for monitored process [2022-11-02 20:45:09,123 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:45:09,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:45:09,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:45:09,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 1114 proven. 8 refuted. 0 times theorem prover too weak. 4598 trivial. 0 not checked. [2022-11-02 20:45:09,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:09,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 240 proven. 20 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2022-11-02 20:45:09,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:09,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247367404] [2022-11-02 20:45:09,676 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:45:09,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98435705] [2022-11-02 20:45:09,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98435705] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:09,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:45:09,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-11-02 20:45:09,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063934057] [2022-11-02 20:45:09,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:09,678 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:45:09,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:09,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1510121358, now seen corresponding path program 17 times [2022-11-02 20:45:09,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:09,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069250724] [2022-11-02 20:45:09,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:09,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:09,687 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:45:09,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [413621640] [2022-11-02 20:45:09,687 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 20:45:09,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:09,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:09,707 INFO L229 MonitoredProcess]: Starting monitored process 188 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:09,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (188)] Waiting until timeout for monitored process [2022-11-02 20:45:09,838 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2022-11-02 20:45:09,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:45:09,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 20:45:09,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:10,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2743 backedges. 1701 proven. 59 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2022-11-02 20:45:10,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2743 backedges. 303 proven. 534 refuted. 0 times theorem prover too weak. 1906 trivial. 0 not checked. [2022-11-02 20:45:11,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:11,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069250724] [2022-11-02 20:45:11,737 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:45:11,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413621640] [2022-11-02 20:45:11,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413621640] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:11,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:45:11,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 17 [2022-11-02 20:45:11,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80238642] [2022-11-02 20:45:11,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:11,738 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:45:11,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:11,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 20:45:11,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:45:11,739 INFO L87 Difference]: Start difference. First operand 1345 states and 1795 transitions. cyclomatic complexity: 471 Second operand has 17 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 11 states have call successors, (26), 2 states have call predecessors, (26), 7 states have return successors, (29), 9 states have call predecessors, (29), 11 states have call successors, (29) [2022-11-02 20:45:12,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:12,753 INFO L93 Difference]: Finished difference Result 1551 states and 2068 transitions. [2022-11-02 20:45:12,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1551 states and 2068 transitions. [2022-11-02 20:45:12,762 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2022-11-02 20:45:12,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1551 states to 1414 states and 1861 transitions. [2022-11-02 20:45:12,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2022-11-02 20:45:12,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2022-11-02 20:45:12,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1414 states and 1861 transitions. [2022-11-02 20:45:12,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:45:12,775 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1414 states and 1861 transitions. [2022-11-02 20:45:12,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states and 1861 transitions. [2022-11-02 20:45:12,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1135. [2022-11-02 20:45:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 744 states have (on average 1.075268817204301) internal successors, (800), 753 states have internal predecessors, (800), 248 states have call successors, (248), 138 states have call predecessors, (248), 143 states have return successors, (394), 243 states have call predecessors, (394), 248 states have call successors, (394) [2022-11-02 20:45:12,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1442 transitions. [2022-11-02 20:45:12,808 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1135 states and 1442 transitions. [2022-11-02 20:45:12,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:45:12,809 INFO L428 stractBuchiCegarLoop]: Abstraction has 1135 states and 1442 transitions. [2022-11-02 20:45:12,809 INFO L335 stractBuchiCegarLoop]: ======== Iteration 29 ============ [2022-11-02 20:45:12,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1135 states and 1442 transitions. [2022-11-02 20:45:12,814 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2022-11-02 20:45:12,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:45:12,814 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:45:12,817 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [50, 50, 26, 26, 26, 26, 24, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-02 20:45:12,817 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [45, 45, 30, 30, 30, 30, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:12,818 INFO L748 eck$LassoCheckResult]: Stem: 86596#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 86571#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; 86572#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 86595#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; 86583#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 86584#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 86975#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; 86971#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 86972#factENTRY ~n := #in~n; 86976#L25 assume ~n <= 0;#res := 1; 86974#factFINAL assume true; 86970#factEXIT >#68#return; 86966#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 86967#factENTRY ~n := #in~n; 86973#L25 assume ~n <= 0;#res := 1; 86969#factFINAL assume true; 86965#factEXIT >#70#return; 86962#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 86963#factENTRY ~n := #in~n; 86968#L25 assume ~n <= 0;#res := 1; 86964#factFINAL assume true; 86961#factEXIT >#72#return; 86958#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; 86956#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 86952#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 86949#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 86946#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; 86940#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 86941#factENTRY ~n := #in~n; 86959#L25 assume !(~n <= 0); 86954#L26 call #t~ret0 := fact(~n - 1);< 86955#factENTRY ~n := #in~n; 86960#L25 assume ~n <= 0;#res := 1; 86957#factFINAL assume true; 86953#factEXIT >#66#return; 86951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86945#factFINAL assume true; 86939#factEXIT >#74#return; 86936#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 86937#factENTRY ~n := #in~n; 86978#L25 assume ~n <= 0;#res := 1; 86977#factFINAL assume true; 86935#factEXIT >#76#return; 86932#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 86933#factENTRY ~n := #in~n; 86948#L25 assume !(~n <= 0); 86943#L26 call #t~ret0 := fact(~n - 1);< 86944#factENTRY ~n := #in~n; 86950#L25 assume ~n <= 0;#res := 1; 86947#factFINAL assume true; 86942#factEXIT >#66#return; 86938#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86934#factFINAL assume true; 86931#factEXIT >#78#return; 86930#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; 86929#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 86928#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 86927#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 86926#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; 86913#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 86920#factENTRY ~n := #in~n; 86990#L25 assume !(~n <= 0); 86982#L26 call #t~ret0 := fact(~n - 1);< 86987#factENTRY ~n := #in~n; 87514#L25 assume !(~n <= 0); 86984#L26 call #t~ret0 := fact(~n - 1);< 87537#factENTRY ~n := #in~n; 87539#L25 assume ~n <= 0;#res := 1; 87538#factFINAL assume true; 87535#factEXIT >#66#return; 87536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87540#factFINAL assume true; 86981#factEXIT >#66#return; 86986#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86918#factFINAL assume true; 86919#factEXIT >#74#return; 86922#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 86923#factENTRY ~n := #in~n; 86925#L25 assume ~n <= 0;#res := 1; 86924#factFINAL assume true; 86921#factEXIT >#76#return; 86914#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 86920#factENTRY ~n := #in~n; 86990#L25 assume !(~n <= 0); 86982#L26 call #t~ret0 := fact(~n - 1);< 86987#factENTRY ~n := #in~n; 87514#L25 assume !(~n <= 0); 86984#L26 call #t~ret0 := fact(~n - 1);< 87537#factENTRY ~n := #in~n; 87539#L25 assume ~n <= 0;#res := 1; 87538#factFINAL assume true; 87535#factEXIT >#66#return; 87536#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87540#factFINAL assume true; 86981#factEXIT >#66#return; 86986#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86918#factFINAL assume true; 86919#factEXIT >#78#return; 86911#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; 86906#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 86905#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 86900#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 86807#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; 86790#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 86806#factENTRY ~n := #in~n; 86817#L25 assume !(~n <= 0); 86814#L26 call #t~ret0 := fact(~n - 1);< 86820#factENTRY ~n := #in~n; 86821#L25 assume !(~n <= 0); 86811#L26 call #t~ret0 := fact(~n - 1);< 86827#factENTRY ~n := #in~n; 86821#L25 assume !(~n <= 0); 86811#L26 call #t~ret0 := fact(~n - 1);< 86827#factENTRY ~n := #in~n; 86829#L25 assume ~n <= 0;#res := 1; 86828#factFINAL assume true; 86826#factEXIT >#66#return; 86825#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86824#factFINAL assume true; 86823#factEXIT >#66#return; 86815#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86819#factFINAL assume true; 86810#factEXIT >#66#return; 86809#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86805#factFINAL assume true; 86789#factEXIT >#74#return; 86792#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 86908#factENTRY ~n := #in~n; 86910#L25 assume ~n <= 0;#res := 1; 86909#factFINAL assume true; 86907#factEXIT >#76#return; 86791#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 86794#factENTRY ~n := #in~n; 86818#L25 assume !(~n <= 0); 86812#L26 call #t~ret0 := fact(~n - 1);< 86816#factENTRY ~n := #in~n; 86822#L25 assume !(~n <= 0); 86813#L26 call #t~ret0 := fact(~n - 1);< 86820#factENTRY ~n := #in~n; 86821#L25 assume !(~n <= 0); 86811#L26 call #t~ret0 := fact(~n - 1);< 86827#factENTRY ~n := #in~n; 86829#L25 assume ~n <= 0;#res := 1; 86828#factFINAL assume true; 86826#factEXIT >#66#return; 86825#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86824#factFINAL assume true; 86823#factEXIT >#66#return; 86815#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86819#factFINAL assume true; 86810#factEXIT >#66#return; 86809#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86805#factFINAL assume true; 86789#factEXIT >#78#return; 86793#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; 86785#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 86786#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 86781#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 86782#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 86777#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 86601#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 86602#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; 87601#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 87616#factENTRY ~n := #in~n; 87625#L25 assume !(~n <= 0); 87619#L26 call #t~ret0 := fact(~n - 1);< 87620#factENTRY ~n := #in~n; 87624#L25 assume ~n <= 0;#res := 1; 87622#factFINAL assume true; 87618#factEXIT >#66#return; 87617#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87600#factFINAL assume true; 87602#factEXIT >#68#return; 87607#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 87608#factENTRY ~n := #in~n; 87610#L25 assume ~n <= 0;#res := 1; 87609#factFINAL assume true; 87606#factEXIT >#70#return; 87597#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 87603#factENTRY ~n := #in~n; 87627#L25 assume !(~n <= 0); 86559#L26 call #t~ret0 := fact(~n - 1);< 87669#factENTRY ~n := #in~n; 87626#L25 assume ~n <= 0;#res := 1; 87621#factFINAL assume true; 87611#factEXIT >#66#return; 87604#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87605#factFINAL assume true; 87596#factEXIT >#72#return; 87599#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; 86589#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 86590#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 87638#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 87636#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; 86555#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 86556#factENTRY ~n := #in~n; 87643#L25 assume !(~n <= 0); 86559#L26 call #t~ret0 := fact(~n - 1);< 87669#factENTRY ~n := #in~n; 87626#L25 assume ~n <= 0;#res := 1; 87621#factFINAL assume true; 87611#factEXIT >#66#return; 87604#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87605#factFINAL assume true; 87596#factEXIT >#68#return; 86609#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 86610#factENTRY ~n := #in~n; 87623#L25 assume !(~n <= 0); 87612#L26 call #t~ret0 := fact(~n - 1);< 87615#factENTRY ~n := #in~n; 87626#L25 assume ~n <= 0;#res := 1; 87621#factFINAL assume true; 87611#factEXIT >#66#return; 87614#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87635#factFINAL assume true; 87634#factEXIT >#70#return; 86544#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 86545#factENTRY ~n := #in~n; 87644#L25 assume ~n <= 0;#res := 1; 87642#factFINAL assume true; 87640#factEXIT >#72#return; 86587#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; 86588#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 87639#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 87637#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 86598#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; 86542#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 86543#factENTRY ~n := #in~n; 86569#L25 assume !(~n <= 0); 86561#L26 call #t~ret0 := fact(~n - 1);< 87654#factENTRY ~n := #in~n; 87660#L25 assume !(~n <= 0); 86562#L26 call #t~ret0 := fact(~n - 1);< 87658#factENTRY ~n := #in~n; 87661#L25 assume ~n <= 0;#res := 1; 87659#factFINAL assume true; 87657#factEXIT >#66#return; 87656#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87655#factFINAL assume true; 87653#factEXIT >#66#return; 87652#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87651#factFINAL assume true; 87650#factEXIT >#74#return; 86613#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 86614#factENTRY ~n := #in~n; 87671#L25 assume !(~n <= 0); 87613#L26 call #t~ret0 := fact(~n - 1);< 87615#factENTRY ~n := #in~n; 87626#L25 assume ~n <= 0;#res := 1; 87621#factFINAL assume true; 87611#factEXIT >#66#return; 87604#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87605#factFINAL assume true; 87596#factEXIT >#76#return; 86551#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 86616#factENTRY ~n := #in~n; 87663#L25 assume !(~n <= 0); 86579#L26 call #t~ret0 := fact(~n - 1);< 86580#factENTRY ~n := #in~n; 87666#L25 assume ~n <= 0;#res := 1; 87664#factFINAL assume true; 87665#factEXIT >#66#return; 87667#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87668#factFINAL assume true; 86550#factEXIT >#78#return; 86552#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; 87674#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 87673#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 87672#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 87556#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; 87553#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 87555#factENTRY ~n := #in~n; 87593#L25 assume !(~n <= 0); 87568#L26 call #t~ret0 := fact(~n - 1);< 87572#factENTRY ~n := #in~n; 87586#L25 assume !(~n <= 0); 87569#L26 call #t~ret0 := fact(~n - 1);< 87583#factENTRY ~n := #in~n; 87586#L25 assume !(~n <= 0); 87569#L26 call #t~ret0 := fact(~n - 1);< 87583#factENTRY ~n := #in~n; 87588#L25 assume ~n <= 0;#res := 1; 87587#factFINAL assume true; 87582#factEXIT >#66#return; 87580#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87578#factFINAL assume true; 87573#factEXIT >#66#return; 87571#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87595#factFINAL assume true; 87565#factEXIT >#66#return; 87562#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87552#factFINAL assume true; 87554#factEXIT >#74#return; 87558#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 87559#factENTRY ~n := #in~n; 87576#L25 assume ~n <= 0;#res := 1; 87574#factFINAL assume true; 87557#factEXIT >#76#return; 87548#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 87549#factENTRY ~n := #in~n; 87594#L25 assume !(~n <= 0); 87566#L26 call #t~ret0 := fact(~n - 1);< 87591#factENTRY ~n := #in~n; 87589#L25 assume !(~n <= 0); 87570#L26 call #t~ret0 := fact(~n - 1);< 87572#factENTRY ~n := #in~n; 87586#L25 assume !(~n <= 0); 87569#L26 call #t~ret0 := fact(~n - 1);< 87583#factENTRY ~n := #in~n; 87588#L25 assume ~n <= 0;#res := 1; 87587#factFINAL assume true; 87582#factEXIT >#66#return; 87580#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87578#factFINAL assume true; 87573#factEXIT >#66#return; 87571#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87595#factFINAL assume true; 87565#factEXIT >#66#return; 87562#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 87552#factFINAL assume true; 87554#factEXIT >#78#return; 87546#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; 87633#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 87632#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 87631#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 87630#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 87629#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 86776#L42-3 [2022-11-02 20:45:12,819 INFO L750 eck$LassoCheckResult]: Loop: 86776#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 86597#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; 86553#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 86554#factENTRY ~n := #in~n; 86622#L25 assume !(~n <= 0); 86548#L26 call #t~ret0 := fact(~n - 1);< 86621#factENTRY ~n := #in~n; 86756#L25 assume !(~n <= 0); 86547#L26 call #t~ret0 := fact(~n - 1);< 86755#factENTRY ~n := #in~n; 86756#L25 assume !(~n <= 0); 86547#L26 call #t~ret0 := fact(~n - 1);< 86755#factENTRY ~n := #in~n; 86605#L25 assume ~n <= 0;#res := 1; 86606#factFINAL assume true; 86774#factEXIT >#66#return; 86773#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86557#factFINAL assume true; 86546#factEXIT >#66#return; 86549#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86599#factFINAL assume true; 86620#factEXIT >#66#return; 86619#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86618#factFINAL assume true; 86617#factEXIT >#68#return; 86607#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 86608#factENTRY ~n := #in~n; 86734#L25 assume ~n <= 0;#res := 1; 86733#factFINAL assume true; 86725#factEXIT >#70#return; 86669#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 86682#factENTRY ~n := #in~n; 86719#L25 assume !(~n <= 0); 86690#L26 call #t~ret0 := fact(~n - 1);< 86775#factENTRY ~n := #in~n; 86749#L25 assume !(~n <= 0); 86691#L26 call #t~ret0 := fact(~n - 1);< 86696#factENTRY ~n := #in~n; 86732#L25 assume !(~n <= 0); 86693#L26 call #t~ret0 := fact(~n - 1);< 86759#factENTRY ~n := #in~n; 86761#L25 assume ~n <= 0;#res := 1; 86760#factFINAL assume true; 86758#factEXIT >#66#return; 86757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86705#factFINAL assume true; 86703#factEXIT >#66#return; 86694#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86699#factFINAL assume true; 86686#factEXIT >#66#return; 86685#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86681#factFINAL assume true; 86667#factEXIT >#72#return; 86676#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; 86772#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 86771#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 86770#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 86769#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; 86674#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 86680#factENTRY ~n := #in~n; 86721#L25 assume !(~n <= 0); 86687#L26 call #t~ret0 := fact(~n - 1);< 86696#factENTRY ~n := #in~n; 86732#L25 assume !(~n <= 0); 86693#L26 call #t~ret0 := fact(~n - 1);< 86759#factENTRY ~n := #in~n; 86732#L25 assume !(~n <= 0); 86693#L26 call #t~ret0 := fact(~n - 1);< 86759#factENTRY ~n := #in~n; 86761#L25 assume ~n <= 0;#res := 1; 86760#factFINAL assume true; 86758#factEXIT >#66#return; 86757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86705#factFINAL assume true; 86703#factEXIT >#66#return; 86694#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86699#factFINAL assume true; 86686#factEXIT >#66#return; 86685#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86681#factFINAL assume true; 86667#factEXIT >#68#return; 86661#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 86665#factENTRY ~n := #in~n; 86711#L25 assume !(~n <= 0); 86692#L26 call #t~ret0 := fact(~n - 1);< 86700#factENTRY ~n := #in~n; 86731#L25 assume ~n <= 0;#res := 1; 86729#factFINAL assume true; 86727#factEXIT >#66#return; 86724#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86722#factFINAL assume true; 86718#factEXIT >#70#return; 86671#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 86717#factENTRY ~n := #in~n; 86748#L25 assume !(~n <= 0); 86689#L26 call #t~ret0 := fact(~n - 1);< 86696#factENTRY ~n := #in~n; 86732#L25 assume !(~n <= 0); 86693#L26 call #t~ret0 := fact(~n - 1);< 86759#factENTRY ~n := #in~n; 86732#L25 assume !(~n <= 0); 86693#L26 call #t~ret0 := fact(~n - 1);< 86759#factENTRY ~n := #in~n; 86761#L25 assume ~n <= 0;#res := 1; 86760#factFINAL assume true; 86758#factEXIT >#66#return; 86757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86705#factFINAL assume true; 86703#factEXIT >#66#return; 86694#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86699#factFINAL assume true; 86686#factEXIT >#66#return; 86685#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86681#factFINAL assume true; 86667#factEXIT >#72#return; 86678#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; 86754#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 86753#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 86750#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 86723#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; 86673#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 86680#factENTRY ~n := #in~n; 86721#L25 assume !(~n <= 0); 86687#L26 call #t~ret0 := fact(~n - 1);< 86696#factENTRY ~n := #in~n; 86732#L25 assume !(~n <= 0); 86693#L26 call #t~ret0 := fact(~n - 1);< 86759#factENTRY ~n := #in~n; 86732#L25 assume !(~n <= 0); 86693#L26 call #t~ret0 := fact(~n - 1);< 86759#factENTRY ~n := #in~n; 86761#L25 assume ~n <= 0;#res := 1; 86760#factFINAL assume true; 86758#factEXIT >#66#return; 86757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86705#factFINAL assume true; 86703#factEXIT >#66#return; 86694#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86699#factFINAL assume true; 86686#factEXIT >#66#return; 86685#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86681#factFINAL assume true; 86667#factEXIT >#68#return; 86662#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 86665#factENTRY ~n := #in~n; 86711#L25 assume !(~n <= 0); 86692#L26 call #t~ret0 := fact(~n - 1);< 86700#factENTRY ~n := #in~n; 86732#L25 assume !(~n <= 0); 86693#L26 call #t~ret0 := fact(~n - 1);< 86759#factENTRY ~n := #in~n; 86761#L25 assume ~n <= 0;#res := 1; 86760#factFINAL assume true; 86758#factEXIT >#66#return; 86757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86705#factFINAL assume true; 86703#factEXIT >#66#return; 86695#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86752#factFINAL assume true; 86660#factEXIT >#70#return; 86664#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 86683#factENTRY ~n := #in~n; 86730#L25 assume !(~n <= 0); 86688#L26 call #t~ret0 := fact(~n - 1);< 86700#factENTRY ~n := #in~n; 86731#L25 assume ~n <= 0;#res := 1; 86729#factFINAL assume true; 86727#factEXIT >#66#return; 86728#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86751#factFINAL assume true; 86707#factEXIT >#72#return; 86708#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; 86764#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 86762#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 86710#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 86684#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; 86639#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 86680#factENTRY ~n := #in~n; 86721#L25 assume !(~n <= 0); 86687#L26 call #t~ret0 := fact(~n - 1);< 86696#factENTRY ~n := #in~n; 86732#L25 assume !(~n <= 0); 86693#L26 call #t~ret0 := fact(~n - 1);< 86759#factENTRY ~n := #in~n; 86732#L25 assume !(~n <= 0); 86693#L26 call #t~ret0 := fact(~n - 1);< 86759#factENTRY ~n := #in~n; 86761#L25 assume ~n <= 0;#res := 1; 86760#factFINAL assume true; 86758#factEXIT >#66#return; 86757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86705#factFINAL assume true; 86703#factEXIT >#66#return; 86694#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86699#factFINAL assume true; 86686#factEXIT >#66#return; 86685#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86681#factFINAL assume true; 86667#factEXIT >#68#return; 86663#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 86665#factENTRY ~n := #in~n; 86711#L25 assume !(~n <= 0); 86692#L26 call #t~ret0 := fact(~n - 1);< 86700#factENTRY ~n := #in~n; 86732#L25 assume !(~n <= 0); 86693#L26 call #t~ret0 := fact(~n - 1);< 86759#factENTRY ~n := #in~n; 86761#L25 assume ~n <= 0;#res := 1; 86760#factFINAL assume true; 86758#factEXIT >#66#return; 86757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86705#factFINAL assume true; 86703#factEXIT >#66#return; 86695#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86752#factFINAL assume true; 86660#factEXIT >#70#return; 86657#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 86658#factENTRY ~n := #in~n; 86666#L25 assume ~n <= 0;#res := 1; 86659#factFINAL assume true; 86656#factEXIT >#72#return; 86655#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; 86653#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 86651#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 86643#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 86638#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; 86625#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 86541#factENTRY ~n := #in~n; 86654#L25 assume !(~n <= 0); 86631#L26 call #t~ret0 := fact(~n - 1);< 86635#factENTRY ~n := #in~n; 86646#L25 assume !(~n <= 0); 86632#L26 call #t~ret0 := fact(~n - 1);< 86645#factENTRY ~n := #in~n; 86646#L25 assume !(~n <= 0); 86632#L26 call #t~ret0 := fact(~n - 1);< 86645#factENTRY ~n := #in~n; 86648#L25 assume ~n <= 0;#res := 1; 86652#factFINAL assume true; 86649#factEXIT >#66#return; 86647#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86644#factFINAL assume true; 86641#factEXIT >#66#return; 86634#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86720#factFINAL assume true; 86630#factEXIT >#66#return; 86628#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86627#factFINAL assume true; 86623#factEXIT >#74#return; 86624#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 86612#factENTRY ~n := #in~n; 86650#L25 assume !(~n <= 0); 86633#L26 call #t~ret0 := fact(~n - 1);< 86642#factENTRY ~n := #in~n; 86646#L25 assume !(~n <= 0); 86632#L26 call #t~ret0 := fact(~n - 1);< 86645#factENTRY ~n := #in~n; 86648#L25 assume ~n <= 0;#res := 1; 86652#factFINAL assume true; 86649#factEXIT >#66#return; 86647#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86644#factFINAL assume true; 86641#factEXIT >#66#return; 86637#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86636#factFINAL assume true; 86629#factEXIT >#76#return; 86566#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 86565#factENTRY ~n := #in~n; 86567#L25 assume !(~n <= 0); 86577#L26 call #t~ret0 := fact(~n - 1);< 86578#factENTRY ~n := #in~n; 86768#L25 assume ~n <= 0;#res := 1; 86767#factFINAL assume true; 86766#factEXIT >#66#return; 86765#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 86763#factFINAL assume true; 86714#factEXIT >#78#return; 86573#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; 86574#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 86581#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 86615#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 86591#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 86592#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 86776#L42-3 [2022-11-02 20:45:12,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:12,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1711259888, now seen corresponding path program 17 times [2022-11-02 20:45:12,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:12,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311091401] [2022-11-02 20:45:12,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:12,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:12,849 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:45:12,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2039808997] [2022-11-02 20:45:12,850 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 20:45:12,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:12,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:12,857 INFO L229 MonitoredProcess]: Starting monitored process 189 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:12,880 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (189)] Waiting until timeout for monitored process [2022-11-02 20:45:13,191 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-11-02 20:45:13,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:45:13,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-02 20:45:13,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 1225 proven. 81 refuted. 0 times theorem prover too weak. 4414 trivial. 0 not checked. [2022-11-02 20:45:13,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:14,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 354 proven. 108 refuted. 0 times theorem prover too weak. 5258 trivial. 0 not checked. [2022-11-02 20:45:14,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:14,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311091401] [2022-11-02 20:45:14,181 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:45:14,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039808997] [2022-11-02 20:45:14,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039808997] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:14,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:45:14,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2022-11-02 20:45:14,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647965747] [2022-11-02 20:45:14,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:14,182 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:45:14,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:14,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1910755023, now seen corresponding path program 18 times [2022-11-02 20:45:14,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:14,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830029347] [2022-11-02 20:45:14,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:14,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:14,193 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:45:14,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [754446882] [2022-11-02 20:45:14,194 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-02 20:45:14,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:14,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:14,201 INFO L229 MonitoredProcess]: Starting monitored process 190 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:14,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (190)] Waiting until timeout for monitored process [2022-11-02 20:45:14,366 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2022-11-02 20:45:14,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:45:14,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-02 20:45:14,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 4895 backedges. 938 proven. 263 refuted. 0 times theorem prover too weak. 3694 trivial. 0 not checked. [2022-11-02 20:45:14,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:18,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4895 backedges. 936 proven. 278 refuted. 0 times theorem prover too weak. 3681 trivial. 0 not checked. [2022-11-02 20:45:18,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:18,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830029347] [2022-11-02 20:45:18,194 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:45:18,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754446882] [2022-11-02 20:45:18,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754446882] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:18,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:45:18,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22] total 30 [2022-11-02 20:45:18,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856480382] [2022-11-02 20:45:18,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:18,196 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:45:18,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:18,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-02 20:45:18,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2022-11-02 20:45:18,202 INFO L87 Difference]: Start difference. First operand 1135 states and 1442 transitions. cyclomatic complexity: 324 Second operand has 31 states, 26 states have (on average 2.423076923076923) internal successors, (63), 31 states have internal predecessors, (63), 16 states have call successors, (22), 1 states have call predecessors, (22), 8 states have return successors, (25), 10 states have call predecessors, (25), 16 states have call successors, (25) [2022-11-02 20:45:23,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:23,262 INFO L93 Difference]: Finished difference Result 1746 states and 2703 transitions. [2022-11-02 20:45:23,262 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1746 states and 2703 transitions. [2022-11-02 20:45:23,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 139 [2022-11-02 20:45:23,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1746 states to 1716 states and 2629 transitions. [2022-11-02 20:45:23,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2022-11-02 20:45:23,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2022-11-02 20:45:23,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1716 states and 2629 transitions. [2022-11-02 20:45:23,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:45:23,299 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1716 states and 2629 transitions. [2022-11-02 20:45:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states and 2629 transitions. [2022-11-02 20:45:23,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1193. [2022-11-02 20:45:23,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 778 states have (on average 1.0784061696658098) internal successors, (839), 789 states have internal predecessors, (839), 269 states have call successors, (269), 138 states have call predecessors, (269), 146 states have return successors, (444), 265 states have call predecessors, (444), 269 states have call successors, (444) [2022-11-02 20:45:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1552 transitions. [2022-11-02 20:45:23,358 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1193 states and 1552 transitions. [2022-11-02 20:45:23,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-02 20:45:23,360 INFO L428 stractBuchiCegarLoop]: Abstraction has 1193 states and 1552 transitions. [2022-11-02 20:45:23,360 INFO L335 stractBuchiCegarLoop]: ======== Iteration 30 ============ [2022-11-02 20:45:23,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1193 states and 1552 transitions. [2022-11-02 20:45:23,365 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2022-11-02 20:45:23,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:45:23,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:45:23,369 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [50, 50, 26, 26, 26, 26, 24, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-02 20:45:23,369 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [48, 48, 33, 33, 33, 33, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:23,370 INFO L748 eck$LassoCheckResult]: Stem: 93206#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 93182#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; 93183#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 93205#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; 93193#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 93194#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 93434#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; 93430#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 93431#factENTRY ~n := #in~n; 93435#L25 assume ~n <= 0;#res := 1; 93433#factFINAL assume true; 93429#factEXIT >#68#return; 93425#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 93426#factENTRY ~n := #in~n; 93432#L25 assume ~n <= 0;#res := 1; 93428#factFINAL assume true; 93424#factEXIT >#70#return; 93421#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 93422#factENTRY ~n := #in~n; 93427#L25 assume ~n <= 0;#res := 1; 93423#factFINAL assume true; 93420#factEXIT >#72#return; 93418#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; 93417#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 93414#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 93410#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 93409#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; 93398#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 93399#factENTRY ~n := #in~n; 93419#L25 assume !(~n <= 0); 93407#L26 call #t~ret0 := fact(~n - 1);< 93408#factENTRY ~n := #in~n; 93416#L25 assume ~n <= 0;#res := 1; 93413#factFINAL assume true; 93406#factEXIT >#66#return; 93405#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93404#factFINAL assume true; 93397#factEXIT >#74#return; 93393#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 93394#factENTRY ~n := #in~n; 93403#L25 assume ~n <= 0;#res := 1; 93396#factFINAL assume true; 93392#factEXIT >#76#return; 93389#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 93390#factENTRY ~n := #in~n; 93412#L25 assume !(~n <= 0); 93401#L26 call #t~ret0 := fact(~n - 1);< 93402#factENTRY ~n := #in~n; 93415#L25 assume ~n <= 0;#res := 1; 93411#factFINAL assume true; 93400#factEXIT >#66#return; 93395#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93391#factFINAL assume true; 93388#factEXIT >#78#return; 93387#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; 93386#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 93385#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 93384#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 93383#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; 93347#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 93381#factENTRY ~n := #in~n; 93714#L25 assume !(~n <= 0); 93709#L26 call #t~ret0 := fact(~n - 1);< 93712#factENTRY ~n := #in~n; 94235#L25 assume !(~n <= 0); 93710#L26 call #t~ret0 := fact(~n - 1);< 94267#factENTRY ~n := #in~n; 94271#L25 assume ~n <= 0;#res := 1; 94268#factFINAL assume true; 94265#factEXIT >#66#return; 94266#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94276#factFINAL assume true; 94275#factEXIT >#66#return; 94274#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94273#factFINAL assume true; 94272#factEXIT >#74#return; 93356#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 93357#factENTRY ~n := #in~n; 93363#L25 assume ~n <= 0;#res := 1; 93361#factFINAL assume true; 93355#factEXIT >#76#return; 93348#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 93381#factENTRY ~n := #in~n; 93714#L25 assume !(~n <= 0); 93709#L26 call #t~ret0 := fact(~n - 1);< 93712#factENTRY ~n := #in~n; 94235#L25 assume !(~n <= 0); 93710#L26 call #t~ret0 := fact(~n - 1);< 94267#factENTRY ~n := #in~n; 94271#L25 assume ~n <= 0;#res := 1; 94268#factFINAL assume true; 94265#factEXIT >#66#return; 94266#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94276#factFINAL assume true; 94275#factEXIT >#66#return; 94274#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94273#factFINAL assume true; 94272#factEXIT >#78#return; 93344#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; 93342#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 93340#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 93338#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 93283#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; 93275#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 93281#factENTRY ~n := #in~n; 93450#L25 assume !(~n <= 0); 93446#L26 call #t~ret0 := fact(~n - 1);< 93448#factENTRY ~n := #in~n; 93496#L25 assume !(~n <= 0); 93445#L26 call #t~ret0 := fact(~n - 1);< 93688#factENTRY ~n := #in~n; 93496#L25 assume !(~n <= 0); 93445#L26 call #t~ret0 := fact(~n - 1);< 93688#factENTRY ~n := #in~n; 93690#L25 assume ~n <= 0;#res := 1; 93689#factFINAL assume true; 93687#factEXIT >#66#return; 93686#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93685#factFINAL assume true; 93684#factEXIT >#66#return; 93447#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93494#factFINAL assume true; 93442#factEXIT >#66#return; 93438#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93358#factFINAL assume true; 93273#factEXIT >#74#return; 93276#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 93279#factENTRY ~n := #in~n; 93282#L25 assume ~n <= 0;#res := 1; 93280#factFINAL assume true; 93278#factEXIT >#76#return; 93274#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 93277#factENTRY ~n := #in~n; 93449#L25 assume !(~n <= 0); 93443#L26 call #t~ret0 := fact(~n - 1);< 93691#factENTRY ~n := #in~n; 93495#L25 assume !(~n <= 0); 93444#L26 call #t~ret0 := fact(~n - 1);< 93448#factENTRY ~n := #in~n; 93496#L25 assume !(~n <= 0); 93445#L26 call #t~ret0 := fact(~n - 1);< 93688#factENTRY ~n := #in~n; 93690#L25 assume ~n <= 0;#res := 1; 93689#factFINAL assume true; 93687#factEXIT >#66#return; 93686#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93685#factFINAL assume true; 93684#factEXIT >#66#return; 93447#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93494#factFINAL assume true; 93442#factEXIT >#66#return; 93438#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93358#factFINAL assume true; 93273#factEXIT >#78#return; 93268#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; 93266#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 93264#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 93262#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 93260#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 93258#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 93215#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 93216#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; 93171#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 93172#factENTRY ~n := #in~n; 94125#L25 assume !(~n <= 0); 94122#L26 call #t~ret0 := fact(~n - 1);< 94123#factENTRY ~n := #in~n; 94126#L25 assume ~n <= 0;#res := 1; 94124#factFINAL assume true; 94121#factEXIT >#66#return; 94114#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94109#factFINAL assume true; 94107#factEXIT >#68#return; 94101#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94102#factENTRY ~n := #in~n; 94106#L25 assume ~n <= 0;#res := 1; 94105#factFINAL assume true; 94100#factEXIT >#70#return; 94090#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94095#factENTRY ~n := #in~n; 94213#L25 assume !(~n <= 0); 94118#L26 call #t~ret0 := fact(~n - 1);< 94205#factENTRY ~n := #in~n; 94136#L25 assume ~n <= 0;#res := 1; 94133#factFINAL assume true; 94115#factEXIT >#66#return; 94104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94097#factFINAL assume true; 94088#factEXIT >#72#return; 94086#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; 94084#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 94081#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94082#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94078#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; 94079#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94098#factENTRY ~n := #in~n; 94212#L25 assume !(~n <= 0); 94118#L26 call #t~ret0 := fact(~n - 1);< 94205#factENTRY ~n := #in~n; 94136#L25 assume ~n <= 0;#res := 1; 94133#factFINAL assume true; 94115#factEXIT >#66#return; 94104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94097#factFINAL assume true; 94088#factEXIT >#68#return; 94093#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94140#factENTRY ~n := #in~n; 94137#L25 assume !(~n <= 0); 94116#L26 call #t~ret0 := fact(~n - 1);< 94120#factENTRY ~n := #in~n; 94136#L25 assume ~n <= 0;#res := 1; 94133#factFINAL assume true; 94115#factEXIT >#66#return; 94119#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94182#factFINAL assume true; 94180#factEXIT >#70#return; 94173#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94175#factENTRY ~n := #in~n; 94185#L25 assume ~n <= 0;#res := 1; 94178#factFINAL assume true; 94172#factEXIT >#72#return; 94170#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; 94167#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 94164#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94162#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94160#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; 94128#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 94131#factENTRY ~n := #in~n; 94200#L25 assume !(~n <= 0); 94194#L26 call #t~ret0 := fact(~n - 1);< 94197#factENTRY ~n := #in~n; 94204#L25 assume !(~n <= 0); 94193#L26 call #t~ret0 := fact(~n - 1);< 94203#factENTRY ~n := #in~n; 94208#L25 assume ~n <= 0;#res := 1; 94206#factFINAL assume true; 94202#factEXIT >#66#return; 94201#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94198#factFINAL assume true; 94192#factEXIT >#66#return; 94191#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94190#factFINAL assume true; 94127#factEXIT >#74#return; 94091#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 94099#factENTRY ~n := #in~n; 94216#L25 assume !(~n <= 0); 94117#L26 call #t~ret0 := fact(~n - 1);< 94120#factENTRY ~n := #in~n; 94136#L25 assume ~n <= 0;#res := 1; 94133#factFINAL assume true; 94115#factEXIT >#66#return; 94104#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94097#factFINAL assume true; 94088#factEXIT >#76#return; 94094#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94219#factENTRY ~n := #in~n; 94227#L25 assume !(~n <= 0); 94224#L26 call #t~ret0 := fact(~n - 1);< 94225#factENTRY ~n := #in~n; 94228#L25 assume ~n <= 0;#res := 1; 94226#factFINAL assume true; 94223#factEXIT >#66#return; 94221#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94220#factFINAL assume true; 94218#factEXIT >#78#return; 94130#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; 94214#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 94189#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94186#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 94135#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; 93157#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 93158#factENTRY ~n := #in~n; 94187#L25 assume !(~n <= 0); 94153#L26 call #t~ret0 := fact(~n - 1);< 94166#factENTRY ~n := #in~n; 94184#L25 assume !(~n <= 0); 94156#L26 call #t~ret0 := fact(~n - 1);< 94177#factENTRY ~n := #in~n; 94184#L25 assume !(~n <= 0); 94156#L26 call #t~ret0 := fact(~n - 1);< 94177#factENTRY ~n := #in~n; 94183#L25 assume ~n <= 0;#res := 1; 94181#factFINAL assume true; 94176#factEXIT >#66#return; 94171#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94168#factFINAL assume true; 94165#factEXIT >#66#return; 94158#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94233#factFINAL assume true; 94152#factEXIT >#66#return; 94151#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94150#factFINAL assume true; 94132#factEXIT >#74#return; 93227#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 93228#factENTRY ~n := #in~n; 94143#L25 assume ~n <= 0;#res := 1; 94141#factFINAL assume true; 94138#factEXIT >#76#return; 94112#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 94113#factENTRY ~n := #in~n; 94188#L25 assume !(~n <= 0); 94154#L26 call #t~ret0 := fact(~n - 1);< 94159#factENTRY ~n := #in~n; 94222#L25 assume !(~n <= 0); 94157#L26 call #t~ret0 := fact(~n - 1);< 94166#factENTRY ~n := #in~n; 94184#L25 assume !(~n <= 0); 94156#L26 call #t~ret0 := fact(~n - 1);< 94177#factENTRY ~n := #in~n; 94183#L25 assume ~n <= 0;#res := 1; 94181#factFINAL assume true; 94176#factEXIT >#66#return; 94171#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94168#factFINAL assume true; 94165#factEXIT >#66#return; 94158#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94233#factFINAL assume true; 94152#factEXIT >#66#return; 94151#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 94150#factFINAL assume true; 94132#factEXIT >#78#return; 94108#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; 94103#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 94096#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 94087#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 94085#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 94083#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 93241#L42-3 [2022-11-02 20:45:23,371 INFO L750 eck$LassoCheckResult]: Loop: 93241#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 93207#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; 93169#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 93170#factENTRY ~n := #in~n; 93240#L25 assume !(~n <= 0); 93236#L26 call #t~ret0 := fact(~n - 1);< 93239#factENTRY ~n := #in~n; 93246#L25 assume !(~n <= 0); 93237#L26 call #t~ret0 := fact(~n - 1);< 93245#factENTRY ~n := #in~n; 93246#L25 assume !(~n <= 0); 93237#L26 call #t~ret0 := fact(~n - 1);< 93245#factENTRY ~n := #in~n; 93247#L25 assume ~n <= 0;#res := 1; 93253#factFINAL assume true; 93252#factEXIT >#66#return; 93251#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93250#factFINAL assume true; 93249#factEXIT >#66#return; 93238#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93244#factFINAL assume true; 93235#factEXIT >#66#return; 93234#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93233#factFINAL assume true; 93232#factEXIT >#68#return; 93223#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 93224#factENTRY ~n := #in~n; 94264#L25 assume ~n <= 0;#res := 1; 94263#factFINAL assume true; 94261#factEXIT >#70#return; 93730#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 93743#factENTRY ~n := #in~n; 93781#L25 assume !(~n <= 0); 93749#L26 call #t~ret0 := fact(~n - 1);< 93758#factENTRY ~n := #in~n; 93774#L25 assume !(~n <= 0); 93752#L26 call #t~ret0 := fact(~n - 1);< 93765#factENTRY ~n := #in~n; 93772#L25 assume !(~n <= 0); 93754#L26 call #t~ret0 := fact(~n - 1);< 93770#factENTRY ~n := #in~n; 93773#L25 assume ~n <= 0;#res := 1; 93771#factFINAL assume true; 93769#factEXIT >#66#return; 93768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93766#factFINAL assume true; 93764#factEXIT >#66#return; 93757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93779#factFINAL assume true; 93748#factEXIT >#66#return; 93746#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93742#factFINAL assume true; 93729#factEXIT >#72#return; 93737#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; 93800#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 93784#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 93783#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 93782#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; 93734#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 93741#factENTRY ~n := #in~n; 93776#L25 assume !(~n <= 0); 93750#L26 call #t~ret0 := fact(~n - 1);< 93765#factENTRY ~n := #in~n; 93772#L25 assume !(~n <= 0); 93754#L26 call #t~ret0 := fact(~n - 1);< 93770#factENTRY ~n := #in~n; 93772#L25 assume !(~n <= 0); 93754#L26 call #t~ret0 := fact(~n - 1);< 93770#factENTRY ~n := #in~n; 93773#L25 assume ~n <= 0;#res := 1; 93771#factFINAL assume true; 93769#factEXIT >#66#return; 93768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93766#factFINAL assume true; 93764#factEXIT >#66#return; 93757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93779#factFINAL assume true; 93748#factEXIT >#66#return; 93746#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93742#factFINAL assume true; 93729#factEXIT >#68#return; 93725#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 93727#factENTRY ~n := #in~n; 93777#L25 assume !(~n <= 0); 93751#L26 call #t~ret0 := fact(~n - 1);< 93767#factENTRY ~n := #in~n; 93793#L25 assume ~n <= 0;#res := 1; 93792#factFINAL assume true; 93790#factEXIT >#66#return; 93791#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93799#factFINAL assume true; 93798#factEXIT >#70#return; 93732#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 93762#factENTRY ~n := #in~n; 93778#L25 assume !(~n <= 0); 93755#L26 call #t~ret0 := fact(~n - 1);< 93765#factENTRY ~n := #in~n; 93772#L25 assume !(~n <= 0); 93754#L26 call #t~ret0 := fact(~n - 1);< 93770#factENTRY ~n := #in~n; 93772#L25 assume !(~n <= 0); 93754#L26 call #t~ret0 := fact(~n - 1);< 93770#factENTRY ~n := #in~n; 93773#L25 assume ~n <= 0;#res := 1; 93771#factFINAL assume true; 93769#factEXIT >#66#return; 93768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93766#factFINAL assume true; 93764#factEXIT >#66#return; 93757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93779#factFINAL assume true; 93748#factEXIT >#66#return; 93746#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93742#factFINAL assume true; 93729#factEXIT >#72#return; 93738#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; 93797#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 93796#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 93795#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 93794#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; 93731#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 93741#factENTRY ~n := #in~n; 93776#L25 assume !(~n <= 0); 93750#L26 call #t~ret0 := fact(~n - 1);< 93765#factENTRY ~n := #in~n; 93772#L25 assume !(~n <= 0); 93754#L26 call #t~ret0 := fact(~n - 1);< 93770#factENTRY ~n := #in~n; 93772#L25 assume !(~n <= 0); 93754#L26 call #t~ret0 := fact(~n - 1);< 93770#factENTRY ~n := #in~n; 93773#L25 assume ~n <= 0;#res := 1; 93771#factFINAL assume true; 93769#factEXIT >#66#return; 93768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93766#factFINAL assume true; 93764#factEXIT >#66#return; 93757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93779#factFINAL assume true; 93748#factEXIT >#66#return; 93746#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93742#factFINAL assume true; 93729#factEXIT >#68#return; 93723#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 93727#factENTRY ~n := #in~n; 93777#L25 assume !(~n <= 0); 93751#L26 call #t~ret0 := fact(~n - 1);< 93767#factENTRY ~n := #in~n; 93772#L25 assume !(~n <= 0); 93754#L26 call #t~ret0 := fact(~n - 1);< 93770#factENTRY ~n := #in~n; 93773#L25 assume ~n <= 0;#res := 1; 93771#factFINAL assume true; 93769#factEXIT >#66#return; 93768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93766#factFINAL assume true; 93764#factEXIT >#66#return; 93756#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93728#factFINAL assume true; 93722#factEXIT >#70#return; 93726#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 93744#factENTRY ~n := #in~n; 93775#L25 assume !(~n <= 0); 93753#L26 call #t~ret0 := fact(~n - 1);< 93767#factENTRY ~n := #in~n; 93793#L25 assume ~n <= 0;#res := 1; 93792#factFINAL assume true; 93790#factEXIT >#66#return; 93789#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93788#factFINAL assume true; 93787#factEXIT >#72#return; 93785#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; 93780#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 93759#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 93747#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 93745#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; 93477#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 93741#factENTRY ~n := #in~n; 93776#L25 assume !(~n <= 0); 93750#L26 call #t~ret0 := fact(~n - 1);< 93765#factENTRY ~n := #in~n; 93772#L25 assume !(~n <= 0); 93754#L26 call #t~ret0 := fact(~n - 1);< 93770#factENTRY ~n := #in~n; 93772#L25 assume !(~n <= 0); 93754#L26 call #t~ret0 := fact(~n - 1);< 93770#factENTRY ~n := #in~n; 93773#L25 assume ~n <= 0;#res := 1; 93771#factFINAL assume true; 93769#factEXIT >#66#return; 93768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93766#factFINAL assume true; 93764#factEXIT >#66#return; 93757#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93779#factFINAL assume true; 93748#factEXIT >#66#return; 93746#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93742#factFINAL assume true; 93729#factEXIT >#68#return; 93724#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 93727#factENTRY ~n := #in~n; 93777#L25 assume !(~n <= 0); 93751#L26 call #t~ret0 := fact(~n - 1);< 93767#factENTRY ~n := #in~n; 93772#L25 assume !(~n <= 0); 93754#L26 call #t~ret0 := fact(~n - 1);< 93770#factENTRY ~n := #in~n; 93773#L25 assume ~n <= 0;#res := 1; 93771#factFINAL assume true; 93769#factEXIT >#66#return; 93768#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93766#factFINAL assume true; 93764#factEXIT >#66#return; 93756#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93728#factFINAL assume true; 93722#factEXIT >#70#return; 93696#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 93697#factENTRY ~n := #in~n; 93699#L25 assume ~n <= 0;#res := 1; 93698#factFINAL assume true; 93695#factEXIT >#72#return; 93694#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; 93692#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 93489#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 93480#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 93476#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; 93178#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 93156#factENTRY ~n := #in~n; 93179#L25 assume !(~n <= 0); 93187#L26 call #t~ret0 := fact(~n - 1);< 93188#factENTRY ~n := #in~n; 93457#L25 assume !(~n <= 0); 93456#L26 call #t~ret0 := fact(~n - 1);< 93455#factENTRY ~n := #in~n; 93457#L25 assume !(~n <= 0); 93456#L26 call #t~ret0 := fact(~n - 1);< 93455#factENTRY ~n := #in~n; 93457#L25 assume !(~n <= 0); 93456#L26 call #t~ret0 := fact(~n - 1);< 93455#factENTRY ~n := #in~n; 93458#L25 assume ~n <= 0;#res := 1; 93488#factFINAL assume true; 93487#factEXIT >#66#return; 93486#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93485#factFINAL assume true; 93484#factEXIT >#66#return; 93483#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93482#factFINAL assume true; 93481#factEXIT >#66#return; 93473#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93474#factFINAL assume true; 93472#factEXIT >#66#return; 93471#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93470#factFINAL assume true; 93469#factEXIT >#74#return; 93211#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 93226#factENTRY ~n := #in~n; 93254#L25 assume !(~n <= 0); 93160#L26 call #t~ret0 := fact(~n - 1);< 93459#factENTRY ~n := #in~n; 93457#L25 assume !(~n <= 0); 93456#L26 call #t~ret0 := fact(~n - 1);< 93455#factENTRY ~n := #in~n; 93457#L25 assume !(~n <= 0); 93456#L26 call #t~ret0 := fact(~n - 1);< 93455#factENTRY ~n := #in~n; 93457#L25 assume !(~n <= 0); 93456#L26 call #t~ret0 := fact(~n - 1);< 93455#factENTRY ~n := #in~n; 93458#L25 assume ~n <= 0;#res := 1; 93488#factFINAL assume true; 93487#factEXIT >#66#return; 93486#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93485#factFINAL assume true; 93484#factEXIT >#66#return; 93483#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93482#factFINAL assume true; 93481#factEXIT >#66#return; 93473#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93474#factFINAL assume true; 93472#factEXIT >#66#return; 93471#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93470#factFINAL assume true; 93469#factEXIT >#76#return; 93460#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 93462#factENTRY ~n := #in~n; 93461#L25 assume !(~n <= 0); 93453#L26 call #t~ret0 := fact(~n - 1);< 93452#factENTRY ~n := #in~n; 93454#L25 assume ~n <= 0;#res := 1; 93467#factFINAL assume true; 93466#factEXIT >#66#return; 93465#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 93464#factFINAL assume true; 93463#factEXIT >#78#return; 93184#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; 93185#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 93191#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 93229#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 93201#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 93202#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 93241#L42-3 [2022-11-02 20:45:23,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:23,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1711259888, now seen corresponding path program 18 times [2022-11-02 20:45:23,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:23,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844304909] [2022-11-02 20:45:23,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:23,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:23,388 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:45:23,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1222673162] [2022-11-02 20:45:23,388 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-02 20:45:23,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:23,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:23,396 INFO L229 MonitoredProcess]: Starting monitored process 191 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:23,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (191)] Waiting until timeout for monitored process [2022-11-02 20:45:23,638 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2022-11-02 20:45:23,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:45:23,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:45:23,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:24,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 664 proven. 11 refuted. 0 times theorem prover too weak. 5045 trivial. 0 not checked. [2022-11-02 20:45:24,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 664 proven. 15 refuted. 0 times theorem prover too weak. 5041 trivial. 0 not checked. [2022-11-02 20:45:25,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:25,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844304909] [2022-11-02 20:45:25,493 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:45:25,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222673162] [2022-11-02 20:45:25,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222673162] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:25,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:45:25,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2022-11-02 20:45:25,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842167454] [2022-11-02 20:45:25,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:25,495 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:45:25,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:25,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2143824471, now seen corresponding path program 19 times [2022-11-02 20:45:25,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:25,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870869946] [2022-11-02 20:45:25,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:25,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:25,507 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:45:25,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2009104583] [2022-11-02 20:45:25,508 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-02 20:45:25,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:25,508 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:25,513 INFO L229 MonitoredProcess]: Starting monitored process 192 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:25,520 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (192)] Waiting until timeout for monitored process [2022-11-02 20:45:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:25,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-02 20:45:25,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:26,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5633 backedges. 2996 proven. 185 refuted. 0 times theorem prover too weak. 2452 trivial. 0 not checked. [2022-11-02 20:45:26,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:29,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5633 backedges. 272 proven. 1047 refuted. 0 times theorem prover too weak. 4314 trivial. 0 not checked. [2022-11-02 20:45:29,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:29,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870869946] [2022-11-02 20:45:29,832 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:45:29,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009104583] [2022-11-02 20:45:29,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009104583] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:29,833 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:45:29,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 23 [2022-11-02 20:45:29,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225377560] [2022-11-02 20:45:29,834 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:29,834 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:45:29,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:29,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-02 20:45:29,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:45:29,836 INFO L87 Difference]: Start difference. First operand 1193 states and 1552 transitions. cyclomatic complexity: 377 Second operand has 23 states, 20 states have (on average 3.1) internal successors, (62), 23 states have internal predecessors, (62), 13 states have call successors, (31), 2 states have call predecessors, (31), 9 states have return successors, (34), 12 states have call predecessors, (34), 13 states have call successors, (34) [2022-11-02 20:45:32,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:32,417 INFO L93 Difference]: Finished difference Result 1619 states and 2276 transitions. [2022-11-02 20:45:32,418 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1619 states and 2276 transitions. [2022-11-02 20:45:32,427 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 91 [2022-11-02 20:45:32,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1619 states to 1595 states and 2244 transitions. [2022-11-02 20:45:32,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2022-11-02 20:45:32,442 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2022-11-02 20:45:32,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1595 states and 2244 transitions. [2022-11-02 20:45:32,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:45:32,443 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1595 states and 2244 transitions. [2022-11-02 20:45:32,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states and 2244 transitions. [2022-11-02 20:45:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1338. [2022-11-02 20:45:32,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1338 states, 873 states have (on average 1.0721649484536082) internal successors, (936), 880 states have internal predecessors, (936), 314 states have call successors, (314), 150 states have call predecessors, (314), 151 states have return successors, (600), 307 states have call predecessors, (600), 314 states have call successors, (600) [2022-11-02 20:45:32,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1338 states to 1338 states and 1850 transitions. [2022-11-02 20:45:32,494 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1338 states and 1850 transitions. [2022-11-02 20:45:32,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:45:32,497 INFO L428 stractBuchiCegarLoop]: Abstraction has 1338 states and 1850 transitions. [2022-11-02 20:45:32,497 INFO L335 stractBuchiCegarLoop]: ======== Iteration 31 ============ [2022-11-02 20:45:32,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1338 states and 1850 transitions. [2022-11-02 20:45:32,503 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 73 [2022-11-02 20:45:32,503 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:45:32,503 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:45:32,507 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [50, 50, 26, 26, 26, 26, 24, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-02 20:45:32,508 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [48, 48, 33, 33, 33, 33, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:32,508 INFO L748 eck$LassoCheckResult]: Stem: 99838#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 99817#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; 99818#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 99837#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; 99826#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 99827#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 100168#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; 100164#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 100165#factENTRY ~n := #in~n; 100169#L25 assume ~n <= 0;#res := 1; 100167#factFINAL assume true; 100163#factEXIT >#68#return; 100159#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 100160#factENTRY ~n := #in~n; 100166#L25 assume ~n <= 0;#res := 1; 100162#factFINAL assume true; 100158#factEXIT >#70#return; 100155#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 100156#factENTRY ~n := #in~n; 100161#L25 assume ~n <= 0;#res := 1; 100157#factFINAL assume true; 100154#factEXIT >#72#return; 100151#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; 100149#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 100145#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 100142#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 100139#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; 100133#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 100134#factENTRY ~n := #in~n; 100152#L25 assume !(~n <= 0); 100147#L26 call #t~ret0 := fact(~n - 1);< 100148#factENTRY ~n := #in~n; 100153#L25 assume ~n <= 0;#res := 1; 100150#factFINAL assume true; 100146#factEXIT >#66#return; 100144#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100138#factFINAL assume true; 100132#factEXIT >#74#return; 100129#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 100130#factENTRY ~n := #in~n; 100171#L25 assume ~n <= 0;#res := 1; 100170#factFINAL assume true; 100128#factEXIT >#76#return; 100125#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 100126#factENTRY ~n := #in~n; 100141#L25 assume !(~n <= 0); 100136#L26 call #t~ret0 := fact(~n - 1);< 100137#factENTRY ~n := #in~n; 100143#L25 assume ~n <= 0;#res := 1; 100140#factFINAL assume true; 100135#factEXIT >#66#return; 100131#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100127#factFINAL assume true; 100124#factEXIT >#78#return; 100123#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; 100122#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 100121#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 100120#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 100119#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; 100102#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 100114#factENTRY ~n := #in~n; 101075#L25 assume !(~n <= 0); 101072#L26 call #t~ret0 := fact(~n - 1);< 99823#factENTRY ~n := #in~n; 101084#L25 assume !(~n <= 0); 99845#L26 call #t~ret0 := fact(~n - 1);< 101086#factENTRY ~n := #in~n; 99844#L25 assume ~n <= 0;#res := 1; 99846#factFINAL assume true; 101093#factEXIT >#66#return; 101092#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101091#factFINAL assume true; 101090#factEXIT >#66#return; 101089#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101088#factFINAL assume true; 101087#factEXIT >#74#return; 100110#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 100111#factENTRY ~n := #in~n; 100113#L25 assume ~n <= 0;#res := 1; 100112#factFINAL assume true; 100109#factEXIT >#76#return; 100103#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 100114#factENTRY ~n := #in~n; 101075#L25 assume !(~n <= 0); 101072#L26 call #t~ret0 := fact(~n - 1);< 99823#factENTRY ~n := #in~n; 101084#L25 assume !(~n <= 0); 99845#L26 call #t~ret0 := fact(~n - 1);< 101086#factENTRY ~n := #in~n; 99844#L25 assume ~n <= 0;#res := 1; 99846#factFINAL assume true; 101093#factEXIT >#66#return; 101092#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101091#factFINAL assume true; 101090#factEXIT >#66#return; 101089#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101088#factFINAL assume true; 101087#factEXIT >#78#return; 100098#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; 100089#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 100086#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 100083#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 100081#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; 100072#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 100079#factENTRY ~n := #in~n; 100108#L25 assume !(~n <= 0); 100094#L26 call #t~ret0 := fact(~n - 1);< 100097#factENTRY ~n := #in~n; 100453#L25 assume !(~n <= 0); 100095#L26 call #t~ret0 := fact(~n - 1);< 101081#factENTRY ~n := #in~n; 100453#L25 assume !(~n <= 0); 100095#L26 call #t~ret0 := fact(~n - 1);< 101081#factENTRY ~n := #in~n; 101083#L25 assume ~n <= 0;#res := 1; 101082#factFINAL assume true; 101080#factEXIT >#66#return; 101079#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101078#factFINAL assume true; 101077#factEXIT >#66#return; 100096#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100444#factFINAL assume true; 100091#factEXIT >#66#return; 100088#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100085#factFINAL assume true; 100071#factEXIT >#74#return; 100074#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 100077#factENTRY ~n := #in~n; 100080#L25 assume ~n <= 0;#res := 1; 100078#factFINAL assume true; 100076#factEXIT >#76#return; 100073#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 100075#factENTRY ~n := #in~n; 100100#L25 assume !(~n <= 0); 100092#L26 call #t~ret0 := fact(~n - 1);< 100457#factENTRY ~n := #in~n; 100458#L25 assume !(~n <= 0); 100093#L26 call #t~ret0 := fact(~n - 1);< 100097#factENTRY ~n := #in~n; 100453#L25 assume !(~n <= 0); 100095#L26 call #t~ret0 := fact(~n - 1);< 101081#factENTRY ~n := #in~n; 101083#L25 assume ~n <= 0;#res := 1; 101082#factFINAL assume true; 101080#factEXIT >#66#return; 101079#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101078#factFINAL assume true; 101077#factEXIT >#66#return; 100096#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100444#factFINAL assume true; 100091#factEXIT >#66#return; 100088#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100085#factFINAL assume true; 100071#factEXIT >#78#return; 100070#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; 100069#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 100068#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 100067#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 100066#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 100062#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 100064#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 100938#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; 100930#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 100936#factENTRY ~n := #in~n; 100974#L25 assume !(~n <= 0); 100971#L26 call #t~ret0 := fact(~n - 1);< 100972#factENTRY ~n := #in~n; 100975#L25 assume ~n <= 0;#res := 1; 100973#factFINAL assume true; 100970#factEXIT >#66#return; 100969#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100929#factFINAL assume true; 100931#factEXIT >#68#return; 99853#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 99854#factENTRY ~n := #in~n; 100949#L25 assume ~n <= 0;#res := 1; 100935#factFINAL assume true; 100917#factEXIT >#70#return; 100918#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 100932#factENTRY ~n := #in~n; 101018#L25 assume !(~n <= 0); 100941#L26 call #t~ret0 := fact(~n - 1);< 101015#factENTRY ~n := #in~n; 100948#L25 assume ~n <= 0;#res := 1; 100947#factFINAL assume true; 100939#factEXIT >#66#return; 100943#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100946#factFINAL assume true; 100920#factEXIT >#72#return; 100925#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; 100962#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 100960#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 100958#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 100712#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; 99810#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 99811#factENTRY ~n := #in~n; 101017#L25 assume !(~n <= 0); 100941#L26 call #t~ret0 := fact(~n - 1);< 101015#factENTRY ~n := #in~n; 100948#L25 assume ~n <= 0;#res := 1; 100947#factFINAL assume true; 100939#factEXIT >#66#return; 100943#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100946#factFINAL assume true; 100920#factEXIT >#68#return; 100926#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 100934#factENTRY ~n := #in~n; 100945#L25 assume !(~n <= 0); 100942#L26 call #t~ret0 := fact(~n - 1);< 100944#factENTRY ~n := #in~n; 100948#L25 assume ~n <= 0;#res := 1; 100947#factFINAL assume true; 100939#factEXIT >#66#return; 100937#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100927#factFINAL assume true; 100928#factEXIT >#70#return; 99803#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 99804#factENTRY ~n := #in~n; 100993#L25 assume ~n <= 0;#res := 1; 100992#factFINAL assume true; 100990#factEXIT >#72#return; 100989#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; 100988#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 100987#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 100986#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 99840#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; 99792#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 99793#factENTRY ~n := #in~n; 101006#L25 assume !(~n <= 0); 101000#L26 call #t~ret0 := fact(~n - 1);< 101003#factENTRY ~n := #in~n; 101012#L25 assume !(~n <= 0); 100999#L26 call #t~ret0 := fact(~n - 1);< 101009#factENTRY ~n := #in~n; 101013#L25 assume ~n <= 0;#res := 1; 101010#factFINAL assume true; 101008#factEXIT >#66#return; 101007#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101004#factFINAL assume true; 100998#factEXIT >#66#return; 100997#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100996#factFINAL assume true; 100995#factEXIT >#74#return; 100922#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 100933#factENTRY ~n := #in~n; 101020#L25 assume !(~n <= 0); 100940#L26 call #t~ret0 := fact(~n - 1);< 100944#factENTRY ~n := #in~n; 100948#L25 assume ~n <= 0;#res := 1; 100947#factFINAL assume true; 100939#factEXIT >#66#return; 100943#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100946#factFINAL assume true; 100920#factEXIT >#76#return; 100923#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 100966#factENTRY ~n := #in~n; 101029#L25 assume !(~n <= 0); 101026#L26 call #t~ret0 := fact(~n - 1);< 101027#factENTRY ~n := #in~n; 101030#L25 assume ~n <= 0;#res := 1; 101028#factFINAL assume true; 101025#factEXIT >#66#return; 101024#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101021#factFINAL assume true; 100965#factEXIT >#78#return; 100964#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; 100963#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 100961#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 100959#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 100956#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; 100952#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 100955#factENTRY ~n := #in~n; 101066#L25 assume !(~n <= 0); 100979#L26 call #t~ret0 := fact(~n - 1);< 100985#factENTRY ~n := #in~n; 101061#L25 assume !(~n <= 0); 100980#L26 call #t~ret0 := fact(~n - 1);< 101059#factENTRY ~n := #in~n; 101061#L25 assume !(~n <= 0); 100980#L26 call #t~ret0 := fact(~n - 1);< 101059#factENTRY ~n := #in~n; 101063#L25 assume ~n <= 0;#res := 1; 101060#factFINAL assume true; 101058#factEXIT >#66#return; 101056#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101055#factFINAL assume true; 101054#factEXIT >#66#return; 100984#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101076#factFINAL assume true; 100978#factEXIT >#66#return; 100976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100967#factFINAL assume true; 100951#factEXIT >#74#return; 99857#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 99858#factENTRY ~n := #in~n; 101034#L25 assume ~n <= 0;#res := 1; 101035#factFINAL assume true; 101052#factEXIT >#76#return; 99862#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 99863#factENTRY ~n := #in~n; 101065#L25 assume !(~n <= 0); 100982#L26 call #t~ret0 := fact(~n - 1);< 101064#factENTRY ~n := #in~n; 101062#L25 assume !(~n <= 0); 100981#L26 call #t~ret0 := fact(~n - 1);< 100985#factENTRY ~n := #in~n; 101061#L25 assume !(~n <= 0); 100980#L26 call #t~ret0 := fact(~n - 1);< 101059#factENTRY ~n := #in~n; 101063#L25 assume ~n <= 0;#res := 1; 101060#factFINAL assume true; 101058#factEXIT >#66#return; 101056#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101055#factFINAL assume true; 101054#factEXIT >#66#return; 100984#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 101076#factFINAL assume true; 100978#factEXIT >#66#return; 100976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100967#factFINAL assume true; 100951#factEXIT >#78#return; 100954#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; 101048#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 101047#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 101046#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 101045#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 101043#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 100048#L42-3 [2022-11-02 20:45:32,509 INFO L750 eck$LassoCheckResult]: Loop: 100048#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 99839#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; 99808#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 99809#factENTRY ~n := #in~n; 100038#L25 assume !(~n <= 0); 99796#L26 call #t~ret0 := fact(~n - 1);< 99812#factENTRY ~n := #in~n; 99813#L25 assume !(~n <= 0); 99795#L26 call #t~ret0 := fact(~n - 1);< 100039#factENTRY ~n := #in~n; 99813#L25 assume !(~n <= 0); 99795#L26 call #t~ret0 := fact(~n - 1);< 100039#factENTRY ~n := #in~n; 99842#L25 assume ~n <= 0;#res := 1; 99843#factFINAL assume true; 100058#factEXIT >#66#return; 100059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100060#factFINAL assume true; 99794#factEXIT >#66#return; 99797#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99805#factFINAL assume true; 99806#factEXIT >#66#return; 99977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99865#factFINAL assume true; 99864#factEXIT >#68#return; 99851#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 99852#factENTRY ~n := #in~n; 100034#L25 assume ~n <= 0;#res := 1; 100033#factFINAL assume true; 100030#factEXIT >#70#return; 99936#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 99980#factENTRY ~n := #in~n; 100046#L25 assume !(~n <= 0); 99998#L26 call #t~ret0 := fact(~n - 1);< 100041#factENTRY ~n := #in~n; 100012#L25 assume !(~n <= 0); 99991#L26 call #t~ret0 := fact(~n - 1);< 99999#factENTRY ~n := #in~n; 100023#L25 assume !(~n <= 0); 99992#L26 call #t~ret0 := fact(~n - 1);< 100010#factENTRY ~n := #in~n; 100021#L25 assume ~n <= 0;#res := 1; 100020#factFINAL assume true; 100007#factEXIT >#66#return; 100005#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99997#factFINAL assume true; 99988#factEXIT >#66#return; 99994#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100037#factFINAL assume true; 100027#factEXIT >#66#return; 100025#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100024#factFINAL assume true; 99933#factEXIT >#72#return; 99939#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; 100056#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 100055#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 100054#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 100053#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; 99935#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 99940#factENTRY ~n := #in~n; 100045#L25 assume !(~n <= 0); 99989#L26 call #t~ret0 := fact(~n - 1);< 99999#factENTRY ~n := #in~n; 100023#L25 assume !(~n <= 0); 99992#L26 call #t~ret0 := fact(~n - 1);< 100010#factENTRY ~n := #in~n; 100023#L25 assume !(~n <= 0); 99992#L26 call #t~ret0 := fact(~n - 1);< 100010#factENTRY ~n := #in~n; 100023#L25 assume !(~n <= 0); 99992#L26 call #t~ret0 := fact(~n - 1);< 100010#factENTRY ~n := #in~n; 100021#L25 assume ~n <= 0;#res := 1; 100020#factFINAL assume true; 100007#factEXIT >#66#return; 100005#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99997#factFINAL assume true; 99988#factEXIT >#66#return; 99994#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100037#factFINAL assume true; 100027#factEXIT >#66#return; 100028#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100047#factFINAL assume true; 100029#factEXIT >#66#return; 100026#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99978#factFINAL assume true; 99979#factEXIT >#68#return; 99926#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 99931#factENTRY ~n := #in~n; 99966#L25 assume !(~n <= 0); 99958#L26 call #t~ret0 := fact(~n - 1);< 99965#factENTRY ~n := #in~n; 99968#L25 assume ~n <= 0;#res := 1; 99964#factFINAL assume true; 99957#factEXIT >#66#return; 99961#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100001#factFINAL assume true; 99985#factEXIT >#70#return; 99898#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 99982#factENTRY ~n := #in~n; 100051#L25 assume !(~n <= 0); 99993#L26 call #t~ret0 := fact(~n - 1);< 99996#factENTRY ~n := #in~n; 100022#L25 assume !(~n <= 0); 100008#L26 call #t~ret0 := fact(~n - 1);< 100009#factENTRY ~n := #in~n; 100021#L25 assume ~n <= 0;#res := 1; 100020#factFINAL assume true; 100007#factEXIT >#66#return; 100005#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99997#factFINAL assume true; 99988#factEXIT >#66#return; 99987#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99981#factFINAL assume true; 99894#factEXIT >#72#return; 99901#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; 100057#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 100052#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 100050#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 100019#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; 99938#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 99940#factENTRY ~n := #in~n; 100045#L25 assume !(~n <= 0); 99989#L26 call #t~ret0 := fact(~n - 1);< 99999#factENTRY ~n := #in~n; 100023#L25 assume !(~n <= 0); 99992#L26 call #t~ret0 := fact(~n - 1);< 100010#factENTRY ~n := #in~n; 100023#L25 assume !(~n <= 0); 99992#L26 call #t~ret0 := fact(~n - 1);< 100010#factENTRY ~n := #in~n; 100023#L25 assume !(~n <= 0); 99992#L26 call #t~ret0 := fact(~n - 1);< 100010#factENTRY ~n := #in~n; 100021#L25 assume ~n <= 0;#res := 1; 100020#factFINAL assume true; 100007#factEXIT >#66#return; 100005#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99997#factFINAL assume true; 99988#factEXIT >#66#return; 99994#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100037#factFINAL assume true; 100027#factEXIT >#66#return; 100028#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100047#factFINAL assume true; 100029#factEXIT >#66#return; 100026#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99978#factFINAL assume true; 99979#factEXIT >#68#return; 99930#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 99931#factENTRY ~n := #in~n; 99966#L25 assume !(~n <= 0); 99958#L26 call #t~ret0 := fact(~n - 1);< 99965#factENTRY ~n := #in~n; 100023#L25 assume !(~n <= 0); 99992#L26 call #t~ret0 := fact(~n - 1);< 100010#factENTRY ~n := #in~n; 100021#L25 assume ~n <= 0;#res := 1; 100020#factFINAL assume true; 100007#factEXIT >#66#return; 100005#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99997#factFINAL assume true; 99988#factEXIT >#66#return; 99995#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100061#factFINAL assume true; 99925#factEXIT >#70#return; 99895#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 99947#factENTRY ~n := #in~n; 100036#L25 assume !(~n <= 0); 99959#L26 call #t~ret0 := fact(~n - 1);< 99962#factENTRY ~n := #in~n; 99968#L25 assume ~n <= 0;#res := 1; 99964#factFINAL assume true; 99957#factEXIT >#66#return; 99952#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99950#factFINAL assume true; 99946#factEXIT >#72#return; 99945#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; 99944#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 99943#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 99942#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 99941#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; 99880#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 99940#factENTRY ~n := #in~n; 100045#L25 assume !(~n <= 0); 99989#L26 call #t~ret0 := fact(~n - 1);< 99999#factENTRY ~n := #in~n; 100023#L25 assume !(~n <= 0); 99992#L26 call #t~ret0 := fact(~n - 1);< 100010#factENTRY ~n := #in~n; 100023#L25 assume !(~n <= 0); 99992#L26 call #t~ret0 := fact(~n - 1);< 100010#factENTRY ~n := #in~n; 100023#L25 assume !(~n <= 0); 99992#L26 call #t~ret0 := fact(~n - 1);< 100010#factENTRY ~n := #in~n; 100021#L25 assume ~n <= 0;#res := 1; 100020#factFINAL assume true; 100007#factEXIT >#66#return; 100005#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99997#factFINAL assume true; 99988#factEXIT >#66#return; 99994#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100037#factFINAL assume true; 100027#factEXIT >#66#return; 100028#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100047#factFINAL assume true; 100029#factEXIT >#66#return; 100026#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99978#factFINAL assume true; 99979#factEXIT >#68#return; 99927#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 99931#factENTRY ~n := #in~n; 99966#L25 assume !(~n <= 0); 99958#L26 call #t~ret0 := fact(~n - 1);< 99965#factENTRY ~n := #in~n; 100023#L25 assume !(~n <= 0); 99992#L26 call #t~ret0 := fact(~n - 1);< 100010#factENTRY ~n := #in~n; 100021#L25 assume ~n <= 0;#res := 1; 100020#factFINAL assume true; 100007#factEXIT >#66#return; 100005#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99997#factFINAL assume true; 99988#factEXIT >#66#return; 99995#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 100061#factFINAL assume true; 99925#factEXIT >#70#return; 99922#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 99923#factENTRY ~n := #in~n; 99932#L25 assume ~n <= 0;#res := 1; 99924#factFINAL assume true; 99921#factEXIT >#72#return; 99920#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; 99919#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 99918#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 99917#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 99915#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; 99790#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 99791#factENTRY ~n := #in~n; 99906#L25 assume !(~n <= 0); 99875#L26 call #t~ret0 := fact(~n - 1);< 99878#factENTRY ~n := #in~n; 99885#L25 assume !(~n <= 0); 99876#L26 call #t~ret0 := fact(~n - 1);< 99883#factENTRY ~n := #in~n; 99885#L25 assume !(~n <= 0); 99876#L26 call #t~ret0 := fact(~n - 1);< 99883#factENTRY ~n := #in~n; 99885#L25 assume !(~n <= 0); 99876#L26 call #t~ret0 := fact(~n - 1);< 99883#factENTRY ~n := #in~n; 99887#L25 assume ~n <= 0;#res := 1; 99913#factFINAL assume true; 99912#factEXIT >#66#return; 99911#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99910#factFINAL assume true; 99909#factEXIT >#66#return; 99907#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99904#factFINAL assume true; 99902#factEXIT >#66#return; 99877#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99882#factFINAL assume true; 99873#factEXIT >#66#return; 99871#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99870#factFINAL assume true; 99866#factEXIT >#74#return; 99855#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 99856#factENTRY ~n := #in~n; 99908#L25 assume !(~n <= 0); 99874#L26 call #t~ret0 := fact(~n - 1);< 99905#factENTRY ~n := #in~n; 99885#L25 assume !(~n <= 0); 99876#L26 call #t~ret0 := fact(~n - 1);< 99883#factENTRY ~n := #in~n; 99887#L25 assume ~n <= 0;#res := 1; 99913#factFINAL assume true; 99912#factEXIT >#66#return; 99911#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99910#factFINAL assume true; 99909#factEXIT >#66#return; 99903#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99914#factFINAL assume true; 99872#factEXIT >#76#return; 99860#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 99861#factENTRY ~n := #in~n; 100016#L25 assume !(~n <= 0); 100014#L26 call #t~ret0 := fact(~n - 1);< 100015#factENTRY ~n := #in~n; 100018#L25 assume ~n <= 0;#res := 1; 100017#factFINAL assume true; 100013#factEXIT >#66#return; 99986#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 99984#factFINAL assume true; 99970#factEXIT >#78#return; 99819#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; 99820#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 99824#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 99859#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 99830#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 99831#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 100048#L42-3 [2022-11-02 20:45:32,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:32,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1711259888, now seen corresponding path program 19 times [2022-11-02 20:45:32,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:32,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454689233] [2022-11-02 20:45:32,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:32,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:32,525 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:45:32,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1734139516] [2022-11-02 20:45:32,526 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-02 20:45:32,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:32,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:32,532 INFO L229 MonitoredProcess]: Starting monitored process 193 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:32,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (193)] Waiting until timeout for monitored process [2022-11-02 20:45:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:45:32,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:45:32,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:32,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 1114 proven. 8 refuted. 0 times theorem prover too weak. 4598 trivial. 0 not checked. [2022-11-02 20:45:32,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 240 proven. 20 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2022-11-02 20:45:33,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:33,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454689233] [2022-11-02 20:45:33,480 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:45:33,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734139516] [2022-11-02 20:45:33,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734139516] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:33,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:45:33,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-11-02 20:45:33,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72660790] [2022-11-02 20:45:33,481 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:33,482 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:45:33,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:33,482 INFO L85 PathProgramCache]: Analyzing trace with hash -7292215, now seen corresponding path program 20 times [2022-11-02 20:45:33,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:33,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914752324] [2022-11-02 20:45:33,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:33,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:33,495 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:45:33,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [523777867] [2022-11-02 20:45:33,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:45:33,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:33,496 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:33,509 INFO L229 MonitoredProcess]: Starting monitored process 194 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:33,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (194)] Waiting until timeout for monitored process [2022-11-02 20:45:33,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:45:33,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:45:33,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 659 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-02 20:45:33,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:34,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5633 backedges. 2510 proven. 185 refuted. 0 times theorem prover too weak. 2938 trivial. 0 not checked. [2022-11-02 20:45:34,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:37,968 INFO L134 CoverageAnalysis]: Checked inductivity of 5633 backedges. 146 proven. 1341 refuted. 0 times theorem prover too weak. 4146 trivial. 0 not checked. [2022-11-02 20:45:37,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:37,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914752324] [2022-11-02 20:45:37,969 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:45:37,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523777867] [2022-11-02 20:45:37,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523777867] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:37,971 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:45:37,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 24 [2022-11-02 20:45:37,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411623926] [2022-11-02 20:45:37,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:37,972 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:45:37,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:37,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-02 20:45:37,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:45:37,974 INFO L87 Difference]: Start difference. First operand 1338 states and 1850 transitions. cyclomatic complexity: 530 Second operand has 24 states, 21 states have (on average 3.142857142857143) internal successors, (66), 24 states have internal predecessors, (66), 15 states have call successors, (28), 2 states have call predecessors, (28), 10 states have return successors, (32), 10 states have call predecessors, (32), 15 states have call successors, (32) [2022-11-02 20:45:40,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:40,655 INFO L93 Difference]: Finished difference Result 1810 states and 2731 transitions. [2022-11-02 20:45:40,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1810 states and 2731 transitions. [2022-11-02 20:45:40,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 151 [2022-11-02 20:45:40,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1810 states to 1789 states and 2696 transitions. [2022-11-02 20:45:40,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 112 [2022-11-02 20:45:40,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2022-11-02 20:45:40,683 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1789 states and 2696 transitions. [2022-11-02 20:45:40,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:45:40,683 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1789 states and 2696 transitions. [2022-11-02 20:45:40,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states and 2696 transitions. [2022-11-02 20:45:40,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1520. [2022-11-02 20:45:40,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 988 states have (on average 1.0708502024291497) internal successors, (1058), 996 states have internal predecessors, (1058), 377 states have call successors, (377), 154 states have call predecessors, (377), 155 states have return successors, (709), 369 states have call predecessors, (709), 377 states have call successors, (709) [2022-11-02 20:45:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2144 transitions. [2022-11-02 20:45:40,784 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1520 states and 2144 transitions. [2022-11-02 20:45:40,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 20:45:40,785 INFO L428 stractBuchiCegarLoop]: Abstraction has 1520 states and 2144 transitions. [2022-11-02 20:45:40,785 INFO L335 stractBuchiCegarLoop]: ======== Iteration 32 ============ [2022-11-02 20:45:40,785 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1520 states and 2144 transitions. [2022-11-02 20:45:40,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 131 [2022-11-02 20:45:40,792 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:45:40,792 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:45:40,795 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [50, 50, 26, 26, 26, 26, 24, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-02 20:45:40,795 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [51, 51, 36, 36, 36, 36, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:40,796 INFO L748 eck$LassoCheckResult]: Stem: 106815#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 106788#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; 106789#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 106814#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; 106803#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 106804#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107213#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; 107209#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 107210#factENTRY ~n := #in~n; 107214#L25 assume ~n <= 0;#res := 1; 107212#factFINAL assume true; 107208#factEXIT >#68#return; 107204#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 107205#factENTRY ~n := #in~n; 107211#L25 assume ~n <= 0;#res := 1; 107207#factFINAL assume true; 107203#factEXIT >#70#return; 107200#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 107201#factENTRY ~n := #in~n; 107206#L25 assume ~n <= 0;#res := 1; 107202#factFINAL assume true; 107199#factEXIT >#72#return; 107196#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; 107194#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 107190#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 107187#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107184#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; 107178#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 107179#factENTRY ~n := #in~n; 107197#L25 assume !(~n <= 0); 107192#L26 call #t~ret0 := fact(~n - 1);< 107193#factENTRY ~n := #in~n; 107198#L25 assume ~n <= 0;#res := 1; 107195#factFINAL assume true; 107191#factEXIT >#66#return; 107189#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107183#factFINAL assume true; 107177#factEXIT >#74#return; 107174#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 107175#factENTRY ~n := #in~n; 107216#L25 assume ~n <= 0;#res := 1; 107215#factFINAL assume true; 107173#factEXIT >#76#return; 107170#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 107171#factENTRY ~n := #in~n; 107186#L25 assume !(~n <= 0); 107181#L26 call #t~ret0 := fact(~n - 1);< 107182#factENTRY ~n := #in~n; 107188#L25 assume ~n <= 0;#res := 1; 107185#factFINAL assume true; 107180#factEXIT >#66#return; 107176#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107172#factFINAL assume true; 107169#factEXIT >#78#return; 107168#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; 107167#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 107166#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 107165#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107164#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; 107150#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 107163#factENTRY ~n := #in~n; 107528#L25 assume !(~n <= 0); 107243#L26 call #t~ret0 := fact(~n - 1);< 107247#factENTRY ~n := #in~n; 107335#L25 assume !(~n <= 0); 107244#L26 call #t~ret0 := fact(~n - 1);< 107523#factENTRY ~n := #in~n; 107525#L25 assume ~n <= 0;#res := 1; 107524#factFINAL assume true; 107521#factEXIT >#66#return; 107522#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107533#factFINAL assume true; 107532#factEXIT >#66#return; 107531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107530#factFINAL assume true; 107529#factEXIT >#74#return; 107158#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 107159#factENTRY ~n := #in~n; 107161#L25 assume ~n <= 0;#res := 1; 107160#factFINAL assume true; 107157#factEXIT >#76#return; 107151#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 107163#factENTRY ~n := #in~n; 107528#L25 assume !(~n <= 0); 107243#L26 call #t~ret0 := fact(~n - 1);< 107247#factENTRY ~n := #in~n; 107335#L25 assume !(~n <= 0); 107244#L26 call #t~ret0 := fact(~n - 1);< 107523#factENTRY ~n := #in~n; 107525#L25 assume ~n <= 0;#res := 1; 107524#factFINAL assume true; 107521#factEXIT >#66#return; 107522#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107533#factFINAL assume true; 107532#factEXIT >#66#return; 107531#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107530#factFINAL assume true; 107529#factEXIT >#78#return; 107146#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; 107138#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 107136#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 107131#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107129#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; 107120#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 107128#factENTRY ~n := #in~n; 107147#L25 assume !(~n <= 0); 107143#L26 call #t~ret0 := fact(~n - 1);< 107219#factENTRY ~n := #in~n; 107220#L25 assume !(~n <= 0); 107140#L26 call #t~ret0 := fact(~n - 1);< 107253#factENTRY ~n := #in~n; 107220#L25 assume !(~n <= 0); 107140#L26 call #t~ret0 := fact(~n - 1);< 107253#factENTRY ~n := #in~n; 107255#L25 assume ~n <= 0;#res := 1; 107254#factFINAL assume true; 107252#factEXIT >#66#return; 107251#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107250#factFINAL assume true; 107249#factEXIT >#66#return; 107144#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107218#factFINAL assume true; 107139#factEXIT >#66#return; 107137#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107127#factFINAL assume true; 107118#factEXIT >#74#return; 107121#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 107133#factENTRY ~n := #in~n; 107135#L25 assume ~n <= 0;#res := 1; 107134#factFINAL assume true; 107132#factEXIT >#76#return; 107119#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 107122#factENTRY ~n := #in~n; 107154#L25 assume !(~n <= 0); 107141#L26 call #t~ret0 := fact(~n - 1);< 107145#factENTRY ~n := #in~n; 107221#L25 assume !(~n <= 0); 107142#L26 call #t~ret0 := fact(~n - 1);< 107219#factENTRY ~n := #in~n; 107220#L25 assume !(~n <= 0); 107140#L26 call #t~ret0 := fact(~n - 1);< 107253#factENTRY ~n := #in~n; 107255#L25 assume ~n <= 0;#res := 1; 107254#factFINAL assume true; 107252#factEXIT >#66#return; 107251#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107250#factFINAL assume true; 107249#factEXIT >#66#return; 107144#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107218#factFINAL assume true; 107139#factEXIT >#66#return; 107137#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107127#factFINAL assume true; 107118#factEXIT >#78#return; 107116#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; 107114#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 107112#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 107110#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 107108#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 107104#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 107105#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 108039#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; 106773#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 106774#factENTRY ~n := #in~n; 108085#L25 assume !(~n <= 0); 108072#L26 call #t~ret0 := fact(~n - 1);< 108073#factENTRY ~n := #in~n; 108083#L25 assume ~n <= 0;#res := 1; 108081#factFINAL assume true; 108071#factEXIT >#66#return; 108068#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108060#factFINAL assume true; 108057#factEXIT >#68#return; 108047#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 108048#factENTRY ~n := #in~n; 108056#L25 assume ~n <= 0;#res := 1; 108055#factFINAL assume true; 108046#factEXIT >#70#return; 108032#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 108038#factENTRY ~n := #in~n; 108090#L25 assume !(~n <= 0); 108042#L26 call #t~ret0 := fact(~n - 1);< 108089#factENTRY ~n := #in~n; 108078#L25 assume ~n <= 0;#res := 1; 108053#factFINAL assume true; 108040#factEXIT >#66#return; 108044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108037#factFINAL assume true; 108031#factEXIT >#72#return; 108033#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; 108116#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 108115#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 108114#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107999#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; 108000#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 108025#factENTRY ~n := #in~n; 108093#L25 assume !(~n <= 0); 108041#L26 call #t~ret0 := fact(~n - 1);< 108045#factENTRY ~n := #in~n; 108078#L25 assume ~n <= 0;#res := 1; 108053#factFINAL assume true; 108040#factEXIT >#66#return; 108044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108037#factFINAL assume true; 108031#factEXIT >#68#return; 108027#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 108028#factENTRY ~n := #in~n; 108054#L25 assume !(~n <= 0); 108043#L26 call #t~ret0 := fact(~n - 1);< 108045#factENTRY ~n := #in~n; 108078#L25 assume ~n <= 0;#res := 1; 108053#factFINAL assume true; 108040#factEXIT >#66#return; 108036#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108030#factFINAL assume true; 108026#factEXIT >#70#return; 108021#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 108023#factENTRY ~n := #in~n; 108029#L25 assume ~n <= 0;#res := 1; 108024#factFINAL assume true; 108018#factEXIT >#72#return; 108017#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; 108015#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 108016#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 108077#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 108008#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; 108009#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 108052#factENTRY ~n := #in~n; 108067#L25 assume !(~n <= 0); 108063#L26 call #t~ret0 := fact(~n - 1);< 108066#factENTRY ~n := #in~n; 108087#L25 assume !(~n <= 0); 108062#L26 call #t~ret0 := fact(~n - 1);< 108076#factENTRY ~n := #in~n; 108088#L25 assume ~n <= 0;#res := 1; 108086#factFINAL assume true; 108075#factEXIT >#66#return; 108074#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108069#factFINAL assume true; 108061#factEXIT >#66#return; 108059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108058#factFINAL assume true; 108049#factEXIT >#74#return; 108019#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 108025#factENTRY ~n := #in~n; 108093#L25 assume !(~n <= 0); 108041#L26 call #t~ret0 := fact(~n - 1);< 108045#factENTRY ~n := #in~n; 108078#L25 assume ~n <= 0;#res := 1; 108053#factFINAL assume true; 108040#factEXIT >#66#return; 108044#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108037#factFINAL assume true; 108031#factEXIT >#76#return; 108035#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 108095#factENTRY ~n := #in~n; 108104#L25 assume !(~n <= 0); 108101#L26 call #t~ret0 := fact(~n - 1);< 108102#factENTRY ~n := #in~n; 108105#L25 assume ~n <= 0;#res := 1; 108103#factFINAL assume true; 108100#factEXIT >#66#return; 108099#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108098#factFINAL assume true; 108094#factEXIT >#78#return; 108051#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; 108014#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 108013#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 108011#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 108012#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; 106759#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 106760#factENTRY ~n := #in~n; 106787#L25 assume !(~n <= 0); 106828#L26 call #t~ret0 := fact(~n - 1);< 108141#factENTRY ~n := #in~n; 108229#L25 assume !(~n <= 0); 108136#L26 call #t~ret0 := fact(~n - 1);< 108226#factENTRY ~n := #in~n; 108229#L25 assume !(~n <= 0); 108136#L26 call #t~ret0 := fact(~n - 1);< 108226#factENTRY ~n := #in~n; 108230#L25 assume ~n <= 0;#res := 1; 108227#factFINAL assume true; 108225#factEXIT >#66#return; 108224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108222#factFINAL assume true; 108221#factEXIT >#66#return; 108140#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108248#factFINAL assume true; 108135#factEXIT >#66#return; 108132#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108130#factFINAL assume true; 108131#factEXIT >#74#return; 106799#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 106834#factENTRY ~n := #in~n; 108233#L25 assume ~n <= 0;#res := 1; 108234#factFINAL assume true; 108235#factEXIT >#76#return; 106836#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 106837#factENTRY ~n := #in~n; 108232#L25 assume !(~n <= 0); 108138#L26 call #t~ret0 := fact(~n - 1);< 108231#factENTRY ~n := #in~n; 108228#L25 assume !(~n <= 0); 108137#L26 call #t~ret0 := fact(~n - 1);< 108141#factENTRY ~n := #in~n; 108229#L25 assume !(~n <= 0); 108136#L26 call #t~ret0 := fact(~n - 1);< 108226#factENTRY ~n := #in~n; 108230#L25 assume ~n <= 0;#res := 1; 108227#factFINAL assume true; 108225#factEXIT >#66#return; 108224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108222#factFINAL assume true; 108221#factEXIT >#66#return; 108140#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108248#factFINAL assume true; 108135#factEXIT >#66#return; 108132#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 108130#factFINAL assume true; 108131#factEXIT >#78#return; 108127#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; 108126#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 108125#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 108124#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 108123#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 108122#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 106848#L42-3 [2022-11-02 20:45:40,796 INFO L750 eck$LassoCheckResult]: Loop: 106848#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 106816#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; 106771#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 106772#factENTRY ~n := #in~n; 106846#L25 assume !(~n <= 0); 106843#L26 call #t~ret0 := fact(~n - 1);< 106845#factENTRY ~n := #in~n; 106853#L25 assume !(~n <= 0); 106842#L26 call #t~ret0 := fact(~n - 1);< 106852#factENTRY ~n := #in~n; 106853#L25 assume !(~n <= 0); 106842#L26 call #t~ret0 := fact(~n - 1);< 106852#factENTRY ~n := #in~n; 106853#L25 assume !(~n <= 0); 106842#L26 call #t~ret0 := fact(~n - 1);< 106852#factENTRY ~n := #in~n; 106854#L25 assume ~n <= 0;#res := 1; 106864#factFINAL assume true; 106863#factEXIT >#66#return; 106862#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106861#factFINAL assume true; 106859#factEXIT >#66#return; 106860#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107047#factFINAL assume true; 106841#factEXIT >#66#return; 106844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106850#factFINAL assume true; 106851#factEXIT >#66#return; 107045#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107044#factFINAL assume true; 107043#factEXIT >#68#return; 107042#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 106830#factENTRY ~n := #in~n; 107052#L25 assume ~n <= 0;#res := 1; 107050#factFINAL assume true; 107041#factEXIT >#70#return; 106933#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 106959#factENTRY ~n := #in~n; 107097#L25 assume !(~n <= 0); 106968#L26 call #t~ret0 := fact(~n - 1);< 107095#factENTRY ~n := #in~n; 107094#L25 assume !(~n <= 0); 106971#L26 call #t~ret0 := fact(~n - 1);< 107023#factENTRY ~n := #in~n; 107089#L25 assume !(~n <= 0); 106974#L26 call #t~ret0 := fact(~n - 1);< 107081#factENTRY ~n := #in~n; 107089#L25 assume !(~n <= 0); 106974#L26 call #t~ret0 := fact(~n - 1);< 107081#factENTRY ~n := #in~n; 107091#L25 assume ~n <= 0;#res := 1; 107088#factFINAL assume true; 107078#factEXIT >#66#return; 107075#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107063#factFINAL assume true; 107056#factEXIT >#66#return; 107059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107093#factFINAL assume true; 107021#factEXIT >#66#return; 106977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107099#factFINAL assume true; 106967#factEXIT >#66#return; 106975#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106957#factFINAL assume true; 106958#factEXIT >#72#return; 107014#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; 107037#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 107036#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 107035#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107033#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; 106946#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 106960#factENTRY ~n := #in~n; 107098#L25 assume !(~n <= 0); 106970#L26 call #t~ret0 := fact(~n - 1);< 107023#factENTRY ~n := #in~n; 107089#L25 assume !(~n <= 0); 106974#L26 call #t~ret0 := fact(~n - 1);< 107081#factENTRY ~n := #in~n; 107089#L25 assume !(~n <= 0); 106974#L26 call #t~ret0 := fact(~n - 1);< 107081#factENTRY ~n := #in~n; 107091#L25 assume ~n <= 0;#res := 1; 107088#factFINAL assume true; 107078#factEXIT >#66#return; 107075#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107063#factFINAL assume true; 107056#factEXIT >#66#return; 107059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107093#factFINAL assume true; 107021#factEXIT >#66#return; 106963#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106964#factFINAL assume true; 106926#factEXIT >#68#return; 106914#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 106925#factENTRY ~n := #in~n; 106998#L25 assume !(~n <= 0); 106969#L26 call #t~ret0 := fact(~n - 1);< 106993#factENTRY ~n := #in~n; 106997#L25 assume ~n <= 0;#res := 1; 106994#factFINAL assume true; 106989#factEXIT >#66#return; 106991#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107034#factFINAL assume true; 107030#factEXIT >#70#return; 106942#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 107015#factENTRY ~n := #in~n; 107062#L25 assume !(~n <= 0); 106972#L26 call #t~ret0 := fact(~n - 1);< 107023#factENTRY ~n := #in~n; 107089#L25 assume !(~n <= 0); 106974#L26 call #t~ret0 := fact(~n - 1);< 107081#factENTRY ~n := #in~n; 107089#L25 assume !(~n <= 0); 106974#L26 call #t~ret0 := fact(~n - 1);< 107081#factENTRY ~n := #in~n; 107089#L25 assume !(~n <= 0); 106974#L26 call #t~ret0 := fact(~n - 1);< 107081#factENTRY ~n := #in~n; 107091#L25 assume ~n <= 0;#res := 1; 107088#factFINAL assume true; 107078#factEXIT >#66#return; 107075#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107063#factFINAL assume true; 107056#factEXIT >#66#return; 107059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107093#factFINAL assume true; 107021#factEXIT >#66#return; 106977#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107099#factFINAL assume true; 106967#factEXIT >#66#return; 106975#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106957#factFINAL assume true; 106958#factEXIT >#72#return; 107011#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; 107008#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 107005#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 107006#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 107019#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; 106940#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 106956#factENTRY ~n := #in~n; 107046#L25 assume !(~n <= 0); 106978#L26 call #t~ret0 := fact(~n - 1);< 106979#factENTRY ~n := #in~n; 107096#L25 assume !(~n <= 0); 107057#L26 call #t~ret0 := fact(~n - 1);< 107060#factENTRY ~n := #in~n; 107000#L25 assume !(~n <= 0); 107079#L26 call #t~ret0 := fact(~n - 1);< 107080#factENTRY ~n := #in~n; 107091#L25 assume ~n <= 0;#res := 1; 107088#factFINAL assume true; 107078#factEXIT >#66#return; 107075#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107063#factFINAL assume true; 107056#factEXIT >#66#return; 107059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107093#factFINAL assume true; 107021#factEXIT >#66#return; 106963#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106964#factFINAL assume true; 106926#factEXIT >#68#return; 106912#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 106925#factENTRY ~n := #in~n; 106998#L25 assume !(~n <= 0); 106969#L26 call #t~ret0 := fact(~n - 1);< 106993#factENTRY ~n := #in~n; 107089#L25 assume !(~n <= 0); 106974#L26 call #t~ret0 := fact(~n - 1);< 107081#factENTRY ~n := #in~n; 107091#L25 assume ~n <= 0;#res := 1; 107088#factFINAL assume true; 107078#factEXIT >#66#return; 107075#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107063#factFINAL assume true; 107056#factEXIT >#66#return; 106976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107103#factFINAL assume true; 106910#factEXIT >#70#return; 106922#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 106961#factENTRY ~n := #in~n; 106996#L25 assume !(~n <= 0); 106973#L26 call #t~ret0 := fact(~n - 1);< 106993#factENTRY ~n := #in~n; 106997#L25 assume ~n <= 0;#res := 1; 106994#factFINAL assume true; 106989#factEXIT >#66#return; 106988#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106987#factFINAL assume true; 106984#factEXIT >#72#return; 106985#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; 107029#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 107028#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 106965#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 106966#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; 106936#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 106956#factENTRY ~n := #in~n; 107046#L25 assume !(~n <= 0); 106978#L26 call #t~ret0 := fact(~n - 1);< 106979#factENTRY ~n := #in~n; 107096#L25 assume !(~n <= 0); 107057#L26 call #t~ret0 := fact(~n - 1);< 107060#factENTRY ~n := #in~n; 107000#L25 assume !(~n <= 0); 107079#L26 call #t~ret0 := fact(~n - 1);< 107080#factENTRY ~n := #in~n; 107091#L25 assume ~n <= 0;#res := 1; 107088#factFINAL assume true; 107078#factEXIT >#66#return; 107075#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107063#factFINAL assume true; 107056#factEXIT >#66#return; 107059#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107093#factFINAL assume true; 107021#factEXIT >#66#return; 106963#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106964#factFINAL assume true; 106926#factEXIT >#68#return; 106919#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 106925#factENTRY ~n := #in~n; 106998#L25 assume !(~n <= 0); 106969#L26 call #t~ret0 := fact(~n - 1);< 106993#factENTRY ~n := #in~n; 107089#L25 assume !(~n <= 0); 106974#L26 call #t~ret0 := fact(~n - 1);< 107081#factENTRY ~n := #in~n; 107091#L25 assume ~n <= 0;#res := 1; 107088#factFINAL assume true; 107078#factEXIT >#66#return; 107075#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107063#factFINAL assume true; 107056#factEXIT >#66#return; 106976#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 107103#factFINAL assume true; 106910#factEXIT >#70#return; 106904#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 106907#factENTRY ~n := #in~n; 106909#L25 assume ~n <= 0;#res := 1; 106908#factFINAL assume true; 106903#factEXIT >#72#return; 106902#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; 106901#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 106900#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 106898#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 106899#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; 106757#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 106758#factENTRY ~n := #in~n; 106870#L25 assume !(~n <= 0); 106785#L26 call #t~ret0 := fact(~n - 1);< 106784#factENTRY ~n := #in~n; 106786#L25 assume !(~n <= 0); 106762#L26 call #t~ret0 := fact(~n - 1);< 106868#factENTRY ~n := #in~n; 106786#L25 assume !(~n <= 0); 106762#L26 call #t~ret0 := fact(~n - 1);< 106868#factENTRY ~n := #in~n; 106786#L25 assume !(~n <= 0); 106762#L26 call #t~ret0 := fact(~n - 1);< 106868#factENTRY ~n := #in~n; 106827#L25 assume ~n <= 0;#res := 1; 106775#factFINAL assume true; 106761#factEXIT >#66#return; 106763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106895#factFINAL assume true; 106893#factEXIT >#66#return; 106819#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106820#factFINAL assume true; 106894#factEXIT >#66#return; 106886#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106888#factFINAL assume true; 106885#factEXIT >#66#return; 106884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106883#factFINAL assume true; 106882#factEXIT >#74#return; 106796#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 106833#factENTRY ~n := #in~n; 106855#L25 assume !(~n <= 0); 106793#L26 call #t~ret0 := fact(~n - 1);< 106797#factENTRY ~n := #in~n; 106786#L25 assume !(~n <= 0); 106762#L26 call #t~ret0 := fact(~n - 1);< 106868#factENTRY ~n := #in~n; 106786#L25 assume !(~n <= 0); 106762#L26 call #t~ret0 := fact(~n - 1);< 106868#factENTRY ~n := #in~n; 106786#L25 assume !(~n <= 0); 106762#L26 call #t~ret0 := fact(~n - 1);< 106868#factENTRY ~n := #in~n; 106827#L25 assume ~n <= 0;#res := 1; 106775#factFINAL assume true; 106761#factEXIT >#66#return; 106763#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106895#factFINAL assume true; 106893#factEXIT >#66#return; 106819#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106820#factFINAL assume true; 106894#factEXIT >#66#return; 106886#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106888#factFINAL assume true; 106885#factEXIT >#66#return; 106884#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106883#factFINAL assume true; 106882#factEXIT >#76#return; 106857#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 106856#factENTRY ~n := #in~n; 106858#L25 assume !(~n <= 0); 106866#L26 call #t~ret0 := fact(~n - 1);< 106865#factENTRY ~n := #in~n; 106867#L25 assume ~n <= 0;#res := 1; 106881#factFINAL assume true; 106879#factEXIT >#66#return; 106877#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 106875#factFINAL assume true; 106873#factEXIT >#78#return; 106790#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; 106791#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 106801#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 106835#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 106807#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 106808#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 106848#L42-3 [2022-11-02 20:45:40,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:40,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1711259888, now seen corresponding path program 20 times [2022-11-02 20:45:40,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:40,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192824118] [2022-11-02 20:45:40,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:40,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:40,813 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:45:40,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1271290697] [2022-11-02 20:45:40,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:45:40,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:40,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:40,820 INFO L229 MonitoredProcess]: Starting monitored process 195 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:40,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (195)] Waiting until timeout for monitored process [2022-11-02 20:45:41,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:45:41,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:45:41,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:45:41,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:41,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 1114 proven. 8 refuted. 0 times theorem prover too weak. 4598 trivial. 0 not checked. [2022-11-02 20:45:41,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:41,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 240 proven. 20 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2022-11-02 20:45:41,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:41,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192824118] [2022-11-02 20:45:41,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:45:41,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271290697] [2022-11-02 20:45:41,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271290697] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:41,762 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:45:41,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-11-02 20:45:41,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523211879] [2022-11-02 20:45:41,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:41,763 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:45:41,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:41,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1903198865, now seen corresponding path program 21 times [2022-11-02 20:45:41,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:41,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833042281] [2022-11-02 20:45:41,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:41,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:41,780 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:45:41,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [358990693] [2022-11-02 20:45:41,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:45:41,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:41,786 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:41,789 INFO L229 MonitoredProcess]: Starting monitored process 196 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:41,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (196)] Waiting until timeout for monitored process [2022-11-02 20:45:41,972 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-11-02 20:45:41,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:45:41,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-02 20:45:41,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:42,741 INFO L134 CoverageAnalysis]: Checked inductivity of 6425 backedges. 835 proven. 377 refuted. 0 times theorem prover too weak. 5213 trivial. 0 not checked. [2022-11-02 20:45:42,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:46,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6425 backedges. 835 proven. 385 refuted. 0 times theorem prover too weak. 5205 trivial. 0 not checked. [2022-11-02 20:45:46,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:46,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833042281] [2022-11-02 20:45:46,129 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:45:46,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358990693] [2022-11-02 20:45:46,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358990693] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:46,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:45:46,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 29 [2022-11-02 20:45:46,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020324898] [2022-11-02 20:45:46,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:46,130 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:45:46,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:46,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-02 20:45:46,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2022-11-02 20:45:46,132 INFO L87 Difference]: Start difference. First operand 1520 states and 2144 transitions. cyclomatic complexity: 642 Second operand has 30 states, 25 states have (on average 2.52) internal successors, (63), 28 states have internal predecessors, (63), 16 states have call successors, (23), 1 states have call predecessors, (23), 7 states have return successors, (25), 12 states have call predecessors, (25), 16 states have call successors, (25) [2022-11-02 20:45:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:45:51,928 INFO L93 Difference]: Finished difference Result 2225 states and 3305 transitions. [2022-11-02 20:45:51,928 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2225 states and 3305 transitions. [2022-11-02 20:45:51,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 340 [2022-11-02 20:45:51,960 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2225 states to 2204 states and 3281 transitions. [2022-11-02 20:45:51,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2022-11-02 20:45:51,961 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2022-11-02 20:45:51,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2204 states and 3281 transitions. [2022-11-02 20:45:51,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:45:51,962 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2204 states and 3281 transitions. [2022-11-02 20:45:51,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states and 3281 transitions. [2022-11-02 20:45:52,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 1687. [2022-11-02 20:45:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1687 states, 1083 states have (on average 1.0738688827331486) internal successors, (1163), 1089 states have internal predecessors, (1163), 444 states have call successors, (444), 154 states have call predecessors, (444), 160 states have return successors, (867), 443 states have call predecessors, (867), 444 states have call successors, (867) [2022-11-02 20:45:52,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1687 states to 1687 states and 2474 transitions. [2022-11-02 20:45:52,033 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1687 states and 2474 transitions. [2022-11-02 20:45:52,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:45:52,033 INFO L428 stractBuchiCegarLoop]: Abstraction has 1687 states and 2474 transitions. [2022-11-02 20:45:52,034 INFO L335 stractBuchiCegarLoop]: ======== Iteration 33 ============ [2022-11-02 20:45:52,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1687 states and 2474 transitions. [2022-11-02 20:45:52,041 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 175 [2022-11-02 20:45:52,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:45:52,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:45:52,044 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [50, 50, 26, 26, 26, 26, 24, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-02 20:45:52,044 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [50, 50, 35, 35, 35, 35, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:45:52,045 INFO L748 eck$LassoCheckResult]: Stem: 114519#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 114502#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; 114503#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 114518#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; 114508#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 114509#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114747#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; 114737#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 114738#factENTRY ~n := #in~n; 114741#L25 assume ~n <= 0;#res := 1; 114739#factFINAL assume true; 114736#factEXIT >#68#return; 114734#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 114735#factENTRY ~n := #in~n; 114742#L25 assume ~n <= 0;#res := 1; 114740#factFINAL assume true; 114733#factEXIT >#70#return; 114731#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 114732#factENTRY ~n := #in~n; 114746#L25 assume ~n <= 0;#res := 1; 114744#factFINAL assume true; 114730#factEXIT >#72#return; 114728#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; 114723#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 114713#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 114712#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114711#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; 114705#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 114706#factENTRY ~n := #in~n; 114729#L25 assume !(~n <= 0); 114726#L26 call #t~ret0 := fact(~n - 1);< 114727#factENTRY ~n := #in~n; 114745#L25 assume ~n <= 0;#res := 1; 114743#factFINAL assume true; 114725#factEXIT >#66#return; 114722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114718#factFINAL assume true; 114704#factEXIT >#74#return; 114701#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 114702#factENTRY ~n := #in~n; 114720#L25 assume ~n <= 0;#res := 1; 114717#factFINAL assume true; 114700#factEXIT >#76#return; 114697#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 114698#factENTRY ~n := #in~n; 114710#L25 assume !(~n <= 0); 114708#L26 call #t~ret0 := fact(~n - 1);< 114709#factENTRY ~n := #in~n; 114724#L25 assume ~n <= 0;#res := 1; 114721#factFINAL assume true; 114707#factEXIT >#66#return; 114703#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114699#factFINAL assume true; 114696#factEXIT >#78#return; 114695#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; 114694#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 114693#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 114692#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114691#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; 114663#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 114690#factENTRY ~n := #in~n; 114833#L25 assume !(~n <= 0); 114826#L26 call #t~ret0 := fact(~n - 1);< 114829#factENTRY ~n := #in~n; 114840#L25 assume !(~n <= 0); 114823#L26 call #t~ret0 := fact(~n - 1);< 115032#factENTRY ~n := #in~n; 115034#L25 assume ~n <= 0;#res := 1; 115033#factFINAL assume true; 115030#factEXIT >#66#return; 115031#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115036#factFINAL assume true; 115035#factEXIT >#66#return; 114748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114749#factFINAL assume true; 114662#factEXIT >#74#return; 114665#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 114676#factENTRY ~n := #in~n; 114684#L25 assume ~n <= 0;#res := 1; 114682#factFINAL assume true; 114674#factEXIT >#76#return; 114664#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 114690#factENTRY ~n := #in~n; 114833#L25 assume !(~n <= 0); 114826#L26 call #t~ret0 := fact(~n - 1);< 114829#factENTRY ~n := #in~n; 114840#L25 assume !(~n <= 0); 114823#L26 call #t~ret0 := fact(~n - 1);< 115032#factENTRY ~n := #in~n; 115034#L25 assume ~n <= 0;#res := 1; 115033#factFINAL assume true; 115030#factEXIT >#66#return; 115031#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115036#factFINAL assume true; 115035#factEXIT >#66#return; 114748#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114749#factFINAL assume true; 114662#factEXIT >#78#return; 114661#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; 114653#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 114647#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 114645#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114635#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; 114626#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 114631#factENTRY ~n := #in~n; 114677#L25 assume !(~n <= 0); 114639#L26 call #t~ret0 := fact(~n - 1);< 114644#factENTRY ~n := #in~n; 114650#L25 assume !(~n <= 0); 114640#L26 call #t~ret0 := fact(~n - 1);< 114658#factENTRY ~n := #in~n; 114650#L25 assume !(~n <= 0); 114640#L26 call #t~ret0 := fact(~n - 1);< 114658#factENTRY ~n := #in~n; 114660#L25 assume ~n <= 0;#res := 1; 114659#factFINAL assume true; 114657#factEXIT >#66#return; 114656#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114655#factFINAL assume true; 114654#factEXIT >#66#return; 114643#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114649#factFINAL assume true; 114638#factEXIT >#66#return; 114634#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114630#factFINAL assume true; 114625#factEXIT >#74#return; 114628#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 114633#factENTRY ~n := #in~n; 114646#L25 assume ~n <= 0;#res := 1; 114637#factFINAL assume true; 114632#factEXIT >#76#return; 114627#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 114629#factENTRY ~n := #in~n; 114648#L25 assume !(~n <= 0); 114641#L26 call #t~ret0 := fact(~n - 1);< 114651#factENTRY ~n := #in~n; 114652#L25 assume !(~n <= 0); 114642#L26 call #t~ret0 := fact(~n - 1);< 114644#factENTRY ~n := #in~n; 114650#L25 assume !(~n <= 0); 114640#L26 call #t~ret0 := fact(~n - 1);< 114658#factENTRY ~n := #in~n; 114660#L25 assume ~n <= 0;#res := 1; 114659#factFINAL assume true; 114657#factEXIT >#66#return; 114656#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114655#factFINAL assume true; 114654#factEXIT >#66#return; 114643#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114649#factFINAL assume true; 114638#factEXIT >#66#return; 114634#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114630#factFINAL assume true; 114625#factEXIT >#78#return; 114624#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; 114623#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 114622#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 114617#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 114615#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 114606#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 114526#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114527#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; 115833#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 115834#factENTRY ~n := #in~n; 115850#L25 assume !(~n <= 0); 115846#L26 call #t~ret0 := fact(~n - 1);< 115847#factENTRY ~n := #in~n; 115851#L25 assume ~n <= 0;#res := 1; 115849#factFINAL assume true; 115845#factEXIT >#66#return; 115837#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115836#factFINAL assume true; 115832#factEXIT >#68#return; 115797#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 115798#factENTRY ~n := #in~n; 115801#L25 assume ~n <= 0;#res := 1; 115799#factFINAL assume true; 115796#factEXIT >#70#return; 115784#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 115794#factENTRY ~n := #in~n; 115839#L25 assume !(~n <= 0); 115778#L26 call #t~ret0 := fact(~n - 1);< 115790#factENTRY ~n := #in~n; 115791#L25 assume ~n <= 0;#res := 1; 115789#factFINAL assume true; 115777#factEXIT >#66#return; 115781#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115793#factFINAL assume true; 115783#factEXIT >#72#return; 115785#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; 115821#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 115819#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 115814#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 115811#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; 115764#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 115768#factENTRY ~n := #in~n; 115826#L25 assume !(~n <= 0); 115779#L26 call #t~ret0 := fact(~n - 1);< 115782#factENTRY ~n := #in~n; 115791#L25 assume ~n <= 0;#res := 1; 115789#factFINAL assume true; 115777#factEXIT >#66#return; 115781#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115793#factFINAL assume true; 115783#factEXIT >#68#return; 115770#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 115771#factENTRY ~n := #in~n; 115786#L25 assume !(~n <= 0); 115780#L26 call #t~ret0 := fact(~n - 1);< 115782#factENTRY ~n := #in~n; 115791#L25 assume ~n <= 0;#res := 1; 115789#factFINAL assume true; 115777#factEXIT >#66#return; 115776#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115775#factFINAL assume true; 115769#factEXIT >#70#return; 115761#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 115766#factENTRY ~n := #in~n; 115772#L25 assume ~n <= 0;#res := 1; 115767#factFINAL assume true; 115760#factEXIT >#72#return; 115759#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; 115758#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 115757#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 115756#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 115755#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; 115753#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 115754#factENTRY ~n := #in~n; 115808#L25 assume !(~n <= 0); 115803#L26 call #t~ret0 := fact(~n - 1);< 115807#factENTRY ~n := #in~n; 115820#L25 assume !(~n <= 0); 115804#L26 call #t~ret0 := fact(~n - 1);< 115818#factENTRY ~n := #in~n; 115848#L25 assume ~n <= 0;#res := 1; 115831#factFINAL assume true; 115817#factEXIT >#66#return; 115813#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115809#factFINAL assume true; 115802#factEXIT >#66#return; 115800#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115795#factFINAL assume true; 115792#factEXIT >#74#return; 115762#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 115768#factENTRY ~n := #in~n; 115826#L25 assume !(~n <= 0); 115779#L26 call #t~ret0 := fact(~n - 1);< 115782#factENTRY ~n := #in~n; 115791#L25 assume ~n <= 0;#res := 1; 115789#factFINAL assume true; 115777#factEXIT >#66#return; 115781#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115793#factFINAL assume true; 115783#factEXIT >#76#return; 115750#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 115751#factENTRY ~n := #in~n; 115835#L25 assume !(~n <= 0); 115824#L26 call #t~ret0 := fact(~n - 1);< 115825#factENTRY ~n := #in~n; 115828#L25 assume ~n <= 0;#res := 1; 115827#factFINAL assume true; 115823#factEXIT >#66#return; 115822#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115752#factFINAL assume true; 115749#factEXIT >#78#return; 115748#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; 115744#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 115707#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 115706#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 115704#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; 115701#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 115703#factENTRY ~n := #in~n; 115746#L25 assume !(~n <= 0); 115718#L26 call #t~ret0 := fact(~n - 1);< 115723#factENTRY ~n := #in~n; 115741#L25 assume !(~n <= 0); 115720#L26 call #t~ret0 := fact(~n - 1);< 115738#factENTRY ~n := #in~n; 115741#L25 assume !(~n <= 0); 115720#L26 call #t~ret0 := fact(~n - 1);< 115738#factENTRY ~n := #in~n; 115742#L25 assume ~n <= 0;#res := 1; 115739#factFINAL assume true; 115737#factEXIT >#66#return; 115736#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115733#factFINAL assume true; 115724#factEXIT >#66#return; 115722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115745#factFINAL assume true; 115716#factEXIT >#66#return; 115714#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115700#factFINAL assume true; 115702#factEXIT >#74#return; 115709#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 115710#factENTRY ~n := #in~n; 115728#L25 assume ~n <= 0;#res := 1; 115726#factFINAL assume true; 115713#factEXIT >#76#return; 115698#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 115699#factENTRY ~n := #in~n; 115747#L25 assume !(~n <= 0); 115717#L26 call #t~ret0 := fact(~n - 1);< 115743#factENTRY ~n := #in~n; 115740#L25 assume !(~n <= 0); 115721#L26 call #t~ret0 := fact(~n - 1);< 115723#factENTRY ~n := #in~n; 115741#L25 assume !(~n <= 0); 115720#L26 call #t~ret0 := fact(~n - 1);< 115738#factENTRY ~n := #in~n; 115742#L25 assume ~n <= 0;#res := 1; 115739#factFINAL assume true; 115737#factEXIT >#66#return; 115736#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115733#factFINAL assume true; 115724#factEXIT >#66#return; 115722#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115745#factFINAL assume true; 115716#factEXIT >#66#return; 115714#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115700#factFINAL assume true; 115702#factEXIT >#78#return; 115697#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; 115844#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 115843#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 115842#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 115841#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 115840#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 114547#L42-3 [2022-11-02 20:45:52,046 INFO L750 eck$LassoCheckResult]: Loop: 114547#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 114520#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; 114469#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 114470#factENTRY ~n := #in~n; 114560#L25 assume !(~n <= 0); 114555#L26 call #t~ret0 := fact(~n - 1);< 114559#factENTRY ~n := #in~n; 114564#L25 assume !(~n <= 0); 114556#L26 call #t~ret0 := fact(~n - 1);< 114563#factENTRY ~n := #in~n; 114564#L25 assume !(~n <= 0); 114556#L26 call #t~ret0 := fact(~n - 1);< 114563#factENTRY ~n := #in~n; 114565#L25 assume ~n <= 0;#res := 1; 114572#factFINAL assume true; 114571#factEXIT >#66#return; 114570#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114569#factFINAL assume true; 114567#factEXIT >#66#return; 114568#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114561#factFINAL assume true; 114562#factEXIT >#66#return; 114552#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114553#factFINAL assume true; 114549#factEXIT >#68#return; 114538#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 114539#factENTRY ~n := #in~n; 115950#L25 assume ~n <= 0;#res := 1; 115949#factFINAL assume true; 115945#factEXIT >#70#return; 115859#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 115940#factENTRY ~n := #in~n; 115939#L25 assume !(~n <= 0); 115894#L26 call #t~ret0 := fact(~n - 1);< 115936#factENTRY ~n := #in~n; 115935#L25 assume !(~n <= 0); 115888#L26 call #t~ret0 := fact(~n - 1);< 115898#factENTRY ~n := #in~n; 115934#L25 assume !(~n <= 0); 115890#L26 call #t~ret0 := fact(~n - 1);< 115928#factENTRY ~n := #in~n; 115934#L25 assume !(~n <= 0); 115890#L26 call #t~ret0 := fact(~n - 1);< 115928#factENTRY ~n := #in~n; 115931#L25 assume ~n <= 0;#res := 1; 115930#factFINAL assume true; 115925#factEXIT >#66#return; 115924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115918#factFINAL assume true; 115910#factEXIT >#66#return; 115914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115899#factFINAL assume true; 115901#factEXIT >#66#return; 115895#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115909#factFINAL assume true; 115887#factEXIT >#66#return; 115896#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 116062#factFINAL assume true; 115856#factEXIT >#72#return; 115874#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; 116068#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 116066#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 116064#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 116063#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; 115881#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 115937#factENTRY ~n := #in~n; 115929#L25 assume !(~n <= 0); 115900#L26 call #t~ret0 := fact(~n - 1);< 115921#factENTRY ~n := #in~n; 115920#L25 assume !(~n <= 0); 115913#L26 call #t~ret0 := fact(~n - 1);< 115917#factENTRY ~n := #in~n; 115933#L25 assume !(~n <= 0); 115926#L26 call #t~ret0 := fact(~n - 1);< 115927#factENTRY ~n := #in~n; 115931#L25 assume ~n <= 0;#res := 1; 115930#factFINAL assume true; 115925#factEXIT >#66#return; 115924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115918#factFINAL assume true; 115910#factEXIT >#66#return; 115914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115899#factFINAL assume true; 115901#factEXIT >#66#return; 115886#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115879#factFINAL assume true; 115885#factEXIT >#68#return; 115906#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 114541#factENTRY ~n := #in~n; 115922#L25 assume !(~n <= 0); 115892#L26 call #t~ret0 := fact(~n - 1);< 115908#factENTRY ~n := #in~n; 115958#L25 assume ~n <= 0;#res := 1; 115965#factFINAL assume true; 115963#factEXIT >#66#return; 115962#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115961#factFINAL assume true; 115960#factEXIT >#70#return; 115868#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 115959#factENTRY ~n := #in~n; 115941#L25 assume !(~n <= 0); 115893#L26 call #t~ret0 := fact(~n - 1);< 115898#factENTRY ~n := #in~n; 115934#L25 assume !(~n <= 0); 115890#L26 call #t~ret0 := fact(~n - 1);< 115928#factENTRY ~n := #in~n; 115934#L25 assume !(~n <= 0); 115890#L26 call #t~ret0 := fact(~n - 1);< 115928#factENTRY ~n := #in~n; 115934#L25 assume !(~n <= 0); 115890#L26 call #t~ret0 := fact(~n - 1);< 115928#factENTRY ~n := #in~n; 115931#L25 assume ~n <= 0;#res := 1; 115930#factFINAL assume true; 115925#factEXIT >#66#return; 115924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115918#factFINAL assume true; 115910#factEXIT >#66#return; 115914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115899#factFINAL assume true; 115901#factEXIT >#66#return; 115895#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115909#factFINAL assume true; 115887#factEXIT >#66#return; 115896#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 116062#factFINAL assume true; 115856#factEXIT >#72#return; 115875#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; 116086#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 116084#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 116082#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 116080#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; 115880#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 115937#factENTRY ~n := #in~n; 115929#L25 assume !(~n <= 0); 115900#L26 call #t~ret0 := fact(~n - 1);< 115921#factENTRY ~n := #in~n; 115920#L25 assume !(~n <= 0); 115913#L26 call #t~ret0 := fact(~n - 1);< 115917#factENTRY ~n := #in~n; 115933#L25 assume !(~n <= 0); 115926#L26 call #t~ret0 := fact(~n - 1);< 115927#factENTRY ~n := #in~n; 115931#L25 assume ~n <= 0;#res := 1; 115930#factFINAL assume true; 115925#factEXIT >#66#return; 115924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115918#factFINAL assume true; 115910#factEXIT >#66#return; 115914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115899#factFINAL assume true; 115901#factEXIT >#66#return; 115886#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115879#factFINAL assume true; 115885#factEXIT >#68#return; 115903#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 114541#factENTRY ~n := #in~n; 115922#L25 assume !(~n <= 0); 115892#L26 call #t~ret0 := fact(~n - 1);< 115908#factENTRY ~n := #in~n; 115934#L25 assume !(~n <= 0); 115890#L26 call #t~ret0 := fact(~n - 1);< 115928#factENTRY ~n := #in~n; 115931#L25 assume ~n <= 0;#res := 1; 115930#factFINAL assume true; 115925#factEXIT >#66#return; 115924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115918#factFINAL assume true; 115910#factEXIT >#66#return; 115916#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 116090#factFINAL assume true; 116087#factEXIT >#70#return; 114483#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 114543#factENTRY ~n := #in~n; 115948#L25 assume !(~n <= 0); 115889#L26 call #t~ret0 := fact(~n - 1);< 115908#factENTRY ~n := #in~n; 115958#L25 assume ~n <= 0;#res := 1; 115965#factFINAL assume true; 115963#factEXIT >#66#return; 115964#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114478#factFINAL assume true; 114495#factEXIT >#72#return; 116103#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; 116133#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 116132#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 116131#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 116130#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; 115882#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 115937#factENTRY ~n := #in~n; 115929#L25 assume !(~n <= 0); 115900#L26 call #t~ret0 := fact(~n - 1);< 115921#factENTRY ~n := #in~n; 115920#L25 assume !(~n <= 0); 115913#L26 call #t~ret0 := fact(~n - 1);< 115917#factENTRY ~n := #in~n; 115933#L25 assume !(~n <= 0); 115926#L26 call #t~ret0 := fact(~n - 1);< 115927#factENTRY ~n := #in~n; 115931#L25 assume ~n <= 0;#res := 1; 115930#factFINAL assume true; 115925#factEXIT >#66#return; 115924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115918#factFINAL assume true; 115910#factEXIT >#66#return; 115914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115899#factFINAL assume true; 115901#factEXIT >#66#return; 115886#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115879#factFINAL assume true; 115885#factEXIT >#68#return; 115902#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 114541#factENTRY ~n := #in~n; 115922#L25 assume !(~n <= 0); 115892#L26 call #t~ret0 := fact(~n - 1);< 115908#factENTRY ~n := #in~n; 115934#L25 assume !(~n <= 0); 115890#L26 call #t~ret0 := fact(~n - 1);< 115928#factENTRY ~n := #in~n; 115934#L25 assume !(~n <= 0); 115890#L26 call #t~ret0 := fact(~n - 1);< 115928#factENTRY ~n := #in~n; 115931#L25 assume ~n <= 0;#res := 1; 115930#factFINAL assume true; 115925#factEXIT >#66#return; 115924#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115918#factFINAL assume true; 115910#factEXIT >#66#return; 115914#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 115899#factFINAL assume true; 115901#factEXIT >#66#return; 115897#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 116088#factFINAL assume true; 116089#factEXIT >#70#return; 114536#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 114468#factENTRY ~n := #in~n; 114531#L25 assume ~n <= 0;#res := 1; 114537#factFINAL assume true; 116102#factEXIT >#72#return; 116107#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; 116129#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 116128#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 116127#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 116126#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; 114575#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 114452#factENTRY ~n := #in~n; 114597#L25 assume !(~n <= 0); 114581#L26 call #t~ret0 := fact(~n - 1);< 114583#factENTRY ~n := #in~n; 114586#L25 assume !(~n <= 0); 114579#L26 call #t~ret0 := fact(~n - 1);< 114585#factENTRY ~n := #in~n; 114586#L25 assume !(~n <= 0); 114579#L26 call #t~ret0 := fact(~n - 1);< 114585#factENTRY ~n := #in~n; 114586#L25 assume !(~n <= 0); 114579#L26 call #t~ret0 := fact(~n - 1);< 114585#factENTRY ~n := #in~n; 114589#L25 assume ~n <= 0;#res := 1; 114600#factFINAL assume true; 114599#factEXIT >#66#return; 114598#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114596#factFINAL assume true; 114594#factEXIT >#66#return; 114592#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114590#factFINAL assume true; 114587#factEXIT >#66#return; 114582#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114584#factFINAL assume true; 114578#factEXIT >#66#return; 114577#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114576#factFINAL assume true; 114573#factEXIT >#74#return; 114474#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 114542#factENTRY ~n := #in~n; 114593#L25 assume !(~n <= 0); 114580#L26 call #t~ret0 := fact(~n - 1);< 114591#factENTRY ~n := #in~n; 114586#L25 assume !(~n <= 0); 114579#L26 call #t~ret0 := fact(~n - 1);< 114585#factENTRY ~n := #in~n; 114586#L25 assume !(~n <= 0); 114579#L26 call #t~ret0 := fact(~n - 1);< 114585#factENTRY ~n := #in~n; 114589#L25 assume ~n <= 0;#res := 1; 114600#factFINAL assume true; 114599#factEXIT >#66#return; 114598#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114596#factFINAL assume true; 114594#factEXIT >#66#return; 114592#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114590#factFINAL assume true; 114587#factEXIT >#66#return; 114588#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 116137#factFINAL assume true; 116134#factEXIT >#76#return; 114456#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 114545#factENTRY ~n := #in~n; 114601#L25 assume !(~n <= 0); 114497#L26 call #t~ret0 := fact(~n - 1);< 114496#factENTRY ~n := #in~n; 114498#L25 assume ~n <= 0;#res := 1; 114530#factFINAL assume true; 114836#factEXIT >#66#return; 114522#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 114523#factFINAL assume true; 114455#factEXIT >#78#return; 114457#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; 114504#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 114506#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 114544#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 114514#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 114515#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 114547#L42-3 [2022-11-02 20:45:52,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:52,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1711259888, now seen corresponding path program 21 times [2022-11-02 20:45:52,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:52,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023132870] [2022-11-02 20:45:52,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:52,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:52,063 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:45:52,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1513961249] [2022-11-02 20:45:52,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:45:52,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:52,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:52,069 INFO L229 MonitoredProcess]: Starting monitored process 197 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:52,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (197)] Waiting until timeout for monitored process [2022-11-02 20:45:52,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-11-02 20:45:52,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:45:52,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 20:45:52,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 664 proven. 11 refuted. 0 times theorem prover too weak. 5045 trivial. 0 not checked. [2022-11-02 20:45:52,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:54,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 664 proven. 15 refuted. 0 times theorem prover too weak. 5041 trivial. 0 not checked. [2022-11-02 20:45:54,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:54,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023132870] [2022-11-02 20:45:54,468 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:45:54,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513961249] [2022-11-02 20:45:54,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1513961249] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:54,468 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:45:54,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2022-11-02 20:45:54,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34644383] [2022-11-02 20:45:54,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:54,470 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:45:54,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:45:54,471 INFO L85 PathProgramCache]: Analyzing trace with hash 958639817, now seen corresponding path program 22 times [2022-11-02 20:45:54,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:45:54,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335647770] [2022-11-02 20:45:54,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:45:54,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:45:54,480 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:45:54,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1376950065] [2022-11-02 20:45:54,480 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:45:54,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:45:54,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:45:54,483 INFO L229 MonitoredProcess]: Starting monitored process 198 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:45:54,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (198)] Waiting until timeout for monitored process [2022-11-02 20:45:54,692 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:45:54,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:45:54,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-02 20:45:54,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:45:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 6155 backedges. 2805 proven. 313 refuted. 0 times theorem prover too weak. 3037 trivial. 0 not checked. [2022-11-02 20:45:55,429 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:45:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 6155 backedges. 101 proven. 1636 refuted. 0 times theorem prover too weak. 4418 trivial. 0 not checked. [2022-11-02 20:45:59,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:45:59,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335647770] [2022-11-02 20:45:59,594 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:45:59,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376950065] [2022-11-02 20:45:59,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1376950065] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:45:59,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:45:59,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23] total 27 [2022-11-02 20:45:59,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696512439] [2022-11-02 20:45:59,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:45:59,595 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:45:59,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:45:59,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 20:45:59,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:45:59,596 INFO L87 Difference]: Start difference. First operand 1687 states and 2474 transitions. cyclomatic complexity: 805 Second operand has 27 states, 22 states have (on average 3.0) internal successors, (66), 25 states have internal predecessors, (66), 16 states have call successors, (31), 2 states have call predecessors, (31), 10 states have return successors, (35), 13 states have call predecessors, (35), 16 states have call successors, (35) [2022-11-02 20:46:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:02,513 INFO L93 Difference]: Finished difference Result 1923 states and 2815 transitions. [2022-11-02 20:46:02,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1923 states and 2815 transitions. [2022-11-02 20:46:02,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 193 [2022-11-02 20:46:02,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1923 states to 1923 states and 2815 transitions. [2022-11-02 20:46:02,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 106 [2022-11-02 20:46:02,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 106 [2022-11-02 20:46:02,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1923 states and 2815 transitions. [2022-11-02 20:46:02,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:46:02,543 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1923 states and 2815 transitions. [2022-11-02 20:46:02,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states and 2815 transitions. [2022-11-02 20:46:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1642. [2022-11-02 20:46:02,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1049 states have (on average 1.0762631077216396) internal successors, (1129), 1052 states have internal predecessors, (1129), 433 states have call successors, (433), 157 states have call predecessors, (433), 160 states have return successors, (830), 432 states have call predecessors, (830), 433 states have call successors, (830) [2022-11-02 20:46:02,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2392 transitions. [2022-11-02 20:46:02,606 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1642 states and 2392 transitions. [2022-11-02 20:46:02,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:46:02,608 INFO L428 stractBuchiCegarLoop]: Abstraction has 1642 states and 2392 transitions. [2022-11-02 20:46:02,608 INFO L335 stractBuchiCegarLoop]: ======== Iteration 34 ============ [2022-11-02 20:46:02,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1642 states and 2392 transitions. [2022-11-02 20:46:02,615 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 170 [2022-11-02 20:46:02,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:46:02,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:46:02,618 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [50, 50, 26, 26, 26, 26, 24, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-02 20:46:02,618 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [51, 51, 36, 36, 36, 36, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:02,619 INFO L748 eck$LassoCheckResult]: Stem: 122009#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 121985#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; 121986#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 122008#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; 121996#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 121997#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 122204#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; 122200#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 122201#factENTRY ~n := #in~n; 122205#L25 assume ~n <= 0;#res := 1; 122203#factFINAL assume true; 122199#factEXIT >#68#return; 122195#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 122196#factENTRY ~n := #in~n; 122202#L25 assume ~n <= 0;#res := 1; 122198#factFINAL assume true; 122194#factEXIT >#70#return; 122191#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 122192#factENTRY ~n := #in~n; 122197#L25 assume ~n <= 0;#res := 1; 122193#factFINAL assume true; 122190#factEXIT >#72#return; 122188#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; 122187#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 122184#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 122180#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 122179#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; 122168#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 122169#factENTRY ~n := #in~n; 122189#L25 assume !(~n <= 0); 122177#L26 call #t~ret0 := fact(~n - 1);< 122178#factENTRY ~n := #in~n; 122186#L25 assume ~n <= 0;#res := 1; 122183#factFINAL assume true; 122176#factEXIT >#66#return; 122175#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122174#factFINAL assume true; 122167#factEXIT >#74#return; 122163#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 122164#factENTRY ~n := #in~n; 122173#L25 assume ~n <= 0;#res := 1; 122166#factFINAL assume true; 122162#factEXIT >#76#return; 122159#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 122160#factENTRY ~n := #in~n; 122182#L25 assume !(~n <= 0); 122171#L26 call #t~ret0 := fact(~n - 1);< 122172#factENTRY ~n := #in~n; 122185#L25 assume ~n <= 0;#res := 1; 122181#factFINAL assume true; 122170#factEXIT >#66#return; 122165#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122161#factFINAL assume true; 122158#factEXIT >#78#return; 122157#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; 122156#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 122155#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 122154#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 122153#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; 122140#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 122150#factENTRY ~n := #in~n; 122221#L25 assume !(~n <= 0); 122214#L26 call #t~ret0 := fact(~n - 1);< 122219#factENTRY ~n := #in~n; 122233#L25 assume !(~n <= 0); 122217#L26 call #t~ret0 := fact(~n - 1);< 122251#factENTRY ~n := #in~n; 122253#L25 assume ~n <= 0;#res := 1; 122252#factFINAL assume true; 122249#factEXIT >#66#return; 122250#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122257#factFINAL assume true; 122256#factEXIT >#66#return; 122255#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122254#factFINAL assume true; 122139#factEXIT >#74#return; 122142#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 122147#factENTRY ~n := #in~n; 122149#L25 assume ~n <= 0;#res := 1; 122148#factFINAL assume true; 122145#factEXIT >#76#return; 122141#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 122150#factENTRY ~n := #in~n; 122221#L25 assume !(~n <= 0); 122214#L26 call #t~ret0 := fact(~n - 1);< 122219#factENTRY ~n := #in~n; 122233#L25 assume !(~n <= 0); 122217#L26 call #t~ret0 := fact(~n - 1);< 122251#factENTRY ~n := #in~n; 122253#L25 assume ~n <= 0;#res := 1; 122252#factFINAL assume true; 122249#factEXIT >#66#return; 122250#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122257#factFINAL assume true; 122256#factEXIT >#66#return; 122255#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122254#factFINAL assume true; 122139#factEXIT >#78#return; 122131#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; 122129#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 122127#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 122126#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 122124#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; 122115#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 122122#factENTRY ~n := #in~n; 122152#L25 assume !(~n <= 0); 122133#L26 call #t~ret0 := fact(~n - 1);< 122138#factENTRY ~n := #in~n; 122211#L25 assume !(~n <= 0); 122136#L26 call #t~ret0 := fact(~n - 1);< 122226#factENTRY ~n := #in~n; 122211#L25 assume !(~n <= 0); 122136#L26 call #t~ret0 := fact(~n - 1);< 122226#factENTRY ~n := #in~n; 122228#L25 assume ~n <= 0;#res := 1; 122227#factFINAL assume true; 122225#factEXIT >#66#return; 122224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122223#factFINAL assume true; 122222#factEXIT >#66#return; 122137#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122209#factFINAL assume true; 122132#factEXIT >#66#return; 122130#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122128#factFINAL assume true; 122114#factEXIT >#74#return; 122117#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 122120#factENTRY ~n := #in~n; 122123#L25 assume ~n <= 0;#res := 1; 122121#factFINAL assume true; 122119#factEXIT >#76#return; 122116#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 122118#factENTRY ~n := #in~n; 122151#L25 assume !(~n <= 0); 122134#L26 call #t~ret0 := fact(~n - 1);< 122229#factENTRY ~n := #in~n; 122210#L25 assume !(~n <= 0); 122135#L26 call #t~ret0 := fact(~n - 1);< 122138#factENTRY ~n := #in~n; 122211#L25 assume !(~n <= 0); 122136#L26 call #t~ret0 := fact(~n - 1);< 122226#factENTRY ~n := #in~n; 122228#L25 assume ~n <= 0;#res := 1; 122227#factFINAL assume true; 122225#factEXIT >#66#return; 122224#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122223#factFINAL assume true; 122222#factEXIT >#66#return; 122137#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122209#factFINAL assume true; 122132#factEXIT >#66#return; 122130#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122128#factFINAL assume true; 122114#factEXIT >#78#return; 122112#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; 122110#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 122108#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 122107#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 122106#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 122104#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 122016#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 122017#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; 123342#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 123366#factENTRY ~n := #in~n; 123426#L25 assume !(~n <= 0); 123405#L26 call #t~ret0 := fact(~n - 1);< 123406#factENTRY ~n := #in~n; 123411#L25 assume ~n <= 0;#res := 1; 123410#factFINAL assume true; 123404#factEXIT >#66#return; 123402#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123353#factFINAL assume true; 123354#factEXIT >#68#return; 123364#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 123365#factENTRY ~n := #in~n; 123409#L25 assume ~n <= 0;#res := 1; 123408#factFINAL assume true; 123363#factEXIT >#70#return; 123337#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 123355#factENTRY ~n := #in~n; 123383#L25 assume !(~n <= 0); 123374#L26 call #t~ret0 := fact(~n - 1);< 123490#factENTRY ~n := #in~n; 123381#L25 assume ~n <= 0;#res := 1; 123380#factFINAL assume true; 123373#factEXIT >#66#return; 123371#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123367#factFINAL assume true; 123336#factEXIT >#72#return; 123340#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; 123379#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 123372#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 123369#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 123368#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; 121974#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 121975#factENTRY ~n := #in~n; 123384#L25 assume !(~n <= 0); 123375#L26 call #t~ret0 := fact(~n - 1);< 123378#factENTRY ~n := #in~n; 123381#L25 assume ~n <= 0;#res := 1; 123380#factFINAL assume true; 123373#factEXIT >#66#return; 123371#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123367#factFINAL assume true; 123336#factEXIT >#68#return; 122024#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 122025#factENTRY ~n := #in~n; 123382#L25 assume !(~n <= 0); 123376#L26 call #t~ret0 := fact(~n - 1);< 123378#factENTRY ~n := #in~n; 123381#L25 assume ~n <= 0;#res := 1; 123380#factFINAL assume true; 123373#factEXIT >#66#return; 123377#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123463#factFINAL assume true; 123458#factEXIT >#70#return; 123453#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 123454#factENTRY ~n := #in~n; 123461#L25 assume ~n <= 0;#res := 1; 123457#factFINAL assume true; 123452#factEXIT >#72#return; 123449#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; 123448#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 123434#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 123433#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 123361#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; 123357#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 123360#factENTRY ~n := #in~n; 123483#L25 assume !(~n <= 0); 123476#L26 call #t~ret0 := fact(~n - 1);< 123480#factENTRY ~n := #in~n; 123488#L25 assume !(~n <= 0); 123477#L26 call #t~ret0 := fact(~n - 1);< 123486#factENTRY ~n := #in~n; 123489#L25 assume ~n <= 0;#res := 1; 123487#factFINAL assume true; 123485#factEXIT >#66#return; 123484#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123481#factFINAL assume true; 123475#factEXIT >#66#return; 123474#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123473#factFINAL assume true; 123462#factEXIT >#74#return; 123338#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 121975#factENTRY ~n := #in~n; 123384#L25 assume !(~n <= 0); 123375#L26 call #t~ret0 := fact(~n - 1);< 123378#factENTRY ~n := #in~n; 123381#L25 assume ~n <= 0;#res := 1; 123380#factFINAL assume true; 123373#factEXIT >#66#return; 123371#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123367#factFINAL assume true; 123336#factEXIT >#76#return; 121968#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 122032#factENTRY ~n := #in~n; 123580#L25 assume !(~n <= 0); 121983#L26 call #t~ret0 := fact(~n - 1);< 121982#factENTRY ~n := #in~n; 121984#L25 assume ~n <= 0;#res := 1; 122021#factFINAL assume true; 123593#factEXIT >#66#return; 122014#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122015#factFINAL assume true; 121967#factEXIT >#78#return; 121969#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; 121989#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 123432#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 123430#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 123425#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; 121961#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 121962#factENTRY ~n := #in~n; 123577#L25 assume !(~n <= 0); 123503#L26 call #t~ret0 := fact(~n - 1);< 123578#factENTRY ~n := #in~n; 123576#L25 assume !(~n <= 0); 123504#L26 call #t~ret0 := fact(~n - 1);< 123587#factENTRY ~n := #in~n; 123576#L25 assume !(~n <= 0); 123504#L26 call #t~ret0 := fact(~n - 1);< 123587#factENTRY ~n := #in~n; 123590#L25 assume ~n <= 0;#res := 1; 123589#factFINAL assume true; 123586#factEXIT >#66#return; 123584#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123583#factFINAL assume true; 123581#factEXIT >#66#return; 123506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123579#factFINAL assume true; 123500#factEXIT >#66#return; 123496#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123450#factFINAL assume true; 123445#factEXIT >#74#return; 122028#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 122029#factENTRY ~n := #in~n; 123508#L25 assume ~n <= 0;#res := 1; 123498#factFINAL assume true; 123491#factEXIT >#76#return; 123446#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 123451#factENTRY ~n := #in~n; 123574#L25 assume !(~n <= 0); 123501#L26 call #t~ret0 := fact(~n - 1);< 123507#factENTRY ~n := #in~n; 123592#L25 assume !(~n <= 0); 123505#L26 call #t~ret0 := fact(~n - 1);< 123578#factENTRY ~n := #in~n; 123576#L25 assume !(~n <= 0); 123504#L26 call #t~ret0 := fact(~n - 1);< 123587#factENTRY ~n := #in~n; 123590#L25 assume ~n <= 0;#res := 1; 123589#factFINAL assume true; 123586#factEXIT >#66#return; 123584#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123583#factFINAL assume true; 123581#factEXIT >#66#return; 123506#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123579#factFINAL assume true; 123500#factEXIT >#66#return; 123496#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 123450#factFINAL assume true; 123445#factEXIT >#78#return; 123447#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; 121994#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 121995#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 123444#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 123442#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 123440#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 122044#L42-3 [2022-11-02 20:46:02,619 INFO L750 eck$LassoCheckResult]: Loop: 122044#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 122010#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; 121972#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 121973#factENTRY ~n := #in~n; 122042#L25 assume !(~n <= 0); 121964#L26 call #t~ret0 := fact(~n - 1);< 121980#factENTRY ~n := #in~n; 121981#L25 assume !(~n <= 0); 121965#L26 call #t~ret0 := fact(~n - 1);< 122086#factENTRY ~n := #in~n; 121981#L25 assume !(~n <= 0); 121965#L26 call #t~ret0 := fact(~n - 1);< 122086#factENTRY ~n := #in~n; 121981#L25 assume !(~n <= 0); 121965#L26 call #t~ret0 := fact(~n - 1);< 122086#factENTRY ~n := #in~n; 122019#L25 assume ~n <= 0;#res := 1; 122020#factFINAL assume true; 122098#factEXIT >#66#return; 122013#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 121976#factFINAL assume true; 121963#factEXIT >#66#return; 121966#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122462#factFINAL assume true; 122040#factEXIT >#66#return; 122041#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122096#factFINAL assume true; 122097#factEXIT >#66#return; 122458#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122457#factFINAL assume true; 122455#factEXIT >#68#return; 122453#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 122023#factENTRY ~n := #in~n; 122464#L25 assume ~n <= 0;#res := 1; 122463#factFINAL assume true; 122452#factEXIT >#70#return; 122285#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 122392#factENTRY ~n := #in~n; 122405#L25 assume !(~n <= 0); 122386#L26 call #t~ret0 := fact(~n - 1);< 122401#factENTRY ~n := #in~n; 122385#L25 assume !(~n <= 0); 122319#L26 call #t~ret0 := fact(~n - 1);< 122338#factENTRY ~n := #in~n; 122336#L25 assume !(~n <= 0); 122322#L26 call #t~ret0 := fact(~n - 1);< 122333#factENTRY ~n := #in~n; 122337#L25 assume ~n <= 0;#res := 1; 122334#factFINAL assume true; 122330#factEXIT >#66#return; 122329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122327#factFINAL assume true; 122314#factEXIT >#66#return; 122324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122404#factFINAL assume true; 122398#factEXIT >#66#return; 122395#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122391#factFINAL assume true; 122387#factEXIT >#72#return; 122390#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; 122450#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 122449#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 122445#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 122443#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; 122273#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 122339#factENTRY ~n := #in~n; 122355#L25 assume !(~n <= 0); 122316#L26 call #t~ret0 := fact(~n - 1);< 122338#factENTRY ~n := #in~n; 122336#L25 assume !(~n <= 0); 122322#L26 call #t~ret0 := fact(~n - 1);< 122333#factENTRY ~n := #in~n; 122336#L25 assume !(~n <= 0); 122322#L26 call #t~ret0 := fact(~n - 1);< 122333#factENTRY ~n := #in~n; 122336#L25 assume !(~n <= 0); 122322#L26 call #t~ret0 := fact(~n - 1);< 122333#factENTRY ~n := #in~n; 122337#L25 assume ~n <= 0;#res := 1; 122334#factFINAL assume true; 122330#factEXIT >#66#return; 122329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122327#factFINAL assume true; 122314#factEXIT >#66#return; 122324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122404#factFINAL assume true; 122398#factEXIT >#66#return; 122399#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122487#factFINAL assume true; 122434#factEXIT >#66#return; 122433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122432#factFINAL assume true; 122259#factEXIT >#68#return; 122291#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 122384#factENTRY ~n := #in~n; 122410#L25 assume !(~n <= 0); 122320#L26 call #t~ret0 := fact(~n - 1);< 122346#factENTRY ~n := #in~n; 122454#L25 assume ~n <= 0;#res := 1; 122446#factFINAL assume true; 122444#factEXIT >#66#return; 122441#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122440#factFINAL assume true; 122439#factEXIT >#70#return; 122307#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 122312#factENTRY ~n := #in~n; 122364#L25 assume !(~n <= 0); 122317#L26 call #t~ret0 := fact(~n - 1);< 122326#factENTRY ~n := #in~n; 122335#L25 assume !(~n <= 0); 122331#L26 call #t~ret0 := fact(~n - 1);< 122332#factENTRY ~n := #in~n; 122337#L25 assume ~n <= 0;#res := 1; 122334#factFINAL assume true; 122330#factEXIT >#66#return; 122329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122327#factFINAL assume true; 122314#factEXIT >#66#return; 122313#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122311#factFINAL assume true; 122306#factEXIT >#72#return; 122309#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; 122424#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 122422#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 122421#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 122420#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; 122269#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 122339#factENTRY ~n := #in~n; 122355#L25 assume !(~n <= 0); 122316#L26 call #t~ret0 := fact(~n - 1);< 122338#factENTRY ~n := #in~n; 122336#L25 assume !(~n <= 0); 122322#L26 call #t~ret0 := fact(~n - 1);< 122333#factENTRY ~n := #in~n; 122336#L25 assume !(~n <= 0); 122322#L26 call #t~ret0 := fact(~n - 1);< 122333#factENTRY ~n := #in~n; 122336#L25 assume !(~n <= 0); 122322#L26 call #t~ret0 := fact(~n - 1);< 122333#factENTRY ~n := #in~n; 122337#L25 assume ~n <= 0;#res := 1; 122334#factFINAL assume true; 122330#factEXIT >#66#return; 122329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122327#factFINAL assume true; 122314#factEXIT >#66#return; 122324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122404#factFINAL assume true; 122398#factEXIT >#66#return; 122399#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122487#factFINAL assume true; 122434#factEXIT >#66#return; 122433#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122432#factFINAL assume true; 122259#factEXIT >#68#return; 122290#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 122384#factENTRY ~n := #in~n; 122410#L25 assume !(~n <= 0); 122320#L26 call #t~ret0 := fact(~n - 1);< 122346#factENTRY ~n := #in~n; 122336#L25 assume !(~n <= 0); 122322#L26 call #t~ret0 := fact(~n - 1);< 122333#factENTRY ~n := #in~n; 122337#L25 assume ~n <= 0;#res := 1; 122334#factFINAL assume true; 122330#factEXIT >#66#return; 122329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122327#factFINAL assume true; 122314#factEXIT >#66#return; 122325#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122430#factFINAL assume true; 122419#factEXIT >#70#return; 122299#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 122304#factENTRY ~n := #in~n; 122448#L25 assume !(~n <= 0); 122323#L26 call #t~ret0 := fact(~n - 1);< 122447#factENTRY ~n := #in~n; 122454#L25 assume ~n <= 0;#res := 1; 122446#factFINAL assume true; 122444#factEXIT >#66#return; 122305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122298#factFINAL assume true; 122303#factEXIT >#72#return; 122378#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; 122406#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 122402#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 122396#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 122393#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; 122261#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 122339#factENTRY ~n := #in~n; 122355#L25 assume !(~n <= 0); 122316#L26 call #t~ret0 := fact(~n - 1);< 122338#factENTRY ~n := #in~n; 122336#L25 assume !(~n <= 0); 122322#L26 call #t~ret0 := fact(~n - 1);< 122333#factENTRY ~n := #in~n; 122336#L25 assume !(~n <= 0); 122322#L26 call #t~ret0 := fact(~n - 1);< 122333#factENTRY ~n := #in~n; 122337#L25 assume ~n <= 0;#res := 1; 122334#factFINAL assume true; 122330#factEXIT >#66#return; 122329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122327#factFINAL assume true; 122314#factEXIT >#66#return; 122324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122404#factFINAL assume true; 122398#factEXIT >#66#return; 122395#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122391#factFINAL assume true; 122387#factEXIT >#68#return; 122344#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 122384#factENTRY ~n := #in~n; 122410#L25 assume !(~n <= 0); 122320#L26 call #t~ret0 := fact(~n - 1);< 122346#factENTRY ~n := #in~n; 122336#L25 assume !(~n <= 0); 122322#L26 call #t~ret0 := fact(~n - 1);< 122333#factENTRY ~n := #in~n; 122336#L25 assume !(~n <= 0); 122322#L26 call #t~ret0 := fact(~n - 1);< 122333#factENTRY ~n := #in~n; 122337#L25 assume ~n <= 0;#res := 1; 122334#factFINAL assume true; 122330#factEXIT >#66#return; 122329#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122327#factFINAL assume true; 122314#factEXIT >#66#return; 122324#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122404#factFINAL assume true; 122398#factEXIT >#66#return; 122400#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122486#factFINAL assume true; 122383#factEXIT >#70#return; 122371#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 122380#factENTRY ~n := #in~n; 122382#L25 assume ~n <= 0;#res := 1; 122381#factFINAL assume true; 122368#factEXIT >#72#return; 122365#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; 122366#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 122350#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 122351#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 122347#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; 121959#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 121960#factENTRY ~n := #in~n; 122070#L25 assume !(~n <= 0); 122054#L26 call #t~ret0 := fact(~n - 1);< 122058#factENTRY ~n := #in~n; 122073#L25 assume !(~n <= 0); 122056#L26 call #t~ret0 := fact(~n - 1);< 122080#factENTRY ~n := #in~n; 122073#L25 assume !(~n <= 0); 122056#L26 call #t~ret0 := fact(~n - 1);< 122080#factENTRY ~n := #in~n; 122073#L25 assume !(~n <= 0); 122056#L26 call #t~ret0 := fact(~n - 1);< 122080#factENTRY ~n := #in~n; 122081#L25 assume ~n <= 0;#res := 1; 122095#factFINAL assume true; 122094#factEXIT >#66#return; 122093#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122092#factFINAL assume true; 122087#factEXIT >#66#return; 122088#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122091#factFINAL assume true; 122089#factEXIT >#66#return; 122057#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122079#factFINAL assume true; 122053#factEXIT >#66#return; 122052#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122048#factFINAL assume true; 122045#factEXIT >#74#return; 122039#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 122027#factENTRY ~n := #in~n; 122059#L25 assume !(~n <= 0); 122055#L26 call #t~ret0 := fact(~n - 1);< 122067#factENTRY ~n := #in~n; 122073#L25 assume !(~n <= 0); 122056#L26 call #t~ret0 := fact(~n - 1);< 122080#factENTRY ~n := #in~n; 122073#L25 assume !(~n <= 0); 122056#L26 call #t~ret0 := fact(~n - 1);< 122080#factENTRY ~n := #in~n; 122073#L25 assume !(~n <= 0); 122056#L26 call #t~ret0 := fact(~n - 1);< 122080#factENTRY ~n := #in~n; 122081#L25 assume ~n <= 0;#res := 1; 122095#factFINAL assume true; 122094#factEXIT >#66#return; 122093#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122092#factFINAL assume true; 122087#factEXIT >#66#return; 122088#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122091#factFINAL assume true; 122089#factEXIT >#66#return; 122057#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122079#factFINAL assume true; 122053#factEXIT >#66#return; 122052#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122048#factFINAL assume true; 122045#factEXIT >#76#return; 121991#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 122031#factENTRY ~n := #in~n; 122085#L25 assume !(~n <= 0); 121990#L26 call #t~ret0 := fact(~n - 1);< 121992#factENTRY ~n := #in~n; 122071#L25 assume ~n <= 0;#res := 1; 122068#factFINAL assume true; 122064#factEXIT >#66#return; 122062#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 122063#factFINAL assume true; 122043#factEXIT >#78#return; 121987#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; 121988#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 121993#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 122030#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 122004#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 122005#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 122044#L42-3 [2022-11-02 20:46:02,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:02,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1711259888, now seen corresponding path program 22 times [2022-11-02 20:46:02,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:02,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426696940] [2022-11-02 20:46:02,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:02,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:02,639 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:46:02,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1059671512] [2022-11-02 20:46:02,640 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:46:02,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:02,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:02,643 INFO L229 MonitoredProcess]: Starting monitored process 199 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:02,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (199)] Waiting until timeout for monitored process [2022-11-02 20:46:02,938 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:46:02,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:46:02,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 20:46:02,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:03,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 1114 proven. 8 refuted. 0 times theorem prover too weak. 4598 trivial. 0 not checked. [2022-11-02 20:46:03,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:46:03,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 240 proven. 20 refuted. 0 times theorem prover too weak. 5460 trivial. 0 not checked. [2022-11-02 20:46:03,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:03,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426696940] [2022-11-02 20:46:03,821 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:46:03,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059671512] [2022-11-02 20:46:03,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059671512] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:46:03,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:46:03,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2022-11-02 20:46:03,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125662827] [2022-11-02 20:46:03,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:46:03,823 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:46:03,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:03,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1757259969, now seen corresponding path program 23 times [2022-11-02 20:46:03,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:03,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522191310] [2022-11-02 20:46:03,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:03,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:03,837 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:46:03,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [4206223] [2022-11-02 20:46:03,838 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 20:46:03,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:03,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:03,841 INFO L229 MonitoredProcess]: Starting monitored process 200 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:03,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (200)] Waiting until timeout for monitored process [2022-11-02 20:46:04,094 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2022-11-02 20:46:04,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:46:04,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-02 20:46:04,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:04,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6425 backedges. 3545 proven. 107 refuted. 0 times theorem prover too weak. 2773 trivial. 0 not checked. [2022-11-02 20:46:04,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:46:07,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6425 backedges. 449 proven. 1271 refuted. 0 times theorem prover too weak. 4705 trivial. 0 not checked. [2022-11-02 20:46:07,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:07,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522191310] [2022-11-02 20:46:07,981 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:46:07,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4206223] [2022-11-02 20:46:07,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4206223] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:46:07,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:46:07,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18] total 21 [2022-11-02 20:46:07,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877222777] [2022-11-02 20:46:07,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:46:07,982 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-02 20:46:07,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:46:07,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-02 20:46:07,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:46:07,983 INFO L87 Difference]: Start difference. First operand 1642 states and 2392 transitions. cyclomatic complexity: 768 Second operand has 21 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 18 states have internal predecessors, (59), 13 states have call successors, (28), 2 states have call predecessors, (28), 9 states have return successors, (33), 11 states have call predecessors, (33), 13 states have call successors, (33) [2022-11-02 20:46:09,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:46:09,906 INFO L93 Difference]: Finished difference Result 2228 states and 3356 transitions. [2022-11-02 20:46:09,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2228 states and 3356 transitions. [2022-11-02 20:46:09,918 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 227 [2022-11-02 20:46:09,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2228 states to 2202 states and 3321 transitions. [2022-11-02 20:46:09,939 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2022-11-02 20:46:09,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2022-11-02 20:46:09,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2202 states and 3321 transitions. [2022-11-02 20:46:09,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-11-02 20:46:09,940 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2202 states and 3321 transitions. [2022-11-02 20:46:09,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2202 states and 3321 transitions. [2022-11-02 20:46:09,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2202 to 1672. [2022-11-02 20:46:09,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1069 states have (on average 1.0748362956033677) internal successors, (1149), 1072 states have internal predecessors, (1149), 433 states have call successors, (433), 157 states have call predecessors, (433), 170 states have return successors, (871), 442 states have call predecessors, (871), 433 states have call successors, (871) [2022-11-02 20:46:10,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2453 transitions. [2022-11-02 20:46:10,007 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1672 states and 2453 transitions. [2022-11-02 20:46:10,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:46:10,008 INFO L428 stractBuchiCegarLoop]: Abstraction has 1672 states and 2453 transitions. [2022-11-02 20:46:10,009 INFO L335 stractBuchiCegarLoop]: ======== Iteration 35 ============ [2022-11-02 20:46:10,009 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1672 states and 2453 transitions. [2022-11-02 20:46:10,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 168 [2022-11-02 20:46:10,016 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-02 20:46:10,016 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-02 20:46:10,021 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [50, 50, 26, 26, 26, 26, 24, 8, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-02 20:46:10,022 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [48, 48, 33, 33, 33, 33, 15, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:46:10,022 INFO L748 eck$LassoCheckResult]: Stem: 129792#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 129766#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; 129767#L35 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; 129791#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; 129780#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 129781#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 130224#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; 130220#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 130221#factENTRY ~n := #in~n; 130225#L25 assume ~n <= 0;#res := 1; 130223#factFINAL assume true; 130219#factEXIT >#68#return; 130216#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 130217#factENTRY ~n := #in~n; 130222#L25 assume ~n <= 0;#res := 1; 130218#factFINAL assume true; 130215#factEXIT >#70#return; 130213#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 130214#factENTRY ~n := #in~n; 130229#L25 assume ~n <= 0;#res := 1; 130226#factFINAL assume true; 130212#factEXIT >#72#return; 130210#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; 130208#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 130207#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 130206#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 130204#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; 130199#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 130200#factENTRY ~n := #in~n; 130235#L25 assume !(~n <= 0); 130232#L26 call #t~ret0 := fact(~n - 1);< 130233#factENTRY ~n := #in~n; 130236#L25 assume ~n <= 0;#res := 1; 130234#factFINAL assume true; 130231#factEXIT >#66#return; 130230#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130228#factFINAL assume true; 130198#factEXIT >#74#return; 130194#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 130195#factENTRY ~n := #in~n; 130227#L25 assume ~n <= 0;#res := 1; 130197#factFINAL assume true; 130193#factEXIT >#76#return; 130190#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 130191#factENTRY ~n := #in~n; 130205#L25 assume !(~n <= 0); 130202#L26 call #t~ret0 := fact(~n - 1);< 130203#factENTRY ~n := #in~n; 130211#L25 assume ~n <= 0;#res := 1; 130209#factFINAL assume true; 130201#factEXIT >#66#return; 130196#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130192#factFINAL assume true; 130189#factEXIT >#78#return; 130188#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; 130187#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 130186#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 130185#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 130184#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; 130178#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 130181#factENTRY ~n := #in~n; 130248#L25 assume !(~n <= 0); 129798#L26 call #t~ret0 := fact(~n - 1);< 130358#factENTRY ~n := #in~n; 131382#L25 assume !(~n <= 0); 129751#L26 call #t~ret0 := fact(~n - 1);< 131381#factENTRY ~n := #in~n; 131401#L25 assume ~n <= 0;#res := 1; 129760#factFINAL assume true; 129750#factEXIT >#66#return; 129752#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129799#factFINAL assume true; 130244#factEXIT >#66#return; 130237#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130183#factFINAL assume true; 130177#factEXIT >#74#return; 130180#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 130241#factENTRY ~n := #in~n; 130243#L25 assume ~n <= 0;#res := 1; 130242#factFINAL assume true; 130238#factEXIT >#76#return; 130179#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 130181#factENTRY ~n := #in~n; 130248#L25 assume !(~n <= 0); 129798#L26 call #t~ret0 := fact(~n - 1);< 130358#factENTRY ~n := #in~n; 131382#L25 assume !(~n <= 0); 129751#L26 call #t~ret0 := fact(~n - 1);< 131381#factENTRY ~n := #in~n; 131401#L25 assume ~n <= 0;#res := 1; 129760#factFINAL assume true; 129750#factEXIT >#66#return; 129752#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129799#factFINAL assume true; 130244#factEXIT >#66#return; 130237#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130183#factFINAL assume true; 130177#factEXIT >#78#return; 130175#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; 130166#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 130164#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 130159#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 130143#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; 130137#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 130142#factENTRY ~n := #in~n; 130176#L25 assume !(~n <= 0); 130151#L26 call #t~ret0 := fact(~n - 1);< 130161#factENTRY ~n := #in~n; 130173#L25 assume !(~n <= 0); 130154#L26 call #t~ret0 := fact(~n - 1);< 130171#factENTRY ~n := #in~n; 130173#L25 assume !(~n <= 0); 130154#L26 call #t~ret0 := fact(~n - 1);< 130171#factENTRY ~n := #in~n; 130174#L25 assume ~n <= 0;#res := 1; 130172#factFINAL assume true; 130170#factEXIT >#66#return; 130169#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130168#factFINAL assume true; 130167#factEXIT >#66#return; 130155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130160#factFINAL assume true; 130150#factEXIT >#66#return; 130149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130141#factFINAL assume true; 130136#factEXIT >#74#return; 130139#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 130146#factENTRY ~n := #in~n; 130148#L25 assume ~n <= 0;#res := 1; 130147#factFINAL assume true; 130145#factEXIT >#76#return; 130138#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 130140#factENTRY ~n := #in~n; 130157#L25 assume !(~n <= 0); 130152#L26 call #t~ret0 := fact(~n - 1);< 130156#factENTRY ~n := #in~n; 130162#L25 assume !(~n <= 0); 130153#L26 call #t~ret0 := fact(~n - 1);< 130161#factENTRY ~n := #in~n; 130173#L25 assume !(~n <= 0); 130154#L26 call #t~ret0 := fact(~n - 1);< 130171#factENTRY ~n := #in~n; 130174#L25 assume ~n <= 0;#res := 1; 130172#factFINAL assume true; 130170#factEXIT >#66#return; 130169#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130168#factFINAL assume true; 130167#factEXIT >#66#return; 130155#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130160#factFINAL assume true; 130150#factEXIT >#66#return; 130149#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130141#factFINAL assume true; 130136#factEXIT >#78#return; 130135#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; 130134#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 130133#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 130132#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 130131#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 130130#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 130129#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 131174#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; 129757#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 129758#factENTRY ~n := #in~n; 131180#L25 assume !(~n <= 0); 131177#L26 call #t~ret0 := fact(~n - 1);< 131178#factENTRY ~n := #in~n; 131182#L25 assume ~n <= 0;#res := 1; 131179#factFINAL assume true; 131176#factEXIT >#66#return; 131175#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131173#factFINAL assume true; 131149#factEXIT >#68#return; 131150#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 131167#factENTRY ~n := #in~n; 131172#L25 assume ~n <= 0;#res := 1; 131168#factFINAL assume true; 131166#factEXIT >#70#return; 131159#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 131164#factENTRY ~n := #in~n; 131196#L25 assume !(~n <= 0); 131184#L26 call #t~ret0 := fact(~n - 1);< 131188#factENTRY ~n := #in~n; 131191#L25 assume ~n <= 0;#res := 1; 131189#factFINAL assume true; 131183#factEXIT >#66#return; 131181#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131158#factFINAL assume true; 131163#factEXIT >#72#return; 131171#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; 131202#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 131201#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 131200#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 131151#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; 131152#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 131165#factENTRY ~n := #in~n; 131193#L25 assume !(~n <= 0); 131185#L26 call #t~ret0 := fact(~n - 1);< 131190#factENTRY ~n := #in~n; 131191#L25 assume ~n <= 0;#res := 1; 131189#factFINAL assume true; 131183#factEXIT >#66#return; 131181#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131158#factFINAL assume true; 131163#factEXIT >#68#return; 129808#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 129809#factENTRY ~n := #in~n; 131192#L25 assume !(~n <= 0); 131186#L26 call #t~ret0 := fact(~n - 1);< 131190#factENTRY ~n := #in~n; 131191#L25 assume ~n <= 0;#res := 1; 131189#factFINAL assume true; 131183#factEXIT >#66#return; 131187#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131241#factFINAL assume true; 131240#factEXIT >#70#return; 129753#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 129754#factENTRY ~n := #in~n; 131372#L25 assume ~n <= 0;#res := 1; 131194#factFINAL assume true; 131371#factEXIT >#72#return; 131370#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; 131369#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 131368#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 131367#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 129794#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; 129795#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 129745#factENTRY ~n := #in~n; 131343#L25 assume !(~n <= 0); 131333#L26 call #t~ret0 := fact(~n - 1);< 131342#factENTRY ~n := #in~n; 131353#L25 assume !(~n <= 0); 131332#L26 call #t~ret0 := fact(~n - 1);< 131351#factENTRY ~n := #in~n; 131354#L25 assume ~n <= 0;#res := 1; 131352#factFINAL assume true; 131350#factEXIT >#66#return; 131349#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131347#factFINAL assume true; 131340#factEXIT >#66#return; 131339#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131338#factFINAL assume true; 131337#factEXIT >#74#return; 131162#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 131165#factENTRY ~n := #in~n; 131193#L25 assume !(~n <= 0); 131185#L26 call #t~ret0 := fact(~n - 1);< 131190#factENTRY ~n := #in~n; 131191#L25 assume ~n <= 0;#res := 1; 131189#factFINAL assume true; 131183#factEXIT >#66#return; 131181#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131158#factFINAL assume true; 131163#factEXIT >#76#return; 129776#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 129817#factENTRY ~n := #in~n; 131356#L25 assume !(~n <= 0); 129775#L26 call #t~ret0 := fact(~n - 1);< 129777#factENTRY ~n := #in~n; 131380#L25 assume ~n <= 0;#res := 1; 131379#factFINAL assume true; 131378#factEXIT >#66#return; 131377#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131376#factFINAL assume true; 131375#factEXIT >#78#return; 131298#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; 131295#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 131294#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 131293#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 131278#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; 129764#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 129763#factENTRY ~n := #in~n; 129765#L25 assume !(~n <= 0); 129805#L26 call #t~ret0 := fact(~n - 1);< 131291#factENTRY ~n := #in~n; 131313#L25 assume !(~n <= 0); 131288#L26 call #t~ret0 := fact(~n - 1);< 131310#factENTRY ~n := #in~n; 131313#L25 assume !(~n <= 0); 131288#L26 call #t~ret0 := fact(~n - 1);< 131310#factENTRY ~n := #in~n; 131314#L25 assume ~n <= 0;#res := 1; 131312#factFINAL assume true; 131309#factEXIT >#66#return; 131307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131306#factFINAL assume true; 131303#factEXIT >#66#return; 131305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131326#factFINAL assume true; 131285#factEXIT >#66#return; 131283#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131284#factFINAL assume true; 131273#factEXIT >#74#return; 131276#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 129813#factENTRY ~n := #in~n; 131324#L25 assume ~n <= 0;#res := 1; 131325#factFINAL assume true; 131366#factEXIT >#76#return; 131274#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 131281#factENTRY ~n := #in~n; 131400#L25 assume !(~n <= 0); 131287#L26 call #t~ret0 := fact(~n - 1);< 131374#factENTRY ~n := #in~n; 131373#L25 assume !(~n <= 0); 131289#L26 call #t~ret0 := fact(~n - 1);< 131291#factENTRY ~n := #in~n; 131313#L25 assume !(~n <= 0); 131288#L26 call #t~ret0 := fact(~n - 1);< 131310#factENTRY ~n := #in~n; 131314#L25 assume ~n <= 0;#res := 1; 131312#factFINAL assume true; 131309#factEXIT >#66#return; 131307#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131306#factFINAL assume true; 131303#factEXIT >#66#return; 131305#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131326#factFINAL assume true; 131285#factEXIT >#66#return; 131283#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 131284#factFINAL assume true; 131273#factEXIT >#78#return; 131277#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; 131396#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 131395#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 131394#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 131393#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 131384#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 129884#L42-3 [2022-11-02 20:46:10,023 INFO L750 eck$LassoCheckResult]: Loop: 129884#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 129793#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; 129755#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 129756#factENTRY ~n := #in~n; 129828#L25 assume !(~n <= 0); 129747#L26 call #t~ret0 := fact(~n - 1);< 129761#factENTRY ~n := #in~n; 129762#L25 assume !(~n <= 0); 129748#L26 call #t~ret0 := fact(~n - 1);< 129877#factENTRY ~n := #in~n; 129762#L25 assume !(~n <= 0); 129748#L26 call #t~ret0 := fact(~n - 1);< 129877#factENTRY ~n := #in~n; 129803#L25 assume ~n <= 0;#res := 1; 129804#factFINAL assume true; 129885#factEXIT >#66#return; 129796#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129759#factFINAL assume true; 129746#factEXIT >#66#return; 129749#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130041#factFINAL assume true; 129826#factEXIT >#66#return; 129821#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129820#factFINAL assume true; 129818#factEXIT >#68#return; 129819#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 129807#factENTRY ~n := #in~n; 130036#L25 assume ~n <= 0;#res := 1; 130034#factFINAL assume true; 130027#factEXIT >#70#return; 129974#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 129994#factENTRY ~n := #in~n; 130124#L25 assume !(~n <= 0); 129940#L26 call #t~ret0 := fact(~n - 1);< 130001#factENTRY ~n := #in~n; 130115#L25 assume !(~n <= 0); 129930#L26 call #t~ret0 := fact(~n - 1);< 129941#factENTRY ~n := #in~n; 129951#L25 assume !(~n <= 0); 129932#L26 call #t~ret0 := fact(~n - 1);< 129948#factENTRY ~n := #in~n; 129952#L25 assume ~n <= 0;#res := 1; 129949#factFINAL assume true; 129945#factEXIT >#66#return; 129944#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129939#factFINAL assume true; 129926#factEXIT >#66#return; 129936#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130035#factFINAL assume true; 130032#factEXIT >#66#return; 130030#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129987#factFINAL assume true; 129993#factEXIT >#72#return; 130024#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; 130023#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 130022#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 130021#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 130020#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; 129988#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 130019#factENTRY ~n := #in~n; 130018#L25 assume !(~n <= 0); 129954#L26 call #t~ret0 := fact(~n - 1);< 130017#factENTRY ~n := #in~n; 130016#L25 assume !(~n <= 0); 129929#L26 call #t~ret0 := fact(~n - 1);< 129953#factENTRY ~n := #in~n; 129950#L25 assume !(~n <= 0); 129946#L26 call #t~ret0 := fact(~n - 1);< 129947#factENTRY ~n := #in~n; 129952#L25 assume ~n <= 0;#res := 1; 129949#factFINAL assume true; 129945#factEXIT >#66#return; 129944#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129939#factFINAL assume true; 129926#factEXIT >#66#return; 129936#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130035#factFINAL assume true; 130032#factEXIT >#66#return; 130030#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129987#factFINAL assume true; 129993#factEXIT >#68#return; 129915#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 129923#factENTRY ~n := #in~n; 129942#L25 assume !(~n <= 0); 129927#L26 call #t~ret0 := fact(~n - 1);< 129938#factENTRY ~n := #in~n; 130103#L25 assume ~n <= 0;#res := 1; 130102#factFINAL assume true; 130087#factEXIT >#66#return; 130088#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130100#factFINAL assume true; 130099#factEXIT >#70#return; 130008#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 130064#factENTRY ~n := #in~n; 130101#L25 assume !(~n <= 0); 129934#L26 call #t~ret0 := fact(~n - 1);< 129953#factENTRY ~n := #in~n; 129950#L25 assume !(~n <= 0); 129946#L26 call #t~ret0 := fact(~n - 1);< 129947#factENTRY ~n := #in~n; 129952#L25 assume ~n <= 0;#res := 1; 129949#factFINAL assume true; 129945#factEXIT >#66#return; 129944#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129939#factFINAL assume true; 129926#factEXIT >#66#return; 129937#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130014#factFINAL assume true; 130006#factEXIT >#72#return; 130011#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; 130059#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 130057#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 130056#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 130054#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; 129992#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 130019#factENTRY ~n := #in~n; 130018#L25 assume !(~n <= 0); 129954#L26 call #t~ret0 := fact(~n - 1);< 130017#factENTRY ~n := #in~n; 130016#L25 assume !(~n <= 0); 129929#L26 call #t~ret0 := fact(~n - 1);< 129953#factENTRY ~n := #in~n; 129950#L25 assume !(~n <= 0); 129946#L26 call #t~ret0 := fact(~n - 1);< 129947#factENTRY ~n := #in~n; 129952#L25 assume ~n <= 0;#res := 1; 129949#factFINAL assume true; 129945#factEXIT >#66#return; 129944#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129939#factFINAL assume true; 129926#factEXIT >#66#return; 129936#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130035#factFINAL assume true; 130032#factEXIT >#66#return; 130030#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129987#factFINAL assume true; 129993#factEXIT >#68#return; 129916#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 129923#factENTRY ~n := #in~n; 129942#L25 assume !(~n <= 0); 129927#L26 call #t~ret0 := fact(~n - 1);< 129938#factENTRY ~n := #in~n; 129951#L25 assume !(~n <= 0); 129932#L26 call #t~ret0 := fact(~n - 1);< 129948#factENTRY ~n := #in~n; 129952#L25 assume ~n <= 0;#res := 1; 129949#factFINAL assume true; 129945#factEXIT >#66#return; 129944#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129939#factFINAL assume true; 129926#factEXIT >#66#return; 129925#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129924#factFINAL assume true; 129907#factEXIT >#70#return; 129920#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 130015#factENTRY ~n := #in~n; 130055#L25 assume !(~n <= 0); 129931#L26 call #t~ret0 := fact(~n - 1);< 130089#factENTRY ~n := #in~n; 130103#L25 assume ~n <= 0;#res := 1; 130102#factFINAL assume true; 130087#factEXIT >#66#return; 130086#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130084#factFINAL assume true; 130077#factEXIT >#72#return; 129903#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; 130121#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 130123#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 130122#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 130060#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; 129990#L30 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 130019#factENTRY ~n := #in~n; 130018#L25 assume !(~n <= 0); 129954#L26 call #t~ret0 := fact(~n - 1);< 130017#factENTRY ~n := #in~n; 130016#L25 assume !(~n <= 0); 129929#L26 call #t~ret0 := fact(~n - 1);< 129953#factENTRY ~n := #in~n; 129950#L25 assume !(~n <= 0); 129946#L26 call #t~ret0 := fact(~n - 1);< 129947#factENTRY ~n := #in~n; 129952#L25 assume ~n <= 0;#res := 1; 129949#factFINAL assume true; 129945#factEXIT >#66#return; 129944#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129939#factFINAL assume true; 129926#factEXIT >#66#return; 129936#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130035#factFINAL assume true; 130032#factEXIT >#66#return; 130030#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129987#factFINAL assume true; 129993#factEXIT >#68#return; 129912#L30-1 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 129923#factENTRY ~n := #in~n; 129942#L25 assume !(~n <= 0); 129927#L26 call #t~ret0 := fact(~n - 1);< 129938#factENTRY ~n := #in~n; 129951#L25 assume !(~n <= 0); 129932#L26 call #t~ret0 := fact(~n - 1);< 129948#factENTRY ~n := #in~n; 129951#L25 assume !(~n <= 0); 129932#L26 call #t~ret0 := fact(~n - 1);< 129948#factENTRY ~n := #in~n; 129952#L25 assume ~n <= 0;#res := 1; 129949#factFINAL assume true; 129945#factEXIT >#66#return; 129944#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129939#factFINAL assume true; 129926#factEXIT >#66#return; 129936#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130035#factFINAL assume true; 130032#factEXIT >#66#return; 129999#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 130074#factFINAL assume true; 130065#factEXIT >#70#return; 129895#L30-2 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 129904#factENTRY ~n := #in~n; 129906#L25 assume ~n <= 0;#res := 1; 129905#factFINAL assume true; 129892#factEXIT >#72#return; 129899#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; 130075#L30-4 main_#t~ret9#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret9#1; 129882#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 129883#L42-3 assume !!(main_~k~0#1 <= main_~x~0#1); 130061#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; 129831#L30-5 call binomialCoefficient_#t~ret1#1 := fact(binomialCoefficient_~n#1);< 129743#factENTRY ~n := #in~n; 129860#L25 assume !(~n <= 0); 129841#L26 call #t~ret0 := fact(~n - 1);< 129845#factENTRY ~n := #in~n; 129851#L25 assume !(~n <= 0); 129842#L26 call #t~ret0 := fact(~n - 1);< 129850#factENTRY ~n := #in~n; 129851#L25 assume !(~n <= 0); 129842#L26 call #t~ret0 := fact(~n - 1);< 129850#factENTRY ~n := #in~n; 129851#L25 assume !(~n <= 0); 129842#L26 call #t~ret0 := fact(~n - 1);< 129850#factENTRY ~n := #in~n; 129852#L25 assume ~n <= 0;#res := 1; 129876#factFINAL assume true; 129875#factEXIT >#66#return; 129874#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129872#factFINAL assume true; 129855#factEXIT >#66#return; 129856#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129873#factFINAL assume true; 129861#factEXIT >#66#return; 129844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129849#factFINAL assume true; 129840#factEXIT >#66#return; 129839#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129838#factFINAL assume true; 129830#factEXIT >#74#return; 129823#L30-6 call binomialCoefficient_#t~ret2#1 := fact(binomialCoefficient_~k#1);< 129811#factENTRY ~n := #in~n; 129859#L25 assume !(~n <= 0); 129843#L26 call #t~ret0 := fact(~n - 1);< 129858#factENTRY ~n := #in~n; 129851#L25 assume !(~n <= 0); 129842#L26 call #t~ret0 := fact(~n - 1);< 129850#factENTRY ~n := #in~n; 129851#L25 assume !(~n <= 0); 129842#L26 call #t~ret0 := fact(~n - 1);< 129850#factENTRY ~n := #in~n; 129851#L25 assume !(~n <= 0); 129842#L26 call #t~ret0 := fact(~n - 1);< 129850#factENTRY ~n := #in~n; 129852#L25 assume ~n <= 0;#res := 1; 129876#factFINAL assume true; 129875#factEXIT >#66#return; 129874#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129872#factFINAL assume true; 129855#factEXIT >#66#return; 129856#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129873#factFINAL assume true; 129861#factEXIT >#66#return; 129844#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129849#factFINAL assume true; 129840#factEXIT >#66#return; 129839#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129838#factFINAL assume true; 129830#factEXIT >#76#return; 129773#L30-7 call binomialCoefficient_#t~ret3#1 := fact(binomialCoefficient_~n#1 - binomialCoefficient_~k#1);< 129816#factENTRY ~n := #in~n; 129846#L25 assume !(~n <= 0); 129772#L26 call #t~ret0 := fact(~n - 1);< 129774#factENTRY ~n := #in~n; 129868#L25 assume ~n <= 0;#res := 1; 129866#factFINAL assume true; 129865#factEXIT >#66#return; 129863#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 129854#factFINAL assume true; 129829#factEXIT >#78#return; 129768#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; 129769#L30-9 main_#t~ret10#1 := binomialCoefficient_#res#1;assume { :end_inline_binomialCoefficient } true;havoc main_#t~ret10#1; 129778#L42-2 main_#t~post8#1 := main_~k~0#1;main_~k~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; 129814#L42-3 assume !(main_~k~0#1 <= main_~x~0#1); 129787#L41-2 main_#t~post7#1 := main_~n~0#1;main_~n~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 129788#L41-3 assume !!(main_~n~0#1 <= main_~x~0#1);main_~k~0#1 := 0; 129884#L42-3 [2022-11-02 20:46:10,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:10,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1711259888, now seen corresponding path program 23 times [2022-11-02 20:46:10,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:10,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094885093] [2022-11-02 20:46:10,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:10,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:10,059 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:46:10,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [227364968] [2022-11-02 20:46:10,059 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-02 20:46:10,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:10,060 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:10,063 INFO L229 MonitoredProcess]: Starting monitored process 201 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:10,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (201)] Waiting until timeout for monitored process [2022-11-02 20:46:10,488 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2022-11-02 20:46:10,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:46:10,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-02 20:46:10,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 1225 proven. 81 refuted. 0 times theorem prover too weak. 4414 trivial. 0 not checked. [2022-11-02 20:46:10,894 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:46:11,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5720 backedges. 354 proven. 108 refuted. 0 times theorem prover too weak. 5258 trivial. 0 not checked. [2022-11-02 20:46:11,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:46:11,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094885093] [2022-11-02 20:46:11,727 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-02 20:46:11,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227364968] [2022-11-02 20:46:11,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227364968] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:46:11,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:46:11,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 13 [2022-11-02 20:46:11,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649705863] [2022-11-02 20:46:11,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:46:11,731 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-02 20:46:11,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:46:11,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1747747417, now seen corresponding path program 24 times [2022-11-02 20:46:11,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:46:11,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672158701] [2022-11-02 20:46:11,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:46:11,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:46:11,747 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-02 20:46:11,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [84860929] [2022-11-02 20:46:11,748 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-02 20:46:11,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:46:11,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:46:11,752 INFO L229 MonitoredProcess]: Starting monitored process 202 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:46:11,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8dbb040c-3f45-40d7-b090-dd8ff198d32c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (202)] Waiting until timeout for monitored process [2022-11-02 20:46:12,108 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2022-11-02 20:46:12,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:46:12,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-02 20:46:12,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:46:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 5633 backedges. 1185 proven. 748 refuted. 0 times theorem prover too weak. 3700 trivial. 0 not checked. [2022-11-02 20:46:12,973 INFO L328 TraceCheckSpWp]: Computing backward predicates...