./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-numeric/Binomial.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer --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 7271d13f0b7b365fd7ecc81e9b65f9e103181ef3 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: UNKNOWN during nested interpolation. I don't know how to continue --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 02:22:49,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 02:22:49,936 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 02:22:49,953 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 02:22:49,954 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 02:22:49,955 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 02:22:49,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 02:22:49,968 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 02:22:49,974 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 02:22:49,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 02:22:49,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 02:22:49,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 02:22:49,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 02:22:49,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 02:22:49,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 02:22:49,986 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 02:22:49,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 02:22:49,989 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 02:22:49,992 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 02:22:49,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 02:22:50,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 02:22:50,003 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 02:22:50,007 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 02:22:50,008 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 02:22:50,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 02:22:50,012 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 02:22:50,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 02:22:50,014 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 02:22:50,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 02:22:50,016 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 02:22:50,016 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 02:22:50,017 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 02:22:50,018 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 02:22:50,019 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 02:22:50,020 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 02:22:50,020 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 02:22:50,021 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 02:22:50,021 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 02:22:50,022 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 02:22:50,023 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 02:22:50,024 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 02:22:50,025 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-20 02:22:50,058 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 02:22:50,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 02:22:50,060 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 02:22:50,060 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 02:22:50,060 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 02:22:50,060 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-20 02:22:50,061 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-20 02:22:50,061 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-20 02:22:50,061 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-20 02:22:50,061 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-20 02:22:50,061 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-20 02:22:50,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 02:22:50,062 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-20 02:22:50,062 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 02:22:50,062 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 02:22:50,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-20 02:22:50,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-20 02:22:50,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-20 02:22:50,063 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 02:22:50,064 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-20 02:22:50,064 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 02:22:50,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-20 02:22:50,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 02:22:50,065 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 02:22:50,065 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-20 02:22:50,065 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 02:22:50,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 02:22:50,066 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-20 02:22:50,067 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-20 02:22:50,067 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer 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 -> 7271d13f0b7b365fd7ecc81e9b65f9e103181ef3 [2019-11-20 02:22:50,274 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 02:22:50,291 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 02:22:50,295 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 02:22:50,297 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 02:22:50,298 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 02:22:50,300 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/../../sv-benchmarks/c/termination-numeric/Binomial.c [2019-11-20 02:22:50,366 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/data/0f2a74cf4/05541806a41542978b48ef92e3a69389/FLAGd32243e85 [2019-11-20 02:22:50,891 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 02:22:50,891 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/sv-benchmarks/c/termination-numeric/Binomial.c [2019-11-20 02:22:50,898 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/data/0f2a74cf4/05541806a41542978b48ef92e3a69389/FLAGd32243e85 [2019-11-20 02:22:51,310 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/data/0f2a74cf4/05541806a41542978b48ef92e3a69389 [2019-11-20 02:22:51,314 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 02:22:51,315 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 02:22:51,316 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 02:22:51,317 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 02:22:51,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 02:22:51,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:22:51" (1/1) ... [2019-11-20 02:22:51,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33166ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:51, skipping insertion in model container [2019-11-20 02:22:51,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:22:51" (1/1) ... [2019-11-20 02:22:51,334 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 02:22:51,352 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 02:22:51,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:22:51,581 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 02:22:51,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 02:22:51,698 INFO L192 MainTranslator]: Completed translation [2019-11-20 02:22:51,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:51 WrapperNode [2019-11-20 02:22:51,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 02:22:51,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 02:22:51,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 02:22:51,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 02:22:51,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:51" (1/1) ... [2019-11-20 02:22:51,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:51" (1/1) ... [2019-11-20 02:22:51,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 02:22:51,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 02:22:51,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 02:22:51,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 02:22:51,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:51" (1/1) ... [2019-11-20 02:22:51,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:51" (1/1) ... [2019-11-20 02:22:51,752 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:51" (1/1) ... [2019-11-20 02:22:51,752 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:51" (1/1) ... [2019-11-20 02:22:51,756 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:51" (1/1) ... [2019-11-20 02:22:51,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:51" (1/1) ... [2019-11-20 02:22:51,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:51" (1/1) ... [2019-11-20 02:22:51,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 02:22:51,772 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 02:22:51,772 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 02:22:51,772 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 02:22:51,773 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:51,846 INFO L130 BoogieDeclarations]: Found specification of procedure fact [2019-11-20 02:22:51,846 INFO L138 BoogieDeclarations]: Found implementation of procedure fact [2019-11-20 02:22:51,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 02:22:51,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 02:22:52,107 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 02:22:52,108 INFO L285 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-20 02:22:52,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:22:52 BoogieIcfgContainer [2019-11-20 02:22:52,109 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 02:22:52,110 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-20 02:22:52,110 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-20 02:22:52,114 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-20 02:22:52,115 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 02:22:52,115 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.11 02:22:51" (1/3) ... [2019-11-20 02:22:52,116 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75aea5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 02:22:52, skipping insertion in model container [2019-11-20 02:22:52,117 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 02:22:52,117 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:22:51" (2/3) ... [2019-11-20 02:22:52,117 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@75aea5d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.11 02:22:52, skipping insertion in model container [2019-11-20 02:22:52,118 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-20 02:22:52,118 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:22:52" (3/3) ... [2019-11-20 02:22:52,119 INFO L371 chiAutomizerObserver]: Analyzing ICFG Binomial.c [2019-11-20 02:22:52,181 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-20 02:22:52,181 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-20 02:22:52,181 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-20 02:22:52,182 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 02:22:52,182 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 02:22:52,182 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-20 02:22:52,182 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 02:22:52,183 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-20 02:22:52,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-11-20 02:22:52,267 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-20 02:22:52,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:22:52,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:22:52,277 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-20 02:22:52,277 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 02:22:52,277 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-20 02:22:52,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2019-11-20 02:22:52,282 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-20 02:22:52,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:22:52,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:22:52,283 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-20 02:22:52,283 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-20 02:22:52,292 INFO L794 eck$LassoCheckResult]: Stem: 21#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 27#L35true assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 3#L38true assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 14#L41-3true [2019-11-20 02:22:52,293 INFO L796 eck$LassoCheckResult]: Loop: 14#L41-3true assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 5#L42-3true assume !(main_~k~0 <= main_~x~0); 16#L41-2true main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 14#L41-3true [2019-11-20 02:22:52,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:52,300 INFO L82 PathProgramCache]: Analyzing trace with hash 38893, now seen corresponding path program 1 times [2019-11-20 02:22:52,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:22:52,309 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514941533] [2019-11-20 02:22:52,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:22:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:52,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:52,404 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:22:52,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:52,406 INFO L82 PathProgramCache]: Analyzing trace with hash 56819, now seen corresponding path program 1 times [2019-11-20 02:22:52,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:22:52,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532016912] [2019-11-20 02:22:52,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:22:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:52,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:52,421 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:22:52,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:52,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1158688391, now seen corresponding path program 1 times [2019-11-20 02:22:52,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:22:52,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439285229] [2019-11-20 02:22:52,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:22:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:22:52,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:22:52,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439285229] [2019-11-20 02:22:52,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:22:52,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 02:22:52,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367848797] [2019-11-20 02:22:52,561 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:22:52,562 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:22:52,562 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:22:52,562 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:22:52,562 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 02:22:52,563 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:52,563 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:22:52,563 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:22:52,563 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2019-11-20 02:22:52,563 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:22:52,563 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:22:52,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:52,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:52,678 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:22:52,679 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:52,686 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:22:52,687 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 02:22:52,698 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 02:22:52,698 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:52,720 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:22:52,720 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:52,738 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 02:22:52,738 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 02:22:53,001 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 02:22:53,003 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:22:53,004 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:22:53,004 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:22:53,004 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:22:53,004 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:22:53,004 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:53,004 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:22:53,005 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:22:53,005 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration1_Loop [2019-11-20 02:22:53,005 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:22:53,005 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:22:53,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:53,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:53,095 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:22:53,101 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:53,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:22:53,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:22:53,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:22:53,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:22:53,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:22:53,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:22:53,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:22:53,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:22:53,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:22:53,138 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:22:53,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:22:53,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:22:53,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:22:53,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:22:53,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:22:53,144 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:22:53,144 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:53,149 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 02:22:53,176 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-20 02:22:53,177 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:53,182 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 02:22:53,182 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-20 02:22:53,182 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 02:22:53,183 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -1*ULTIMATE.start_main_~n~0 Supporting invariants [] [2019-11-20 02:22:53,189 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-20 02:22:53,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:22:53,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:22:53,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:22:53,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:22:53,246 WARN L253 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 02:22:53,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:22:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 02:22:53,313 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-20 02:22:53,314 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states. Second operand 4 states. [2019-11-20 02:22:53,466 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states.. Second operand 4 states. Result 72 states and 105 transitions. Complement of second has 11 states. [2019-11-20 02:22:53,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-20 02:22:53,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-20 02:22:53,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2019-11-20 02:22:53,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 3 letters. Loop has 3 letters. [2019-11-20 02:22:53,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:22:53,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-20 02:22:53,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:22:53,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-20 02:22:53,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:22:53,480 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 105 transitions. [2019-11-20 02:22:53,487 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2019-11-20 02:22:53,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 32 states and 47 transitions. [2019-11-20 02:22:53,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-20 02:22:53,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2019-11-20 02:22:53,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 47 transitions. [2019-11-20 02:22:53,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:22:53,500 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 47 transitions. [2019-11-20 02:22:53,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 47 transitions. [2019-11-20 02:22:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-11-20 02:22:53,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-20 02:22:53,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2019-11-20 02:22:53,544 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 41 transitions. [2019-11-20 02:22:53,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:22:53,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 02:22:53,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 02:22:53,549 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 4 states. [2019-11-20 02:22:53,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:22:53,613 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2019-11-20 02:22:53,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 02:22:53,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 37 transitions. [2019-11-20 02:22:53,616 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-20 02:22:53,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 27 states and 36 transitions. [2019-11-20 02:22:53,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-20 02:22:53,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-20 02:22:53,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 36 transitions. [2019-11-20 02:22:53,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-20 02:22:53,619 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-11-20 02:22:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 36 transitions. [2019-11-20 02:22:53,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-11-20 02:22:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-20 02:22:53,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2019-11-20 02:22:53,624 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-20 02:22:53,624 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2019-11-20 02:22:53,624 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-20 02:22:53,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 34 transitions. [2019-11-20 02:22:53,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2019-11-20 02:22:53,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:22:53,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:22:53,627 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-20 02:22:53,627 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:22:53,628 INFO L794 eck$LassoCheckResult]: Stem: 234#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 235#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 217#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 215#L41-3 [2019-11-20 02:22:53,628 INFO L796 eck$LassoCheckResult]: Loop: 215#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 216#L42-3 assume !!(main_~k~0 <= main_~x~0); 229#L43 assume main_~k~0 <= main_~n~0;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 225#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 228#factENTRY ~n := #in~n; 232#L25 assume ~n <= 0;#res := 1; 236#factFINAL assume true; 218#factEXIT >#67#return; 222#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 228#factENTRY ~n := #in~n; 232#L25 assume ~n <= 0;#res := 1; 236#factFINAL assume true; 218#factEXIT >#69#return; 224#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 228#factENTRY ~n := #in~n; 232#L25 assume ~n <= 0;#res := 1; 236#factFINAL assume true; 218#factEXIT >#71#return; 214#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2;havoc binomialCoefficient_#t~ret3; 212#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 213#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 231#L42-3 assume !(main_~k~0 <= main_~x~0); 230#L41-2 main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 215#L41-3 [2019-11-20 02:22:53,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:53,629 INFO L82 PathProgramCache]: Analyzing trace with hash 38893, now seen corresponding path program 2 times [2019-11-20 02:22:53,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:22:53,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975288068] [2019-11-20 02:22:53,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:22:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:53,641 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:22:53,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:53,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1214025381, now seen corresponding path program 1 times [2019-11-20 02:22:53,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:22:53,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824098710] [2019-11-20 02:22:53,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:22:53,657 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 02:22:53,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1425149474] [2019-11-20 02:22:53,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:22:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:53,732 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:22:53,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:53,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2062430919, now seen corresponding path program 1 times [2019-11-20 02:22:53,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:22:53,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688569923] [2019-11-20 02:22:53,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:22:53,747 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 02:22:53,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1908633585] [2019-11-20 02:22:53,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:22:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:53,844 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:22:54,214 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-20 02:22:54,345 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 24 [2019-11-20 02:22:54,347 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:22:54,347 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:22:54,347 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:22:54,348 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:22:54,348 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 02:22:54,348 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:54,348 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:22:54,348 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:22:54,348 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2019-11-20 02:22:54,348 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:22:54,349 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:22:54,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:54,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:54,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:54,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:54,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:54,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:54,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:54,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:54,573 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:22:54,573 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:22:54,593 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:22:54,593 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:54,598 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 02:22:54,599 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post8=0} Honda state: {ULTIMATE.start_main_#t~post8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:22:54,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:22:54,615 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:54,621 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 02:22:54,621 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:22:54,639 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:22:54,639 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:54,645 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 02:22:54,646 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#res=1} Honda state: {ULTIMATE.start_binomialCoefficient_#res=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:22:54,672 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:22:54,672 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:54,679 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 02:22:54,679 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret3=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:22:54,710 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:22:54,711 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:54,717 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 02:22:54,717 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret1=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:54,734 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:22:54,735 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 02:22:54,739 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 02:22:54,739 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret9=0} Honda state: {ULTIMATE.start_main_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:22:54,763 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:22:54,763 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:54,768 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 02:22:54,768 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7=0} Honda state: {ULTIMATE.start_main_#t~post7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:22:54,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:22:54,788 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:22:54,815 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 02:22:54,815 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:55,445 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 02:22:55,448 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:22:55,448 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:22:55,448 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:22:55,448 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:22:55,448 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:22:55,449 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:55,449 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:22:55,449 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:22:55,449 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration2_Loop [2019-11-20 02:22:55,449 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:22:55,449 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:22:55,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:55,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:55,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:55,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:55,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:55,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:55,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:55,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:55,696 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:22:55,696 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:55,712 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:22:55,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:22:55,714 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:22:55,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:22:55,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:22:55,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:22:55,716 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:22:55,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:22:55,718 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:55,736 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:22:55,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:22:55,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:22:55,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:22:55,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:22:55,739 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:22:55,740 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:22:55,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:22:55,742 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:22:55,786 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:55,788 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:22:55,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:22:55,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:22:55,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:22:55,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:22:55,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:22:55,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:22:55,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:22:55,810 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:22:55,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:22:55,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:22:55,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:22:55,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:22:55,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:22:55,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:22:55,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:55,815 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:55,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:22:55,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:22:55,827 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:22:55,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:22:55,827 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:22:55,827 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:22:55,829 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:22:55,830 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:22:55,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:55,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:22:55,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:22:55,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:22:55,838 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:22:55,838 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:22:55,838 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:22:55,838 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:22:55,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:22:55,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:55,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:22:55,850 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:22:55,851 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:22:55,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:22:55,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:22:55,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:22:55,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:22:55,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:22:55,858 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:22:55,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:22:55,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:22:55,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:22:55,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:22:55,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:22:55,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:55,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:22:55,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:22:55,881 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 02:22:55,892 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-20 02:22:55,892 INFO L444 ModelExtractionUtils]: 5 out of 9 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:22:55,898 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 02:22:55,898 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-20 02:22:55,898 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 02:22:55,898 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:55,902 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-20 02:22:55,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:22:55,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:22:55,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:22:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:22:55,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 02:22:55,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:22:56,067 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 02:22:56,067 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-20 02:22:56,068 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 11 Second operand 8 states. [2019-11-20 02:22:56,460 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 34 transitions. cyclomatic complexity: 11. Second operand 8 states. Result 116 states and 181 transitions. Complement of second has 26 states. [2019-11-20 02:22:56,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-20 02:22:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-20 02:22:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2019-11-20 02:22:56,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 3 letters. Loop has 23 letters. [2019-11-20 02:22:56,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:22:56,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 26 letters. Loop has 23 letters. [2019-11-20 02:22:56,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:22:56,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 73 transitions. Stem has 3 letters. Loop has 46 letters. [2019-11-20 02:22:56,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:22:56,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 116 states and 181 transitions. [2019-11-20 02:22:56,470 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 33 [2019-11-20 02:22:56,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 116 states to 115 states and 180 transitions. [2019-11-20 02:22:56,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2019-11-20 02:22:56,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2019-11-20 02:22:56,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 180 transitions. [2019-11-20 02:22:56,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:22:56,477 INFO L688 BuchiCegarLoop]: Abstraction has 115 states and 180 transitions. [2019-11-20 02:22:56,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 180 transitions. [2019-11-20 02:22:56,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 104. [2019-11-20 02:22:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-20 02:22:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 153 transitions. [2019-11-20 02:22:56,496 INFO L711 BuchiCegarLoop]: Abstraction has 104 states and 153 transitions. [2019-11-20 02:22:56,496 INFO L591 BuchiCegarLoop]: Abstraction has 104 states and 153 transitions. [2019-11-20 02:22:56,496 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-20 02:22:56,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 153 transitions. [2019-11-20 02:22:56,498 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 32 [2019-11-20 02:22:56,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:22:56,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:22:56,500 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 02:22:56,500 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:22:56,500 INFO L794 eck$LassoCheckResult]: Stem: 536#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 537#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 490#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 491#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 493#L42-3 [2019-11-20 02:22:56,501 INFO L796 eck$LassoCheckResult]: Loop: 493#L42-3 assume !!(main_~k~0 <= main_~x~0); 514#L43 assume main_~k~0 <= main_~n~0;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 538#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 567#factENTRY ~n := #in~n; 572#L25 assume !(~n <= 0); 497#L26 call #t~ret0 := fact(~n - 1);< 526#factENTRY ~n := #in~n; 527#L25 assume ~n <= 0;#res := 1; 544#factFINAL assume true; 496#factEXIT >#65#return; 500#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 570#factFINAL assume true; 568#factEXIT >#67#return; 563#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 567#factENTRY ~n := #in~n; 572#L25 assume ~n <= 0;#res := 1; 573#factFINAL assume true; 562#factEXIT >#69#return; 565#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 567#factENTRY ~n := #in~n; 572#L25 assume ~n <= 0;#res := 1; 573#factFINAL assume true; 562#factEXIT >#71#return; 561#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2;havoc binomialCoefficient_#t~ret3; 559#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 557#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 556#L42-3 assume !(main_~k~0 <= main_~x~0); 516#L41-2 main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 492#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 493#L42-3 [2019-11-20 02:22:56,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:56,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 1 times [2019-11-20 02:22:56,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:22:56,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521891782] [2019-11-20 02:22:56,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:22:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:56,511 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:22:56,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:56,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1320440455, now seen corresponding path program 1 times [2019-11-20 02:22:56,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:22:56,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458868679] [2019-11-20 02:22:56,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:22:56,519 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 02:22:56,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2071843212] [2019-11-20 02:22:56,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:22:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:22:56,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 02:22:56,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:22:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 02:22:56,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458868679] [2019-11-20 02:22:56,644 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 02:22:56,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071843212] [2019-11-20 02:22:56,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-20 02:22:56,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-11-20 02:22:56,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045162065] [2019-11-20 02:22:56,645 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 02:22:56,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:22:56,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 02:22:56,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-20 02:22:56,646 INFO L87 Difference]: Start difference. First operand 104 states and 153 transitions. cyclomatic complexity: 54 Second operand 8 states. [2019-11-20 02:22:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:22:56,950 INFO L93 Difference]: Finished difference Result 192 states and 293 transitions. [2019-11-20 02:22:56,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 02:22:56,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 293 transitions. [2019-11-20 02:22:56,957 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 64 [2019-11-20 02:22:56,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 192 states and 293 transitions. [2019-11-20 02:22:56,964 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2019-11-20 02:22:56,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2019-11-20 02:22:56,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 293 transitions. [2019-11-20 02:22:56,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:22:56,966 INFO L688 BuchiCegarLoop]: Abstraction has 192 states and 293 transitions. [2019-11-20 02:22:56,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 293 transitions. [2019-11-20 02:22:56,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 128. [2019-11-20 02:22:56,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-20 02:22:56,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 203 transitions. [2019-11-20 02:22:56,990 INFO L711 BuchiCegarLoop]: Abstraction has 128 states and 203 transitions. [2019-11-20 02:22:56,990 INFO L591 BuchiCegarLoop]: Abstraction has 128 states and 203 transitions. [2019-11-20 02:22:56,990 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-20 02:22:56,990 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 203 transitions. [2019-11-20 02:22:56,992 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2019-11-20 02:22:56,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:22:56,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:22:56,994 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 02:22:56,994 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:22:56,994 INFO L794 eck$LassoCheckResult]: Stem: 937#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 938#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 892#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 893#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 889#L42-3 [2019-11-20 02:22:56,995 INFO L796 eck$LassoCheckResult]: Loop: 889#L42-3 assume !!(main_~k~0 <= main_~x~0); 939#L43 assume main_~k~0 <= main_~n~0;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 940#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 981#factENTRY ~n := #in~n; 983#L25 assume !(~n <= 0); 896#L26 call #t~ret0 := fact(~n - 1);< 925#factENTRY ~n := #in~n; 926#L25 assume ~n <= 0;#res := 1; 946#factFINAL assume true; 894#factEXIT >#65#return; 899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979#factFINAL assume true; 980#factEXIT >#67#return; 973#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 981#factENTRY ~n := #in~n; 983#L25 assume ~n <= 0;#res := 1; 982#factFINAL assume true; 971#factEXIT >#69#return; 977#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 978#factENTRY ~n := #in~n; 985#L25 assume !(~n <= 0); 896#L26 call #t~ret0 := fact(~n - 1);< 925#factENTRY ~n := #in~n; 926#L25 assume ~n <= 0;#res := 1; 946#factFINAL assume true; 894#factEXIT >#65#return; 899#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 979#factFINAL assume true; 980#factEXIT >#71#return; 970#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2;havoc binomialCoefficient_#t~ret3; 968#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 966#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 965#L42-3 assume !(main_~k~0 <= main_~x~0); 915#L41-2 main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 888#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 889#L42-3 [2019-11-20 02:22:56,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:56,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 2 times [2019-11-20 02:22:56,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:22:56,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313908198] [2019-11-20 02:22:56,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:22:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:57,006 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:22:57,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:57,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1015509379, now seen corresponding path program 2 times [2019-11-20 02:22:57,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:22:57,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469776047] [2019-11-20 02:22:57,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:22:57,014 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 02:22:57,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [135527996] [2019-11-20 02:22:57,015 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:22:57,064 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 02:22:57,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 02:22:57,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-20 02:22:57,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:22:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-20 02:22:57,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469776047] [2019-11-20 02:22:57,227 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 02:22:57,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135527996] [2019-11-20 02:22:57,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-20 02:22:57,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-11-20 02:22:57,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349812050] [2019-11-20 02:22:57,228 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 02:22:57,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:22:57,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 02:22:57,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-20 02:22:57,229 INFO L87 Difference]: Start difference. First operand 128 states and 203 transitions. cyclomatic complexity: 80 Second operand 12 states. [2019-11-20 02:22:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:22:57,895 INFO L93 Difference]: Finished difference Result 198 states and 313 transitions. [2019-11-20 02:22:57,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 02:22:57,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 198 states and 313 transitions. [2019-11-20 02:22:57,901 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 68 [2019-11-20 02:22:57,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 198 states to 192 states and 307 transitions. [2019-11-20 02:22:57,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2019-11-20 02:22:57,915 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2019-11-20 02:22:57,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 192 states and 307 transitions. [2019-11-20 02:22:57,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:22:57,916 INFO L688 BuchiCegarLoop]: Abstraction has 192 states and 307 transitions. [2019-11-20 02:22:57,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 307 transitions. [2019-11-20 02:22:57,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2019-11-20 02:22:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-20 02:22:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 247 transitions. [2019-11-20 02:22:57,948 INFO L711 BuchiCegarLoop]: Abstraction has 156 states and 247 transitions. [2019-11-20 02:22:57,948 INFO L591 BuchiCegarLoop]: Abstraction has 156 states and 247 transitions. [2019-11-20 02:22:57,948 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-20 02:22:57,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 156 states and 247 transitions. [2019-11-20 02:22:57,951 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 52 [2019-11-20 02:22:57,952 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:22:57,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:22:57,954 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 02:22:57,955 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:22:57,955 INFO L794 eck$LassoCheckResult]: Stem: 1391#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 1392#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 1347#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 1348#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 1350#L42-3 [2019-11-20 02:22:57,956 INFO L796 eck$LassoCheckResult]: Loop: 1350#L42-3 assume !!(main_~k~0 <= main_~x~0); 1412#L43 assume main_~k~0 <= main_~n~0;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 1414#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 1459#factENTRY ~n := #in~n; 1466#L25 assume !(~n <= 0); 1359#L26 call #t~ret0 := fact(~n - 1);< 1385#factENTRY ~n := #in~n; 1386#L25 assume ~n <= 0;#res := 1; 1407#factFINAL assume true; 1357#factEXIT >#65#return; 1363#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462#factFINAL assume true; 1460#factEXIT >#67#return; 1454#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 1459#factENTRY ~n := #in~n; 1466#L25 assume !(~n <= 0); 1359#L26 call #t~ret0 := fact(~n - 1);< 1385#factENTRY ~n := #in~n; 1386#L25 assume ~n <= 0;#res := 1; 1407#factFINAL assume true; 1357#factEXIT >#65#return; 1363#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462#factFINAL assume true; 1460#factEXIT >#69#return; 1455#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 1459#factENTRY ~n := #in~n; 1466#L25 assume !(~n <= 0); 1359#L26 call #t~ret0 := fact(~n - 1);< 1385#factENTRY ~n := #in~n; 1386#L25 assume ~n <= 0;#res := 1; 1407#factFINAL assume true; 1357#factEXIT >#65#return; 1363#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1462#factFINAL assume true; 1460#factEXIT >#71#return; 1458#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2;havoc binomialCoefficient_#t~ret3; 1495#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 1413#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 1411#L42-3 assume !(main_~k~0 <= main_~x~0); 1375#L41-2 main_#t~post7 := main_~n~0;main_~n~0 := 1 + main_#t~post7;havoc main_#t~post7; 1349#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 1350#L42-3 [2019-11-20 02:22:57,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:57,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 3 times [2019-11-20 02:22:57,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:22:57,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606841202] [2019-11-20 02:22:57,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:22:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:57,969 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:22:57,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:57,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1510379783, now seen corresponding path program 3 times [2019-11-20 02:22:57,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:22:57,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775095925] [2019-11-20 02:22:57,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:22:57,975 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 02:22:57,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1096535484] [2019-11-20 02:22:57,976 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:22:58,007 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-20 02:22:58,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 02:22:58,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-20 02:22:58,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:22:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-11-20 02:22:58,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775095925] [2019-11-20 02:22:58,045 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 02:22:58,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096535484] [2019-11-20 02:22:58,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 02:22:58,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 02:22:58,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401543047] [2019-11-20 02:22:58,047 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 02:22:58,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:22:58,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:22:58,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:22:58,047 INFO L87 Difference]: Start difference. First operand 156 states and 247 transitions. cyclomatic complexity: 96 Second operand 6 states. [2019-11-20 02:22:58,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:22:58,131 INFO L93 Difference]: Finished difference Result 204 states and 331 transitions. [2019-11-20 02:22:58,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:22:58,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 204 states and 331 transitions. [2019-11-20 02:22:58,136 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 73 [2019-11-20 02:22:58,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 204 states to 198 states and 325 transitions. [2019-11-20 02:22:58,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2019-11-20 02:22:58,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 100 [2019-11-20 02:22:58,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 198 states and 325 transitions. [2019-11-20 02:22:58,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:22:58,144 INFO L688 BuchiCegarLoop]: Abstraction has 198 states and 325 transitions. [2019-11-20 02:22:58,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states and 325 transitions. [2019-11-20 02:22:58,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 160. [2019-11-20 02:22:58,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-11-20 02:22:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 251 transitions. [2019-11-20 02:22:58,178 INFO L711 BuchiCegarLoop]: Abstraction has 160 states and 251 transitions. [2019-11-20 02:22:58,178 INFO L591 BuchiCegarLoop]: Abstraction has 160 states and 251 transitions. [2019-11-20 02:22:58,178 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-20 02:22:58,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 160 states and 251 transitions. [2019-11-20 02:22:58,181 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2019-11-20 02:22:58,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:22:58,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:22:58,182 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 02:22:58,186 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:22:58,186 INFO L794 eck$LassoCheckResult]: Stem: 1894#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 1895#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 1840#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 1841#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 1843#L42-3 [2019-11-20 02:22:58,187 INFO L796 eck$LassoCheckResult]: Loop: 1843#L42-3 assume !!(main_~k~0 <= main_~x~0); 1926#L43 assume main_~k~0 <= main_~n~0;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 1934#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 1947#factENTRY ~n := #in~n; 1950#L25 assume !(~n <= 0); 1912#L26 call #t~ret0 := fact(~n - 1);< 1913#factENTRY ~n := #in~n; 1956#L25 assume ~n <= 0;#res := 1; 1954#factFINAL assume true; 1952#factEXIT >#65#return; 1951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1945#factFINAL assume true; 1946#factEXIT >#67#return; 1935#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 1947#factENTRY ~n := #in~n; 1950#L25 assume !(~n <= 0); 1912#L26 call #t~ret0 := fact(~n - 1);< 1913#factENTRY ~n := #in~n; 1956#L25 assume ~n <= 0;#res := 1; 1954#factFINAL assume true; 1952#factEXIT >#65#return; 1951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1945#factFINAL assume true; 1946#factEXIT >#69#return; 1939#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 1947#factENTRY ~n := #in~n; 1950#L25 assume !(~n <= 0); 1912#L26 call #t~ret0 := fact(~n - 1);< 1913#factENTRY ~n := #in~n; 1956#L25 assume ~n <= 0;#res := 1; 1954#factFINAL assume true; 1952#factEXIT >#65#return; 1951#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 1945#factFINAL assume true; 1946#factEXIT >#71#return; 1942#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2;havoc binomialCoefficient_#t~ret3; 1958#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 1957#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 1843#L42-3 [2019-11-20 02:22:58,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:58,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 4 times [2019-11-20 02:22:58,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:22:58,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123642238] [2019-11-20 02:22:58,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:22:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:58,202 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:22:58,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:58,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1831628649, now seen corresponding path program 1 times [2019-11-20 02:22:58,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:22:58,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698347986] [2019-11-20 02:22:58,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:22:58,217 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 02:22:58,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [239455173] [2019-11-20 02:22:58,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:22:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:22:58,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 02:22:58,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:22:58,345 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 7 proven. 35 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-20 02:22:58,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698347986] [2019-11-20 02:22:58,345 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 02:22:58,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239455173] [2019-11-20 02:22:58,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-20 02:22:58,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-11-20 02:22:58,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589721597] [2019-11-20 02:22:58,346 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-20 02:22:58,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:22:58,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 02:22:58,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-20 02:22:58,347 INFO L87 Difference]: Start difference. First operand 160 states and 251 transitions. cyclomatic complexity: 96 Second operand 9 states. [2019-11-20 02:22:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:22:58,759 INFO L93 Difference]: Finished difference Result 312 states and 527 transitions. [2019-11-20 02:22:58,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 02:22:58,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 527 transitions. [2019-11-20 02:22:58,767 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 110 [2019-11-20 02:22:58,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 312 states and 527 transitions. [2019-11-20 02:22:58,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 152 [2019-11-20 02:22:58,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 152 [2019-11-20 02:22:58,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 312 states and 527 transitions. [2019-11-20 02:22:58,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:22:58,777 INFO L688 BuchiCegarLoop]: Abstraction has 312 states and 527 transitions. [2019-11-20 02:22:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states and 527 transitions. [2019-11-20 02:22:58,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 200. [2019-11-20 02:22:58,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-20 02:22:58,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 367 transitions. [2019-11-20 02:22:58,823 INFO L711 BuchiCegarLoop]: Abstraction has 200 states and 367 transitions. [2019-11-20 02:22:58,823 INFO L591 BuchiCegarLoop]: Abstraction has 200 states and 367 transitions. [2019-11-20 02:22:58,823 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-20 02:22:58,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 367 transitions. [2019-11-20 02:22:58,826 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 61 [2019-11-20 02:22:58,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:22:58,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:22:58,830 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-20 02:22:58,830 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:22:58,831 INFO L794 eck$LassoCheckResult]: Stem: 2499#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 2500#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 2445#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 2446#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 2448#L42-3 [2019-11-20 02:22:58,832 INFO L796 eck$LassoCheckResult]: Loop: 2448#L42-3 assume !!(main_~k~0 <= main_~x~0); 2529#L43 assume main_~k~0 <= main_~n~0;binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~n~0, main_~k~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 2530#L30 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 2554#factENTRY ~n := #in~n; 2560#L25 assume !(~n <= 0); 2561#L26 call #t~ret0 := fact(~n - 1);< 2527#factENTRY ~n := #in~n; 2573#L25 assume ~n <= 0;#res := 1; 2571#factFINAL assume true; 2566#factEXIT >#65#return; 2564#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2552#factFINAL assume true; 2553#factEXIT >#67#return; 2545#L30-1 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 2554#factENTRY ~n := #in~n; 2560#L25 assume !(~n <= 0); 2561#L26 call #t~ret0 := fact(~n - 1);< 2527#factENTRY ~n := #in~n; 2573#L25 assume ~n <= 0;#res := 1; 2571#factFINAL assume true; 2566#factEXIT >#65#return; 2564#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 2552#factFINAL assume true; 2553#factEXIT >#69#return; 2541#L30-2 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 2559#factENTRY ~n := #in~n; 2562#L25 assume ~n <= 0;#res := 1; 2558#factFINAL assume true; 2540#factEXIT >#71#return; 2443#L30-3 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2;havoc binomialCoefficient_#t~ret3; 2439#L30-4 main_#t~ret9 := binomialCoefficient_#res;havoc main_#t~ret9; 2440#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 2448#L42-3 [2019-11-20 02:22:58,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:58,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1205710, now seen corresponding path program 5 times [2019-11-20 02:22:58,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:22:58,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196686185] [2019-11-20 02:22:58,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:22:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:58,856 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:22:58,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:58,857 INFO L82 PathProgramCache]: Analyzing trace with hash -677796173, now seen corresponding path program 2 times [2019-11-20 02:22:58,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:22:58,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339830357] [2019-11-20 02:22:58,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:22:58,870 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 02:22:58,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [346933581] [2019-11-20 02:22:58,873 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:22:58,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 02:22:58,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2019-11-20 02:22:58,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:22:58,950 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:22:58,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:22:58,951 INFO L82 PathProgramCache]: Analyzing trace with hash -224814976, now seen corresponding path program 1 times [2019-11-20 02:22:58,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:22:58,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440730045] [2019-11-20 02:22:58,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:22:58,964 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 02:22:58,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1328148817] [2019-11-20 02:22:58,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:22:59,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:22:59,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 02:22:59,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:22:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-20 02:22:59,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440730045] [2019-11-20 02:22:59,054 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-20 02:22:59,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328148817] [2019-11-20 02:22:59,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-20 02:22:59,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-11-20 02:22:59,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541000820] [2019-11-20 02:22:59,433 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-20 02:22:59,617 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2019-11-20 02:22:59,618 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:22:59,618 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:22:59,618 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:22:59,619 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:22:59,619 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-20 02:22:59,619 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:59,619 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:22:59,619 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:22:59,619 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2019-11-20 02:22:59,619 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:22:59,620 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:22:59,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:59,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:59,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:59,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:59,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:59,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:59,824 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:22:59,824 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:59,831 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:22:59,831 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 02:22:59,837 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-20 02:22:59,837 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_binomialCoefficient_#t~ret2=0} Honda state: {ULTIMATE.start_binomialCoefficient_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:22:59,845 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-20 02:22:59,845 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:59,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-20 02:22:59,855 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-20 02:22:59,877 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-20 02:22:59,879 INFO L210 LassoAnalysis]: Preferences: [2019-11-20 02:22:59,880 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-20 02:22:59,880 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-20 02:22:59,880 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-20 02:22:59,880 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-20 02:22:59,880 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:22:59,880 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-20 02:22:59,880 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-20 02:22:59,880 INFO L133 ssoRankerPreferences]: Filename of dumped script: Binomial.c_Iteration7_Loop [2019-11-20 02:22:59,880 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-20 02:22:59,881 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-20 02:22:59,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:59,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:59,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:59,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:59,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:22:59,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-20 02:23:00,083 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-11-20 02:23:00,126 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-20 02:23:00,126 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:00,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:23:00,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:00,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:00,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:00,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:00,132 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:00,133 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:00,133 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:00,134 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:00,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-20 02:23:00,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-20 02:23:00,141 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-20 02:23:00,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-20 02:23:00,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-20 02:23:00,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-20 02:23:00,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-20 02:23:00,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-20 02:23:00,153 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-20 02:23:00,165 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-20 02:23:00,165 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-20 02:23:00,170 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-20 02:23:00,170 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-20 02:23:00,170 INFO L510 LassoAnalysis]: Proved termination. [2019-11-20 02:23:00,170 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0) = -2*ULTIMATE.start_main_~k~0 + 3 Supporting invariants [] Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-20 02:23:00,178 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-20 02:23:00,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:00,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:00,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 02:23:00,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:00,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 02:23:00,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 02:23:00,386 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-20 02:23:00,387 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2019-11-20 02:23:00,387 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 367 transitions. cyclomatic complexity: 172 Second operand 9 states. [2019-11-20 02:23:00,836 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 200 states and 367 transitions. cyclomatic complexity: 172. Second operand 9 states. Result 819 states and 1395 transitions. Complement of second has 33 states. [2019-11-20 02:23:00,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 7 non-accepting loop states 1 accepting loop states [2019-11-20 02:23:00,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-11-20 02:23:00,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 73 transitions. [2019-11-20 02:23:00,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 4 letters. Loop has 32 letters. [2019-11-20 02:23:00,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:23:00,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 36 letters. Loop has 32 letters. [2019-11-20 02:23:00,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:23:00,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 73 transitions. Stem has 4 letters. Loop has 64 letters. [2019-11-20 02:23:00,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-20 02:23:00,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 819 states and 1395 transitions. [2019-11-20 02:23:00,862 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 108 [2019-11-20 02:23:00,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 819 states to 710 states and 1201 transitions. [2019-11-20 02:23:00,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 212 [2019-11-20 02:23:00,880 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 217 [2019-11-20 02:23:00,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 710 states and 1201 transitions. [2019-11-20 02:23:00,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:23:00,881 INFO L688 BuchiCegarLoop]: Abstraction has 710 states and 1201 transitions. [2019-11-20 02:23:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states and 1201 transitions. [2019-11-20 02:23:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 658. [2019-11-20 02:23:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-11-20 02:23:00,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1101 transitions. [2019-11-20 02:23:00,921 INFO L711 BuchiCegarLoop]: Abstraction has 658 states and 1101 transitions. [2019-11-20 02:23:00,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 02:23:00,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 02:23:00,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 02:23:00,921 INFO L87 Difference]: Start difference. First operand 658 states and 1101 transitions. Second operand 6 states. [2019-11-20 02:23:01,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 02:23:01,143 INFO L93 Difference]: Finished difference Result 537 states and 866 transitions. [2019-11-20 02:23:01,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 02:23:01,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 537 states and 866 transitions. [2019-11-20 02:23:01,156 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 82 [2019-11-20 02:23:01,168 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 537 states to 535 states and 861 transitions. [2019-11-20 02:23:01,169 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 175 [2019-11-20 02:23:01,169 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 175 [2019-11-20 02:23:01,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 535 states and 861 transitions. [2019-11-20 02:23:01,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-20 02:23:01,173 INFO L688 BuchiCegarLoop]: Abstraction has 535 states and 861 transitions. [2019-11-20 02:23:01,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states and 861 transitions. [2019-11-20 02:23:01,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 526. [2019-11-20 02:23:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-11-20 02:23:01,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 848 transitions. [2019-11-20 02:23:01,201 INFO L711 BuchiCegarLoop]: Abstraction has 526 states and 848 transitions. [2019-11-20 02:23:01,201 INFO L591 BuchiCegarLoop]: Abstraction has 526 states and 848 transitions. [2019-11-20 02:23:01,201 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-20 02:23:01,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 526 states and 848 transitions. [2019-11-20 02:23:01,206 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 82 [2019-11-20 02:23:01,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-20 02:23:01,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-20 02:23:01,209 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-20 02:23:01,209 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 02:23:01,210 INFO L794 eck$LassoCheckResult]: Stem: 4986#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~ret9, main_#t~ret10, main_#t~post8, main_~k~0, main_#t~post7, main_~n~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet4;havoc main_#t~nondet4; 4987#L35 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet5;havoc main_#t~nondet5; 4944#L38 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet6;havoc main_#t~nondet6;main_~n~0 := 0; 4945#L41-3 assume !!(main_~n~0 <= main_~x~0);main_~k~0 := 0; 5075#L42-3 assume !!(main_~k~0 <= main_~x~0); 5048#L43 [2019-11-20 02:23:01,210 INFO L796 eck$LassoCheckResult]: Loop: 5048#L43 assume !(main_~k~0 <= main_~n~0);binomialCoefficient_#in~n, binomialCoefficient_#in~k := main_~k~0, main_~n~0;havoc binomialCoefficient_#res;havoc binomialCoefficient_#t~ret1, binomialCoefficient_#t~ret2, binomialCoefficient_#t~ret3, binomialCoefficient_~n, binomialCoefficient_~k;binomialCoefficient_~n := binomialCoefficient_#in~n;binomialCoefficient_~k := binomialCoefficient_#in~k; 5024#L30-5 call binomialCoefficient_#t~ret1 := fact(binomialCoefficient_~n);< 5148#factENTRY ~n := #in~n; 5262#L25 assume !(~n <= 0); 5156#L26 call #t~ret0 := fact(~n - 1);< 5159#factENTRY ~n := #in~n; 5166#L25 assume !(~n <= 0); 5153#L26 call #t~ret0 := fact(~n - 1);< 5159#factENTRY ~n := #in~n; 5166#L25 assume ~n <= 0;#res := 1; 5164#factFINAL assume true; 5162#factEXIT >#65#return; 5158#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5160#factFINAL assume true; 5152#factEXIT >#65#return; 5151#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5150#factFINAL assume true; 5149#factEXIT >#73#return; 5023#L30-6 call binomialCoefficient_#t~ret2 := fact(binomialCoefficient_~k);< 5148#factENTRY ~n := #in~n; 5262#L25 assume ~n <= 0;#res := 1; 5247#factFINAL assume true; 5248#factEXIT >#75#return; 5025#L30-7 call binomialCoefficient_#t~ret3 := fact(binomialCoefficient_~n - binomialCoefficient_~k);< 5146#factENTRY ~n := #in~n; 5161#L25 assume !(~n <= 0); 5156#L26 call #t~ret0 := fact(~n - 1);< 5159#factENTRY ~n := #in~n; 5166#L25 assume !(~n <= 0); 5153#L26 call #t~ret0 := fact(~n - 1);< 5159#factENTRY ~n := #in~n; 5166#L25 assume ~n <= 0;#res := 1; 5164#factFINAL assume true; 5162#factEXIT >#65#return; 5158#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5160#factFINAL assume true; 5152#factEXIT >#65#return; 5151#L26-1 #res := ~n * #t~ret0;havoc #t~ret0; 5150#factFINAL assume true; 5149#factEXIT >#77#return; 5114#L30-8 binomialCoefficient_#res := (if binomialCoefficient_#t~ret1 < 0 && 0 != binomialCoefficient_#t~ret1 % (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) then (if binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3 < 0 then binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3) - 1 else 1 + binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3)) else binomialCoefficient_#t~ret1 / (binomialCoefficient_#t~ret2 * binomialCoefficient_#t~ret3));havoc binomialCoefficient_#t~ret1;havoc binomialCoefficient_#t~ret2;havoc binomialCoefficient_#t~ret3; 5115#L30-9 main_#t~ret10 := binomialCoefficient_#res;havoc main_#t~ret10; 5058#L42-2 main_#t~post8 := main_~k~0;main_~k~0 := 1 + main_#t~post8;havoc main_#t~post8; 5059#L42-3 assume !!(main_~k~0 <= main_~x~0); 5048#L43 [2019-11-20 02:23:01,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:01,210 INFO L82 PathProgramCache]: Analyzing trace with hash 37377045, now seen corresponding path program 1 times [2019-11-20 02:23:01,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:01,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961866738] [2019-11-20 02:23:01,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:01,225 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:01,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:01,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1978386707, now seen corresponding path program 1 times [2019-11-20 02:23:01,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:01,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529886319] [2019-11-20 02:23:01,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:01,242 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-20 02:23:01,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1679730461] [2019-11-20 02:23:01,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f50a1cd6-47a0-4571-ac22-d10e9d51dcbe/bin/uautomizer/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 02:23:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 02:23:01,339 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 02:23:01,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 02:23:01,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1569148711, now seen corresponding path program 1 times [2019-11-20 02:23:01,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 02:23:01,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599215906] [2019-11-20 02:23:01,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 02:23:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 02:23:01,378 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: UNKNOWN during nested interpolation. I don't know how to continue at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:363) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:928) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkConcatFeasibility(LassoCheck.java:899) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:832) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-20 02:23:01,382 INFO L168 Benchmark]: Toolchain (without parser) took 10067.67 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.7 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -54.1 MB). Peak memory consumption was 262.6 MB. Max. memory is 11.5 GB. [2019-11-20 02:23:01,383 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:23:01,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-20 02:23:01,384 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 02:23:01,385 INFO L168 Benchmark]: Boogie Preprocessor took 31.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-11-20 02:23:01,385 INFO L168 Benchmark]: RCFGBuilder took 337.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-11-20 02:23:01,386 INFO L168 Benchmark]: BuchiAutomizer took 9270.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.2 MB). Peak memory consumption was 279.7 MB. Max. memory is 11.5 GB. [2019-11-20 02:23:01,389 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 383.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 337.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9270.96 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.2 MB). Peak memory consumption was 279.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: UNKNOWN during nested interpolation. I don't know how to continue de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: UNKNOWN during nested interpolation. I don't know how to continue: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:363) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...