./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-numeric/Parts_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-numeric/Parts_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/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 be287e2bd97a0ee2eedfe145e117cb9cd9037f62 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:12:08,216 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:12:08,217 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:12:08,225 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:12:08,225 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:12:08,226 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:12:08,226 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:12:08,227 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:12:08,228 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:12:08,229 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:12:08,230 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:12:08,230 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:12:08,230 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:12:08,231 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:12:08,232 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:12:08,232 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:12:08,233 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:12:08,234 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:12:08,236 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:12:08,237 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:12:08,237 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:12:08,238 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:12:08,240 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:12:08,240 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:12:08,240 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:12:08,241 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:12:08,242 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:12:08,242 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:12:08,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:12:08,243 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:12:08,244 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:12:08,244 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:12:08,244 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:12:08,244 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:12:08,245 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:12:08,245 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:12:08,246 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 13:12:08,256 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:12:08,256 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:12:08,257 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:12:08,258 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:12:08,258 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:12:08,258 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 13:12:08,258 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 13:12:08,258 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 13:12:08,258 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 13:12:08,258 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 13:12:08,259 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 13:12:08,259 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:12:08,259 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:12:08,259 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:12:08,259 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:12:08,259 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 13:12:08,259 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 13:12:08,259 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 13:12:08,259 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:12:08,260 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 13:12:08,260 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:12:08,260 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 13:12:08,260 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:12:08,260 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:12:08,260 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 13:12:08,260 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:12:08,260 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:12:08,261 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 13:12:08,261 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 13:12:08,261 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/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 -> be287e2bd97a0ee2eedfe145e117cb9cd9037f62 [2018-11-23 13:12:08,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:12:08,295 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:12:08,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:12:08,298 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:12:08,298 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:12:08,299 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/../../sv-benchmarks/c/termination-numeric/Parts_true-termination_true-no-overflow.c [2018-11-23 13:12:08,334 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/data/30d48946b/010acd882afd47d58703c52f69fee019/FLAGb45c66e78 [2018-11-23 13:12:08,751 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:12:08,752 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/sv-benchmarks/c/termination-numeric/Parts_true-termination_true-no-overflow.c [2018-11-23 13:12:08,756 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/data/30d48946b/010acd882afd47d58703c52f69fee019/FLAGb45c66e78 [2018-11-23 13:12:08,767 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/data/30d48946b/010acd882afd47d58703c52f69fee019 [2018-11-23 13:12:08,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:12:08,769 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:12:08,770 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:08,770 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:12:08,772 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:12:08,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:08" (1/1) ... [2018-11-23 13:12:08,775 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e5f2ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:08, skipping insertion in model container [2018-11-23 13:12:08,775 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:12:08" (1/1) ... [2018-11-23 13:12:08,781 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:12:08,794 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:12:08,902 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:08,904 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:12:08,914 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:12:08,922 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:12:08,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:08 WrapperNode [2018-11-23 13:12:08,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:12:08,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:08,924 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:12:08,924 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:12:08,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:08" (1/1) ... [2018-11-23 13:12:08,932 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:08" (1/1) ... [2018-11-23 13:12:08,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:12:08,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:12:08,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:12:08,943 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:12:08,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:08" (1/1) ... [2018-11-23 13:12:08,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:08" (1/1) ... [2018-11-23 13:12:08,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:08" (1/1) ... [2018-11-23 13:12:08,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:08" (1/1) ... [2018-11-23 13:12:08,950 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:08" (1/1) ... [2018-11-23 13:12:08,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:08" (1/1) ... [2018-11-23 13:12:08,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:08" (1/1) ... [2018-11-23 13:12:08,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:12:08,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:12:08,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:12:08,955 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:12:08,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/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 [2018-11-23 13:12:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure parts [2018-11-23 13:12:09,023 INFO L138 BoogieDeclarations]: Found implementation of procedure parts [2018-11-23 13:12:09,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:12:09,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:12:09,135 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:12:09,136 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 13:12:09,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:09 BoogieIcfgContainer [2018-11-23 13:12:09,136 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:12:09,137 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 13:12:09,137 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 13:12:09,139 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 13:12:09,140 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:12:09,140 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:12:08" (1/3) ... [2018-11-23 13:12:09,141 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@431fa2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:12:09, skipping insertion in model container [2018-11-23 13:12:09,142 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:12:09,142 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:12:08" (2/3) ... [2018-11-23 13:12:09,142 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@431fa2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:12:09, skipping insertion in model container [2018-11-23 13:12:09,142 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:12:09,142 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:09" (3/3) ... [2018-11-23 13:12:09,144 INFO L375 chiAutomizerObserver]: Analyzing ICFG Parts_true-termination_true-no-overflow.c [2018-11-23 13:12:09,190 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:12:09,191 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 13:12:09,191 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 13:12:09,191 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 13:12:09,191 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:12:09,191 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:12:09,191 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 13:12:09,191 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:12:09,191 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 13:12:09,203 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-23 13:12:09,227 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-23 13:12:09,227 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:09,227 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:09,232 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 13:12:09,232 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:12:09,233 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 13:12:09,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2018-11-23 13:12:09,235 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-23 13:12:09,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:09,235 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:09,235 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 13:12:09,235 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:12:09,240 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 6#L28true assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 7#L31true assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 8#L34-3true [2018-11-23 13:12:09,240 INFO L796 eck$LassoCheckResult]: Loop: 8#L34-3true assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 10#L35-3true assume !true; 11#L34-2true main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 8#L34-3true [2018-11-23 13:12:09,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:09,244 INFO L82 PathProgramCache]: Analyzing trace with hash 49816, now seen corresponding path program 1 times [2018-11-23 13:12:09,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:09,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:09,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:09,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:09,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:09,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:09,313 INFO L82 PathProgramCache]: Analyzing trace with hash 67975, now seen corresponding path program 1 times [2018-11-23 13:12:09,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:09,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:09,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:09,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:09,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:09,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:09,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:12:09,336 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:12:09,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:12:09,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:12:09,346 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-23 13:12:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:09,352 INFO L93 Difference]: Finished difference Result 23 states and 32 transitions. [2018-11-23 13:12:09,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:12:09,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 32 transitions. [2018-11-23 13:12:09,356 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-23 13:12:09,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 20 states and 27 transitions. [2018-11-23 13:12:09,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-23 13:12:09,361 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-11-23 13:12:09,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2018-11-23 13:12:09,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:12:09,363 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-23 13:12:09,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2018-11-23 13:12:09,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 13:12:09,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:12:09,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2018-11-23 13:12:09,384 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-23 13:12:09,384 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2018-11-23 13:12:09,384 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 13:12:09,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2018-11-23 13:12:09,385 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-23 13:12:09,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:09,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:09,385 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 13:12:09,385 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:12:09,385 INFO L794 eck$LassoCheckResult]: Stem: 68#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 63#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 64#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 65#L34-3 [2018-11-23 13:12:09,386 INFO L796 eck$LassoCheckResult]: Loop: 65#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 66#L35-3 assume !(main_~q~0 <= main_~x~0); 67#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 65#L34-3 [2018-11-23 13:12:09,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:09,386 INFO L82 PathProgramCache]: Analyzing trace with hash 49816, now seen corresponding path program 2 times [2018-11-23 13:12:09,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:09,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:09,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:09,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:09,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:09,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:09,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:09,394 INFO L82 PathProgramCache]: Analyzing trace with hash 67727, now seen corresponding path program 1 times [2018-11-23 13:12:09,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:09,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:09,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:09,394 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:09,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:09,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:09,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1484106392, now seen corresponding path program 1 times [2018-11-23 13:12:09,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:09,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:09,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:09,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:09,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:09,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:09,441 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:09,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:12:09,469 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:09,469 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:09,469 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:09,469 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:09,469 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:12:09,470 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:09,470 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:09,470 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:09,470 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-23 13:12:09,470 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:09,470 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:09,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:09,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:09,552 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:09,553 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/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 [2018-11-23 13:12:09,556 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:09,556 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:09,563 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:09,564 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/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 [2018-11-23 13:12:09,581 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:09,581 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/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 [2018-11-23 13:12:09,601 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:12:09,601 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:09,740 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:12:09,741 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:09,742 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:09,742 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:09,742 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:09,742 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:12:09,742 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:09,742 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:09,742 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:09,742 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration2_Loop [2018-11-23 13:12:09,742 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:09,742 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:09,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:09,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:09,799 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:09,802 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:12:09,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:09,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:09,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:09,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:09,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:09,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:09,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:09,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:09,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:09,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:09,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:09,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:09,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:09,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:09,809 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:09,810 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:09,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:09,816 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:12:09,824 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:12:09,824 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 13:12:09,826 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:12:09,826 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:12:09,826 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:12:09,827 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0) = -1*ULTIMATE.start_main_~p~0 Supporting invariants [] [2018-11-23 13:12:09,827 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:12:09,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:09,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:09,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:09,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:09,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:09,900 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 [2018-11-23 13:12:09,900 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand 4 states. [2018-11-23 13:12:09,949 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 27 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 28 states and 38 transitions. Complement of second has 7 states. [2018-11-23 13:12:09,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:09,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:12:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 7 transitions. [2018-11-23 13:12:09,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 3 letters. [2018-11-23 13:12:09,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:09,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-23 13:12:09,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:09,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 7 transitions. Stem has 3 letters. Loop has 6 letters. [2018-11-23 13:12:09,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:09,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 38 transitions. [2018-11-23 13:12:09,954 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-11-23 13:12:09,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 26 states and 36 transitions. [2018-11-23 13:12:09,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-23 13:12:09,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 13:12:09,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 36 transitions. [2018-11-23 13:12:09,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:09,957 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2018-11-23 13:12:09,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 36 transitions. [2018-11-23 13:12:09,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 13:12:09,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 13:12:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2018-11-23 13:12:09,961 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 34 transitions. [2018-11-23 13:12:09,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:12:09,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:12:09,961 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 4 states. [2018-11-23 13:12:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:09,981 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2018-11-23 13:12:09,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:12:09,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 31 transitions. [2018-11-23 13:12:09,983 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-23 13:12:09,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 23 states and 30 transitions. [2018-11-23 13:12:09,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-11-23 13:12:09,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-11-23 13:12:09,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2018-11-23 13:12:09,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:12:09,984 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2018-11-23 13:12:09,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2018-11-23 13:12:09,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-23 13:12:09,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 13:12:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2018-11-23 13:12:09,986 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-23 13:12:09,986 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2018-11-23 13:12:09,986 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 13:12:09,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2018-11-23 13:12:09,987 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2018-11-23 13:12:09,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:09,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:09,988 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 13:12:09,988 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:09,988 INFO L794 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 208#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 209#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 210#L34-3 [2018-11-23 13:12:09,988 INFO L796 eck$LassoCheckResult]: Loop: 210#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 211#L35-3 assume !!(main_~q~0 <= main_~x~0); 200#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 207#partsENTRY ~p := #in~p;~q := #in~q; 214#L20 assume ~p <= 0;#res := 1; 215#partsFINAL assume true; 199#partsEXIT >#67#return; 204#L36-1 havoc main_#t~ret8; 216#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 217#L35-3 assume !(main_~q~0 <= main_~x~0); 212#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 210#L34-3 [2018-11-23 13:12:09,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:09,989 INFO L82 PathProgramCache]: Analyzing trace with hash 49816, now seen corresponding path program 3 times [2018-11-23 13:12:09,989 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:09,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:09,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:09,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:09,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:09,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:09,995 INFO L82 PathProgramCache]: Analyzing trace with hash 28034713, now seen corresponding path program 1 times [2018-11-23 13:12:09,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:09,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:09,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:09,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:09,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:10,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:10,007 INFO L82 PathProgramCache]: Analyzing trace with hash 717639586, now seen corresponding path program 1 times [2018-11-23 13:12:10,007 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:10,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:10,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:10,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:10,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:10,112 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:10,112 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:10,112 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:10,112 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:10,112 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:12:10,112 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:10,112 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:10,112 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:10,113 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-23 13:12:10,113 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:10,113 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:10,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:10,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:10,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:10,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:10,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:10,156 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:10,156 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/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 [2018-11-23 13:12:10,165 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:10,165 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:10,183 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:12:10,183 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:10,199 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:12:10,200 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:10,201 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:10,201 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:10,201 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:10,201 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:12:10,201 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:10,201 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:10,201 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:10,201 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration3_Loop [2018-11-23 13:12:10,201 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:10,202 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:10,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:10,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:10,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:10,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:10,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:10,255 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:10,256 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:12:10,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:10,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:10,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:10,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:10,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:10,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:10,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:10,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:10,261 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:12:10,263 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:12:10,263 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 13:12:10,264 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:12:10,264 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:12:10,264 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:12:10,264 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0) = -2*ULTIMATE.start_main_~p~0 + 1 Supporting invariants [] [2018-11-23 13:12:10,264 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:12:10,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:10,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:10,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:10,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:10,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:10,340 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-23 13:12:10,340 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand 7 states. [2018-11-23 13:12:10,497 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand 7 states. Result 142 states and 211 transitions. Complement of second has 28 states. [2018-11-23 13:12:10,498 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 [2018-11-23 13:12:10,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2018-11-23 13:12:10,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 58 transitions. Stem has 3 letters. Loop has 11 letters. [2018-11-23 13:12:10,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:10,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 58 transitions. Stem has 14 letters. Loop has 11 letters. [2018-11-23 13:12:10,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:10,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 58 transitions. Stem has 3 letters. Loop has 22 letters. [2018-11-23 13:12:10,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:10,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 142 states and 211 transitions. [2018-11-23 13:12:10,506 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-23 13:12:10,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 142 states to 141 states and 210 transitions. [2018-11-23 13:12:10,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2018-11-23 13:12:10,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 72 [2018-11-23 13:12:10,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 141 states and 210 transitions. [2018-11-23 13:12:10,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:10,510 INFO L705 BuchiCegarLoop]: Abstraction has 141 states and 210 transitions. [2018-11-23 13:12:10,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states and 210 transitions. [2018-11-23 13:12:10,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 132. [2018-11-23 13:12:10,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 13:12:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 197 transitions. [2018-11-23 13:12:10,519 INFO L728 BuchiCegarLoop]: Abstraction has 132 states and 197 transitions. [2018-11-23 13:12:10,519 INFO L608 BuchiCegarLoop]: Abstraction has 132 states and 197 transitions. [2018-11-23 13:12:10,519 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 13:12:10,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 132 states and 197 transitions. [2018-11-23 13:12:10,521 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-23 13:12:10,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:10,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:10,521 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 13:12:10,522 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:10,522 INFO L794 eck$LassoCheckResult]: Stem: 489#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 482#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 483#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 484#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 486#L35-3 [2018-11-23 13:12:10,522 INFO L796 eck$LassoCheckResult]: Loop: 486#L35-3 assume !!(main_~q~0 <= main_~x~0); 490#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 524#partsENTRY ~p := #in~p;~q := #in~q; 541#L20 assume !(~p <= 0); 527#L21 assume ~q <= 0;#res := 0; 525#partsFINAL assume true; 523#partsEXIT >#67#return; 522#L36-1 havoc main_#t~ret8; 521#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 520#L35-3 assume !(main_~q~0 <= main_~x~0); 494#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 485#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 486#L35-3 [2018-11-23 13:12:10,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:10,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1544334, now seen corresponding path program 1 times [2018-11-23 13:12:10,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:10,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:10,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:10,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:10,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:10,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:10,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:10,527 INFO L82 PathProgramCache]: Analyzing trace with hash 148862011, now seen corresponding path program 1 times [2018-11-23 13:12:10,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:10,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:10,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:10,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:10,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:10,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:10,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 13:12:10,588 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:12:10,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:12:10,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:12:10,588 INFO L87 Difference]: Start difference. First operand 132 states and 197 transitions. cyclomatic complexity: 70 Second operand 9 states. [2018-11-23 13:12:10,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:10,735 INFO L93 Difference]: Finished difference Result 222 states and 381 transitions. [2018-11-23 13:12:10,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:12:10,736 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 381 transitions. [2018-11-23 13:12:10,741 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 31 [2018-11-23 13:12:10,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 216 states and 375 transitions. [2018-11-23 13:12:10,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 109 [2018-11-23 13:12:10,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 109 [2018-11-23 13:12:10,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 216 states and 375 transitions. [2018-11-23 13:12:10,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:10,747 INFO L705 BuchiCegarLoop]: Abstraction has 216 states and 375 transitions. [2018-11-23 13:12:10,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states and 375 transitions. [2018-11-23 13:12:10,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 176. [2018-11-23 13:12:10,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-23 13:12:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 289 transitions. [2018-11-23 13:12:10,765 INFO L728 BuchiCegarLoop]: Abstraction has 176 states and 289 transitions. [2018-11-23 13:12:10,765 INFO L608 BuchiCegarLoop]: Abstraction has 176 states and 289 transitions. [2018-11-23 13:12:10,765 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 13:12:10,765 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states and 289 transitions. [2018-11-23 13:12:10,768 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2018-11-23 13:12:10,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:10,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:10,768 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-23 13:12:10,768 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:10,769 INFO L794 eck$LassoCheckResult]: Stem: 849#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 842#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 843#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 844#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 846#L35-3 [2018-11-23 13:12:10,769 INFO L796 eck$LassoCheckResult]: Loop: 846#L35-3 assume !!(main_~q~0 <= main_~x~0); 850#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 902#partsENTRY ~p := #in~p;~q := #in~q; 936#L20 assume !(~p <= 0); 934#L21 assume ~q <= 0;#res := 0; 935#partsFINAL assume true; 954#partsEXIT >#67#return; 953#L36-1 havoc main_#t~ret8; 875#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 846#L35-3 [2018-11-23 13:12:10,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:10,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1544334, now seen corresponding path program 2 times [2018-11-23 13:12:10,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:10,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:10,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:10,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:10,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:10,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:10,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1742875649, now seen corresponding path program 1 times [2018-11-23 13:12:10,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:10,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:10,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:10,776 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:10,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:10,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:10,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1841293844, now seen corresponding path program 1 times [2018-11-23 13:12:10,783 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:10,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:10,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:10,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:10,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:10,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:10,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:12:10,889 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:10,889 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:10,889 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:10,889 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:10,889 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:12:10,890 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:10,890 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:10,890 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:10,890 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-23 13:12:10,890 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:10,890 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:10,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:10,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:10,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:10,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:10,916 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:10,916 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/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 [2018-11-23 13:12:10,921 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:10,921 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:10,924 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:10,924 INFO L448 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/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:10,939 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:10,939 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:10,956 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:12:10,957 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:10,974 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:12:10,975 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:10,975 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:10,975 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:10,975 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:10,975 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:12:10,975 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:10,976 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:10,976 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:10,976 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration5_Loop [2018-11-23 13:12:10,976 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:10,976 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:10,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:10,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:10,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:10,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:10,998 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:10,998 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:12:10,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:10,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:10,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:10,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:10,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:10,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:10,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:10,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:10,999 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:11,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:11,000 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:11,000 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:11,000 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:11,000 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:11,000 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:11,001 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:11,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:11,002 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:12:11,004 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:12:11,004 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 13:12:11,004 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:12:11,004 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:12:11,004 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:12:11,004 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0) = -2*ULTIMATE.start_main_~q~0 + 1 Supporting invariants [] [2018-11-23 13:12:11,005 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:12:11,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:11,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:11,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:11,056 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-11-23 13:12:11,056 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 176 states and 289 transitions. cyclomatic complexity: 118 Second operand 7 states. [2018-11-23 13:12:11,158 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 176 states and 289 transitions. cyclomatic complexity: 118. Second operand 7 states. Result 687 states and 1143 transitions. Complement of second has 25 states. [2018-11-23 13:12:11,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:11,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2018-11-23 13:12:11,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 4 letters. Loop has 9 letters. [2018-11-23 13:12:11,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:11,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 13 letters. Loop has 9 letters. [2018-11-23 13:12:11,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:11,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 4 letters. Loop has 18 letters. [2018-11-23 13:12:11,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:11,160 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 687 states and 1143 transitions. [2018-11-23 13:12:11,169 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 45 [2018-11-23 13:12:11,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 687 states to 631 states and 1044 transitions. [2018-11-23 13:12:11,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 190 [2018-11-23 13:12:11,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2018-11-23 13:12:11,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 631 states and 1044 transitions. [2018-11-23 13:12:11,181 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:11,181 INFO L705 BuchiCegarLoop]: Abstraction has 631 states and 1044 transitions. [2018-11-23 13:12:11,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states and 1044 transitions. [2018-11-23 13:12:11,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 592. [2018-11-23 13:12:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-11-23 13:12:11,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 977 transitions. [2018-11-23 13:12:11,215 INFO L728 BuchiCegarLoop]: Abstraction has 592 states and 977 transitions. [2018-11-23 13:12:11,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:12:11,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:12:11,215 INFO L87 Difference]: Start difference. First operand 592 states and 977 transitions. Second operand 5 states. [2018-11-23 13:12:11,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:11,291 INFO L93 Difference]: Finished difference Result 630 states and 1090 transitions. [2018-11-23 13:12:11,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:12:11,292 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 630 states and 1090 transitions. [2018-11-23 13:12:11,297 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2018-11-23 13:12:11,300 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 630 states to 299 states and 504 transitions. [2018-11-23 13:12:11,300 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2018-11-23 13:12:11,301 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2018-11-23 13:12:11,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 299 states and 504 transitions. [2018-11-23 13:12:11,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:11,303 INFO L705 BuchiCegarLoop]: Abstraction has 299 states and 504 transitions. [2018-11-23 13:12:11,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states and 504 transitions. [2018-11-23 13:12:11,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 255. [2018-11-23 13:12:11,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-11-23 13:12:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 399 transitions. [2018-11-23 13:12:11,314 INFO L728 BuchiCegarLoop]: Abstraction has 255 states and 399 transitions. [2018-11-23 13:12:11,314 INFO L608 BuchiCegarLoop]: Abstraction has 255 states and 399 transitions. [2018-11-23 13:12:11,314 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 13:12:11,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 255 states and 399 transitions. [2018-11-23 13:12:11,316 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 41 [2018-11-23 13:12:11,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:11,316 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:11,316 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:11,316 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:11,317 INFO L794 eck$LassoCheckResult]: Stem: 3054#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 3041#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 3042#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 3043#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 3045#L35-3 assume !!(main_~q~0 <= main_~x~0); 3072#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 3087#partsENTRY ~p := #in~p;~q := #in~q; 3239#L20 assume ~p <= 0;#res := 1; 3237#partsFINAL assume true; 3238#partsEXIT >#67#return; 3079#L36-1 [2018-11-23 13:12:11,317 INFO L796 eck$LassoCheckResult]: Loop: 3079#L36-1 havoc main_#t~ret8; 3064#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 3048#L35-3 assume !!(main_~q~0 <= main_~x~0); 3037#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 3240#partsENTRY ~p := #in~p;~q := #in~q; 3241#L20 assume ~p <= 0;#res := 1; 3251#partsFINAL assume true; 3231#partsEXIT >#67#return; 3079#L36-1 [2018-11-23 13:12:11,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:11,317 INFO L82 PathProgramCache]: Analyzing trace with hash 2114025366, now seen corresponding path program 1 times [2018-11-23 13:12:11,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:11,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:11,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:11,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:11,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:11,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:11,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1248496373, now seen corresponding path program 1 times [2018-11-23 13:12:11,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:11,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:11,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:11,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:11,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:11,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:11,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1106999392, now seen corresponding path program 1 times [2018-11-23 13:12:11,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:11,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:11,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:11,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:11,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:11,393 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:11,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:11,394 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:11,394 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:11,394 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:12:11,394 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:11,394 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:11,394 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:11,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-23 13:12:11,394 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:11,394 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:11,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:11,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:11,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:11,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:11,425 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:11,425 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:11,427 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:11,427 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:11,429 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:11,430 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret8=1} Honda state: {ULTIMATE.start_main_#t~ret8=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:11,449 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:11,449 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:11,467 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:12:11,467 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:11,715 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:12:11,717 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:11,717 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:11,717 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:11,717 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:11,717 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:12:11,717 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:11,717 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:11,717 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:11,718 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration6_Loop [2018-11-23 13:12:11,718 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:11,718 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:11,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:11,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:11,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:11,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:11,749 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:11,749 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:12:11,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:11,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:11,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:11,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:11,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:11,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:11,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:11,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:11,753 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:12:11,756 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:12:11,756 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:12:11,756 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:12:11,756 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:12:11,757 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:12:11,757 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~q~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-23 13:12:11,757 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:12:11,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:11,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:11,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:11,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:11,822 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-23 13:12:11,822 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 255 states and 399 transitions. cyclomatic complexity: 152 Second operand 7 states. [2018-11-23 13:12:11,895 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 255 states and 399 transitions. cyclomatic complexity: 152. Second operand 7 states. Result 370 states and 564 transitions. Complement of second has 13 states. [2018-11-23 13:12:11,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 47 transitions. [2018-11-23 13:12:11,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 10 letters. Loop has 8 letters. [2018-11-23 13:12:11,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:11,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 18 letters. Loop has 8 letters. [2018-11-23 13:12:11,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:11,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 47 transitions. Stem has 10 letters. Loop has 16 letters. [2018-11-23 13:12:11,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:11,897 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 370 states and 564 transitions. [2018-11-23 13:12:11,906 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 53 [2018-11-23 13:12:11,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 370 states to 306 states and 470 transitions. [2018-11-23 13:12:11,910 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 181 [2018-11-23 13:12:11,910 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2018-11-23 13:12:11,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 470 transitions. [2018-11-23 13:12:11,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:11,911 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 470 transitions. [2018-11-23 13:12:11,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 470 transitions. [2018-11-23 13:12:11,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-11-23 13:12:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-11-23 13:12:11,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 467 transitions. [2018-11-23 13:12:11,922 INFO L728 BuchiCegarLoop]: Abstraction has 304 states and 467 transitions. [2018-11-23 13:12:11,922 INFO L608 BuchiCegarLoop]: Abstraction has 304 states and 467 transitions. [2018-11-23 13:12:11,922 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 13:12:11,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 304 states and 467 transitions. [2018-11-23 13:12:11,924 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 53 [2018-11-23 13:12:11,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:11,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:11,924 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:11,925 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:12:11,925 INFO L794 eck$LassoCheckResult]: Stem: 3753#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 3739#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 3740#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 3741#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 3743#L35-3 assume !!(main_~q~0 <= main_~x~0); 3799#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 3800#partsENTRY ~p := #in~p;~q := #in~q; 3884#L20 assume !(~p <= 0); 3885#L21 assume !(~q <= 0); 3981#L22 assume ~q > ~p; 3765#L22-1 call #t~ret0 := parts(~p, ~p);< 3974#partsENTRY [2018-11-23 13:12:11,925 INFO L796 eck$LassoCheckResult]: Loop: 3974#partsENTRY ~p := #in~p;~q := #in~q; 3976#L20 assume !(~p <= 0); 3977#L21 assume !(~q <= 0); 3982#L22 assume !(~q > ~p); 3763#L23 call #t~ret1 := parts(~p - ~q, ~q);< 3974#partsENTRY [2018-11-23 13:12:11,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:11,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1110295411, now seen corresponding path program 1 times [2018-11-23 13:12:11,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:11,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:11,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:11,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:11,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:11,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:11,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:12:11,946 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:12:11,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:11,946 INFO L82 PathProgramCache]: Analyzing trace with hash 28756499, now seen corresponding path program 1 times [2018-11-23 13:12:11,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:11,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:11,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:11,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:11,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:11,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:11,989 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:11,989 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:11,990 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:11,990 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:11,990 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:12:11,990 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:11,990 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:11,990 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:11,990 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-23 13:12:11,990 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:11,990 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:11,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:11,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:11,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:12,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:12,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:12,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:12,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:12,039 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:12,039 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:12,052 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:12,053 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:12,056 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:12,056 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:12,082 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:12,083 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:12,084 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:12,085 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/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 [2018-11-23 13:12:12,101 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:12,101 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:12,124 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:12:12,124 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:12,149 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:12:12,151 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:12,151 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:12,151 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:12,151 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:12,151 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:12:12,151 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:12,151 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:12,151 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:12,151 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration7_Loop [2018-11-23 13:12:12,151 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:12,151 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:12,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:12,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:12,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:12,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:12,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:12,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:12,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:12,184 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:12,184 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:12:12,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:12,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:12,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:12,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:12,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:12,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:12,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:12,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:12,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:12,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:12,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:12,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:12,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:12,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:12,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:12,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:12,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:12,190 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:12:12,191 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:12:12,191 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:12:12,192 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:12:12,192 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:12:12,192 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:12:12,192 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~p) = 1*parts_#in~p Supporting invariants [] [2018-11-23 13:12:12,192 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:12:12,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:12,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:12,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:12,234 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-23 13:12:12,234 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 304 states and 467 transitions. cyclomatic complexity: 172 Second operand 5 states. [2018-11-23 13:12:12,348 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 304 states and 467 transitions. cyclomatic complexity: 172. Second operand 5 states. Result 904 states and 1531 transitions. Complement of second has 25 states. [2018-11-23 13:12:12,352 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 [2018-11-23 13:12:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:12:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2018-11-23 13:12:12,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 11 letters. Loop has 5 letters. [2018-11-23 13:12:12,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:12,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 16 letters. Loop has 5 letters. [2018-11-23 13:12:12,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:12,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 43 transitions. Stem has 11 letters. Loop has 10 letters. [2018-11-23 13:12:12,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:12,353 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 904 states and 1531 transitions. [2018-11-23 13:12:12,372 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 116 [2018-11-23 13:12:12,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 904 states to 756 states and 1370 transitions. [2018-11-23 13:12:12,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 435 [2018-11-23 13:12:12,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 443 [2018-11-23 13:12:12,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 756 states and 1370 transitions. [2018-11-23 13:12:12,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:12,384 INFO L705 BuchiCegarLoop]: Abstraction has 756 states and 1370 transitions. [2018-11-23 13:12:12,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states and 1370 transitions. [2018-11-23 13:12:12,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 726. [2018-11-23 13:12:12,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 726 states. [2018-11-23 13:12:12,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 1305 transitions. [2018-11-23 13:12:12,408 INFO L728 BuchiCegarLoop]: Abstraction has 726 states and 1305 transitions. [2018-11-23 13:12:12,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:12:12,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:12:12,408 INFO L87 Difference]: Start difference. First operand 726 states and 1305 transitions. Second operand 5 states. [2018-11-23 13:12:12,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:12,468 INFO L93 Difference]: Finished difference Result 731 states and 1299 transitions. [2018-11-23 13:12:12,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:12:12,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 731 states and 1299 transitions. [2018-11-23 13:12:12,476 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 89 [2018-11-23 13:12:12,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 731 states to 728 states and 1296 transitions. [2018-11-23 13:12:12,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 397 [2018-11-23 13:12:12,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 397 [2018-11-23 13:12:12,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 728 states and 1296 transitions. [2018-11-23 13:12:12,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:12,486 INFO L705 BuchiCegarLoop]: Abstraction has 728 states and 1296 transitions. [2018-11-23 13:12:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states and 1296 transitions. [2018-11-23 13:12:12,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 687. [2018-11-23 13:12:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2018-11-23 13:12:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1228 transitions. [2018-11-23 13:12:12,507 INFO L728 BuchiCegarLoop]: Abstraction has 687 states and 1228 transitions. [2018-11-23 13:12:12,507 INFO L608 BuchiCegarLoop]: Abstraction has 687 states and 1228 transitions. [2018-11-23 13:12:12,507 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 13:12:12,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 687 states and 1228 transitions. [2018-11-23 13:12:12,511 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 85 [2018-11-23 13:12:12,512 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:12,512 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:12,512 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:12,513 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:12,513 INFO L794 eck$LassoCheckResult]: Stem: 6524#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 6511#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 6512#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 6517#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 6819#L35-3 assume !!(main_~q~0 <= main_~x~0); 7026#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 7027#partsENTRY ~p := #in~p;~q := #in~q; 7046#L20 assume ~p <= 0;#res := 1; 7045#partsFINAL assume true; 7044#partsEXIT >#67#return; 7037#L36-1 havoc main_#t~ret8; 6810#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 6808#L35-3 assume !(main_~q~0 <= main_~x~0); 6807#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 6806#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 6514#L35-3 [2018-11-23 13:12:12,513 INFO L796 eck$LassoCheckResult]: Loop: 6514#L35-3 assume !!(main_~q~0 <= main_~x~0); 6812#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 6815#partsENTRY ~p := #in~p;~q := #in~q; 6817#L20 assume !(~p <= 0); 6818#L21 assume ~q <= 0;#res := 0; 7063#partsFINAL assume true; 7060#partsEXIT >#67#return; 7051#L36-1 havoc main_#t~ret8; 6709#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 6603#L35-3 assume !!(main_~q~0 <= main_~x~0); 6594#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 6668#partsENTRY ~p := #in~p;~q := #in~q; 6665#L20 assume !(~p <= 0); 6661#L21 assume !(~q <= 0); 6659#L22 assume !(~q > ~p); 6613#L23 call #t~ret1 := parts(~p - ~q, ~q);< 6706#partsENTRY ~p := #in~p;~q := #in~q; 6702#L20 assume ~p <= 0;#res := 1; 6703#partsFINAL assume true; 6748#partsEXIT >#63#return; 6616#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 6706#partsENTRY ~p := #in~p;~q := #in~q; 6702#L20 assume !(~p <= 0); 6698#L21 assume ~q <= 0;#res := 0; 6699#partsFINAL assume true; 6710#partsEXIT >#65#return; 6682#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 6601#partsFINAL assume true; 6602#partsEXIT >#67#return; 6677#L36-1 havoc main_#t~ret8; 6676#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 6593#L35-3 assume !(main_~q~0 <= main_~x~0); 6522#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 6513#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 6514#L35-3 [2018-11-23 13:12:12,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:12,513 INFO L82 PathProgramCache]: Analyzing trace with hash 771990724, now seen corresponding path program 2 times [2018-11-23 13:12:12,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:12,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:12,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:12,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:12,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:12,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:12,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:12,557 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:12,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:12:12,578 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:12:12,578 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:12,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:12,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:12,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-23 13:12:12,642 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:12:12,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:12,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1644712569, now seen corresponding path program 1 times [2018-11-23 13:12:12,642 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:12,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:12,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:12,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:12,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:12,700 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 13:12:12,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:12,701 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:12,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:12,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:12,803 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 13:12:12,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:12,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-11-23 13:12:12,819 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:12:12,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 13:12:12,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:12:12,819 INFO L87 Difference]: Start difference. First operand 687 states and 1228 transitions. cyclomatic complexity: 561 Second operand 11 states. [2018-11-23 13:12:12,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:12,879 INFO L93 Difference]: Finished difference Result 765 states and 1349 transitions. [2018-11-23 13:12:12,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:12:12,881 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 765 states and 1349 transitions. [2018-11-23 13:12:12,888 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 101 [2018-11-23 13:12:12,898 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 765 states to 759 states and 1342 transitions. [2018-11-23 13:12:12,898 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 403 [2018-11-23 13:12:12,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 403 [2018-11-23 13:12:12,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 759 states and 1342 transitions. [2018-11-23 13:12:12,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:12,899 INFO L705 BuchiCegarLoop]: Abstraction has 759 states and 1342 transitions. [2018-11-23 13:12:12,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states and 1342 transitions. [2018-11-23 13:12:12,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 686. [2018-11-23 13:12:12,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2018-11-23 13:12:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1226 transitions. [2018-11-23 13:12:12,920 INFO L728 BuchiCegarLoop]: Abstraction has 686 states and 1226 transitions. [2018-11-23 13:12:12,920 INFO L608 BuchiCegarLoop]: Abstraction has 686 states and 1226 transitions. [2018-11-23 13:12:12,920 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 13:12:12,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 686 states and 1226 transitions. [2018-11-23 13:12:12,924 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 85 [2018-11-23 13:12:12,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:12,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:12,925 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-23 13:12:12,925 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:12,925 INFO L794 eck$LassoCheckResult]: Stem: 8137#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 8130#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 8131#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 8132#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 8419#L35-3 assume !!(main_~q~0 <= main_~x~0); 8124#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 8194#partsENTRY ~p := #in~p;~q := #in~q; 8695#L20 assume ~p <= 0;#res := 1; 8694#partsFINAL assume true; 8123#partsEXIT >#67#return; 8125#L36-1 havoc main_#t~ret8; 8180#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 8459#L35-3 assume !!(main_~q~0 <= main_~x~0); 8150#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 8452#partsENTRY ~p := #in~p;~q := #in~q; 8456#L20 assume ~p <= 0;#res := 1; 8455#partsFINAL assume true; 8449#partsEXIT >#67#return; 8450#L36-1 havoc main_#t~ret8; 8637#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 8403#L35-3 assume !(main_~q~0 <= main_~x~0); 8402#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 8399#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 8396#L35-3 [2018-11-23 13:12:12,926 INFO L796 eck$LassoCheckResult]: Loop: 8396#L35-3 assume !!(main_~q~0 <= main_~x~0); 8393#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 8394#partsENTRY ~p := #in~p;~q := #in~q; 8397#L20 assume !(~p <= 0); 8398#L21 assume ~q <= 0;#res := 0; 8448#partsFINAL assume true; 8446#partsEXIT >#67#return; 8441#L36-1 havoc main_#t~ret8; 8384#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 8382#L35-3 assume !!(main_~q~0 <= main_~x~0); 8201#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 8273#partsENTRY ~p := #in~p;~q := #in~q; 8271#L20 assume !(~p <= 0); 8269#L21 assume !(~q <= 0); 8268#L22 assume !(~q > ~p); 8232#L23 call #t~ret1 := parts(~p - ~q, ~q);< 8288#partsENTRY ~p := #in~p;~q := #in~q; 8285#L20 assume ~p <= 0;#res := 1; 8286#partsFINAL assume true; 8302#partsEXIT >#63#return; 8223#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 8288#partsENTRY ~p := #in~p;~q := #in~q; 8285#L20 assume !(~p <= 0); 8281#L21 assume ~q <= 0;#res := 0; 8282#partsFINAL assume true; 8372#partsEXIT >#65#return; 8212#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 8213#partsFINAL assume true; 8207#partsEXIT >#67#return; 8204#L36-1 havoc main_#t~ret8; 8205#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 8199#L35-3 assume !(main_~q~0 <= main_~x~0); 8200#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 8401#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 8396#L35-3 [2018-11-23 13:12:12,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:12,926 INFO L82 PathProgramCache]: Analyzing trace with hash -696579334, now seen corresponding path program 3 times [2018-11-23 13:12:12,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:12,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:12,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:12,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:12,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:12,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:12,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1644712569, now seen corresponding path program 2 times [2018-11-23 13:12:12,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:12,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:12,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:12,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:12,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 13:12:12,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:12,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:13,002 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:12:13,012 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:12:13,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:13,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:13,124 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 13:12:13,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:13,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-11-23 13:12:13,149 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:12:13,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 13:12:13,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2018-11-23 13:12:13,149 INFO L87 Difference]: Start difference. First operand 686 states and 1226 transitions. cyclomatic complexity: 560 Second operand 18 states. [2018-11-23 13:12:13,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:13,588 INFO L93 Difference]: Finished difference Result 1128 states and 2454 transitions. [2018-11-23 13:12:13,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 13:12:13,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1128 states and 2454 transitions. [2018-11-23 13:12:13,598 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 197 [2018-11-23 13:12:13,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1128 states to 1078 states and 2389 transitions. [2018-11-23 13:12:13,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 601 [2018-11-23 13:12:13,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 601 [2018-11-23 13:12:13,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1078 states and 2389 transitions. [2018-11-23 13:12:13,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:13,610 INFO L705 BuchiCegarLoop]: Abstraction has 1078 states and 2389 transitions. [2018-11-23 13:12:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states and 2389 transitions. [2018-11-23 13:12:13,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 724. [2018-11-23 13:12:13,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2018-11-23 13:12:13,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1345 transitions. [2018-11-23 13:12:13,634 INFO L728 BuchiCegarLoop]: Abstraction has 724 states and 1345 transitions. [2018-11-23 13:12:13,634 INFO L608 BuchiCegarLoop]: Abstraction has 724 states and 1345 transitions. [2018-11-23 13:12:13,635 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 13:12:13,635 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 724 states and 1345 transitions. [2018-11-23 13:12:13,638 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 95 [2018-11-23 13:12:13,638 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:13,638 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:13,640 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-23 13:12:13,640 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2018-11-23 13:12:13,640 INFO L794 eck$LassoCheckResult]: Stem: 10099#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 10092#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 10093#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 10094#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 10096#L35-3 assume !!(main_~q~0 <= main_~x~0); 10409#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 10411#partsENTRY ~p := #in~p;~q := #in~q; 10414#L20 assume ~p <= 0;#res := 1; 10412#partsFINAL assume true; 10408#partsEXIT >#67#return; 10407#L36-1 havoc main_#t~ret8; 10406#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 10404#L35-3 assume !!(main_~q~0 <= main_~x~0); 10396#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 10400#partsENTRY ~p := #in~p;~q := #in~q; 10405#L20 assume ~p <= 0;#res := 1; 10403#partsFINAL assume true; 10395#partsEXIT >#67#return; 10397#L36-1 havoc main_#t~ret8; 10610#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 10372#L35-3 assume !(main_~q~0 <= main_~x~0); 10371#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 10367#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 10364#L35-3 [2018-11-23 13:12:13,640 INFO L796 eck$LassoCheckResult]: Loop: 10364#L35-3 assume !!(main_~q~0 <= main_~x~0); 10361#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 10362#partsENTRY ~p := #in~p;~q := #in~q; 10369#L20 assume !(~p <= 0); 10365#L21 assume ~q <= 0;#res := 0; 10363#partsFINAL assume true; 10360#partsEXIT >#67#return; 10358#L36-1 havoc main_#t~ret8; 10356#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 10348#L35-3 assume !!(main_~q~0 <= main_~x~0); 10175#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 10178#partsENTRY ~p := #in~p;~q := #in~q; 10251#L20 assume !(~p <= 0); 10247#L21 assume !(~q <= 0); 10244#L22 assume !(~q > ~p); 10197#L23 call #t~ret1 := parts(~p - ~q, ~q);< 10222#partsENTRY ~p := #in~p;~q := #in~q; 10269#L20 assume ~p <= 0;#res := 1; 10270#partsFINAL assume true; 10293#partsEXIT >#63#return; 10191#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 10222#partsENTRY ~p := #in~p;~q := #in~q; 10269#L20 assume !(~p <= 0); 10262#L21 assume ~q <= 0;#res := 0; 10263#partsFINAL assume true; 10307#partsEXIT >#65#return; 10310#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 10179#partsFINAL assume true; 10180#partsEXIT >#67#return; 10323#L36-1 havoc main_#t~ret8; 10326#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 10319#L35-3 assume !!(main_~q~0 <= main_~x~0); 10174#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 10178#partsENTRY ~p := #in~p;~q := #in~q; 10251#L20 assume !(~p <= 0); 10247#L21 assume !(~q <= 0); 10244#L22 assume !(~q > ~p); 10197#L23 call #t~ret1 := parts(~p - ~q, ~q);< 10222#partsENTRY ~p := #in~p;~q := #in~q; 10269#L20 assume ~p <= 0;#res := 1; 10270#partsFINAL assume true; 10293#partsEXIT >#63#return; 10191#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 10222#partsENTRY ~p := #in~p;~q := #in~q; 10269#L20 assume !(~p <= 0); 10262#L21 assume ~q <= 0;#res := 0; 10263#partsFINAL assume true; 10307#partsEXIT >#65#return; 10310#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 10179#partsFINAL assume true; 10180#partsEXIT >#67#return; 10321#L36-1 havoc main_#t~ret8; 10166#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 10167#L35-3 assume !(main_~q~0 <= main_~x~0); 10320#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 10366#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 10364#L35-3 [2018-11-23 13:12:13,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:13,640 INFO L82 PathProgramCache]: Analyzing trace with hash -696579334, now seen corresponding path program 4 times [2018-11-23 13:12:13,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:13,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:13,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:13,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:13,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:13,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:13,651 INFO L82 PathProgramCache]: Analyzing trace with hash -400961993, now seen corresponding path program 3 times [2018-11-23 13:12:13,651 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:13,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:13,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:13,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:13,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:13,721 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 48 proven. 21 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-23 13:12:13,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:13,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:13,730 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:12:13,767 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 13:12:13,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:13,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:13,856 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 46 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-23 13:12:13,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:13,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2018-11-23 13:12:13,872 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:12:13,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:12:13,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:12:13,872 INFO L87 Difference]: Start difference. First operand 724 states and 1345 transitions. cyclomatic complexity: 641 Second operand 17 states. [2018-11-23 13:12:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:14,253 INFO L93 Difference]: Finished difference Result 1220 states and 2142 transitions. [2018-11-23 13:12:14,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:12:14,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1220 states and 2142 transitions. [2018-11-23 13:12:14,261 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 154 [2018-11-23 13:12:14,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1220 states to 1187 states and 2088 transitions. [2018-11-23 13:12:14,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 592 [2018-11-23 13:12:14,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 592 [2018-11-23 13:12:14,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1187 states and 2088 transitions. [2018-11-23 13:12:14,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:14,271 INFO L705 BuchiCegarLoop]: Abstraction has 1187 states and 2088 transitions. [2018-11-23 13:12:14,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states and 2088 transitions. [2018-11-23 13:12:14,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1012. [2018-11-23 13:12:14,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2018-11-23 13:12:14,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1822 transitions. [2018-11-23 13:12:14,292 INFO L728 BuchiCegarLoop]: Abstraction has 1012 states and 1822 transitions. [2018-11-23 13:12:14,292 INFO L608 BuchiCegarLoop]: Abstraction has 1012 states and 1822 transitions. [2018-11-23 13:12:14,292 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 13:12:14,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1012 states and 1822 transitions. [2018-11-23 13:12:14,296 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 106 [2018-11-23 13:12:14,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:14,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:14,298 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-23 13:12:14,298 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2018-11-23 13:12:14,298 INFO L794 eck$LassoCheckResult]: Stem: 12257#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 12250#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 12251#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 12252#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 12253#L35-3 assume !!(main_~q~0 <= main_~x~0); 12952#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 12954#partsENTRY ~p := #in~p;~q := #in~q; 12957#L20 assume ~p <= 0;#res := 1; 12955#partsFINAL assume true; 12951#partsEXIT >#67#return; 12950#L36-1 havoc main_#t~ret8; 12949#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 12947#L35-3 assume !!(main_~q~0 <= main_~x~0); 12943#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 12944#partsENTRY ~p := #in~p;~q := #in~q; 12948#L20 assume ~p <= 0;#res := 1; 12946#partsFINAL assume true; 12942#partsEXIT >#67#return; 12941#L36-1 havoc main_#t~ret8; 12940#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 12618#L35-3 assume !(main_~q~0 <= main_~x~0); 12616#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 12608#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 12606#L35-3 [2018-11-23 13:12:14,298 INFO L796 eck$LassoCheckResult]: Loop: 12606#L35-3 assume !!(main_~q~0 <= main_~x~0); 12602#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 12603#partsENTRY ~p := #in~p;~q := #in~q; 12611#L20 assume !(~p <= 0); 12607#L21 assume ~q <= 0;#res := 0; 12605#partsFINAL assume true; 12601#partsEXIT >#67#return; 12599#L36-1 havoc main_#t~ret8; 12598#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 12597#L35-3 assume !!(main_~q~0 <= main_~x~0); 12307#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 12497#partsENTRY ~p := #in~p;~q := #in~q; 12450#L20 assume !(~p <= 0); 12452#L21 assume !(~q <= 0); 12423#L22 assume !(~q > ~p); 12372#L23 call #t~ret1 := parts(~p - ~q, ~q);< 12420#partsENTRY ~p := #in~p;~q := #in~q; 12427#L20 assume ~p <= 0;#res := 1; 12422#partsFINAL assume true; 12392#partsEXIT >#63#return; 12367#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 12379#partsENTRY ~p := #in~p;~q := #in~q; 12457#L20 assume !(~p <= 0); 12459#L21 assume ~q <= 0;#res := 0; 12500#partsFINAL assume true; 12477#partsEXIT >#65#return; 12481#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 12596#partsFINAL assume true; 12595#partsEXIT >#67#return; 12564#L36-1 havoc main_#t~ret8; 12569#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 12565#L35-3 assume !!(main_~q~0 <= main_~x~0); 12304#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 12329#partsENTRY ~p := #in~p;~q := #in~q; 12609#L20 assume !(~p <= 0); 12425#L21 assume !(~q <= 0); 12423#L22 assume !(~q > ~p); 12372#L23 call #t~ret1 := parts(~p - ~q, ~q);< 12420#partsENTRY ~p := #in~p;~q := #in~q; 12427#L20 assume ~p <= 0;#res := 1; 12422#partsFINAL assume true; 12392#partsEXIT >#63#return; 12367#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 12379#partsENTRY ~p := #in~p;~q := #in~q; 12457#L20 assume !(~p <= 0); 12459#L21 assume !(~q <= 0); 12435#L22 assume !(~q > ~p); 12370#L23 call #t~ret1 := parts(~p - ~q, ~q);< 12420#partsENTRY ~p := #in~p;~q := #in~q; 12427#L20 assume ~p <= 0;#res := 1; 12422#partsFINAL assume true; 12392#partsEXIT >#63#return; 12374#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 12379#partsENTRY ~p := #in~p;~q := #in~q; 12457#L20 assume !(~p <= 0); 12459#L21 assume ~q <= 0;#res := 0; 12500#partsFINAL assume true; 12477#partsEXIT >#65#return; 12482#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 12465#partsFINAL assume true; 12466#partsEXIT >#65#return; 12331#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 12332#partsFINAL assume true; 12563#partsEXIT >#67#return; 12561#L36-1 havoc main_#t~ret8; 12554#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 12323#L35-3 assume !(main_~q~0 <= main_~x~0); 12262#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 12263#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 12606#L35-3 [2018-11-23 13:12:14,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:14,298 INFO L82 PathProgramCache]: Analyzing trace with hash -696579334, now seen corresponding path program 5 times [2018-11-23 13:12:14,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:14,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:14,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:14,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:14,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:14,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:14,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:14,307 INFO L82 PathProgramCache]: Analyzing trace with hash 86170293, now seen corresponding path program 4 times [2018-11-23 13:12:14,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:14,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:14,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:14,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:14,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 75 proven. 20 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2018-11-23 13:12:14,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:14,365 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:14,381 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:12:14,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:12:14,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:14,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 39 proven. 58 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-11-23 13:12:14,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:14,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 14 [2018-11-23 13:12:14,474 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:12:14,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:12:14,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:12:14,475 INFO L87 Difference]: Start difference. First operand 1012 states and 1822 transitions. cyclomatic complexity: 832 Second operand 14 states. [2018-11-23 13:12:14,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:14,760 INFO L93 Difference]: Finished difference Result 1573 states and 2639 transitions. [2018-11-23 13:12:14,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 13:12:14,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1573 states and 2639 transitions. [2018-11-23 13:12:14,773 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 115 [2018-11-23 13:12:14,787 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1573 states to 1484 states and 2492 transitions. [2018-11-23 13:12:14,788 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 768 [2018-11-23 13:12:14,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 786 [2018-11-23 13:12:14,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1484 states and 2492 transitions. [2018-11-23 13:12:14,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:14,791 INFO L705 BuchiCegarLoop]: Abstraction has 1484 states and 2492 transitions. [2018-11-23 13:12:14,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states and 2492 transitions. [2018-11-23 13:12:14,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 1374. [2018-11-23 13:12:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1374 states. [2018-11-23 13:12:14,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 2297 transitions. [2018-11-23 13:12:14,818 INFO L728 BuchiCegarLoop]: Abstraction has 1374 states and 2297 transitions. [2018-11-23 13:12:14,818 INFO L608 BuchiCegarLoop]: Abstraction has 1374 states and 2297 transitions. [2018-11-23 13:12:14,818 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 13:12:14,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1374 states and 2297 transitions. [2018-11-23 13:12:14,823 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 113 [2018-11-23 13:12:14,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:14,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:14,824 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:14,824 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:12:14,824 INFO L794 eck$LassoCheckResult]: Stem: 15094#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 15080#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 15081#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 15082#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 15084#L35-3 assume !!(main_~q~0 <= main_~x~0); 15087#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 15143#partsENTRY ~p := #in~p;~q := #in~q; 16168#L20 assume ~p <= 0;#res := 1; 16167#partsFINAL assume true; 16086#partsEXIT >#67#return; 15129#L36-1 havoc main_#t~ret8; 15130#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 16102#L35-3 assume !!(main_~q~0 <= main_~x~0); 15131#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 15144#partsENTRY ~p := #in~p;~q := #in~q; 16332#L20 assume !(~p <= 0); 16331#L21 assume !(~q <= 0); 16330#L22 assume !(~q > ~p); 15106#L23 call #t~ret1 := parts(~p - ~q, ~q);< 16326#partsENTRY ~p := #in~p;~q := #in~q; 16392#L20 assume !(~p <= 0); 16391#L21 assume !(~q <= 0); 16384#L22 assume !(~q > ~p); 16321#L23 call #t~ret1 := parts(~p - ~q, ~q);< 16325#partsENTRY [2018-11-23 13:12:14,824 INFO L796 eck$LassoCheckResult]: Loop: 16325#partsENTRY ~p := #in~p;~q := #in~q; 16323#L20 assume !(~p <= 0); 16322#L21 assume !(~q <= 0); 16320#L22 assume !(~q > ~p); 15116#L23 call #t~ret1 := parts(~p - ~q, ~q);< 16325#partsENTRY [2018-11-23 13:12:14,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:14,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1614470804, now seen corresponding path program 1 times [2018-11-23 13:12:14,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:14,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:14,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:14,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:14,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:14,853 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 13:12:14,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:14,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:12:14,853 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:12:14,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:14,853 INFO L82 PathProgramCache]: Analyzing trace with hash 28756499, now seen corresponding path program 2 times [2018-11-23 13:12:14,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:14,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:14,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:14,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:14,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:14,909 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:14,909 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:14,909 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:14,910 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:14,910 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:12:14,910 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:14,910 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:14,910 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:14,910 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration12_Loop [2018-11-23 13:12:14,910 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:14,910 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:14,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:14,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:14,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:14,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:14,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:14,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:14,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:14,949 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:14,949 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:14,961 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:14,961 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:14,963 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:14,963 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/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 [2018-11-23 13:12:14,988 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:14,988 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:14,991 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:14,991 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/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 [2018-11-23 13:12:15,008 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:15,008 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:15,010 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:15,010 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/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 [2018-11-23 13:12:15,036 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:15,036 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:15,038 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:15,038 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:15,054 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:15,054 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:15,056 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:15,056 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:15,080 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:15,081 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:15,098 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:12:15,098 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:15,135 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:12:15,137 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:15,137 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:15,137 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:15,137 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:15,137 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:12:15,137 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:15,137 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:15,137 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:15,137 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration12_Loop [2018-11-23 13:12:15,137 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:15,137 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:15,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:15,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:15,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:15,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:15,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:15,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:15,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:15,182 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:15,182 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:12:15,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:15,183 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:15,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:15,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:15,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:15,183 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:15,184 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:15,184 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:15,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:15,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:15,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:15,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:15,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:15,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:15,185 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:15,185 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:15,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:15,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:15,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:15,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:15,186 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:15,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:15,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:15,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:15,187 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:15,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:15,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:15,192 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:15,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:15,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:15,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:15,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:15,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:15,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:15,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:15,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:15,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:15,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:15,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:15,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:15,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:15,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:15,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:15,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:15,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:15,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:15,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:15,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:15,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:15,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:15,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:15,200 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:15,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:15,201 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:12:15,202 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:12:15,203 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:12:15,203 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:12:15,203 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:12:15,203 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:12:15,203 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~p) = 1*parts_#in~p Supporting invariants [] [2018-11-23 13:12:15,203 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:12:15,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:15,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:15,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:15,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:15,365 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-23 13:12:15,365 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1374 states and 2297 transitions. cyclomatic complexity: 942 Second operand 6 states. [2018-11-23 13:12:15,527 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1374 states and 2297 transitions. cyclomatic complexity: 942. Second operand 6 states. Result 2066 states and 3628 transitions. Complement of second has 24 states. [2018-11-23 13:12:15,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:15,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2018-11-23 13:12:15,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 24 letters. Loop has 5 letters. [2018-11-23 13:12:15,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:15,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 29 letters. Loop has 5 letters. [2018-11-23 13:12:15,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:15,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 36 transitions. Stem has 24 letters. Loop has 10 letters. [2018-11-23 13:12:15,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:15,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2066 states and 3628 transitions. [2018-11-23 13:12:15,544 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 133 [2018-11-23 13:12:15,559 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2066 states to 1928 states and 3481 transitions. [2018-11-23 13:12:15,559 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 932 [2018-11-23 13:12:15,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 973 [2018-11-23 13:12:15,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1928 states and 3481 transitions. [2018-11-23 13:12:15,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:15,561 INFO L705 BuchiCegarLoop]: Abstraction has 1928 states and 3481 transitions. [2018-11-23 13:12:15,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states and 3481 transitions. [2018-11-23 13:12:15,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1871. [2018-11-23 13:12:15,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1871 states. [2018-11-23 13:12:15,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 3336 transitions. [2018-11-23 13:12:15,594 INFO L728 BuchiCegarLoop]: Abstraction has 1871 states and 3336 transitions. [2018-11-23 13:12:15,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:12:15,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:12:15,594 INFO L87 Difference]: Start difference. First operand 1871 states and 3336 transitions. Second operand 5 states. [2018-11-23 13:12:15,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:15,629 INFO L93 Difference]: Finished difference Result 1708 states and 3083 transitions. [2018-11-23 13:12:15,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:12:15,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1708 states and 3083 transitions. [2018-11-23 13:12:15,640 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 104 [2018-11-23 13:12:15,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1708 states to 1691 states and 3065 transitions. [2018-11-23 13:12:15,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 782 [2018-11-23 13:12:15,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 782 [2018-11-23 13:12:15,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1691 states and 3065 transitions. [2018-11-23 13:12:15,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:15,653 INFO L705 BuchiCegarLoop]: Abstraction has 1691 states and 3065 transitions. [2018-11-23 13:12:15,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states and 3065 transitions. [2018-11-23 13:12:15,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1682. [2018-11-23 13:12:15,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1682 states. [2018-11-23 13:12:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 3056 transitions. [2018-11-23 13:12:15,682 INFO L728 BuchiCegarLoop]: Abstraction has 1682 states and 3056 transitions. [2018-11-23 13:12:15,682 INFO L608 BuchiCegarLoop]: Abstraction has 1682 states and 3056 transitions. [2018-11-23 13:12:15,682 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-23 13:12:15,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1682 states and 3056 transitions. [2018-11-23 13:12:15,688 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 104 [2018-11-23 13:12:15,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:15,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:15,689 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-23 13:12:15,689 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:15,689 INFO L794 eck$LassoCheckResult]: Stem: 22256#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 22250#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 22251#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 22252#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 22253#L35-3 assume !!(main_~q~0 <= main_~x~0); 23062#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 23064#partsENTRY ~p := #in~p;~q := #in~q; 23096#L20 assume ~p <= 0;#res := 1; 23095#partsFINAL assume true; 23061#partsEXIT >#67#return; 23059#L36-1 havoc main_#t~ret8; 23057#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 23055#L35-3 assume !!(main_~q~0 <= main_~x~0); 23047#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 23051#partsENTRY ~p := #in~p;~q := #in~q; 23109#L20 assume ~p <= 0;#res := 1; 23107#partsFINAL assume true; 23046#partsEXIT >#67#return; 23045#L36-1 havoc main_#t~ret8; 22953#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 22952#L35-3 assume !(main_~q~0 <= main_~x~0); 22478#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 22475#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 22468#L35-3 assume !!(main_~q~0 <= main_~x~0); 22461#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 22463#partsENTRY ~p := #in~p;~q := #in~q; 22472#L20 assume ~p <= 0;#res := 1; 22466#partsFINAL assume true; 22460#partsEXIT >#67#return; 22456#L36-1 [2018-11-23 13:12:15,690 INFO L796 eck$LassoCheckResult]: Loop: 22456#L36-1 havoc main_#t~ret8; 22454#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 22451#L35-3 assume !!(main_~q~0 <= main_~x~0); 22284#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 22448#partsENTRY ~p := #in~p;~q := #in~q; 22446#L20 assume ~p <= 0;#res := 1; 22445#partsFINAL assume true; 22458#partsEXIT >#67#return; 22456#L36-1 [2018-11-23 13:12:15,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:15,690 INFO L82 PathProgramCache]: Analyzing trace with hash -947752702, now seen corresponding path program 6 times [2018-11-23 13:12:15,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:15,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:15,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:15,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:15,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 13:12:15,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:12:15,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:12:15,727 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:12:15,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:15,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1248496373, now seen corresponding path program 2 times [2018-11-23 13:12:15,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:15,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:15,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:15,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:15,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:15,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:15,765 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:15,765 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:15,765 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:15,765 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:15,766 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:12:15,766 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:15,766 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:15,766 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:15,766 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration13_Loop [2018-11-23 13:12:15,766 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:15,766 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:15,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:15,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:15,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:15,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:15,794 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:15,794 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:15,801 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:15,801 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:15,803 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:15,803 INFO L448 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/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:15,818 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:15,818 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:15,832 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:15,833 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~p~0=0} Honda state: {ULTIMATE.start_main_~p~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:15,835 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:15,835 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:15,851 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:12:15,851 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:16,079 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:12:16,080 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:16,080 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:16,080 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:16,080 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:16,080 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:12:16,080 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:16,080 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:16,081 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:16,081 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration13_Loop [2018-11-23 13:12:16,081 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:16,081 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:16,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:16,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:16,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:16,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:16,101 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:16,101 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:12:16,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:16,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:16,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:16,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:16,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:16,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:16,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:16,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:16,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:16,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:16,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:16,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:16,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:16,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:16,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:16,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:16,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:16,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:16,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:16,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:16,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:16,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:16,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:16,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:16,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:16,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:16,107 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:12:16,107 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:12:16,107 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:12:16,108 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:12:16,108 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:12:16,108 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:12:16,108 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0, ULTIMATE.start_main_~x~0) = -1*ULTIMATE.start_main_~q~0 + 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2018-11-23 13:12:16,108 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:12:16,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:16,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:16,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:16,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:16,172 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-23 13:12:16,172 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1682 states and 3056 transitions. cyclomatic complexity: 1401 Second operand 7 states. [2018-11-23 13:12:16,210 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1682 states and 3056 transitions. cyclomatic complexity: 1401. Second operand 7 states. Result 1701 states and 3077 transitions. Complement of second has 10 states. [2018-11-23 13:12:16,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:16,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-23 13:12:16,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 29 letters. Loop has 8 letters. [2018-11-23 13:12:16,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:16,212 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:12:16,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:16,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:16,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:16,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:16,301 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-23 13:12:16,301 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1682 states and 3056 transitions. cyclomatic complexity: 1401 Second operand 7 states. [2018-11-23 13:12:16,360 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1682 states and 3056 transitions. cyclomatic complexity: 1401. Second operand 7 states. Result 1699 states and 3074 transitions. Complement of second has 12 states. [2018-11-23 13:12:16,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:16,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-11-23 13:12:16,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 29 letters. Loop has 8 letters. [2018-11-23 13:12:16,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:16,361 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:12:16,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:16,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:16,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:16,494 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-23 13:12:16,494 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1682 states and 3056 transitions. cyclomatic complexity: 1401 Second operand 7 states. [2018-11-23 13:12:16,631 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1682 states and 3056 transitions. cyclomatic complexity: 1401. Second operand 7 states. Result 3254 states and 5990 transitions. Complement of second has 13 states. [2018-11-23 13:12:16,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:16,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 52 transitions. [2018-11-23 13:12:16,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 29 letters. Loop has 8 letters. [2018-11-23 13:12:16,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:16,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 37 letters. Loop has 8 letters. [2018-11-23 13:12:16,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:16,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 52 transitions. Stem has 29 letters. Loop has 16 letters. [2018-11-23 13:12:16,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:16,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3254 states and 5990 transitions. [2018-11-23 13:12:16,661 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 56 [2018-11-23 13:12:16,687 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3254 states to 2438 states and 4177 transitions. [2018-11-23 13:12:16,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 413 [2018-11-23 13:12:16,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 431 [2018-11-23 13:12:16,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2438 states and 4177 transitions. [2018-11-23 13:12:16,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:16,689 INFO L705 BuchiCegarLoop]: Abstraction has 2438 states and 4177 transitions. [2018-11-23 13:12:16,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2438 states and 4177 transitions. [2018-11-23 13:12:16,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2438 to 2291. [2018-11-23 13:12:16,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2018-11-23 13:12:16,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3994 transitions. [2018-11-23 13:12:16,748 INFO L728 BuchiCegarLoop]: Abstraction has 2291 states and 3994 transitions. [2018-11-23 13:12:16,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:12:16,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:12:16,748 INFO L87 Difference]: Start difference. First operand 2291 states and 3994 transitions. Second operand 6 states. [2018-11-23 13:12:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:16,821 INFO L93 Difference]: Finished difference Result 1035 states and 1603 transitions. [2018-11-23 13:12:16,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:12:16,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1035 states and 1603 transitions. [2018-11-23 13:12:16,828 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2018-11-23 13:12:16,831 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1035 states to 481 states and 717 transitions. [2018-11-23 13:12:16,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 201 [2018-11-23 13:12:16,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 210 [2018-11-23 13:12:16,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 481 states and 717 transitions. [2018-11-23 13:12:16,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:16,832 INFO L705 BuchiCegarLoop]: Abstraction has 481 states and 717 transitions. [2018-11-23 13:12:16,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states and 717 transitions. [2018-11-23 13:12:16,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 458. [2018-11-23 13:12:16,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-11-23 13:12:16,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 692 transitions. [2018-11-23 13:12:16,842 INFO L728 BuchiCegarLoop]: Abstraction has 458 states and 692 transitions. [2018-11-23 13:12:16,842 INFO L608 BuchiCegarLoop]: Abstraction has 458 states and 692 transitions. [2018-11-23 13:12:16,842 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-23 13:12:16,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 458 states and 692 transitions. [2018-11-23 13:12:16,844 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 53 [2018-11-23 13:12:16,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:16,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:16,844 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:16,844 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:16,845 INFO L794 eck$LassoCheckResult]: Stem: 34324#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 34314#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 34315#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 34316#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 34317#L35-3 assume !!(main_~q~0 <= main_~x~0); 34426#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 34428#partsENTRY ~p := #in~p;~q := #in~q; 34431#L20 assume ~p <= 0;#res := 1; 34429#partsFINAL assume true; 34425#partsEXIT >#67#return; 34424#L36-1 havoc main_#t~ret8; 34423#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 34422#L35-3 assume !!(main_~q~0 <= main_~x~0); 34392#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 34406#partsENTRY ~p := #in~p;~q := #in~q; 34403#L20 assume ~p <= 0;#res := 1; 34404#partsFINAL assume true; 34391#partsEXIT >#67#return; 34388#L36-1 havoc main_#t~ret8; 34389#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 34318#L35-3 assume !(main_~q~0 <= main_~x~0); 34319#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 34395#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 34390#L35-3 assume !!(main_~q~0 <= main_~x~0); 34383#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 34384#partsENTRY ~p := #in~p;~q := #in~q; 34462#L20 assume !(~p <= 0); 34461#L21 assume ~q <= 0;#res := 0; 34460#partsFINAL assume true; 34401#partsEXIT >#67#return; 34402#L36-1 havoc main_#t~ret8; 34455#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 34454#L35-3 assume !!(main_~q~0 <= main_~x~0); 34360#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 34452#partsENTRY ~p := #in~p;~q := #in~q; 34451#L20 assume !(~p <= 0); 34450#L21 assume !(~q <= 0); 34449#L22 assume !(~q > ~p); 34299#L23 call #t~ret1 := parts(~p - ~q, ~q);< 34446#partsENTRY ~p := #in~p;~q := #in~q; 34447#L20 assume ~p <= 0;#res := 1; 34709#partsFINAL assume true; 34708#partsEXIT >#63#return; 34353#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 34553#partsENTRY [2018-11-23 13:12:16,845 INFO L796 eck$LassoCheckResult]: Loop: 34553#partsENTRY ~p := #in~p;~q := #in~q; 34703#L20 assume !(~p <= 0); 34699#L21 assume !(~q <= 0); 34574#L22 assume !(~q > ~p); 34355#L23 call #t~ret1 := parts(~p - ~q, ~q);< 34441#partsENTRY ~p := #in~p;~q := #in~q; 34692#L20 assume ~p <= 0;#res := 1; 34636#partsFINAL assume true; 34570#partsEXIT >#63#return; 34356#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 34553#partsENTRY [2018-11-23 13:12:16,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:16,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1638349208, now seen corresponding path program 1 times [2018-11-23 13:12:16,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:16,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:16,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:16,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:16,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:16,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:16,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1936011869, now seen corresponding path program 1 times [2018-11-23 13:12:16,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:16,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:16,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:16,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:16,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:16,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:16,861 INFO L82 PathProgramCache]: Analyzing trace with hash -285304012, now seen corresponding path program 2 times [2018-11-23 13:12:16,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:16,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:16,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:16,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:16,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:16,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:16,895 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 36 proven. 8 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-11-23 13:12:16,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:16,896 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:16,905 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:12:16,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:12:16,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:16,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:16,930 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 56 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-23 13:12:16,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:16,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 13:12:17,099 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:17,099 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:17,099 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:17,099 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:17,099 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:12:17,099 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:17,099 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:17,099 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:17,099 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration14_Loop [2018-11-23 13:12:17,099 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:17,099 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:17,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:17,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:17,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:17,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:17,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:17,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:17,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:17,132 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:17,132 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/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 [2018-11-23 13:12:17,135 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:17,135 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:17,140 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:17,140 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:17,155 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:17,155 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:17,157 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:17,157 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/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 [2018-11-23 13:12:17,172 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:17,172 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:17,176 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:17,176 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/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 [2018-11-23 13:12:17,191 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:17,191 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:17,193 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:17,193 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/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 [2018-11-23 13:12:17,208 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:17,208 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:17,210 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:17,210 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:17,229 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:17,229 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:17,246 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:12:17,246 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:17,263 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:12:17,265 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:17,265 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:17,265 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:17,266 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:17,266 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:12:17,266 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:17,266 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:17,266 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:17,266 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration14_Loop [2018-11-23 13:12:17,266 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:17,266 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:17,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:17,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:17,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:17,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:17,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:17,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:17,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:17,299 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:17,299 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:12:17,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:17,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:17,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:17,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:17,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:17,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:17,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:17,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:17,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:17,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:17,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:17,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:17,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:17,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:17,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:17,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:17,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:17,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:17,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:17,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:17,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:17,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:17,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:17,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:17,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:17,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:17,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:17,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:17,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:17,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:17,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:17,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:17,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:17,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:17,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:17,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:17,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:17,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:17,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:17,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:17,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:17,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:17,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:17,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:17,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:17,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:17,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:17,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:17,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:17,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:17,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:17,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:17,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:17,310 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:12:17,311 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:12:17,311 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:12:17,311 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:12:17,311 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:12:17,312 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:12:17,312 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2018-11-23 13:12:17,312 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:12:17,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:17,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:17,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:17,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:17,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:17,416 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-23 13:12:17,416 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 458 states and 692 transitions. cyclomatic complexity: 244 Second operand 6 states. [2018-11-23 13:12:17,541 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 458 states and 692 transitions. cyclomatic complexity: 244. Second operand 6 states. Result 1300 states and 2150 transitions. Complement of second has 35 states. [2018-11-23 13:12:17,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:12:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 67 transitions. [2018-11-23 13:12:17,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 44 letters. Loop has 10 letters. [2018-11-23 13:12:17,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:17,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 54 letters. Loop has 10 letters. [2018-11-23 13:12:17,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:17,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 67 transitions. Stem has 44 letters. Loop has 20 letters. [2018-11-23 13:12:17,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:17,543 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1300 states and 2150 transitions. [2018-11-23 13:12:17,551 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 81 [2018-11-23 13:12:17,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1300 states to 997 states and 1633 transitions. [2018-11-23 13:12:17,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 345 [2018-11-23 13:12:17,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 351 [2018-11-23 13:12:17,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 997 states and 1633 transitions. [2018-11-23 13:12:17,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:17,559 INFO L705 BuchiCegarLoop]: Abstraction has 997 states and 1633 transitions. [2018-11-23 13:12:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states and 1633 transitions. [2018-11-23 13:12:17,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 932. [2018-11-23 13:12:17,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2018-11-23 13:12:17,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1462 transitions. [2018-11-23 13:12:17,574 INFO L728 BuchiCegarLoop]: Abstraction has 932 states and 1462 transitions. [2018-11-23 13:12:17,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:12:17,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:12:17,575 INFO L87 Difference]: Start difference. First operand 932 states and 1462 transitions. Second operand 8 states. [2018-11-23 13:12:17,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:17,658 INFO L93 Difference]: Finished difference Result 1213 states and 1828 transitions. [2018-11-23 13:12:17,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:12:17,660 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1213 states and 1828 transitions. [2018-11-23 13:12:17,667 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 97 [2018-11-23 13:12:17,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1213 states to 1118 states and 1708 transitions. [2018-11-23 13:12:17,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 351 [2018-11-23 13:12:17,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 351 [2018-11-23 13:12:17,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1118 states and 1708 transitions. [2018-11-23 13:12:17,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:17,677 INFO L705 BuchiCegarLoop]: Abstraction has 1118 states and 1708 transitions. [2018-11-23 13:12:17,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states and 1708 transitions. [2018-11-23 13:12:17,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1066. [2018-11-23 13:12:17,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2018-11-23 13:12:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1644 transitions. [2018-11-23 13:12:17,703 INFO L728 BuchiCegarLoop]: Abstraction has 1066 states and 1644 transitions. [2018-11-23 13:12:17,704 INFO L608 BuchiCegarLoop]: Abstraction has 1066 states and 1644 transitions. [2018-11-23 13:12:17,704 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-23 13:12:17,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1066 states and 1644 transitions. [2018-11-23 13:12:17,708 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 89 [2018-11-23 13:12:17,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:17,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:17,709 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:17,709 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:12:17,709 INFO L794 eck$LassoCheckResult]: Stem: 38617#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 38613#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 38614#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 38615#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 38616#L35-3 assume !!(main_~q~0 <= main_~x~0); 38605#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 38663#partsENTRY ~p := #in~p;~q := #in~q; 39666#L20 assume ~p <= 0;#res := 1; 39665#partsFINAL assume true; 38604#partsEXIT >#67#return; 38606#L36-1 havoc main_#t~ret8; 38635#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 38636#L35-3 assume !!(main_~q~0 <= main_~x~0); 38624#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 38726#partsENTRY ~p := #in~p;~q := #in~q; 38688#L20 assume ~p <= 0;#res := 1; 38687#partsFINAL assume true; 38683#partsEXIT >#67#return; 38671#L36-1 havoc main_#t~ret8; 38672#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 38669#L35-3 assume !(main_~q~0 <= main_~x~0); 38670#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 38673#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 38674#L35-3 assume !!(main_~q~0 <= main_~x~0); 38661#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 38662#partsENTRY ~p := #in~p;~q := #in~q; 38682#L20 assume !(~p <= 0); 38678#L21 assume ~q <= 0;#res := 0; 38679#partsFINAL assume true; 38675#partsEXIT >#67#return; 38648#L36-1 havoc main_#t~ret8; 38649#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 38862#L35-3 assume !!(main_~q~0 <= main_~x~0); 38855#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 38856#partsENTRY ~p := #in~p;~q := #in~q; 39539#L20 assume !(~p <= 0); 39537#L21 assume !(~q <= 0); 39536#L22 assume ~q > ~p; 38703#L22-1 call #t~ret0 := parts(~p, ~p);< 38729#partsENTRY ~p := #in~p;~q := #in~q; 38988#L20 assume !(~p <= 0); 38986#L21 assume !(~q <= 0); 38984#L22 assume !(~q > ~p); 38820#L23 call #t~ret1 := parts(~p - ~q, ~q);< 38824#partsENTRY ~p := #in~p;~q := #in~q; 39283#L20 assume ~p <= 0;#res := 1; 39282#partsFINAL assume true; 38819#partsEXIT >#63#return; 38736#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 38755#partsENTRY ~p := #in~p;~q := #in~q; 39126#L20 assume !(~p <= 0); 39125#L21 assume !(~q <= 0); 38765#L22 assume !(~q > ~p); 39554#L23 [2018-11-23 13:12:17,709 INFO L796 eck$LassoCheckResult]: Loop: 39554#L23 call #t~ret1 := parts(~p - ~q, ~q);< 39564#partsENTRY ~p := #in~p;~q := #in~q; 39559#L20 assume !(~p <= 0); 39560#L21 assume !(~q <= 0); 39553#L22 assume !(~q > ~p); 39554#L23 [2018-11-23 13:12:17,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:17,710 INFO L82 PathProgramCache]: Analyzing trace with hash 799804287, now seen corresponding path program 1 times [2018-11-23 13:12:17,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:17,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:17,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:17,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:17,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:17,772 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-11-23 13:12:17,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:17,772 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:17,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:17,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:17,854 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 57 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-11-23 13:12:17,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:17,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 13:12:17,868 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:12:17,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:17,869 INFO L82 PathProgramCache]: Analyzing trace with hash 85891559, now seen corresponding path program 3 times [2018-11-23 13:12:17,869 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:17,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:17,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:17,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:17,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:17,912 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:17,912 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:17,912 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:17,912 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:17,912 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:12:17,912 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:17,912 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:17,912 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:17,912 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration15_Loop [2018-11-23 13:12:17,912 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:17,912 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:17,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:17,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:17,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:17,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:17,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:17,945 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:17,945 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:17,948 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:17,948 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:17,950 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:17,950 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:17,965 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:17,965 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:17,967 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:17,967 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:17,982 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:17,982 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:18,001 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:12:18,002 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:30,025 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-23 13:12:30,027 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:30,027 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:30,027 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:30,027 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:30,028 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:12:30,028 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:30,028 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:30,028 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:30,028 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration15_Loop [2018-11-23 13:12:30,028 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:30,028 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:30,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:30,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:30,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:30,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:30,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:30,067 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:30,067 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:12:30,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:30,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:30,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:30,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:30,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:30,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:30,069 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:30,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:30,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:30,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:30,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:30,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:30,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:30,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:30,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:30,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:30,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:30,073 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:12:30,076 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:12:30,076 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 13:12:30,077 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:12:30,077 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:12:30,077 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:12:30,077 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2018-11-23 13:12:30,077 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:12:30,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:30,135 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:30,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:30,182 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:12:30,182 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1066 states and 1644 transitions. cyclomatic complexity: 601 Second operand 7 states. [2018-11-23 13:12:30,244 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1066 states and 1644 transitions. cyclomatic complexity: 601. Second operand 7 states. Result 1199 states and 1839 transitions. Complement of second has 28 states. [2018-11-23 13:12:30,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:30,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:30,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2018-11-23 13:12:30,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 53 letters. Loop has 5 letters. [2018-11-23 13:12:30,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:30,246 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:12:30,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:30,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:30,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:30,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:30,328 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:12:30,328 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1066 states and 1644 transitions. cyclomatic complexity: 601 Second operand 7 states. [2018-11-23 13:12:30,403 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1066 states and 1644 transitions. cyclomatic complexity: 601. Second operand 7 states. Result 1163 states and 1755 transitions. Complement of second has 21 states. [2018-11-23 13:12:30,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:30,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:30,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2018-11-23 13:12:30,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 29 transitions. Stem has 53 letters. Loop has 5 letters. [2018-11-23 13:12:30,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:30,404 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:12:30,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:30,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:30,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:30,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:30,518 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:12:30,518 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1066 states and 1644 transitions. cyclomatic complexity: 601 Second operand 7 states. [2018-11-23 13:12:30,653 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1066 states and 1644 transitions. cyclomatic complexity: 601. Second operand 7 states. Result 1692 states and 2684 transitions. Complement of second has 40 states. [2018-11-23 13:12:30,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:30,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:30,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-23 13:12:30,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 53 letters. Loop has 5 letters. [2018-11-23 13:12:30,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:30,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 58 letters. Loop has 5 letters. [2018-11-23 13:12:30,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:30,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 53 letters. Loop has 10 letters. [2018-11-23 13:12:30,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:30,655 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1692 states and 2684 transitions. [2018-11-23 13:12:30,669 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 106 [2018-11-23 13:12:30,685 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1692 states to 1294 states and 2201 transitions. [2018-11-23 13:12:30,686 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 321 [2018-11-23 13:12:30,686 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 364 [2018-11-23 13:12:30,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1294 states and 2201 transitions. [2018-11-23 13:12:30,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:30,686 INFO L705 BuchiCegarLoop]: Abstraction has 1294 states and 2201 transitions. [2018-11-23 13:12:30,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states and 2201 transitions. [2018-11-23 13:12:30,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1169. [2018-11-23 13:12:30,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1169 states. [2018-11-23 13:12:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1833 transitions. [2018-11-23 13:12:30,716 INFO L728 BuchiCegarLoop]: Abstraction has 1169 states and 1833 transitions. [2018-11-23 13:12:30,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:12:30,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:12:30,717 INFO L87 Difference]: Start difference. First operand 1169 states and 1833 transitions. Second operand 8 states. [2018-11-23 13:12:30,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:30,815 INFO L93 Difference]: Finished difference Result 1192 states and 1848 transitions. [2018-11-23 13:12:30,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:12:30,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1192 states and 1848 transitions. [2018-11-23 13:12:30,822 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 89 [2018-11-23 13:12:30,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1192 states to 1166 states and 1820 transitions. [2018-11-23 13:12:30,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2018-11-23 13:12:30,833 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 342 [2018-11-23 13:12:30,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1166 states and 1820 transitions. [2018-11-23 13:12:30,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:30,833 INFO L705 BuchiCegarLoop]: Abstraction has 1166 states and 1820 transitions. [2018-11-23 13:12:30,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states and 1820 transitions. [2018-11-23 13:12:30,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 1115. [2018-11-23 13:12:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2018-11-23 13:12:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1758 transitions. [2018-11-23 13:12:30,857 INFO L728 BuchiCegarLoop]: Abstraction has 1115 states and 1758 transitions. [2018-11-23 13:12:30,857 INFO L608 BuchiCegarLoop]: Abstraction has 1115 states and 1758 transitions. [2018-11-23 13:12:30,857 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-23 13:12:30,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1115 states and 1758 transitions. [2018-11-23 13:12:30,861 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 83 [2018-11-23 13:12:30,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:30,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:30,862 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [12, 11, 8, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2018-11-23 13:12:30,862 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:30,862 INFO L794 eck$LassoCheckResult]: Stem: 46931#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 46927#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 46928#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 46929#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 46930#L35-3 assume !!(main_~q~0 <= main_~x~0); 46915#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 46986#partsENTRY ~p := #in~p;~q := #in~q; 48025#L20 assume ~p <= 0;#res := 1; 48024#partsFINAL assume true; 46914#partsEXIT >#67#return; 46916#L36-1 havoc main_#t~ret8; 46971#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 47058#L35-3 assume !!(main_~q~0 <= main_~x~0); 46942#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 47035#partsENTRY ~p := #in~p;~q := #in~q; 47006#L20 assume ~p <= 0;#res := 1; 47005#partsFINAL assume true; 47001#partsEXIT >#67#return; 46992#L36-1 havoc main_#t~ret8; 46947#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 46948#L35-3 assume !(main_~q~0 <= main_~x~0); 46936#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 46937#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 46932#L35-3 assume !!(main_~q~0 <= main_~x~0); 46933#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 47000#partsENTRY ~p := #in~p;~q := #in~q; 46999#L20 assume !(~p <= 0); 46998#L21 assume ~q <= 0;#res := 0; 46996#partsFINAL assume true; 46997#partsEXIT >#67#return; 47444#L36-1 havoc main_#t~ret8; 47431#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 47428#L35-3 assume !!(main_~q~0 <= main_~x~0); 47423#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 47425#partsENTRY ~p := #in~p;~q := #in~q; 47490#L20 assume !(~p <= 0); 47485#L21 assume ~q <= 0;#res := 0; 47486#partsFINAL assume true; 47905#partsEXIT >#67#return; 47871#L36-1 havoc main_#t~ret8; 47176#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 47175#L35-3 assume !!(main_~q~0 <= main_~x~0); 47160#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 47173#partsENTRY ~p := #in~p;~q := #in~q; 47171#L20 assume !(~p <= 0); 47169#L21 assume !(~q <= 0); 47168#L22 assume !(~q > ~p); 47037#L23 call #t~ret1 := parts(~p - ~q, ~q);< 47164#partsENTRY ~p := #in~p;~q := #in~q; 47266#L20 assume !(~p <= 0); 47265#L21 assume !(~q <= 0); 47263#L22 assume !(~q > ~p); 47264#L23 call #t~ret1 := parts(~p - ~q, ~q);< 47336#partsENTRY ~p := #in~p;~q := #in~q; 47341#L20 assume ~p <= 0;#res := 1; 47340#partsFINAL assume true; 47335#partsEXIT >#63#return; 46918#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 47077#partsENTRY ~p := #in~p;~q := #in~q; 47306#L20 assume !(~p <= 0); 47304#L21 assume !(~q <= 0); 47303#L22 assume !(~q > ~p); 47044#L23 call #t~ret1 := parts(~p - ~q, ~q);< 47118#partsENTRY ~p := #in~p;~q := #in~q; 47106#L20 assume !(~p <= 0); 47107#L21 assume !(~q <= 0); 47253#L22 assume !(~q > ~p); 47082#L23 call #t~ret1 := parts(~p - ~q, ~q);< 47083#partsENTRY ~p := #in~p;~q := #in~q; 47091#L20 assume ~p <= 0;#res := 1; 47089#partsFINAL assume true; 47081#partsEXIT >#63#return; 46920#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 47078#partsENTRY ~p := #in~p;~q := #in~q; 47417#L20 assume !(~p <= 0); 47769#L21 assume ~q <= 0;#res := 0; 47768#partsFINAL assume true; 47765#partsEXIT >#65#return; 47760#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 47764#partsFINAL assume true; 47762#partsEXIT >#63#return; 47756#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 47761#partsENTRY ~p := #in~p;~q := #in~q; 47767#L20 assume !(~p <= 0); 47763#L21 assume ~q <= 0;#res := 0; 47145#partsFINAL assume true; 47759#partsEXIT >#65#return; 47758#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 47757#partsFINAL assume true; 47755#partsEXIT >#65#return; 47754#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 47766#partsFINAL assume true; 47117#partsEXIT >#63#return; 47065#L23-1 [2018-11-23 13:12:30,863 INFO L796 eck$LassoCheckResult]: Loop: 47065#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 47111#partsENTRY ~p := #in~p;~q := #in~q; 47157#L20 assume !(~p <= 0); 47144#L21 assume !(~q <= 0); 47142#L22 assume !(~q > ~p); 47042#L23 call #t~ret1 := parts(~p - ~q, ~q);< 47121#partsENTRY ~p := #in~p;~q := #in~q; 47198#L20 assume ~p <= 0;#res := 1; 47194#partsFINAL assume true; 47162#partsEXIT >#63#return; 47065#L23-1 [2018-11-23 13:12:30,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:30,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2070940106, now seen corresponding path program 1 times [2018-11-23 13:12:30,863 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:30,863 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:30,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:30,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:30,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 51 proven. 51 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-11-23 13:12:30,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:30,934 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:30,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:30,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-11-23 13:12:31,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:12:31,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-11-23 13:12:31,001 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:12:31,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:31,001 INFO L82 PathProgramCache]: Analyzing trace with hash 155525029, now seen corresponding path program 2 times [2018-11-23 13:12:31,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:31,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:31,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:31,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:31,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:31,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:31,190 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:31,190 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:31,190 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:31,190 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:31,190 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:12:31,190 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:31,190 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:31,190 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:31,190 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration16_Loop [2018-11-23 13:12:31,190 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:31,190 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:31,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:31,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:31,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:31,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:31,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:31,279 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:31,279 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:31,283 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:31,283 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:31,286 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:31,286 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:31,312 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:31,313 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:31,344 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:12:31,344 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:35,277 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:12:35,279 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:35,280 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:35,280 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:35,280 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:35,280 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:12:35,280 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:35,280 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:35,280 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:35,280 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration16_Loop [2018-11-23 13:12:35,280 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:35,280 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:35,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:35,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:35,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:35,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:35,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:35,336 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:35,336 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:12:35,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:35,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:35,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:35,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:35,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:35,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:35,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:35,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:35,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:35,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:35,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:35,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:35,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:35,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:35,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:35,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:35,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:35,341 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:12:35,343 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:12:35,343 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:12:35,343 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:12:35,343 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:12:35,344 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:12:35,344 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2018-11-23 13:12:35,344 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:12:35,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:35,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:35,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:35,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:35,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:35,520 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:12:35,520 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1115 states and 1758 transitions. cyclomatic complexity: 664 Second operand 7 states. [2018-11-23 13:12:35,611 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1115 states and 1758 transitions. cyclomatic complexity: 664. Second operand 7 states. Result 2892 states and 4726 transitions. Complement of second has 28 states. [2018-11-23 13:12:35,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 55 transitions. [2018-11-23 13:12:35,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 55 transitions. Stem has 93 letters. Loop has 10 letters. [2018-11-23 13:12:35,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:35,613 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:12:35,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:35,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:35,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:35,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:35,729 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:12:35,729 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1115 states and 1758 transitions. cyclomatic complexity: 664 Second operand 7 states. [2018-11-23 13:12:35,848 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1115 states and 1758 transitions. cyclomatic complexity: 664. Second operand 7 states. Result 1729 states and 2554 transitions. Complement of second has 32 states. [2018-11-23 13:12:35,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:35,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:35,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2018-11-23 13:12:35,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 59 transitions. Stem has 93 letters. Loop has 10 letters. [2018-11-23 13:12:35,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:35,849 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:12:35,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:35,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:35,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:35,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:35,985 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:12:35,985 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1115 states and 1758 transitions. cyclomatic complexity: 664 Second operand 7 states. [2018-11-23 13:12:36,097 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1115 states and 1758 transitions. cyclomatic complexity: 664. Second operand 7 states. Result 4900 states and 7136 transitions. Complement of second has 110 states. [2018-11-23 13:12:36,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:36,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:36,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2018-11-23 13:12:36,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 93 letters. Loop has 10 letters. [2018-11-23 13:12:36,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:36,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 103 letters. Loop has 10 letters. [2018-11-23 13:12:36,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:36,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 93 letters. Loop has 20 letters. [2018-11-23 13:12:36,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:36,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4900 states and 7136 transitions. [2018-11-23 13:12:36,122 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 137 [2018-11-23 13:12:36,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4900 states to 2322 states and 3517 transitions. [2018-11-23 13:12:36,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 600 [2018-11-23 13:12:36,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 631 [2018-11-23 13:12:36,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2322 states and 3517 transitions. [2018-11-23 13:12:36,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:36,139 INFO L705 BuchiCegarLoop]: Abstraction has 2322 states and 3517 transitions. [2018-11-23 13:12:36,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2322 states and 3517 transitions. [2018-11-23 13:12:36,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2322 to 1821. [2018-11-23 13:12:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1821 states. [2018-11-23 13:12:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2651 transitions. [2018-11-23 13:12:36,180 INFO L728 BuchiCegarLoop]: Abstraction has 1821 states and 2651 transitions. [2018-11-23 13:12:36,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:12:36,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:12:36,181 INFO L87 Difference]: Start difference. First operand 1821 states and 2651 transitions. Second operand 6 states. [2018-11-23 13:12:36,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:36,249 INFO L93 Difference]: Finished difference Result 1000 states and 1393 transitions. [2018-11-23 13:12:36,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:12:36,251 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1000 states and 1393 transitions. [2018-11-23 13:12:36,256 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 86 [2018-11-23 13:12:36,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1000 states to 969 states and 1347 transitions. [2018-11-23 13:12:36,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 310 [2018-11-23 13:12:36,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 310 [2018-11-23 13:12:36,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 969 states and 1347 transitions. [2018-11-23 13:12:36,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:36,264 INFO L705 BuchiCegarLoop]: Abstraction has 969 states and 1347 transitions. [2018-11-23 13:12:36,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states and 1347 transitions. [2018-11-23 13:12:36,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 951. [2018-11-23 13:12:36,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-11-23 13:12:36,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1313 transitions. [2018-11-23 13:12:36,279 INFO L728 BuchiCegarLoop]: Abstraction has 951 states and 1313 transitions. [2018-11-23 13:12:36,279 INFO L608 BuchiCegarLoop]: Abstraction has 951 states and 1313 transitions. [2018-11-23 13:12:36,279 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-23 13:12:36,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 951 states and 1313 transitions. [2018-11-23 13:12:36,282 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 86 [2018-11-23 13:12:36,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:36,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:36,283 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 7, 7, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:36,283 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:36,283 INFO L794 eck$LassoCheckResult]: Stem: 61823#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 61815#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 61816#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 61817#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 61818#L35-3 assume !!(main_~q~0 <= main_~x~0); 61938#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 61939#partsENTRY ~p := #in~p;~q := #in~q; 61943#L20 assume ~p <= 0;#res := 1; 61941#partsFINAL assume true; 61937#partsEXIT >#67#return; 61926#L36-1 havoc main_#t~ret8; 61922#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 61921#L35-3 assume !!(main_~q~0 <= main_~x~0); 61906#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 61912#partsENTRY ~p := #in~p;~q := #in~q; 61909#L20 assume ~p <= 0;#res := 1; 61905#partsFINAL assume true; 61907#partsEXIT >#67#return; 61894#L36-1 havoc main_#t~ret8; 61837#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 61819#L35-3 assume !(main_~q~0 <= main_~x~0); 61820#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 61824#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 61895#L35-3 assume !!(main_~q~0 <= main_~x~0); 61890#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 61891#partsENTRY ~p := #in~p;~q := #in~q; 61994#L20 assume !(~p <= 0); 61927#L21 assume ~q <= 0;#res := 0; 61908#partsFINAL assume true; 61904#partsEXIT >#67#return; 61880#L36-1 havoc main_#t~ret8; 61881#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 61992#L35-3 assume !!(main_~q~0 <= main_~x~0); 61993#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 62086#partsENTRY ~p := #in~p;~q := #in~q; 62133#L20 assume !(~p <= 0); 62132#L21 assume !(~q <= 0); 62131#L22 assume !(~q > ~p); 62126#L23 call #t~ret1 := parts(~p - ~q, ~q);< 62128#partsENTRY ~p := #in~p;~q := #in~q; 62152#L20 assume ~p <= 0;#res := 1; 62150#partsFINAL assume true; 62149#partsEXIT >#63#return; 62139#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 62142#partsENTRY ~p := #in~p;~q := #in~q; 62153#L20 assume !(~p <= 0); 62151#L21 assume ~q <= 0;#res := 0; 62148#partsFINAL assume true; 62138#partsEXIT >#65#return; 62141#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 62266#partsFINAL assume true; 62260#partsEXIT >#67#return; 61882#L36-1 havoc main_#t~ret8; 61883#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 61925#L35-3 assume !!(main_~q~0 <= main_~x~0); 61897#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 62074#partsENTRY ~p := #in~p;~q := #in~q; 61956#L20 assume !(~p <= 0); 61957#L21 assume !(~q <= 0); 61923#L22 assume !(~q > ~p); 61924#L23 call #t~ret1 := parts(~p - ~q, ~q);< 61934#partsENTRY ~p := #in~p;~q := #in~q; 62579#L20 assume ~p <= 0;#res := 1; 62578#partsFINAL assume true; 62556#partsEXIT >#63#return; 61872#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 62553#partsENTRY ~p := #in~p;~q := #in~q; 62546#L20 assume !(~p <= 0); 62545#L21 assume !(~q <= 0); 62540#L22 assume !(~q > ~p); 62541#L23 call #t~ret1 := parts(~p - ~q, ~q);< 62585#partsENTRY ~p := #in~p;~q := #in~q; 62668#L20 assume !(~p <= 0); 62665#L21 assume !(~q <= 0); 62660#L22 assume ~q > ~p; 61808#L22-1 call #t~ret0 := parts(~p, ~p);< 61863#partsENTRY ~p := #in~p;~q := #in~q; 62528#L20 assume !(~p <= 0); 62527#L21 [2018-11-23 13:12:36,283 INFO L796 eck$LassoCheckResult]: Loop: 62527#L21 assume !(~q <= 0); 61853#L22 assume !(~q > ~p); 61805#L23 call #t~ret1 := parts(~p - ~q, ~q);< 61812#partsENTRY ~p := #in~p;~q := #in~q; 61884#L20 assume ~p <= 0;#res := 1; 61885#partsFINAL assume true; 62741#partsEXIT >#63#return; 61846#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 62634#partsENTRY ~p := #in~p;~q := #in~q; 62705#L20 assume !(~p <= 0); 62704#L21 assume !(~q <= 0); 62702#L22 assume !(~q > ~p); 61830#L23 call #t~ret1 := parts(~p - ~q, ~q);< 61814#partsENTRY ~p := #in~p;~q := #in~q; 61831#L20 assume !(~p <= 0); 61861#L21 assume !(~q <= 0); 61862#L22 assume ~q > ~p; 61810#L22-1 call #t~ret0 := parts(~p, ~p);< 62529#partsENTRY ~p := #in~p;~q := #in~q; 62530#L20 assume !(~p <= 0); 62527#L21 [2018-11-23 13:12:36,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:36,283 INFO L82 PathProgramCache]: Analyzing trace with hash -659929409, now seen corresponding path program 1 times [2018-11-23 13:12:36,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:36,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:36,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:36,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:36,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:36,359 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 82 proven. 29 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-23 13:12:36,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:36,359 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:36,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:36,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:36,471 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 98 proven. 27 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2018-11-23 13:12:36,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:36,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 13:12:36,486 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:12:36,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:36,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1841932034, now seen corresponding path program 1 times [2018-11-23 13:12:36,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:36,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:36,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:36,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:36,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:36,658 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:36,658 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:36,658 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:36,659 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:36,659 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:12:36,659 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:36,659 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:36,659 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:36,659 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration17_Loop [2018-11-23 13:12:36,659 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:36,659 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:36,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:36,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:36,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:36,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:36,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:36,711 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:36,711 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:36,718 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:36,718 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:36,720 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:36,720 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:36,735 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:36,735 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:36,756 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:12:36,756 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:37,901 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:12:37,903 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:37,903 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:37,903 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:37,903 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:37,903 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:12:37,903 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:37,903 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:37,903 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:37,903 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration17_Loop [2018-11-23 13:12:37,903 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:37,903 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:37,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:37,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:37,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:37,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:37,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:37,948 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:37,948 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:12:37,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:37,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:37,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:37,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:37,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:37,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:37,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:37,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:37,953 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:12:37,955 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:12:37,955 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 13:12:37,955 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:12:37,955 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:12:37,955 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:12:37,955 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2018-11-23 13:12:37,956 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:12:37,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:38,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:38,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:38,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:38,117 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:12:38,117 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-23 13:12:38,117 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 951 states and 1313 transitions. cyclomatic complexity: 378 Second operand 12 states. [2018-11-23 13:12:38,137 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 951 states and 1313 transitions. cyclomatic complexity: 378. Second operand 12 states. Result 953 states and 1315 transitions. Complement of second has 6 states. [2018-11-23 13:12:38,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:38,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:12:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-23 13:12:38,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 78 letters. Loop has 20 letters. [2018-11-23 13:12:38,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:38,138 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:12:38,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:38,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:38,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:38,283 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:12:38,283 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-23 13:12:38,283 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 951 states and 1313 transitions. cyclomatic complexity: 378 Second operand 12 states. [2018-11-23 13:12:38,306 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 951 states and 1313 transitions. cyclomatic complexity: 378. Second operand 12 states. Result 953 states and 1315 transitions. Complement of second has 6 states. [2018-11-23 13:12:38,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:12:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2018-11-23 13:12:38,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 78 letters. Loop has 20 letters. [2018-11-23 13:12:38,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:38,307 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:12:38,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:38,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:38,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:38,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:12:38,432 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-23 13:12:38,432 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 951 states and 1313 transitions. cyclomatic complexity: 378 Second operand 12 states. [2018-11-23 13:12:38,661 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 951 states and 1313 transitions. cyclomatic complexity: 378. Second operand 12 states. Result 5704 states and 7197 transitions. Complement of second has 310 states. [2018-11-23 13:12:38,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:38,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:12:38,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2018-11-23 13:12:38,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 77 transitions. Stem has 78 letters. Loop has 20 letters. [2018-11-23 13:12:38,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:38,664 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:12:38,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:38,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:38,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:38,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:38,837 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 13:12:38,837 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.2 stem predicates 9 loop predicates [2018-11-23 13:12:38,837 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 951 states and 1313 transitions. cyclomatic complexity: 378 Second operand 12 states. [2018-11-23 13:12:39,144 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 951 states and 1313 transitions. cyclomatic complexity: 378. Second operand 12 states. Result 5996 states and 7654 transitions. Complement of second has 321 states. [2018-11-23 13:12:39,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:39,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:12:39,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 84 transitions. [2018-11-23 13:12:39,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 84 transitions. Stem has 78 letters. Loop has 20 letters. [2018-11-23 13:12:39,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:39,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 84 transitions. Stem has 98 letters. Loop has 20 letters. [2018-11-23 13:12:39,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:39,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 84 transitions. Stem has 78 letters. Loop has 40 letters. [2018-11-23 13:12:39,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:39,148 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5996 states and 7654 transitions. [2018-11-23 13:12:39,169 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 78 [2018-11-23 13:12:39,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5996 states to 2242 states and 3163 transitions. [2018-11-23 13:12:39,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 453 [2018-11-23 13:12:39,184 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 479 [2018-11-23 13:12:39,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2242 states and 3163 transitions. [2018-11-23 13:12:39,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:39,184 INFO L705 BuchiCegarLoop]: Abstraction has 2242 states and 3163 transitions. [2018-11-23 13:12:39,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states and 3163 transitions. [2018-11-23 13:12:39,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 1774. [2018-11-23 13:12:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1774 states. [2018-11-23 13:12:39,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2342 transitions. [2018-11-23 13:12:39,208 INFO L728 BuchiCegarLoop]: Abstraction has 1774 states and 2342 transitions. [2018-11-23 13:12:39,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 13:12:39,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-11-23 13:12:39,209 INFO L87 Difference]: Start difference. First operand 1774 states and 2342 transitions. Second operand 16 states. [2018-11-23 13:12:39,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:39,471 INFO L93 Difference]: Finished difference Result 1766 states and 2259 transitions. [2018-11-23 13:12:39,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 13:12:39,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1766 states and 2259 transitions. [2018-11-23 13:12:39,501 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 93 [2018-11-23 13:12:39,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1766 states to 1518 states and 1939 transitions. [2018-11-23 13:12:39,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 390 [2018-11-23 13:12:39,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 390 [2018-11-23 13:12:39,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1518 states and 1939 transitions. [2018-11-23 13:12:39,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:39,508 INFO L705 BuchiCegarLoop]: Abstraction has 1518 states and 1939 transitions. [2018-11-23 13:12:39,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states and 1939 transitions. [2018-11-23 13:12:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1440. [2018-11-23 13:12:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1440 states. [2018-11-23 13:12:39,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1440 states to 1440 states and 1825 transitions. [2018-11-23 13:12:39,524 INFO L728 BuchiCegarLoop]: Abstraction has 1440 states and 1825 transitions. [2018-11-23 13:12:39,524 INFO L608 BuchiCegarLoop]: Abstraction has 1440 states and 1825 transitions. [2018-11-23 13:12:39,524 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-23 13:12:39,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1440 states and 1825 transitions. [2018-11-23 13:12:39,528 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 77 [2018-11-23 13:12:39,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:39,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:39,529 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:39,529 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [13, 13, 10, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1] [2018-11-23 13:12:39,529 INFO L794 eck$LassoCheckResult]: Stem: 82096#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 82088#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 82089#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 82090#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 82091#L35-3 assume !!(main_~q~0 <= main_~x~0); 83050#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 83051#partsENTRY ~p := #in~p;~q := #in~q; 83053#L20 assume ~p <= 0;#res := 1; 83052#partsFINAL assume true; 83049#partsEXIT >#67#return; 83048#L36-1 havoc main_#t~ret8; 82119#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 82120#L35-3 assume !!(main_~q~0 <= main_~x~0); 82103#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 82102#partsENTRY ~p := #in~p;~q := #in~q; 82105#L20 assume ~p <= 0;#res := 1; 82159#partsFINAL assume true; 83509#partsEXIT >#67#return; 83508#L36-1 havoc main_#t~ret8; 82190#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 82189#L35-3 assume !!(main_~q~0 <= main_~x~0); 82104#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 82183#partsENTRY ~p := #in~p;~q := #in~q; 82180#L20 assume ~p <= 0;#res := 1; 82181#partsFINAL assume true; 82914#partsEXIT >#67#return; 82841#L36-1 havoc main_#t~ret8; 82734#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 82733#L35-3 assume !(main_~q~0 <= main_~x~0); 82097#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 82098#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 82162#L35-3 assume !!(main_~q~0 <= main_~x~0); 82163#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 82172#partsENTRY ~p := #in~p;~q := #in~q; 82171#L20 assume !(~p <= 0); 82170#L21 assume ~q <= 0;#res := 0; 82168#partsFINAL assume true; 82169#partsEXIT >#67#return; 82655#L36-1 havoc main_#t~ret8; 82653#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 82601#L35-3 assume !!(main_~q~0 <= main_~x~0); 82567#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 82568#partsENTRY ~p := #in~p;~q := #in~q; 82692#L20 assume !(~p <= 0); 82690#L21 assume !(~q <= 0); 82687#L22 assume !(~q > ~p); 82641#L23 call #t~ret1 := parts(~p - ~q, ~q);< 82643#partsENTRY ~p := #in~p;~q := #in~q; 83031#L20 assume ~p <= 0;#res := 1; 83023#partsFINAL assume true; 83018#partsEXIT >#63#return; 83015#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 83016#partsENTRY ~p := #in~p;~q := #in~q; 83044#L20 assume !(~p <= 0); 83042#L21 assume ~q <= 0;#res := 0; 83040#partsFINAL assume true; 83014#partsEXIT >#65#return; 83010#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 83008#partsFINAL assume true; 83006#partsEXIT >#67#return; 83002#L36-1 havoc main_#t~ret8; 82835#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 82834#L35-3 assume !!(main_~q~0 <= main_~x~0); 82178#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 82833#partsENTRY ~p := #in~p;~q := #in~q; 82831#L20 assume !(~p <= 0); 82820#L21 assume !(~q <= 0); 82258#L22 assume ~q > ~p; 82187#L22-1 call #t~ret0 := parts(~p, ~p);< 82188#partsENTRY ~p := #in~p;~q := #in~q; 82532#L20 assume !(~p <= 0); 82531#L21 assume !(~q <= 0); 82530#L22 assume !(~q > ~p); 82423#L23 call #t~ret1 := parts(~p - ~q, ~q);< 82426#partsENTRY ~p := #in~p;~q := #in~q; 82428#L20 assume ~p <= 0;#res := 1; 82427#partsFINAL assume true; 82422#partsEXIT >#63#return; 82196#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 82207#partsENTRY ~p := #in~p;~q := #in~q; 82812#L20 assume !(~p <= 0); 82810#L21 assume ~q <= 0;#res := 0; 82809#partsFINAL assume true; 82195#partsEXIT >#65#return; 82197#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 82191#partsFINAL assume true; 82192#partsEXIT >#61#return; 82182#L22-2 #res := #t~ret0;havoc #t~ret0; 82176#partsFINAL assume true; 82179#partsEXIT >#67#return; 82166#L36-1 [2018-11-23 13:12:39,530 INFO L796 eck$LassoCheckResult]: Loop: 82166#L36-1 havoc main_#t~ret8; 82118#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 82092#L35-3 assume !(main_~q~0 <= main_~x~0); 82093#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 82164#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 82165#L35-3 assume !!(main_~q~0 <= main_~x~0); 82160#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 82161#partsENTRY ~p := #in~p;~q := #in~q; 82674#L20 assume !(~p <= 0); 82673#L21 assume ~q <= 0;#res := 0; 82671#partsFINAL assume true; 82167#partsEXIT >#67#return; 82143#L36-1 havoc main_#t~ret8; 82144#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 82094#L35-3 assume !!(main_~q~0 <= main_~x~0); 82095#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 83100#partsENTRY ~p := #in~p;~q := #in~q; 83319#L20 assume !(~p <= 0); 83316#L21 assume !(~q <= 0); 83312#L22 assume !(~q > ~p); 83271#L23 call #t~ret1 := parts(~p - ~q, ~q);< 83272#partsENTRY ~p := #in~p;~q := #in~q; 83290#L20 assume ~p <= 0;#res := 1; 83284#partsFINAL assume true; 83270#partsEXIT >#63#return; 83107#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 83109#partsENTRY ~p := #in~p;~q := #in~q; 83276#L20 assume !(~p <= 0); 83274#L21 assume ~q <= 0;#res := 0; 83269#partsFINAL assume true; 83105#partsEXIT >#65#return; 83108#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 83511#partsFINAL assume true; 83510#partsEXIT >#67#return; 82079#L36-1 havoc main_#t~ret8; 82145#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 82980#L35-3 assume !!(main_~q~0 <= main_~x~0); 82116#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 82175#partsENTRY ~p := #in~p;~q := #in~q; 82832#L20 assume !(~p <= 0); 82139#L21 assume !(~q <= 0); 82140#L22 assume ~q > ~p; 82185#L22-1 call #t~ret0 := parts(~p, ~p);< 82241#partsENTRY ~p := #in~p;~q := #in~q; 82239#L20 assume !(~p <= 0); 82231#L21 assume !(~q <= 0); 82232#L22 assume !(~q > ~p); 82425#L23 call #t~ret1 := parts(~p - ~q, ~q);< 82426#partsENTRY ~p := #in~p;~q := #in~q; 82428#L20 assume ~p <= 0;#res := 1; 82427#partsFINAL assume true; 82422#partsEXIT >#63#return; 82107#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 82498#partsENTRY ~p := #in~p;~q := #in~q; 82503#L20 assume !(~p <= 0); 82502#L21 assume !(~q <= 0); 82499#L22 assume !(~q > ~p); 82268#L23 call #t~ret1 := parts(~p - ~q, ~q);< 82269#partsENTRY ~p := #in~p;~q := #in~q; 82639#L20 assume !(~p <= 0); 82637#L21 assume !(~q <= 0); 82636#L22 assume !(~q > ~p); 82593#L23 call #t~ret1 := parts(~p - ~q, ~q);< 82596#partsENTRY ~p := #in~p;~q := #in~q; 82693#L20 assume !(~p <= 0); 82691#L21 assume !(~q <= 0); 82688#L22 assume ~q > ~p; 82689#L22-1 call #t~ret0 := parts(~p, ~p);< 82712#partsENTRY ~p := #in~p;~q := #in~q; 82722#L20 assume ~p <= 0;#res := 1; 82721#partsFINAL assume true; 82711#partsEXIT >#61#return; 82707#L22-2 #res := #t~ret0;havoc #t~ret0; 82703#partsFINAL assume true; 82646#partsEXIT >#63#return; 82570#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 82589#partsENTRY ~p := #in~p;~q := #in~q; 82813#L20 assume !(~p <= 0); 82811#L21 assume ~q <= 0;#res := 0; 82605#partsFINAL assume true; 82579#partsEXIT >#65#return; 82565#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 82563#partsFINAL assume true; 82561#partsEXIT >#63#return; 82252#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 82254#partsENTRY ~p := #in~p;~q := #in~q; 82281#L20 assume !(~p <= 0); 82264#L21 assume ~q <= 0;#res := 0; 82261#partsFINAL assume true; 82250#partsEXIT >#65#return; 82253#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 82500#partsFINAL assume true; 82501#partsEXIT >#65#return; 82193#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 82194#partsFINAL assume true; 82184#partsEXIT >#61#return; 82186#L22-2 #res := #t~ret0;havoc #t~ret0; 83512#partsFINAL assume true; 82173#partsEXIT >#67#return; 82166#L36-1 [2018-11-23 13:12:39,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:39,531 INFO L82 PathProgramCache]: Analyzing trace with hash 489369963, now seen corresponding path program 1 times [2018-11-23 13:12:39,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:39,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:39,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:39,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:39,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:39,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:39,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1551629517, now seen corresponding path program 1 times [2018-11-23 13:12:39,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:39,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:39,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:39,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:39,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:39,582 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 114 proven. 14 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-11-23 13:12:39,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:39,582 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:39,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:39,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 84 proven. 143 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-23 13:12:39,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:39,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 15 [2018-11-23 13:12:39,692 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:12:39,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:12:39,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:12:39,692 INFO L87 Difference]: Start difference. First operand 1440 states and 1825 transitions. cyclomatic complexity: 405 Second operand 15 states. [2018-11-23 13:12:40,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:40,061 INFO L93 Difference]: Finished difference Result 1744 states and 2282 transitions. [2018-11-23 13:12:40,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 13:12:40,062 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1744 states and 2282 transitions. [2018-11-23 13:12:40,067 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 111 [2018-11-23 13:12:40,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1744 states to 1665 states and 2199 transitions. [2018-11-23 13:12:40,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 467 [2018-11-23 13:12:40,074 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 467 [2018-11-23 13:12:40,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1665 states and 2199 transitions. [2018-11-23 13:12:40,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:40,074 INFO L705 BuchiCegarLoop]: Abstraction has 1665 states and 2199 transitions. [2018-11-23 13:12:40,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states and 2199 transitions. [2018-11-23 13:12:40,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1294. [2018-11-23 13:12:40,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1294 states. [2018-11-23 13:12:40,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 1623 transitions. [2018-11-23 13:12:40,094 INFO L728 BuchiCegarLoop]: Abstraction has 1294 states and 1623 transitions. [2018-11-23 13:12:40,094 INFO L608 BuchiCegarLoop]: Abstraction has 1294 states and 1623 transitions. [2018-11-23 13:12:40,094 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-23 13:12:40,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1294 states and 1623 transitions. [2018-11-23 13:12:40,096 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 79 [2018-11-23 13:12:40,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:40,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:40,097 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:40,097 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [8, 8, 6, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:40,097 INFO L794 eck$LassoCheckResult]: Stem: 85614#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 85610#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 85611#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 85612#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 85613#L35-3 assume !!(main_~q~0 <= main_~x~0); 85724#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 85725#partsENTRY ~p := #in~p;~q := #in~q; 85727#L20 assume ~p <= 0;#res := 1; 85726#partsFINAL assume true; 85723#partsEXIT >#67#return; 85722#L36-1 havoc main_#t~ret8; 85721#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 85719#L35-3 assume !!(main_~q~0 <= main_~x~0); 85717#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 85712#partsENTRY ~p := #in~p;~q := #in~q; 85720#L20 assume ~p <= 0;#res := 1; 85718#partsFINAL assume true; 85716#partsEXIT >#67#return; 85715#L36-1 havoc main_#t~ret8; 85714#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 85713#L35-3 assume !!(main_~q~0 <= main_~x~0); 85708#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 85711#partsENTRY ~p := #in~p;~q := #in~q; 85707#L20 assume ~p <= 0;#res := 1; 85709#partsFINAL assume true; 85733#partsEXIT >#67#return; 85734#L36-1 havoc main_#t~ret8; 85923#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 85922#L35-3 assume !(main_~q~0 <= main_~x~0); 85921#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 85689#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 85687#L35-3 assume !!(main_~q~0 <= main_~x~0); 85688#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 85916#partsENTRY ~p := #in~p;~q := #in~q; 85925#L20 assume !(~p <= 0); 85924#L21 assume ~q <= 0;#res := 0; 85693#partsFINAL assume true; 85694#partsEXIT >#67#return; 85657#L36-1 havoc main_#t~ret8; 85658#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 86063#L35-3 assume !!(main_~q~0 <= main_~x~0); 85676#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 85677#partsENTRY ~p := #in~p;~q := #in~q; 86081#L20 assume !(~p <= 0); 86080#L21 assume !(~q <= 0); 86078#L22 assume !(~q > ~p); 86074#L23 call #t~ret1 := parts(~p - ~q, ~q);< 86076#partsENTRY ~p := #in~p;~q := #in~q; 86323#L20 assume ~p <= 0;#res := 1; 86320#partsFINAL assume true; 86316#partsEXIT >#63#return; 86313#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 86314#partsENTRY ~p := #in~p;~q := #in~q; 86325#L20 assume !(~p <= 0); 86322#L21 assume ~q <= 0;#res := 0; 86319#partsFINAL assume true; 86312#partsEXIT >#65#return; 86307#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 86304#partsFINAL assume true; 86301#partsEXIT >#67#return; 85659#L36-1 havoc main_#t~ret8; 85635#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 85636#L35-3 assume !!(main_~q~0 <= main_~x~0); 85699#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 85700#partsENTRY ~p := #in~p;~q := #in~q; 86058#L20 assume !(~p <= 0); 86059#L21 assume !(~q <= 0); 85732#L22 assume ~q > ~p; 85730#L22-1 call #t~ret0 := parts(~p, ~p);< 85731#partsENTRY ~p := #in~p;~q := #in~q; 85860#L20 assume !(~p <= 0); 85858#L21 assume !(~q <= 0); 85859#L22 assume !(~q > ~p); 85849#L23 call #t~ret1 := parts(~p - ~q, ~q);< 85853#partsENTRY ~p := #in~p;~q := #in~q; 85855#L20 assume ~p <= 0;#res := 1; 85854#partsFINAL assume true; 85848#partsEXIT >#63#return; 85852#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 85989#partsENTRY ~p := #in~p;~q := #in~q; 85992#L20 assume !(~p <= 0); 85991#L21 assume ~q <= 0;#res := 0; 85990#partsFINAL assume true; 85988#partsEXIT >#65#return; 85987#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 85986#partsFINAL assume true; 85985#partsEXIT >#61#return; 85984#L22-2 #res := #t~ret0;havoc #t~ret0; 85983#partsFINAL assume true; 85698#partsEXIT >#67#return; 85690#L36-1 [2018-11-23 13:12:40,097 INFO L796 eck$LassoCheckResult]: Loop: 85690#L36-1 havoc main_#t~ret8; 85634#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 85615#L35-3 assume !(main_~q~0 <= main_~x~0); 85616#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 85619#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 85917#L35-3 assume !!(main_~q~0 <= main_~x~0); 85674#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 85675#partsENTRY ~p := #in~p;~q := #in~q; 85697#L20 assume !(~p <= 0); 85695#L21 assume ~q <= 0;#res := 0; 85696#partsFINAL assume true; 85691#partsEXIT >#67#return; 85692#L36-1 havoc main_#t~ret8; 85891#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 85888#L35-3 assume !!(main_~q~0 <= main_~x~0); 85884#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 85885#partsENTRY ~p := #in~p;~q := #in~q; 85920#L20 assume !(~p <= 0); 85919#L21 assume !(~q <= 0); 85918#L22 assume !(~q > ~p); 85901#L23 call #t~ret1 := parts(~p - ~q, ~q);< 85902#partsENTRY ~p := #in~p;~q := #in~q; 86631#L20 assume ~p <= 0;#res := 1; 86628#partsFINAL assume true; 86625#partsEXIT >#63#return; 86621#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 86622#partsENTRY ~p := #in~p;~q := #in~q; 86630#L20 assume !(~p <= 0); 86627#L21 assume ~q <= 0;#res := 0; 86624#partsFINAL assume true; 86620#partsEXIT >#65#return; 86619#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 86616#partsFINAL assume true; 86614#partsEXIT >#67#return; 86109#L36-1 havoc main_#t~ret8; 86110#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 86884#L35-3 assume !!(main_~q~0 <= main_~x~0); 85704#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 85865#partsENTRY ~p := #in~p;~q := #in~q; 85856#L20 assume !(~p <= 0); 85857#L21 assume !(~q <= 0); 85782#L22 assume ~q > ~p; 85729#L22-1 call #t~ret0 := parts(~p, ~p);< 85776#partsENTRY ~p := #in~p;~q := #in~q; 85774#L20 assume !(~p <= 0); 85771#L21 assume !(~q <= 0); 85772#L22 assume !(~q > ~p); 85850#L23 call #t~ret1 := parts(~p - ~q, ~q);< 85853#partsENTRY ~p := #in~p;~q := #in~q; 85855#L20 assume ~p <= 0;#res := 1; 85854#partsFINAL assume true; 85848#partsEXIT >#63#return; 85738#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 85751#partsENTRY ~p := #in~p;~q := #in~q; 86298#L20 assume !(~p <= 0); 86296#L21 assume ~q <= 0;#res := 0; 86297#partsFINAL assume true; 85737#partsEXIT >#65#return; 85736#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 85735#partsFINAL assume true; 85728#partsEXIT >#61#return; 85710#L22-2 #res := #t~ret0;havoc #t~ret0; 85702#partsFINAL assume true; 85706#partsEXIT >#67#return; 85690#L36-1 [2018-11-23 13:12:40,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:40,097 INFO L82 PathProgramCache]: Analyzing trace with hash 489369963, now seen corresponding path program 2 times [2018-11-23 13:12:40,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:40,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:40,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:40,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:40,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:40,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:40,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1022817342, now seen corresponding path program 2 times [2018-11-23 13:12:40,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:40,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:40,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:40,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:40,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:40,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:40,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:40,122 INFO L82 PathProgramCache]: Analyzing trace with hash -546050772, now seen corresponding path program 3 times [2018-11-23 13:12:40,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:40,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:40,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:40,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:40,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:40,208 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 113 proven. 80 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2018-11-23 13:12:40,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:40,208 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:40,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:12:40,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 13:12:40,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:40,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:40,346 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 289 proven. 54 refuted. 0 times theorem prover too weak. 593 trivial. 0 not checked. [2018-11-23 13:12:40,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:40,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2018-11-23 13:12:40,724 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:40,724 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:40,724 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:40,724 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:40,724 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:12:40,724 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:40,724 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:40,724 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:40,724 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration19_Loop [2018-11-23 13:12:40,724 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:40,724 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:40,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:40,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:40,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:40,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:40,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:40,757 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:40,757 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:40,759 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:40,759 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:40,761 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:40,761 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret8=1} Honda state: {ULTIMATE.start_main_#t~ret8=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:40,777 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:40,777 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:40,779 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:40,779 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=2, ULTIMATE.start_main_~q~0=2} Honda state: {ULTIMATE.start_main_~x~0=2, ULTIMATE.start_main_~q~0=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-23 13:12:40,796 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:40,796 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:40,798 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:40,798 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6=0} Honda state: {ULTIMATE.start_main_#t~post6=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:40,819 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:40,819 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:40,836 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:12:40,837 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:40,864 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:12:40,865 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:40,865 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:40,865 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:40,865 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:40,865 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:12:40,865 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:40,865 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:40,865 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:40,865 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration19_Loop [2018-11-23 13:12:40,865 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:40,865 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:40,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:40,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:40,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:40,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:40,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:40,895 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:40,895 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:12:40,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:40,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:40,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:40,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:40,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:40,896 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:40,896 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:40,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:40,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:40,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:40,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:40,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:40,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:40,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:40,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:40,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:40,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:40,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:40,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:40,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:40,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:40,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:40,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:40,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:40,899 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:40,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:40,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:40,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:40,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:40,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:40,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:40,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:40,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:40,901 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:40,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:40,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:40,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:40,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:40,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:40,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:40,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:40,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:40,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:40,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:40,903 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:12:40,904 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:12:40,904 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 13:12:40,904 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:12:40,904 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:12:40,905 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:12:40,905 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0) = -2*ULTIMATE.start_main_~p~0 + 1 Supporting invariants [] [2018-11-23 13:12:40,905 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:12:40,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:40,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:40,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:41,030 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 16 proven. 48 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-11-23 13:12:41,135 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2018-11-23 13:12:41,135 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1294 states and 1623 transitions. cyclomatic complexity: 349 Second operand 13 states. [2018-11-23 13:12:41,337 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1294 states and 1623 transitions. cyclomatic complexity: 349. Second operand 13 states. Result 3101 states and 3924 transitions. Complement of second has 53 states. [2018-11-23 13:12:41,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:41,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:12:41,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 68 transitions. [2018-11-23 13:12:41,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 68 transitions. Stem has 90 letters. Loop has 64 letters. [2018-11-23 13:12:41,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:41,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 68 transitions. Stem has 154 letters. Loop has 64 letters. [2018-11-23 13:12:41,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:41,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 68 transitions. Stem has 90 letters. Loop has 128 letters. [2018-11-23 13:12:41,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:41,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3101 states and 3924 transitions. [2018-11-23 13:12:41,347 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 91 [2018-11-23 13:12:41,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3101 states to 2655 states and 3331 transitions. [2018-11-23 13:12:41,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 420 [2018-11-23 13:12:41,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 420 [2018-11-23 13:12:41,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2655 states and 3331 transitions. [2018-11-23 13:12:41,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:41,359 INFO L705 BuchiCegarLoop]: Abstraction has 2655 states and 3331 transitions. [2018-11-23 13:12:41,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states and 3331 transitions. [2018-11-23 13:12:41,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2406. [2018-11-23 13:12:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2406 states. [2018-11-23 13:12:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 2985 transitions. [2018-11-23 13:12:41,384 INFO L728 BuchiCegarLoop]: Abstraction has 2406 states and 2985 transitions. [2018-11-23 13:12:41,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:12:41,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:12:41,384 INFO L87 Difference]: Start difference. First operand 2406 states and 2985 transitions. Second operand 17 states. [2018-11-23 13:12:41,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:41,825 INFO L93 Difference]: Finished difference Result 2814 states and 3549 transitions. [2018-11-23 13:12:41,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 13:12:41,827 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2814 states and 3549 transitions. [2018-11-23 13:12:41,835 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 93 [2018-11-23 13:12:41,847 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2814 states to 2755 states and 3484 transitions. [2018-11-23 13:12:41,847 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 451 [2018-11-23 13:12:41,847 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 468 [2018-11-23 13:12:41,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2755 states and 3484 transitions. [2018-11-23 13:12:41,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:41,848 INFO L705 BuchiCegarLoop]: Abstraction has 2755 states and 3484 transitions. [2018-11-23 13:12:41,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states and 3484 transitions. [2018-11-23 13:12:41,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 2365. [2018-11-23 13:12:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2365 states. [2018-11-23 13:12:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 2935 transitions. [2018-11-23 13:12:41,875 INFO L728 BuchiCegarLoop]: Abstraction has 2365 states and 2935 transitions. [2018-11-23 13:12:41,875 INFO L608 BuchiCegarLoop]: Abstraction has 2365 states and 2935 transitions. [2018-11-23 13:12:41,875 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-23 13:12:41,875 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2365 states and 2935 transitions. [2018-11-23 13:12:41,880 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 89 [2018-11-23 13:12:41,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:41,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:41,881 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [11, 11, 6, 6, 6, 6, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:41,881 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [21, 21, 16, 9, 8, 8, 8, 8, 8, 8, 7, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:41,882 INFO L794 eck$LassoCheckResult]: Stem: 96296#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 96281#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 96282#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 96287#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 96424#L35-3 assume !!(main_~q~0 <= main_~x~0); 96421#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 96422#partsENTRY ~p := #in~p;~q := #in~q; 96425#L20 assume ~p <= 0;#res := 1; 96423#partsFINAL assume true; 96420#partsEXIT >#67#return; 96418#L36-1 havoc main_#t~ret8; 96417#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 96415#L35-3 assume !!(main_~q~0 <= main_~x~0); 96413#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 96406#partsENTRY ~p := #in~p;~q := #in~q; 96416#L20 assume ~p <= 0;#res := 1; 96414#partsFINAL assume true; 96412#partsEXIT >#67#return; 96411#L36-1 havoc main_#t~ret8; 96410#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 96408#L35-3 assume !!(main_~q~0 <= main_~x~0); 96404#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 96405#partsENTRY ~p := #in~p;~q := #in~q; 96409#L20 assume ~p <= 0;#res := 1; 96407#partsFINAL assume true; 96403#partsEXIT >#67#return; 96402#L36-1 havoc main_#t~ret8; 96401#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 96400#L35-3 assume !(main_~q~0 <= main_~x~0); 96399#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 96285#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 96286#L35-3 assume !!(main_~q~0 <= main_~x~0); 96817#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 96818#partsENTRY ~p := #in~p;~q := #in~q; 96837#L20 assume !(~p <= 0); 96835#L21 assume ~q <= 0;#res := 0; 96832#partsFINAL assume true; 96816#partsEXIT >#67#return; 96810#L36-1 havoc main_#t~ret8; 96806#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 96804#L35-3 assume !!(main_~q~0 <= main_~x~0); 96801#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 96802#partsENTRY ~p := #in~p;~q := #in~q; 96836#L20 assume !(~p <= 0); 96834#L21 assume !(~q <= 0); 96831#L22 assume !(~q > ~p); 96813#L23 call #t~ret1 := parts(~p - ~q, ~q);< 96814#partsENTRY ~p := #in~p;~q := #in~q; 97391#L20 assume ~p <= 0;#res := 1; 97390#partsFINAL assume true; 97389#partsEXIT >#63#return; 97375#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 97376#partsENTRY ~p := #in~p;~q := #in~q; 97385#L20 assume !(~p <= 0); 97383#L21 assume ~q <= 0;#res := 0; 97381#partsFINAL assume true; 97374#partsEXIT >#65#return; 97371#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 97368#partsFINAL assume true; 97364#partsEXIT >#67#return; 97365#L36-1 havoc main_#t~ret8; 97767#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 96495#L35-3 assume !!(main_~q~0 <= main_~x~0); 96493#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 97765#partsENTRY ~p := #in~p;~q := #in~q; 97990#L20 assume !(~p <= 0); 97989#L21 assume !(~q <= 0); 97472#L22 assume ~q > ~p; 97408#L22-1 call #t~ret0 := parts(~p, ~p);< 97411#partsENTRY ~p := #in~p;~q := #in~q; 97491#L20 assume !(~p <= 0); 97490#L21 assume !(~q <= 0); 97489#L22 assume !(~q > ~p); 97462#L23 call #t~ret1 := parts(~p - ~q, ~q);< 97464#partsENTRY ~p := #in~p;~q := #in~q; 97466#L20 assume ~p <= 0;#res := 1; 97465#partsFINAL assume true; 97459#partsEXIT >#63#return; 97463#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 97487#partsENTRY ~p := #in~p;~q := #in~q; 97483#L20 assume !(~p <= 0); 97475#L21 assume ~q <= 0;#res := 0; 97469#partsFINAL assume true; 97470#partsEXIT >#65#return; 97413#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 97412#partsFINAL assume true; 97407#partsEXIT >#61#return; 97396#L22-2 #res := #t~ret0;havoc #t~ret0; 96492#partsFINAL assume true; 96494#partsEXIT >#67#return; 96366#L36-1 [2018-11-23 13:12:41,882 INFO L796 eck$LassoCheckResult]: Loop: 96366#L36-1 havoc main_#t~ret8; 96367#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 96288#L35-3 assume !(main_~q~0 <= main_~x~0); 96289#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 96283#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 96284#L35-3 assume !!(main_~q~0 <= main_~x~0); 96428#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 96430#partsENTRY ~p := #in~p;~q := #in~q; 97552#L20 assume !(~p <= 0); 97551#L21 assume ~q <= 0;#res := 0; 97550#partsFINAL assume true; 96427#partsEXIT >#67#return; 96429#L36-1 havoc main_#t~ret8; 97538#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 97536#L35-3 assume !!(main_~q~0 <= main_~x~0); 97533#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 97534#partsENTRY ~p := #in~p;~q := #in~q; 97559#L20 assume !(~p <= 0); 97558#L21 assume !(~q <= 0); 97549#L22 assume !(~q > ~p); 97544#L23 call #t~ret1 := parts(~p - ~q, ~q);< 97545#partsENTRY ~p := #in~p;~q := #in~q; 97646#L20 assume !(~p <= 0); 97645#L21 assume !(~q <= 0); 97644#L22 assume !(~q > ~p); 97637#L23 call #t~ret1 := parts(~p - ~q, ~q);< 97639#partsENTRY ~p := #in~p;~q := #in~q; 97674#L20 assume ~p <= 0;#res := 1; 97650#partsFINAL assume true; 97636#partsEXIT >#63#return; 97555#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 97557#partsENTRY ~p := #in~p;~q := #in~q; 97787#L20 assume !(~p <= 0); 97563#L21 assume ~q <= 0;#res := 0; 97560#partsFINAL assume true; 97553#partsEXIT >#65#return; 97548#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 97547#partsFINAL assume true; 97543#partsEXIT >#63#return; 97540#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 97541#partsENTRY ~p := #in~p;~q := #in~q; 97564#L20 assume !(~p <= 0); 97546#L21 assume ~q <= 0;#res := 0; 97542#partsFINAL assume true; 97539#partsEXIT >#65#return; 97537#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 97535#partsFINAL assume true; 97532#partsEXIT >#67#return; 97530#L36-1 havoc main_#t~ret8; 97528#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 97525#L35-3 assume !!(main_~q~0 <= main_~x~0); 97450#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 97512#partsENTRY ~p := #in~p;~q := #in~q; 97614#L20 assume !(~p <= 0); 97609#L21 assume !(~q <= 0); 97600#L22 assume !(~q > ~p); 97596#L23 call #t~ret1 := parts(~p - ~q, ~q);< 97598#partsENTRY ~p := #in~p;~q := #in~q; 97683#L20 assume ~p <= 0;#res := 1; 97678#partsFINAL assume true; 97653#partsEXIT >#63#return; 97575#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 97663#partsENTRY ~p := #in~p;~q := #in~q; 97791#L20 assume !(~p <= 0); 97790#L21 assume !(~q <= 0); 97789#L22 assume !(~q > ~p); 97629#L23 call #t~ret1 := parts(~p - ~q, ~q);< 97632#partsENTRY ~p := #in~p;~q := #in~q; 98070#L20 assume !(~p <= 0); 98071#L21 assume !(~q <= 0); 98059#L22 assume !(~q > ~p); 98054#L23 call #t~ret1 := parts(~p - ~q, ~q);< 98056#partsENTRY ~p := #in~p;~q := #in~q; 98051#L20 assume ~p <= 0;#res := 1; 98055#partsFINAL assume true; 98060#partsEXIT >#63#return; 98062#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 98350#partsENTRY ~p := #in~p;~q := #in~q; 98356#L20 assume !(~p <= 0); 98187#L21 assume ~q <= 0;#res := 0; 98188#partsFINAL assume true; 98353#partsEXIT >#65#return; 97662#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 97655#partsFINAL assume true; 97628#partsEXIT >#63#return; 97602#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 97607#partsENTRY ~p := #in~p;~q := #in~q; 97658#L20 assume !(~p <= 0); 97615#L21 assume ~q <= 0;#res := 0; 97611#partsFINAL assume true; 97601#partsEXIT >#65#return; 97605#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 97788#partsFINAL assume true; 97574#partsEXIT >#65#return; 97572#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 97567#partsFINAL assume true; 97522#partsEXIT >#67#return; 97517#L36-1 havoc main_#t~ret8; 97516#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 97515#L35-3 assume !!(main_~q~0 <= main_~x~0); 97451#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 97513#partsENTRY ~p := #in~p;~q := #in~q; 97505#L20 assume !(~p <= 0); 97506#L21 assume !(~q <= 0); 97455#L22 assume ~q > ~p; 97430#L22-1 call #t~ret0 := parts(~p, ~p);< 97449#partsENTRY ~p := #in~p;~q := #in~q; 97447#L20 assume !(~p <= 0); 97443#L21 assume !(~q <= 0); 97444#L22 assume !(~q > ~p); 97461#L23 call #t~ret1 := parts(~p - ~q, ~q);< 97464#partsENTRY ~p := #in~p;~q := #in~q; 97466#L20 assume ~p <= 0;#res := 1; 97465#partsFINAL assume true; 97459#partsEXIT >#63#return; 97418#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 97431#partsENTRY ~p := #in~p;~q := #in~q; 97501#L20 assume !(~p <= 0); 97500#L21 assume !(~q <= 0); 97498#L22 assume !(~q > ~p); 97495#L23 call #t~ret1 := parts(~p - ~q, ~q);< 97497#partsENTRY ~p := #in~p;~q := #in~q; 98095#L20 assume !(~p <= 0); 98094#L21 assume !(~q <= 0); 98092#L22 assume !(~q > ~p); 98076#L23 call #t~ret1 := parts(~p - ~q, ~q);< 98088#partsENTRY ~p := #in~p;~q := #in~q; 98093#L20 assume ~p <= 0;#res := 1; 98090#partsFINAL assume true; 98074#partsEXIT >#63#return; 97872#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 98416#partsENTRY ~p := #in~p;~q := #in~q; 98425#L20 assume !(~p <= 0); 98423#L21 assume ~q <= 0;#res := 0; 98422#partsFINAL assume true; 98420#partsEXIT >#65#return; 97647#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 97503#partsFINAL assume true; 97492#partsEXIT >#63#return; 97479#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 97482#partsENTRY ~p := #in~p;~q := #in~q; 97502#L20 assume !(~p <= 0); 97488#L21 assume ~q <= 0;#res := 0; 97484#partsFINAL assume true; 97476#partsEXIT >#65#return; 97473#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 97474#partsFINAL assume true; 97414#partsEXIT >#65#return; 97422#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 97781#partsFINAL assume true; 97780#partsEXIT >#61#return; 97778#L22-2 #res := #t~ret0;havoc #t~ret0; 97777#partsFINAL assume true; 97776#partsEXIT >#67#return; 96366#L36-1 [2018-11-23 13:12:41,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:41,882 INFO L82 PathProgramCache]: Analyzing trace with hash 489369963, now seen corresponding path program 4 times [2018-11-23 13:12:41,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:41,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:41,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:41,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:41,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:41,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:41,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:41,899 INFO L82 PathProgramCache]: Analyzing trace with hash 84368578, now seen corresponding path program 3 times [2018-11-23 13:12:41,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:41,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:41,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:41,900 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:41,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:41,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:41,923 INFO L82 PathProgramCache]: Analyzing trace with hash 817864108, now seen corresponding path program 5 times [2018-11-23 13:12:41,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:41,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:41,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:41,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:41,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:42,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 26 proven. 144 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2018-11-23 13:12:42,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:42,003 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:42,011 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:12:42,073 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-23 13:12:42,073 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:42,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:42,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1149 proven. 151 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2018-11-23 13:12:42,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:42,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16] total 25 [2018-11-23 13:12:43,234 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 79 [2018-11-23 13:12:43,241 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:43,241 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:43,241 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:43,241 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:43,241 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:12:43,241 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:43,242 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:43,242 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:43,242 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration20_Loop [2018-11-23 13:12:43,242 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:43,242 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:43,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:43,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:43,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:43,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:43,274 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:43,274 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:43,277 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:43,277 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:43,293 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:12:43,293 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:43,455 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:12:43,456 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:43,456 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:43,457 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:43,457 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:43,457 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:12:43,457 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:43,457 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:43,457 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:43,457 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration20_Loop [2018-11-23 13:12:43,457 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:43,457 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:43,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:43,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:43,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:43,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:43,486 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:43,486 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:12:43,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:43,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:43,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:43,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:43,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:43,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:43,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:43,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:43,488 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:12:43,489 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:12:43,489 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 13:12:43,489 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:12:43,489 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:12:43,489 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:12:43,489 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0) = -2*ULTIMATE.start_main_~p~0 + 3 Supporting invariants [] [2018-11-23 13:12:43,490 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:12:43,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:43,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:43,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 27 proven. 247 refuted. 0 times theorem prover too weak. 834 trivial. 0 not checked. [2018-11-23 13:12:43,772 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 11 loop predicates [2018-11-23 13:12:43,772 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2365 states and 2935 transitions. cyclomatic complexity: 603 Second operand 14 states. [2018-11-23 13:12:44,212 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2365 states and 2935 transitions. cyclomatic complexity: 603. Second operand 14 states. Result 7743 states and 10348 transitions. Complement of second has 87 states. [2018-11-23 13:12:44,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:44,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:12:44,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 88 transitions. [2018-11-23 13:12:44,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 88 transitions. Stem has 90 letters. Loop has 154 letters. [2018-11-23 13:12:44,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:44,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 88 transitions. Stem has 244 letters. Loop has 154 letters. [2018-11-23 13:12:44,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:44,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 88 transitions. Stem has 90 letters. Loop has 308 letters. [2018-11-23 13:12:44,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:44,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7743 states and 10348 transitions. [2018-11-23 13:12:44,242 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 111 [2018-11-23 13:12:44,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7743 states to 5462 states and 7272 transitions. [2018-11-23 13:12:44,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 704 [2018-11-23 13:12:44,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 719 [2018-11-23 13:12:44,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5462 states and 7272 transitions. [2018-11-23 13:12:44,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:44,269 INFO L705 BuchiCegarLoop]: Abstraction has 5462 states and 7272 transitions. [2018-11-23 13:12:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5462 states and 7272 transitions. [2018-11-23 13:12:44,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5462 to 3629. [2018-11-23 13:12:44,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3629 states. [2018-11-23 13:12:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3629 states to 3629 states and 4534 transitions. [2018-11-23 13:12:44,317 INFO L728 BuchiCegarLoop]: Abstraction has 3629 states and 4534 transitions. [2018-11-23 13:12:44,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:12:44,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=501, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:12:44,318 INFO L87 Difference]: Start difference. First operand 3629 states and 4534 transitions. Second operand 25 states. [2018-11-23 13:12:44,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:44,745 INFO L93 Difference]: Finished difference Result 4163 states and 5289 transitions. [2018-11-23 13:12:44,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 13:12:44,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4163 states and 5289 transitions. [2018-11-23 13:12:44,760 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 103 [2018-11-23 13:12:44,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4163 states to 4071 states and 5179 transitions. [2018-11-23 13:12:44,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 470 [2018-11-23 13:12:44,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 488 [2018-11-23 13:12:44,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4071 states and 5179 transitions. [2018-11-23 13:12:44,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:44,776 INFO L705 BuchiCegarLoop]: Abstraction has 4071 states and 5179 transitions. [2018-11-23 13:12:44,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4071 states and 5179 transitions. [2018-11-23 13:12:44,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4071 to 3731. [2018-11-23 13:12:44,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3731 states. [2018-11-23 13:12:44,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3731 states to 3731 states and 4669 transitions. [2018-11-23 13:12:44,819 INFO L728 BuchiCegarLoop]: Abstraction has 3731 states and 4669 transitions. [2018-11-23 13:12:44,819 INFO L608 BuchiCegarLoop]: Abstraction has 3731 states and 4669 transitions. [2018-11-23 13:12:44,819 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-23 13:12:44,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3731 states and 4669 transitions. [2018-11-23 13:12:44,826 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 89 [2018-11-23 13:12:44,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:44,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:44,828 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [29, 24, 22, 14, 14, 13, 10, 10, 9, 9, 8, 7, 6, 6, 5, 5, 5, 2, 1, 1, 1, 1, 1] [2018-11-23 13:12:44,828 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 3, 3, 3, 3, 1, 1, 1, 1] [2018-11-23 13:12:44,828 INFO L794 eck$LassoCheckResult]: Stem: 115834#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 115822#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 115823#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 115828#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 116036#L35-3 assume !!(main_~q~0 <= main_~x~0); 116033#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 116034#partsENTRY ~p := #in~p;~q := #in~q; 116037#L20 assume ~p <= 0;#res := 1; 116035#partsFINAL assume true; 116032#partsEXIT >#67#return; 116029#L36-1 havoc main_#t~ret8; 116031#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 117241#L35-3 assume !!(main_~q~0 <= main_~x~0); 117238#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 117231#partsENTRY ~p := #in~p;~q := #in~q; 117242#L20 assume ~p <= 0;#res := 1; 117240#partsFINAL assume true; 117237#partsEXIT >#67#return; 117236#L36-1 havoc main_#t~ret8; 117235#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 117234#L35-3 assume !!(main_~q~0 <= main_~x~0); 117224#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 117230#partsENTRY ~p := #in~p;~q := #in~q; 117233#L20 assume ~p <= 0;#res := 1; 117232#partsFINAL assume true; 117222#partsEXIT >#67#return; 117226#L36-1 havoc main_#t~ret8; 117469#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 117466#L35-3 assume !(main_~q~0 <= main_~x~0); 117459#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 117457#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 117455#L35-3 assume !!(main_~q~0 <= main_~x~0); 117140#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 117144#partsENTRY ~p := #in~p;~q := #in~q; 117163#L20 assume !(~p <= 0); 117157#L21 assume ~q <= 0;#res := 0; 117158#partsFINAL assume true; 117139#partsEXIT >#67#return; 117142#L36-1 havoc main_#t~ret8; 117516#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 117509#L35-3 assume !!(main_~q~0 <= main_~x~0); 117126#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 117419#partsENTRY ~p := #in~p;~q := #in~q; 117528#L20 assume !(~p <= 0); 117176#L21 assume !(~q <= 0); 117177#L22 assume !(~q > ~p); 117124#L23 call #t~ret1 := parts(~p - ~q, ~q);< 117128#partsENTRY ~p := #in~p;~q := #in~q; 117853#L20 assume !(~p <= 0); 117847#L21 assume !(~q <= 0); 117832#L22 assume !(~q > ~p); 117202#L23 call #t~ret1 := parts(~p - ~q, ~q);< 117842#partsENTRY ~p := #in~p;~q := #in~q; 117849#L20 assume !(~p <= 0); 117848#L21 assume !(~q <= 0); 117548#L22 assume !(~q > ~p); 117549#L23 call #t~ret1 := parts(~p - ~q, ~q);< 117877#partsENTRY ~p := #in~p;~q := #in~q; 117881#L20 assume ~p <= 0;#res := 1; 117879#partsFINAL assume true; 117876#partsEXIT >#63#return; 117872#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 117873#partsENTRY ~p := #in~p;~q := #in~q; 117880#L20 assume !(~p <= 0); 117878#L21 assume ~q <= 0;#res := 0; 117875#partsFINAL assume true; 117871#partsEXIT >#65#return; 117527#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 117866#partsFINAL assume true; 117201#partsEXIT >#63#return; 117204#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 117218#partsENTRY ~p := #in~p;~q := #in~q; 117219#L20 assume !(~p <= 0); 117208#L21 assume ~q <= 0;#res := 0; 117209#partsFINAL assume true; 117525#partsEXIT >#65#return; 117526#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 117861#partsFINAL assume true; 117123#partsEXIT >#63#return; 117125#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 117185#partsENTRY ~p := #in~p;~q := #in~q; 117178#L20 assume !(~p <= 0); 117179#L21 assume ~q <= 0;#res := 0; 117568#partsFINAL assume true; 117514#partsEXIT >#65#return; 117515#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 117507#partsFINAL assume true; 117508#partsEXIT >#67#return; 117374#L36-1 havoc main_#t~ret8; 117372#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 117370#L35-3 assume !!(main_~q~0 <= main_~x~0); 115933#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 115940#partsENTRY ~p := #in~p;~q := #in~q; 115939#L20 assume !(~p <= 0); 115938#L21 assume !(~q <= 0); 115936#L22 assume !(~q > ~p); 115860#L23 call #t~ret1 := parts(~p - ~q, ~q);< 115935#partsENTRY ~p := #in~p;~q := #in~q; 117972#L20 assume !(~p <= 0); 117970#L21 assume !(~q <= 0); 115919#L22 assume !(~q > ~p); 115921#L23 call #t~ret1 := parts(~p - ~q, ~q);< 115932#partsENTRY ~p := #in~p;~q := #in~q; 115927#L20 assume !(~p <= 0); 115929#L21 assume !(~q <= 0); 117962#L22 assume !(~q > ~p); 115928#L23 call #t~ret1 := parts(~p - ~q, ~q);< 115932#partsENTRY ~p := #in~p;~q := #in~q; 115927#L20 assume !(~p <= 0); 115929#L21 assume !(~q <= 0); 117962#L22 assume !(~q > ~p); 115836#L23 call #t~ret1 := parts(~p - ~q, ~q);< 115835#partsENTRY ~p := #in~p;~q := #in~q; 115838#L20 assume ~p <= 0;#res := 1; 119479#partsFINAL assume true; 119478#partsEXIT >#63#return; 119242#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 115861#partsENTRY ~p := #in~p;~q := #in~q; 119497#L20 assume !(~p <= 0); 119496#L21 assume !(~q <= 0); 119494#L22 assume !(~q > ~p); 119491#L23 call #t~ret1 := parts(~p - ~q, ~q);< 119492#partsENTRY ~p := #in~p;~q := #in~q; 119507#L20 assume !(~p <= 0); 119506#L21 assume !(~q <= 0); 119505#L22 assume !(~q > ~p); 115897#L23 call #t~ret1 := parts(~p - ~q, ~q);< 115819#partsENTRY ~p := #in~p;~q := #in~q; 115896#L20 assume ~p <= 0;#res := 1; 115898#partsFINAL assume true; 119504#partsEXIT >#63#return; 115840#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 119512#partsENTRY ~p := #in~p;~q := #in~q; 119530#L20 assume !(~p <= 0); 115882#L21 assume ~q <= 0;#res := 0; 115883#partsFINAL assume true; 119523#partsEXIT >#65#return; 119499#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 119498#partsFINAL assume true; 119489#partsEXIT >#63#return; 119486#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 119487#partsENTRY ~p := #in~p;~q := #in~q; 119495#L20 assume !(~p <= 0); 119493#L21 assume ~q <= 0;#res := 0; 119488#partsFINAL assume true; 119485#partsEXIT >#65#return; 119484#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 119483#partsFINAL assume true; 119482#partsEXIT >#65#return; 119481#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 119480#partsFINAL assume true; 119477#partsEXIT >#63#return; 119242#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 115861#partsENTRY ~p := #in~p;~q := #in~q; 119497#L20 assume !(~p <= 0); 119496#L21 assume !(~q <= 0); 119494#L22 assume !(~q > ~p); 119491#L23 call #t~ret1 := parts(~p - ~q, ~q);< 119492#partsENTRY ~p := #in~p;~q := #in~q; 119507#L20 assume !(~p <= 0); 119506#L21 assume !(~q <= 0); 119505#L22 assume !(~q > ~p); 115897#L23 call #t~ret1 := parts(~p - ~q, ~q);< 115819#partsENTRY ~p := #in~p;~q := #in~q; 115896#L20 assume ~p <= 0;#res := 1; 115898#partsFINAL assume true; 119504#partsEXIT >#63#return; 115840#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 119512#partsENTRY ~p := #in~p;~q := #in~q; 119530#L20 assume !(~p <= 0); 115882#L21 assume ~q <= 0;#res := 0; 115883#partsFINAL assume true; 119523#partsEXIT >#65#return; 119499#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 119498#partsFINAL assume true; 119489#partsEXIT >#63#return; 119486#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 119487#partsENTRY ~p := #in~p;~q := #in~q; 119495#L20 assume !(~p <= 0); 119493#L21 assume ~q <= 0;#res := 0; 119488#partsFINAL assume true; 119485#partsEXIT >#65#return; 119484#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 119483#partsFINAL assume true; 119482#partsEXIT >#65#return; 119481#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 119480#partsFINAL assume true; 119477#partsEXIT >#63#return; 115859#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 115861#partsENTRY ~p := #in~p;~q := #in~q; 119497#L20 assume !(~p <= 0); 119496#L21 assume !(~q <= 0); 119494#L22 assume !(~q > ~p); 119491#L23 call #t~ret1 := parts(~p - ~q, ~q);< 119492#partsENTRY ~p := #in~p;~q := #in~q; 119507#L20 assume !(~p <= 0); 119506#L21 assume !(~q <= 0); 119505#L22 assume !(~q > ~p); 115845#L23 call #t~ret1 := parts(~p - ~q, ~q);< 119476#partsENTRY ~p := #in~p;~q := #in~q; 119475#L20 assume !(~p <= 0); 119474#L21 assume !(~q <= 0); 115874#L22 assume !(~q > ~p); 115875#L23 [2018-11-23 13:12:44,828 INFO L796 eck$LassoCheckResult]: Loop: 115875#L23 call #t~ret1 := parts(~p - ~q, ~q);< 115819#partsENTRY ~p := #in~p;~q := #in~q; 115896#L20 assume ~p <= 0;#res := 1; 115898#partsFINAL assume true; 119504#partsEXIT >#63#return; 115842#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 115839#partsENTRY ~p := #in~p;~q := #in~q; 115843#L20 assume !(~p <= 0); 119534#L21 assume !(~q <= 0); 119533#L22 assume !(~q > ~p); 115811#L23 call #t~ret1 := parts(~p - ~q, ~q);< 115821#partsENTRY ~p := #in~p;~q := #in~q; 119538#L20 assume !(~p <= 0); 119537#L21 assume !(~q <= 0); 119536#L22 assume !(~q > ~p); 115846#L23 call #t~ret1 := parts(~p - ~q, ~q);< 119476#partsENTRY ~p := #in~p;~q := #in~q; 119475#L20 assume !(~p <= 0); 119474#L21 assume !(~q <= 0); 115874#L22 assume !(~q > ~p); 115875#L23 [2018-11-23 13:12:44,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:44,829 INFO L82 PathProgramCache]: Analyzing trace with hash 82341562, now seen corresponding path program 2 times [2018-11-23 13:12:44,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:44,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:44,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:44,830 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:44,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1902 backedges. 390 proven. 290 refuted. 0 times theorem prover too weak. 1222 trivial. 0 not checked. [2018-11-23 13:12:44,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:44,910 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:44,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:12:44,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:12:44,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:44,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:45,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1902 backedges. 960 proven. 48 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2018-11-23 13:12:45,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:45,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 13:12:45,022 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:12:45,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:45,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1055201891, now seen corresponding path program 3 times [2018-11-23 13:12:45,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:45,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:45,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:45,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:45,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:45,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:45,079 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:45,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:12:45,099 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:12:45,099 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:45,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:45,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:45,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 13 [2018-11-23 13:12:45,137 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:12:45,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:12:45,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:12:45,137 INFO L87 Difference]: Start difference. First operand 3731 states and 4669 transitions. cyclomatic complexity: 983 Second operand 13 states. [2018-11-23 13:12:45,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:45,459 INFO L93 Difference]: Finished difference Result 4076 states and 4932 transitions. [2018-11-23 13:12:45,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 13:12:45,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4076 states and 4932 transitions. [2018-11-23 13:12:45,474 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 57 [2018-11-23 13:12:45,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4076 states to 3540 states and 4316 transitions. [2018-11-23 13:12:45,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 494 [2018-11-23 13:12:45,485 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 545 [2018-11-23 13:12:45,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3540 states and 4316 transitions. [2018-11-23 13:12:45,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:45,485 INFO L705 BuchiCegarLoop]: Abstraction has 3540 states and 4316 transitions. [2018-11-23 13:12:45,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3540 states and 4316 transitions. [2018-11-23 13:12:45,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3540 to 3022. [2018-11-23 13:12:45,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states. [2018-11-23 13:12:45,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 3583 transitions. [2018-11-23 13:12:45,525 INFO L728 BuchiCegarLoop]: Abstraction has 3022 states and 3583 transitions. [2018-11-23 13:12:45,525 INFO L608 BuchiCegarLoop]: Abstraction has 3022 states and 3583 transitions. [2018-11-23 13:12:45,525 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-11-23 13:12:45,525 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3022 states and 3583 transitions. [2018-11-23 13:12:45,532 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 57 [2018-11-23 13:12:45,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:45,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:45,533 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [20, 14, 14, 10, 9, 8, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:12:45,533 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:12:45,534 INFO L794 eck$LassoCheckResult]: Stem: 124361#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 124350#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 124351#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 124356#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 124494#L35-3 assume !!(main_~q~0 <= main_~x~0); 124491#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 124492#partsENTRY ~p := #in~p;~q := #in~q; 124495#L20 assume ~p <= 0;#res := 1; 124493#partsFINAL assume true; 124490#partsEXIT >#67#return; 124487#L36-1 havoc main_#t~ret8; 124489#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 125520#L35-3 assume !!(main_~q~0 <= main_~x~0); 125516#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 125495#partsENTRY ~p := #in~p;~q := #in~q; 125521#L20 assume ~p <= 0;#res := 1; 125519#partsFINAL assume true; 125515#partsEXIT >#67#return; 125514#L36-1 havoc main_#t~ret8; 125513#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 125510#L35-3 assume !!(main_~q~0 <= main_~x~0); 125491#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 125494#partsENTRY ~p := #in~p;~q := #in~q; 125512#L20 assume ~p <= 0;#res := 1; 125509#partsFINAL assume true; 125490#partsEXIT >#67#return; 125488#L36-1 havoc main_#t~ret8; 125486#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 125484#L35-3 assume !(main_~q~0 <= main_~x~0); 125476#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 125472#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 125468#L35-3 assume !!(main_~q~0 <= main_~x~0); 125452#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 125455#partsENTRY ~p := #in~p;~q := #in~q; 125475#L20 assume !(~p <= 0); 125471#L21 assume ~q <= 0;#res := 0; 125465#partsFINAL assume true; 125451#partsEXIT >#67#return; 125444#L36-1 havoc main_#t~ret8; 125445#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 125435#L35-3 assume !!(main_~q~0 <= main_~x~0); 125430#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 125524#partsENTRY ~p := #in~p;~q := #in~q; 125730#L20 assume !(~p <= 0); 125728#L21 assume !(~q <= 0); 125727#L22 assume !(~q > ~p); 125725#L23 call #t~ret1 := parts(~p - ~q, ~q);< 125726#partsENTRY ~p := #in~p;~q := #in~q; 125803#L20 assume !(~p <= 0); 125802#L21 assume !(~q <= 0); 125800#L22 assume !(~q > ~p); 125797#L23 call #t~ret1 := parts(~p - ~q, ~q);< 125798#partsENTRY ~p := #in~p;~q := #in~q; 125807#L20 assume ~p <= 0;#res := 1; 125804#partsFINAL assume true; 125795#partsEXIT >#63#return; 125791#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 125793#partsENTRY ~p := #in~p;~q := #in~q; 125819#L20 assume !(~p <= 0); 125814#L21 assume ~q <= 0;#res := 0; 125811#partsFINAL assume true; 125789#partsEXIT >#65#return; 125787#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 125780#partsFINAL assume true; 125724#partsEXIT >#63#return; 125722#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 125723#partsENTRY ~p := #in~p;~q := #in~q; 125872#L20 assume !(~p <= 0); 125870#L21 assume ~q <= 0;#res := 0; 125869#partsFINAL assume true; 125721#partsEXIT >#65#return; 125719#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 125667#partsFINAL assume true; 125429#partsEXIT >#67#return; 125428#L36-1 havoc main_#t~ret8; 125427#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 125426#L35-3 assume !!(main_~q~0 <= main_~x~0); 125342#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 125377#partsENTRY ~p := #in~p;~q := #in~q; 125378#L20 assume !(~p <= 0); 125371#L21 assume !(~q <= 0); 125372#L22 assume !(~q > ~p); 125897#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126782#partsENTRY ~p := #in~p;~q := #in~q; 127221#L20 assume !(~p <= 0); 127220#L21 assume !(~q <= 0); 127219#L22 assume !(~q > ~p); 126152#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126158#partsENTRY ~p := #in~p;~q := #in~q; 126160#L20 assume ~p <= 0;#res := 1; 126159#partsFINAL assume true; 126151#partsEXIT >#63#return; 125994#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126001#partsENTRY ~p := #in~p;~q := #in~q; 126000#L20 assume !(~p <= 0); 125998#L21 assume !(~q <= 0); 125996#L22 assume !(~q > ~p); 125989#L23 call #t~ret1 := parts(~p - ~q, ~q);< 125991#partsENTRY ~p := #in~p;~q := #in~q; 126031#L20 assume !(~p <= 0); 126029#L21 assume !(~q <= 0); 126027#L22 assume ~q > ~p; 126023#L22-1 call #t~ret0 := parts(~p, ~p);< 126025#partsENTRY ~p := #in~p;~q := #in~q; 126061#L20 assume !(~p <= 0); 126058#L21 assume !(~q <= 0); 126054#L22 assume !(~q > ~p); 126049#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126050#partsENTRY ~p := #in~p;~q := #in~q; 126057#L20 assume ~p <= 0;#res := 1; 126053#partsFINAL assume true; 126048#partsEXIT >#63#return; 126044#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 126045#partsENTRY ~p := #in~p;~q := #in~q; 126056#L20 assume !(~p <= 0); 126052#L21 assume ~q <= 0;#res := 0; 126047#partsFINAL assume true; 126043#partsEXIT >#65#return; 126041#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 126037#partsFINAL assume true; 126021#partsEXIT >#61#return; 126011#L22-2 #res := #t~ret0;havoc #t~ret0; 126005#partsFINAL assume true; 125988#partsEXIT >#63#return; 125982#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 125984#partsENTRY ~p := #in~p;~q := #in~q; 126141#L20 assume !(~p <= 0); 126140#L21 assume !(~q <= 0); 126139#L22 assume !(~q > ~p); 125784#L23 call #t~ret1 := parts(~p - ~q, ~q);< 125856#partsENTRY ~p := #in~p;~q := #in~q; 125956#L20 assume !(~p <= 0); 125955#L21 assume !(~q <= 0); 125948#L22 assume !(~q > ~p); 125949#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126784#partsENTRY ~p := #in~p;~q := #in~q; 126777#L20 assume !(~p <= 0); 126778#L21 assume !(~q <= 0); 126761#L22 assume !(~q > ~p); 126762#L23 [2018-11-23 13:12:45,534 INFO L796 eck$LassoCheckResult]: Loop: 126762#L23 call #t~ret1 := parts(~p - ~q, ~q);< 126784#partsENTRY ~p := #in~p;~q := #in~q; 126777#L20 assume !(~p <= 0); 126778#L21 assume !(~q <= 0); 126761#L22 assume !(~q > ~p); 126762#L23 [2018-11-23 13:12:45,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:45,534 INFO L82 PathProgramCache]: Analyzing trace with hash 89652183, now seen corresponding path program 6 times [2018-11-23 13:12:45,534 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:45,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:45,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:45,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:45,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 273 proven. 129 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2018-11-23 13:12:45,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:45,602 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:45,613 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:12:45,648 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-11-23 13:12:45,648 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:12:45,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:45,796 INFO L134 CoverageAnalysis]: Checked inductivity of 796 backedges. 433 proven. 36 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2018-11-23 13:12:45,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:45,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 15 [2018-11-23 13:12:45,822 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:12:45,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:45,822 INFO L82 PathProgramCache]: Analyzing trace with hash 85891559, now seen corresponding path program 4 times [2018-11-23 13:12:45,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:45,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:45,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:45,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:45,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:45,887 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:45,887 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:45,887 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:45,887 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:45,887 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:12:45,887 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:45,887 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:45,887 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:45,887 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration22_Loop [2018-11-23 13:12:45,887 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:45,887 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:45,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:45,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:45,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:45,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:45,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:45,941 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:45,941 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:45,944 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:45,944 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:45,947 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:45,947 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:45,964 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:45,964 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:45,967 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:45,967 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:45,983 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:45,983 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:45,985 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:45,985 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:46,001 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:46,001 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:46,003 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:46,003 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:46,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:46,019 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:46,040 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:12:46,040 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:58,062 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-23 13:12:58,064 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:58,064 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:58,064 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:58,065 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:58,065 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:12:58,065 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:58,065 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:58,065 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:58,065 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration22_Loop [2018-11-23 13:12:58,065 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:58,065 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:58,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:58,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:58,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:58,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:58,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:58,097 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:58,097 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:12:58,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:58,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:58,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:58,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:58,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:58,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:58,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:58,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:58,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:12:58,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:12:58,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:12:58,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:12:58,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:12:58,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:12:58,099 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:12:58,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:12:58,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:12:58,101 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:12:58,103 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 13:12:58,103 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 13:12:58,103 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:12:58,104 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:12:58,104 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:12:58,104 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2018-11-23 13:12:58,104 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:12:58,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:58,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:58,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:58,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:58,272 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:12:58,272 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3022 states and 3583 transitions. cyclomatic complexity: 593 Second operand 7 states. [2018-11-23 13:12:58,327 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3022 states and 3583 transitions. cyclomatic complexity: 593. Second operand 7 states. Result 3075 states and 3643 transitions. Complement of second has 24 states. [2018-11-23 13:12:58,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:58,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:58,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-11-23 13:12:58,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 139 letters. Loop has 5 letters. [2018-11-23 13:12:58,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:58,329 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:12:58,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:58,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:58,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:58,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:58,463 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:12:58,463 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3022 states and 3583 transitions. cyclomatic complexity: 593 Second operand 7 states. [2018-11-23 13:12:58,536 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3022 states and 3583 transitions. cyclomatic complexity: 593. Second operand 7 states. Result 3070 states and 3638 transitions. Complement of second has 17 states. [2018-11-23 13:12:58,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:58,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 26 transitions. [2018-11-23 13:12:58,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 26 transitions. Stem has 139 letters. Loop has 5 letters. [2018-11-23 13:12:58,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:58,538 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:12:58,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:58,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:58,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:12:58,673 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:12:58,674 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3022 states and 3583 transitions. cyclomatic complexity: 593 Second operand 7 states. [2018-11-23 13:12:58,741 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3022 states and 3583 transitions. cyclomatic complexity: 593. Second operand 7 states. Result 4030 states and 4767 transitions. Complement of second has 40 states. [2018-11-23 13:12:58,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 13:12:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:12:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-23 13:12:58,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 139 letters. Loop has 5 letters. [2018-11-23 13:12:58,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:58,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 144 letters. Loop has 5 letters. [2018-11-23 13:12:58,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:58,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 139 letters. Loop has 10 letters. [2018-11-23 13:12:58,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:12:58,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4030 states and 4767 transitions. [2018-11-23 13:12:58,755 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 57 [2018-11-23 13:12:58,764 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4030 states to 3027 states and 3592 transitions. [2018-11-23 13:12:58,764 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 407 [2018-11-23 13:12:58,764 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 440 [2018-11-23 13:12:58,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3027 states and 3592 transitions. [2018-11-23 13:12:58,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:58,765 INFO L705 BuchiCegarLoop]: Abstraction has 3027 states and 3592 transitions. [2018-11-23 13:12:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3027 states and 3592 transitions. [2018-11-23 13:12:58,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3027 to 3022. [2018-11-23 13:12:58,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states. [2018-11-23 13:12:58,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 3583 transitions. [2018-11-23 13:12:58,790 INFO L728 BuchiCegarLoop]: Abstraction has 3022 states and 3583 transitions. [2018-11-23 13:12:58,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 13:12:58,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:12:58,790 INFO L87 Difference]: Start difference. First operand 3022 states and 3583 transitions. Second operand 15 states. [2018-11-23 13:12:59,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:12:59,029 INFO L93 Difference]: Finished difference Result 2903 states and 3432 transitions. [2018-11-23 13:12:59,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 13:12:59,029 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2903 states and 3432 transitions. [2018-11-23 13:12:59,035 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2018-11-23 13:12:59,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2903 states to 2641 states and 3142 transitions. [2018-11-23 13:12:59,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 305 [2018-11-23 13:12:59,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 305 [2018-11-23 13:12:59,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2641 states and 3142 transitions. [2018-11-23 13:12:59,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:12:59,047 INFO L705 BuchiCegarLoop]: Abstraction has 2641 states and 3142 transitions. [2018-11-23 13:12:59,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states and 3142 transitions. [2018-11-23 13:12:59,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 2561. [2018-11-23 13:12:59,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2561 states. [2018-11-23 13:12:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 3034 transitions. [2018-11-23 13:12:59,075 INFO L728 BuchiCegarLoop]: Abstraction has 2561 states and 3034 transitions. [2018-11-23 13:12:59,075 INFO L608 BuchiCegarLoop]: Abstraction has 2561 states and 3034 transitions. [2018-11-23 13:12:59,075 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-11-23 13:12:59,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2561 states and 3034 transitions. [2018-11-23 13:12:59,080 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2018-11-23 13:12:59,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:12:59,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:12:59,082 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [29, 24, 21, 13, 11, 10, 9, 9, 8, 8, 8, 8, 8, 8, 8, 6, 6, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2018-11-23 13:12:59,082 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:12:59,082 INFO L794 eck$LassoCheckResult]: Stem: 145349#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 145336#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 145337#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 145338#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 145339#L35-3 assume !!(main_~q~0 <= main_~x~0); 145475#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 145476#partsENTRY ~p := #in~p;~q := #in~q; 145478#L20 assume ~p <= 0;#res := 1; 145477#partsFINAL assume true; 145474#partsEXIT >#67#return; 145473#L36-1 havoc main_#t~ret8; 145471#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 145468#L35-3 assume !!(main_~q~0 <= main_~x~0); 145464#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 145465#partsENTRY ~p := #in~p;~q := #in~q; 145470#L20 assume ~p <= 0;#res := 1; 145467#partsFINAL assume true; 145463#partsEXIT >#67#return; 145461#L36-1 havoc main_#t~ret8; 145459#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 145455#L35-3 assume !!(main_~q~0 <= main_~x~0); 145449#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 145451#partsENTRY ~p := #in~p;~q := #in~q; 145458#L20 assume ~p <= 0;#res := 1; 145454#partsFINAL assume true; 145447#partsEXIT >#67#return; 145450#L36-1 havoc main_#t~ret8; 145457#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 145453#L35-3 assume !(main_~q~0 <= main_~x~0); 145446#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 145443#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 145428#L35-3 assume !!(main_~q~0 <= main_~x~0); 145425#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 145427#partsENTRY ~p := #in~p;~q := #in~q; 145439#L20 assume !(~p <= 0); 145436#L21 assume ~q <= 0;#res := 0; 145433#partsFINAL assume true; 145424#partsEXIT >#67#return; 145418#L36-1 havoc main_#t~ret8; 145413#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 145410#L35-3 assume !!(main_~q~0 <= main_~x~0); 145406#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 145408#partsENTRY ~p := #in~p;~q := #in~q; 145438#L20 assume !(~p <= 0); 145435#L21 assume !(~q <= 0); 145432#L22 assume !(~q > ~p); 145421#L23 call #t~ret1 := parts(~p - ~q, ~q);< 145422#partsENTRY ~p := #in~p;~q := #in~q; 145431#L20 assume ~p <= 0;#res := 1; 145430#partsFINAL assume true; 145420#partsEXIT >#63#return; 145415#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 145416#partsENTRY ~p := #in~p;~q := #in~q; 145445#L20 assume !(~p <= 0); 145429#L21 assume ~q <= 0;#res := 0; 145419#partsFINAL assume true; 145414#partsEXIT >#65#return; 145411#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 145409#partsFINAL assume true; 145404#partsEXIT >#67#return; 145401#L36-1 havoc main_#t~ret8; 145402#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 145580#L35-3 assume !!(main_~q~0 <= main_~x~0); 145569#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 145572#partsENTRY ~p := #in~p;~q := #in~q; 145678#L20 assume !(~p <= 0); 145676#L21 assume !(~q <= 0); 145670#L22 assume ~q > ~p; 145583#L22-1 call #t~ret0 := parts(~p, ~p);< 145584#partsENTRY ~p := #in~p;~q := #in~q; 145696#L20 assume !(~p <= 0); 145693#L21 assume !(~q <= 0); 145690#L22 assume !(~q > ~p); 145597#L23 call #t~ret1 := parts(~p - ~q, ~q);< 145600#partsENTRY ~p := #in~p;~q := #in~q; 145610#L20 assume ~p <= 0;#res := 1; 145603#partsFINAL assume true; 145595#partsEXIT >#63#return; 145593#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 145594#partsENTRY ~p := #in~p;~q := #in~q; 145632#L20 assume !(~p <= 0); 145623#L21 assume ~q <= 0;#res := 0; 145614#partsFINAL assume true; 145592#partsEXIT >#65#return; 145591#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 145587#partsFINAL assume true; 145582#partsEXIT >#61#return; 145581#L22-2 #res := #t~ret0;havoc #t~ret0; 145579#partsFINAL assume true; 145568#partsEXIT >#67#return; 145565#L36-1 havoc main_#t~ret8; 145562#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 145555#L35-3 assume !(main_~q~0 <= main_~x~0); 145553#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 145397#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 145398#L35-3 assume !!(main_~q~0 <= main_~x~0); 145535#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 145537#partsENTRY ~p := #in~p;~q := #in~q; 145552#L20 assume !(~p <= 0); 145549#L21 assume ~q <= 0;#res := 0; 145545#partsFINAL assume true; 145533#partsEXIT >#67#return; 145527#L36-1 havoc main_#t~ret8; 145515#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 145516#L35-3 assume !!(main_~q~0 <= main_~x~0); 145487#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 145488#partsENTRY ~p := #in~p;~q := #in~q; 145770#L20 assume !(~p <= 0); 145771#L21 assume !(~q <= 0); 145762#L22 assume !(~q > ~p); 145759#L23 call #t~ret1 := parts(~p - ~q, ~q);< 145989#partsENTRY ~p := #in~p;~q := #in~q; 145982#L20 assume !(~p <= 0); 145978#L21 assume !(~q <= 0); 145808#L22 assume !(~q > ~p); 145809#L23 call #t~ret1 := parts(~p - ~q, ~q);< 145961#partsENTRY ~p := #in~p;~q := #in~q; 145977#L20 assume !(~p <= 0); 145976#L21 assume !(~q <= 0); 145974#L22 assume !(~q > ~p); 145975#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146510#partsENTRY ~p := #in~p;~q := #in~q; 146579#L20 assume ~p <= 0;#res := 1; 146511#partsFINAL assume true; 146509#partsEXIT >#63#return; 146503#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146504#partsENTRY ~p := #in~p;~q := #in~q; 146520#L20 assume !(~p <= 0); 146514#L21 assume ~q <= 0;#res := 0; 146513#partsFINAL assume true; 146502#partsEXIT >#65#return; 146143#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 146501#partsFINAL assume true; 146144#partsEXIT >#63#return; 145816#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 145819#partsENTRY ~p := #in~p;~q := #in~q; 146146#L20 assume !(~p <= 0); 146145#L21 assume ~q <= 0;#res := 0; 145814#partsFINAL assume true; 145817#partsEXIT >#65#return; 145776#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 145777#partsFINAL assume true; 145758#partsEXIT >#63#return; 145520#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 145522#partsENTRY ~p := #in~p;~q := #in~q; 145780#L20 assume !(~p <= 0); 145781#L21 assume ~q <= 0;#res := 0; 145765#partsFINAL assume true; 145519#partsEXIT >#65#return; 145521#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 145507#partsFINAL assume true; 145509#partsEXIT >#67#return; 145483#L36-1 havoc main_#t~ret8; 145362#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 145363#L35-3 assume !!(main_~q~0 <= main_~x~0); 145392#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 145393#partsENTRY ~p := #in~p;~q := #in~q; 146415#L20 assume !(~p <= 0); 146413#L21 assume !(~q <= 0); 146126#L22 assume !(~q > ~p); 146418#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146420#partsENTRY ~p := #in~p;~q := #in~q; 146423#L20 assume ~p <= 0;#res := 1; 146421#partsFINAL assume true; 146417#partsEXIT >#63#return; 146403#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146416#partsENTRY ~p := #in~p;~q := #in~q; 146414#L20 assume !(~p <= 0); 146411#L21 assume !(~q <= 0); 146405#L22 assume !(~q > ~p); 146300#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146399#partsENTRY ~p := #in~p;~q := #in~q; 146307#L20 assume !(~p <= 0); 146303#L21 assume !(~q <= 0); 146301#L22 assume ~q > ~p; 146282#L22-1 call #t~ret0 := parts(~p, ~p);< 146285#partsENTRY ~p := #in~p;~q := #in~q; 146402#L20 assume !(~p <= 0); 146398#L21 assume !(~q <= 0); 146395#L22 assume !(~q > ~p); 146379#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146380#partsENTRY ~p := #in~p;~q := #in~q; 146391#L20 assume ~p <= 0;#res := 1; 146390#partsFINAL assume true; 146378#partsEXIT >#63#return; 146305#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146306#partsENTRY ~p := #in~p;~q := #in~q; 146349#L20 assume !(~p <= 0); 146314#L21 assume ~q <= 0;#res := 0; 146313#partsFINAL assume true; 146304#partsEXIT >#65#return; 146302#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 146299#partsFINAL assume true; 146281#partsEXIT >#61#return; 146284#L22-2 #res := #t~ret0;havoc #t~ret0; 146412#partsFINAL assume true; 146406#partsEXIT >#63#return; 146388#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 146401#partsENTRY ~p := #in~p;~q := #in~q; 146397#L20 assume !(~p <= 0); 146394#L21 assume !(~q <= 0); 146393#L22 assume !(~q > ~p); 146348#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146387#partsENTRY ~p := #in~p;~q := #in~q; 146386#L20 assume !(~p <= 0); 146384#L21 assume !(~q <= 0); 146382#L22 assume !(~q > ~p); 146316#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146351#partsENTRY ~p := #in~p;~q := #in~q; 146357#L20 assume !(~p <= 0); 146356#L21 assume !(~q <= 0); 146354#L22 assume !(~q > ~p); 146319#L23 [2018-11-23 13:12:59,082 INFO L796 eck$LassoCheckResult]: Loop: 146319#L23 call #t~ret1 := parts(~p - ~q, ~q);< 146351#partsENTRY ~p := #in~p;~q := #in~q; 146357#L20 assume !(~p <= 0); 146356#L21 assume !(~q <= 0); 146354#L22 assume !(~q > ~p); 146319#L23 [2018-11-23 13:12:59,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:59,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1008279748, now seen corresponding path program 7 times [2018-11-23 13:12:59,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:59,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:59,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:59,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:12:59,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:59,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1893 backedges. 471 proven. 39 refuted. 0 times theorem prover too weak. 1383 trivial. 0 not checked. [2018-11-23 13:12:59,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:12:59,180 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:12:59,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:12:59,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:12:59,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1893 backedges. 981 proven. 120 refuted. 0 times theorem prover too weak. 792 trivial. 0 not checked. [2018-11-23 13:12:59,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:12:59,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-11-23 13:12:59,365 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:12:59,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:12:59,366 INFO L82 PathProgramCache]: Analyzing trace with hash 85891559, now seen corresponding path program 5 times [2018-11-23 13:12:59,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:12:59,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:12:59,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:59,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:12:59,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:12:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:12:59,400 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:12:59,400 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:12:59,400 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:12:59,400 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:12:59,400 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:12:59,400 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:59,400 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:12:59,400 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:12:59,400 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration23_Loop [2018-11-23 13:12:59,400 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:12:59,401 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:12:59,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:59,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:59,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:59,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:59,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:12:59,433 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:12:59,433 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:59,434 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:59,435 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:59,437 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:59,437 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:59,452 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:59,453 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:59,455 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:59,455 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:59,470 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:59,470 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:12:59,472 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:12:59,472 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:59,487 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:12:59,487 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:12:59,507 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:12:59,507 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:13:08,161 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:13:08,163 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:13:08,163 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:13:08,163 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:13:08,163 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:13:08,164 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:13:08,164 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:08,164 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:13:08,164 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:13:08,164 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration23_Loop [2018-11-23 13:13:08,164 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:13:08,164 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:13:08,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:08,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:08,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:08,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:08,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:08,195 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:13:08,195 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:13:08,195 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:13:08,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:13:08,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:13:08,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:13:08,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:13:08,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:13:08,196 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:13:08,196 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:13:08,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:13:08,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:13:08,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:13:08,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:13:08,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:13:08,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:13:08,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:13:08,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:13:08,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:13:08,199 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:13:08,205 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:13:08,205 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 13:13:08,205 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:13:08,206 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:13:08,206 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:13:08,206 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2018-11-23 13:13:08,206 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:13:08,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:08,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:08,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:08,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:08,381 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:13:08,381 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2561 states and 3034 transitions. cyclomatic complexity: 495 Second operand 7 states. [2018-11-23 13:13:08,414 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2561 states and 3034 transitions. cyclomatic complexity: 495. Second operand 7 states. Result 2566 states and 3039 transitions. Complement of second has 10 states. [2018-11-23 13:13:08,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:13:08,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:13:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-23 13:13:08,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 212 letters. Loop has 5 letters. [2018-11-23 13:13:08,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:08,415 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:13:08,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:08,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:08,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:08,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:08,572 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:13:08,572 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2561 states and 3034 transitions. cyclomatic complexity: 495 Second operand 7 states. [2018-11-23 13:13:08,609 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2561 states and 3034 transitions. cyclomatic complexity: 495. Second operand 7 states. Result 2566 states and 3039 transitions. Complement of second has 10 states. [2018-11-23 13:13:08,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:13:08,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:13:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-23 13:13:08,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 212 letters. Loop has 5 letters. [2018-11-23 13:13:08,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:08,610 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:13:08,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:08,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:08,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:08,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:08,771 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:13:08,772 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2561 states and 3034 transitions. cyclomatic complexity: 495 Second operand 7 states. [2018-11-23 13:13:08,836 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2561 states and 3034 transitions. cyclomatic complexity: 495. Second operand 7 states. Result 3420 states and 4044 transitions. Complement of second has 40 states. [2018-11-23 13:13:08,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 13:13:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:13:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-23 13:13:08,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 212 letters. Loop has 5 letters. [2018-11-23 13:13:08,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:08,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 217 letters. Loop has 5 letters. [2018-11-23 13:13:08,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:08,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 212 letters. Loop has 10 letters. [2018-11-23 13:13:08,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:08,839 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3420 states and 4044 transitions. [2018-11-23 13:13:08,853 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2018-11-23 13:13:08,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3420 states to 2564 states and 3039 transitions. [2018-11-23 13:13:08,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 268 [2018-11-23 13:13:08,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 289 [2018-11-23 13:13:08,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2564 states and 3039 transitions. [2018-11-23 13:13:08,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:13:08,860 INFO L705 BuchiCegarLoop]: Abstraction has 2564 states and 3039 transitions. [2018-11-23 13:13:08,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2564 states and 3039 transitions. [2018-11-23 13:13:08,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2564 to 2561. [2018-11-23 13:13:08,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2561 states. [2018-11-23 13:13:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2561 states to 2561 states and 3034 transitions. [2018-11-23 13:13:08,879 INFO L728 BuchiCegarLoop]: Abstraction has 2561 states and 3034 transitions. [2018-11-23 13:13:08,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:13:08,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:13:08,879 INFO L87 Difference]: Start difference. First operand 2561 states and 3034 transitions. Second operand 19 states. [2018-11-23 13:13:09,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:09,489 INFO L93 Difference]: Finished difference Result 4319 states and 5232 transitions. [2018-11-23 13:13:09,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 13:13:09,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4319 states and 5232 transitions. [2018-11-23 13:13:09,498 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-23 13:13:09,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4319 states to 3890 states and 4735 transitions. [2018-11-23 13:13:09,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 338 [2018-11-23 13:13:09,509 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 338 [2018-11-23 13:13:09,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3890 states and 4735 transitions. [2018-11-23 13:13:09,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:13:09,509 INFO L705 BuchiCegarLoop]: Abstraction has 3890 states and 4735 transitions. [2018-11-23 13:13:09,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3890 states and 4735 transitions. [2018-11-23 13:13:09,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3890 to 3458. [2018-11-23 13:13:09,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3458 states. [2018-11-23 13:13:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4096 transitions. [2018-11-23 13:13:09,553 INFO L728 BuchiCegarLoop]: Abstraction has 3458 states and 4096 transitions. [2018-11-23 13:13:09,553 INFO L608 BuchiCegarLoop]: Abstraction has 3458 states and 4096 transitions. [2018-11-23 13:13:09,553 INFO L442 BuchiCegarLoop]: ======== Iteration 24============ [2018-11-23 13:13:09,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3458 states and 4096 transitions. [2018-11-23 13:13:09,560 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2018-11-23 13:13:09,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:13:09,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:13:09,562 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [28, 22, 20, 13, 10, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 5, 5, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1] [2018-11-23 13:13:09,562 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:13:09,562 INFO L794 eck$LassoCheckResult]: Stem: 166104#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 166091#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 166092#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 166097#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 166791#L35-3 assume !!(main_~q~0 <= main_~x~0); 166788#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 166789#partsENTRY ~p := #in~p;~q := #in~q; 166792#L20 assume ~p <= 0;#res := 1; 166790#partsFINAL assume true; 166787#partsEXIT >#67#return; 166786#L36-1 havoc main_#t~ret8; 166785#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 166784#L35-3 assume !!(main_~q~0 <= main_~x~0); 166782#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 166783#partsENTRY ~p := #in~p;~q := #in~q; 166953#L20 assume ~p <= 0;#res := 1; 166942#partsFINAL assume true; 166781#partsEXIT >#67#return; 166780#L36-1 havoc main_#t~ret8; 166714#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 166711#L35-3 assume !!(main_~q~0 <= main_~x~0); 166705#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 166707#partsENTRY ~p := #in~p;~q := #in~q; 166712#L20 assume ~p <= 0;#res := 1; 166713#partsFINAL assume true; 166704#partsEXIT >#67#return; 166703#L36-1 havoc main_#t~ret8; 166702#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 166701#L35-3 assume !(main_~q~0 <= main_~x~0); 166699#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 166697#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 166696#L35-3 assume !!(main_~q~0 <= main_~x~0); 166688#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 166691#partsENTRY ~p := #in~p;~q := #in~q; 166694#L20 assume !(~p <= 0); 166693#L21 assume ~q <= 0;#res := 0; 166692#partsFINAL assume true; 166687#partsEXIT >#67#return; 166686#L36-1 havoc main_#t~ret8; 166663#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 166664#L35-3 assume !!(main_~q~0 <= main_~x~0); 166659#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 166661#partsENTRY ~p := #in~p;~q := #in~q; 166685#L20 assume !(~p <= 0); 166684#L21 assume !(~q <= 0); 166681#L22 assume !(~q > ~p); 166677#L23 call #t~ret1 := parts(~p - ~q, ~q);< 166678#partsENTRY ~p := #in~p;~q := #in~q; 166683#L20 assume ~p <= 0;#res := 1; 166680#partsFINAL assume true; 166676#partsEXIT >#63#return; 166672#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 166673#partsENTRY ~p := #in~p;~q := #in~q; 166682#L20 assume !(~p <= 0); 166679#L21 assume ~q <= 0;#res := 0; 166675#partsFINAL assume true; 166671#partsEXIT >#65#return; 166669#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 166667#partsFINAL assume true; 166657#partsEXIT >#67#return; 166660#L36-1 havoc main_#t~ret8; 166652#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 166653#L35-3 assume !!(main_~q~0 <= main_~x~0); 166577#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 166579#partsENTRY ~p := #in~p;~q := #in~q; 166600#L20 assume !(~p <= 0); 166595#L21 assume !(~q <= 0); 166592#L22 assume ~q > ~p; 166586#L22-1 call #t~ret0 := parts(~p, ~p);< 166589#partsENTRY ~p := #in~p;~q := #in~q; 166622#L20 assume !(~p <= 0); 166618#L21 assume !(~q <= 0); 166613#L22 assume !(~q > ~p); 166604#L23 call #t~ret1 := parts(~p - ~q, ~q);< 166606#partsENTRY ~p := #in~p;~q := #in~q; 166616#L20 assume ~p <= 0;#res := 1; 166611#partsFINAL assume true; 166602#partsEXIT >#63#return; 166597#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 166598#partsENTRY ~p := #in~p;~q := #in~q; 166615#L20 assume !(~p <= 0); 166610#L21 assume ~q <= 0;#res := 0; 166601#partsFINAL assume true; 166596#partsEXIT >#65#return; 166593#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 166590#partsFINAL assume true; 166585#partsEXIT >#61#return; 166584#L22-2 #res := #t~ret0;havoc #t~ret0; 166583#partsFINAL assume true; 166576#partsEXIT >#67#return; 166574#L36-1 havoc main_#t~ret8; 166572#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 166571#L35-3 assume !(main_~q~0 <= main_~x~0); 166569#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 166567#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 166565#L35-3 assume !!(main_~q~0 <= main_~x~0); 166528#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 166533#partsENTRY ~p := #in~p;~q := #in~q; 166556#L20 assume !(~p <= 0); 166555#L21 assume ~q <= 0;#res := 0; 166539#partsFINAL assume true; 166527#partsEXIT >#67#return; 166520#L36-1 havoc main_#t~ret8; 166515#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 166512#L35-3 assume !!(main_~q~0 <= main_~x~0); 166504#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 166509#partsENTRY ~p := #in~p;~q := #in~q; 166550#L20 assume !(~p <= 0); 166545#L21 assume !(~q <= 0); 166538#L22 assume !(~q > ~p); 166525#L23 call #t~ret1 := parts(~p - ~q, ~q);< 166526#partsENTRY ~p := #in~p;~q := #in~q; 166554#L20 assume !(~p <= 0); 166553#L21 assume !(~q <= 0); 166551#L22 assume !(~q > ~p); 166547#L23 call #t~ret1 := parts(~p - ~q, ~q);< 166549#partsENTRY ~p := #in~p;~q := #in~q; 166560#L20 assume ~p <= 0;#res := 1; 166557#partsFINAL assume true; 166546#partsEXIT >#63#return; 166541#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 166544#partsENTRY ~p := #in~p;~q := #in~q; 166580#L20 assume !(~p <= 0); 166575#L21 assume ~q <= 0;#res := 0; 166564#partsFINAL assume true; 166540#partsEXIT >#65#return; 166537#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 166536#partsFINAL assume true; 166524#partsEXIT >#63#return; 166518#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 166519#partsENTRY ~p := #in~p;~q := #in~q; 166581#L20 assume !(~p <= 0); 166535#L21 assume ~q <= 0;#res := 0; 166523#partsFINAL assume true; 166517#partsEXIT >#65#return; 166514#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 166511#partsFINAL assume true; 166503#partsEXIT >#67#return; 166500#L36-1 havoc main_#t~ret8; 166494#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 166486#L35-3 assume !!(main_~q~0 <= main_~x~0); 166084#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 166414#partsENTRY ~p := #in~p;~q := #in~q; 166485#L20 assume !(~p <= 0); 166484#L21 assume !(~q <= 0); 166483#L22 assume ~q > ~p; 166187#L22-1 call #t~ret0 := parts(~p, ~p);< 166189#partsENTRY ~p := #in~p;~q := #in~q; 166229#L20 assume !(~p <= 0); 166225#L21 assume !(~q <= 0); 166226#L22 assume !(~q > ~p); 166212#L23 call #t~ret1 := parts(~p - ~q, ~q);< 166214#partsENTRY ~p := #in~p;~q := #in~q; 166227#L20 assume ~p <= 0;#res := 1; 166223#partsFINAL assume true; 166211#partsEXIT >#63#return; 166201#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 166204#partsENTRY ~p := #in~p;~q := #in~q; 166322#L20 assume !(~p <= 0); 166320#L21 assume !(~q <= 0); 166319#L22 assume !(~q > ~p); 166303#L23 call #t~ret1 := parts(~p - ~q, ~q);< 166304#partsENTRY ~p := #in~p;~q := #in~q; 166384#L20 assume !(~p <= 0); 166381#L21 assume !(~q <= 0); 166377#L22 assume ~q > ~p; 166335#L22-1 call #t~ret0 := parts(~p, ~p);< 166337#partsENTRY ~p := #in~p;~q := #in~q; 166364#L20 assume !(~p <= 0); 166361#L21 assume !(~q <= 0); 166359#L22 assume !(~q > ~p); 166356#L23 call #t~ret1 := parts(~p - ~q, ~q);< 166357#partsENTRY ~p := #in~p;~q := #in~q; 166382#L20 assume ~p <= 0;#res := 1; 166378#partsFINAL assume true; 166355#partsEXIT >#63#return; 166352#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 166353#partsENTRY ~p := #in~p;~q := #in~q; 166383#L20 assume !(~p <= 0); 166380#L21 assume ~q <= 0;#res := 0; 166376#partsFINAL assume true; 166351#partsEXIT >#65#return; 166348#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 166345#partsFINAL assume true; 166333#partsEXIT >#61#return; 166327#L22-2 #res := #t~ret0;havoc #t~ret0; 166325#partsFINAL assume true; 166301#partsEXIT >#63#return; 166292#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 166295#partsENTRY ~p := #in~p;~q := #in~q; 166403#L20 assume !(~p <= 0); 166404#L21 assume !(~q <= 0); 166393#L22 assume !(~q > ~p); 166246#L23 call #t~ret1 := parts(~p - ~q, ~q);< 166253#partsENTRY ~p := #in~p;~q := #in~q; 166476#L20 assume !(~p <= 0); 166474#L21 assume !(~q <= 0); 166472#L22 assume !(~q > ~p); 166436#L23 call #t~ret1 := parts(~p - ~q, ~q);< 166470#partsENTRY ~p := #in~p;~q := #in~q; 166498#L20 assume !(~p <= 0); 166492#L21 assume !(~q <= 0); 166491#L22 assume !(~q > ~p); 166435#L23 [2018-11-23 13:13:09,562 INFO L796 eck$LassoCheckResult]: Loop: 166435#L23 call #t~ret1 := parts(~p - ~q, ~q);< 166470#partsENTRY ~p := #in~p;~q := #in~q; 166498#L20 assume !(~p <= 0); 166492#L21 assume !(~q <= 0); 166491#L22 assume !(~q > ~p); 166435#L23 [2018-11-23 13:13:09,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:09,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1734313687, now seen corresponding path program 8 times [2018-11-23 13:13:09,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:09,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:09,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:09,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:09,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1708 backedges. 424 proven. 171 refuted. 0 times theorem prover too weak. 1113 trivial. 0 not checked. [2018-11-23 13:13:09,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:09,675 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:13:09,684 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:13:09,723 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:13:09,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:09,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:09,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1708 backedges. 870 proven. 8 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked. [2018-11-23 13:13:09,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:09,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2018-11-23 13:13:09,891 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:13:09,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:09,892 INFO L82 PathProgramCache]: Analyzing trace with hash 85891559, now seen corresponding path program 6 times [2018-11-23 13:13:09,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:09,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:09,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:09,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:09,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:09,932 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:13:09,932 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:13:09,932 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:13:09,932 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:13:09,932 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:13:09,932 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:09,932 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:13:09,933 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:13:09,933 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration24_Loop [2018-11-23 13:13:09,933 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:13:09,933 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:13:09,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:09,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:09,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:09,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:09,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:09,964 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:13:09,964 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:09,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:13:09,966 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:09,985 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:13:09,986 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:13:22,007 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-23 13:13:22,009 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:13:22,010 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:13:22,010 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:13:22,010 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:13:22,010 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:13:22,010 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:22,010 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:13:22,010 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:13:22,010 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration24_Loop [2018-11-23 13:13:22,010 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:13:22,010 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:13:22,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:22,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:22,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:22,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:22,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:22,045 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:13:22,045 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:13:22,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:13:22,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:13:22,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:13:22,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:13:22,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:13:22,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:13:22,046 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:13:22,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:13:22,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:13:22,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:13:22,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:13:22,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:13:22,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:13:22,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:13:22,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:13:22,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:13:22,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:13:22,049 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:13:22,051 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:13:22,051 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 13:13:22,051 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:13:22,051 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:13:22,051 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:13:22,051 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2018-11-23 13:13:22,051 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:13:22,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:22,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:22,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:22,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:22,206 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:13:22,206 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3458 states and 4096 transitions. cyclomatic complexity: 672 Second operand 7 states. [2018-11-23 13:13:22,241 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3458 states and 4096 transitions. cyclomatic complexity: 672. Second operand 7 states. Result 3463 states and 4101 transitions. Complement of second has 10 states. [2018-11-23 13:13:22,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:13:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:13:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-23 13:13:22,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 203 letters. Loop has 5 letters. [2018-11-23 13:13:22,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:22,242 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:13:22,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:22,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:22,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:22,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:22,425 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:13:22,425 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3458 states and 4096 transitions. cyclomatic complexity: 672 Second operand 7 states. [2018-11-23 13:13:22,480 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3458 states and 4096 transitions. cyclomatic complexity: 672. Second operand 7 states. Result 3463 states and 4101 transitions. Complement of second has 10 states. [2018-11-23 13:13:22,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:13:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:13:22,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-23 13:13:22,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 203 letters. Loop has 5 letters. [2018-11-23 13:13:22,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:22,480 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:13:22,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:22,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:22,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:22,653 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:13:22,653 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3458 states and 4096 transitions. cyclomatic complexity: 672 Second operand 7 states. [2018-11-23 13:13:22,721 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3458 states and 4096 transitions. cyclomatic complexity: 672. Second operand 7 states. Result 4654 states and 5503 transitions. Complement of second has 40 states. [2018-11-23 13:13:22,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 13:13:22,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:13:22,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-23 13:13:22,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 203 letters. Loop has 5 letters. [2018-11-23 13:13:22,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:22,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 208 letters. Loop has 5 letters. [2018-11-23 13:13:22,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:22,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 203 letters. Loop has 10 letters. [2018-11-23 13:13:22,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:22,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4654 states and 5503 transitions. [2018-11-23 13:13:22,736 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2018-11-23 13:13:22,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4654 states to 3466 states and 4106 transitions. [2018-11-23 13:13:22,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 254 [2018-11-23 13:13:22,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 277 [2018-11-23 13:13:22,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3466 states and 4106 transitions. [2018-11-23 13:13:22,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:13:22,747 INFO L705 BuchiCegarLoop]: Abstraction has 3466 states and 4106 transitions. [2018-11-23 13:13:22,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3466 states and 4106 transitions. [2018-11-23 13:13:22,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3466 to 3458. [2018-11-23 13:13:22,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3458 states. [2018-11-23 13:13:22,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3458 states to 3458 states and 4096 transitions. [2018-11-23 13:13:22,777 INFO L728 BuchiCegarLoop]: Abstraction has 3458 states and 4096 transitions. [2018-11-23 13:13:22,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 13:13:22,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:13:22,778 INFO L87 Difference]: Start difference. First operand 3458 states and 4096 transitions. Second operand 21 states. [2018-11-23 13:13:23,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:23,295 INFO L93 Difference]: Finished difference Result 5503 states and 6361 transitions. [2018-11-23 13:13:23,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 13:13:23,296 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5503 states and 6361 transitions. [2018-11-23 13:13:23,307 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-23 13:13:23,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5503 states to 3081 states and 3543 transitions. [2018-11-23 13:13:23,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 336 [2018-11-23 13:13:23,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 347 [2018-11-23 13:13:23,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3081 states and 3543 transitions. [2018-11-23 13:13:23,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:13:23,315 INFO L705 BuchiCegarLoop]: Abstraction has 3081 states and 3543 transitions. [2018-11-23 13:13:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3081 states and 3543 transitions. [2018-11-23 13:13:23,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3081 to 2931. [2018-11-23 13:13:23,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2931 states. [2018-11-23 13:13:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2931 states to 2931 states and 3361 transitions. [2018-11-23 13:13:23,343 INFO L728 BuchiCegarLoop]: Abstraction has 2931 states and 3361 transitions. [2018-11-23 13:13:23,343 INFO L608 BuchiCegarLoop]: Abstraction has 2931 states and 3361 transitions. [2018-11-23 13:13:23,343 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-23 13:13:23,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2931 states and 3361 transitions. [2018-11-23 13:13:23,347 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2018-11-23 13:13:23,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:13:23,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:13:23,349 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [38, 38, 26, 15, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1] [2018-11-23 13:13:23,350 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [25, 25, 20, 12, 9, 9, 9, 9, 9, 9, 8, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1] [2018-11-23 13:13:23,350 INFO L794 eck$LassoCheckResult]: Stem: 192765#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 192753#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 192754#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 192755#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 192756#L35-3 assume !!(main_~q~0 <= main_~x~0); 193125#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 193126#partsENTRY ~p := #in~p;~q := #in~q; 193128#L20 assume ~p <= 0;#res := 1; 193127#partsFINAL assume true; 193124#partsEXIT >#67#return; 193123#L36-1 havoc main_#t~ret8; 193122#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 193120#L35-3 assume !!(main_~q~0 <= main_~x~0); 193117#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 193118#partsENTRY ~p := #in~p;~q := #in~q; 193121#L20 assume ~p <= 0;#res := 1; 193119#partsFINAL assume true; 193116#partsEXIT >#67#return; 193115#L36-1 havoc main_#t~ret8; 193114#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 193111#L35-3 assume !!(main_~q~0 <= main_~x~0); 193106#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 193108#partsENTRY ~p := #in~p;~q := #in~q; 193112#L20 assume ~p <= 0;#res := 1; 193109#partsFINAL assume true; 193105#partsEXIT >#67#return; 193104#L36-1 havoc main_#t~ret8; 193102#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 193099#L35-3 assume !!(main_~q~0 <= main_~x~0); 193094#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 193096#partsENTRY ~p := #in~p;~q := #in~q; 193101#L20 assume ~p <= 0;#res := 1; 193098#partsFINAL assume true; 193093#partsEXIT >#67#return; 193092#L36-1 havoc main_#t~ret8; 193090#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 193088#L35-3 assume !(main_~q~0 <= main_~x~0); 192764#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 192757#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 192758#L35-3 assume !!(main_~q~0 <= main_~x~0); 193055#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 193056#partsENTRY ~p := #in~p;~q := #in~q; 193073#L20 assume !(~p <= 0); 193072#L21 assume ~q <= 0;#res := 0; 193070#partsFINAL assume true; 193054#partsEXIT >#67#return; 193052#L36-1 havoc main_#t~ret8; 193050#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 193049#L35-3 assume !!(main_~q~0 <= main_~x~0); 193047#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 193048#partsENTRY ~p := #in~p;~q := #in~q; 193103#L20 assume !(~p <= 0); 193100#L21 assume !(~q <= 0); 193097#L22 assume !(~q > ~p); 193061#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193062#partsENTRY ~p := #in~p;~q := #in~q; 193067#L20 assume ~p <= 0;#res := 1; 193065#partsFINAL assume true; 193060#partsEXIT >#63#return; 193058#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 193059#partsENTRY ~p := #in~p;~q := #in~q; 193071#L20 assume !(~p <= 0); 193069#L21 assume ~q <= 0;#res := 0; 193068#partsFINAL assume true; 193057#partsEXIT >#65#return; 193053#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 193051#partsFINAL assume true; 193046#partsEXIT >#67#return; 193045#L36-1 havoc main_#t~ret8; 193040#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 193037#L35-3 assume !!(main_~q~0 <= main_~x~0); 192982#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 192984#partsENTRY ~p := #in~p;~q := #in~q; 193041#L20 assume !(~p <= 0); 193038#L21 assume !(~q <= 0); 193035#L22 assume ~q > ~p; 192993#L22-1 call #t~ret0 := parts(~p, ~p);< 192995#partsENTRY ~p := #in~p;~q := #in~q; 193091#L20 assume !(~p <= 0); 193089#L21 assume !(~q <= 0); 193086#L22 assume !(~q > ~p); 193078#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193081#partsENTRY ~p := #in~p;~q := #in~q; 193087#L20 assume ~p <= 0;#res := 1; 193082#partsFINAL assume true; 193075#partsEXIT >#63#return; 193043#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 193044#partsENTRY ~p := #in~p;~q := #in~q; 193066#L20 assume !(~p <= 0); 193064#L21 assume ~q <= 0;#res := 0; 193063#partsFINAL assume true; 193042#partsEXIT >#65#return; 193039#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 193036#partsFINAL assume true; 192991#partsEXIT >#61#return; 192994#L22-2 #res := #t~ret0;havoc #t~ret0; 193034#partsFINAL assume true; 192981#partsEXIT >#67#return; 192979#L36-1 havoc main_#t~ret8; 192972#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 192969#L35-3 assume !!(main_~q~0 <= main_~x~0); 192964#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 192966#partsENTRY ~p := #in~p;~q := #in~q; 193025#L20 assume !(~p <= 0); 193023#L21 assume !(~q <= 0); 193021#L22 assume ~q > ~p; 192977#L22-1 call #t~ret0 := parts(~p, ~p);< 192978#partsENTRY ~p := #in~p;~q := #in~q; 193011#L20 assume !(~p <= 0); 193010#L21 assume !(~q <= 0); 193009#L22 assume !(~q > ~p); 193005#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193008#partsENTRY ~p := #in~p;~q := #in~q; 193017#L20 assume ~p <= 0;#res := 1; 193012#partsFINAL assume true; 193004#partsEXIT >#63#return; 193001#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 193002#partsENTRY ~p := #in~p;~q := #in~q; 193033#L20 assume !(~p <= 0); 193031#L21 assume ~q <= 0;#res := 0; 193029#partsFINAL assume true; 193000#partsEXIT >#65#return; 192998#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 192996#partsFINAL assume true; 192976#partsEXIT >#61#return; 192971#L22-2 #res := #t~ret0;havoc #t~ret0; 192968#partsFINAL assume true; 192963#partsEXIT >#67#return; 192961#L36-1 havoc main_#t~ret8; 192960#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 192958#L35-3 assume !(main_~q~0 <= main_~x~0); 192956#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 192953#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 192920#L35-3 assume !!(main_~q~0 <= main_~x~0); 192916#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 192917#partsENTRY ~p := #in~p;~q := #in~q; 192942#L20 assume !(~p <= 0); 192927#L21 assume ~q <= 0;#res := 0; 192924#partsFINAL assume true; 192915#partsEXIT >#67#return; 192908#L36-1 havoc main_#t~ret8; 192904#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 192896#L35-3 assume !!(main_~q~0 <= main_~x~0); 192892#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 192893#partsENTRY ~p := #in~p;~q := #in~q; 192937#L20 assume !(~p <= 0); 192926#L21 assume !(~q <= 0); 192923#L22 assume !(~q > ~p); 192912#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192914#partsENTRY ~p := #in~p;~q := #in~q; 192941#L20 assume !(~p <= 0); 192940#L21 assume !(~q <= 0); 192938#L22 assume !(~q > ~p); 192934#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192936#partsENTRY ~p := #in~p;~q := #in~q; 192946#L20 assume ~p <= 0;#res := 1; 192945#partsFINAL assume true; 192933#partsEXIT >#63#return; 192929#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192932#partsENTRY ~p := #in~p;~q := #in~q; 192949#L20 assume !(~p <= 0); 192947#L21 assume ~q <= 0;#res := 0; 192943#partsFINAL assume true; 192928#partsEXIT >#65#return; 192925#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 192918#partsFINAL assume true; 192910#partsEXIT >#63#return; 192906#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192907#partsENTRY ~p := #in~p;~q := #in~q; 192922#L20 assume !(~p <= 0); 192921#L21 assume ~q <= 0;#res := 0; 192909#partsFINAL assume true; 192905#partsEXIT >#65#return; 192903#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 192895#partsFINAL assume true; 192891#partsEXIT >#67#return; 192887#L36-1 havoc main_#t~ret8; 192883#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 192880#L35-3 assume !!(main_~q~0 <= main_~x~0); 192875#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 192877#partsENTRY ~p := #in~p;~q := #in~q; 193671#L20 assume !(~p <= 0); 193669#L21 assume !(~q <= 0); 193474#L22 assume !(~q > ~p); 193453#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193455#partsENTRY ~p := #in~p;~q := #in~q; 193473#L20 assume ~p <= 0;#res := 1; 193460#partsFINAL assume true; 193462#partsEXIT >#63#return; 193779#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 193992#partsENTRY ~p := #in~p;~q := #in~q; 193990#L20 assume !(~p <= 0); 193987#L21 assume !(~q <= 0); 193983#L22 assume !(~q > ~p); 193765#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193769#partsENTRY ~p := #in~p;~q := #in~q; 193999#L20 assume !(~p <= 0); 193996#L21 assume !(~q <= 0); 193995#L22 assume !(~q > ~p); 193812#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193813#partsENTRY ~p := #in~p;~q := #in~q; 194011#L20 assume ~p <= 0;#res := 1; 193998#partsFINAL assume true; 193810#partsEXIT >#63#return; 193790#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 193793#partsENTRY ~p := #in~p;~q := #in~q; 194120#L20 assume !(~p <= 0); 193814#L21 assume ~q <= 0;#res := 0; 193807#partsFINAL assume true; 193787#partsEXIT >#65#return; 193783#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 193778#partsFINAL assume true; 193764#partsEXIT >#63#return; 193768#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 193887#partsENTRY ~p := #in~p;~q := #in~q; 193898#L20 assume !(~p <= 0); 193896#L21 assume ~q <= 0;#res := 0; 193895#partsFINAL assume true; 193885#partsEXIT >#65#return; 193886#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 193994#partsFINAL assume true; 193993#partsEXIT >#65#return; 193354#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 193352#partsFINAL assume true; 192874#partsEXIT >#67#return; 192868#L36-1 havoc main_#t~ret8; 192866#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 192816#L35-3 assume !!(main_~q~0 <= main_~x~0); 192817#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 192864#partsENTRY ~p := #in~p;~q := #in~q; 192863#L20 assume !(~p <= 0); 192862#L21 assume !(~q <= 0); 192861#L22 assume ~q > ~p; 192828#L22-1 call #t~ret0 := parts(~p, ~p);< 192829#partsENTRY ~p := #in~p;~q := #in~q; 193285#L20 assume !(~p <= 0); 193283#L21 assume !(~q <= 0); 193281#L22 assume !(~q > ~p); 193278#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193279#partsENTRY ~p := #in~p;~q := #in~q; 193287#L20 assume ~p <= 0;#res := 1; 193286#partsFINAL assume true; 193277#partsEXIT >#63#return; 193246#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 193276#partsENTRY ~p := #in~p;~q := #in~q; 193274#L20 assume !(~p <= 0); 193272#L21 assume !(~q <= 0); 193270#L22 assume !(~q > ~p); 192796#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193243#partsENTRY ~p := #in~p;~q := #in~q; 193240#L20 assume !(~p <= 0); 193226#L21 assume !(~q <= 0); 193222#L22 assume ~q > ~p; 192795#L22-1 call #t~ret0 := parts(~p, ~p);< 192797#partsENTRY ~p := #in~p;~q := #in~q; 193434#L20 assume !(~p <= 0); 193433#L21 assume !(~q <= 0); 193431#L22 assume !(~q > ~p); 193422#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193423#partsENTRY ~p := #in~p;~q := #in~q; 193430#L20 assume ~p <= 0;#res := 1; 193428#partsFINAL assume true; 193421#partsEXIT >#63#return; 193418#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 193419#partsENTRY ~p := #in~p;~q := #in~q; 193432#L20 assume !(~p <= 0); 193429#L21 assume ~q <= 0;#res := 0; 193427#partsFINAL assume true; 193417#partsEXIT >#65#return; 193409#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 193402#partsFINAL assume true; 193399#partsEXIT >#61#return; 193395#L22-2 #res := #t~ret0;havoc #t~ret0; 193394#partsFINAL assume true; 193388#partsEXIT >#63#return; 193381#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 193382#partsENTRY ~p := #in~p;~q := #in~q; 193397#L20 assume !(~p <= 0); 193390#L21 assume ~q <= 0;#res := 0; 193387#partsFINAL assume true; 193380#partsEXIT >#65#return; 193377#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 193372#partsFINAL assume true; 193368#partsEXIT >#65#return; 193367#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 193366#partsFINAL assume true; 193365#partsEXIT >#61#return; 193364#L22-2 #res := #t~ret0;havoc #t~ret0; 193363#partsFINAL assume true; 193362#partsEXIT >#67#return; 192811#L36-1 [2018-11-23 13:13:23,350 INFO L796 eck$LassoCheckResult]: Loop: 192811#L36-1 havoc main_#t~ret8; 192773#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 192759#L35-3 assume !(main_~q~0 <= main_~x~0); 192760#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 192763#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 192810#L35-3 assume !!(main_~q~0 <= main_~x~0); 192806#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 192807#partsENTRY ~p := #in~p;~q := #in~q; 192821#L20 assume !(~p <= 0); 192820#L21 assume ~q <= 0;#res := 0; 192819#partsFINAL assume true; 192818#partsEXIT >#67#return; 192792#L36-1 havoc main_#t~ret8; 192793#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 194133#L35-3 assume !!(main_~q~0 <= main_~x~0); 194128#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 194131#partsENTRY ~p := #in~p;~q := #in~q; 194144#L20 assume !(~p <= 0); 194142#L21 assume !(~q <= 0); 194141#L22 assume !(~q > ~p); 194139#L23 call #t~ret1 := parts(~p - ~q, ~q);< 194140#partsENTRY ~p := #in~p;~q := #in~q; 194161#L20 assume !(~p <= 0); 194157#L21 assume !(~q <= 0); 194155#L22 assume !(~q > ~p); 194152#L23 call #t~ret1 := parts(~p - ~q, ~q);< 194154#partsENTRY ~p := #in~p;~q := #in~q; 194172#L20 assume !(~p <= 0); 194165#L21 assume !(~q <= 0); 194159#L22 assume !(~q > ~p); 194160#L23 call #t~ret1 := parts(~p - ~q, ~q);< 194177#partsENTRY ~p := #in~p;~q := #in~q; 194195#L20 assume ~p <= 0;#res := 1; 194180#partsFINAL assume true; 194176#partsEXIT >#63#return; 194169#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 194170#partsENTRY ~p := #in~p;~q := #in~q; 194179#L20 assume !(~p <= 0); 194178#L21 assume ~q <= 0;#res := 0; 194175#partsFINAL assume true; 194168#partsEXIT >#65#return; 194149#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 194156#partsFINAL assume true; 194151#partsEXIT >#63#return; 194147#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 194150#partsENTRY ~p := #in~p;~q := #in~q; 194186#L20 assume !(~p <= 0); 194184#L21 assume ~q <= 0;#res := 0; 194182#partsFINAL assume true; 194146#partsEXIT >#65#return; 194145#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 194143#partsFINAL assume true; 194138#partsEXIT >#63#return; 194136#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 194137#partsENTRY ~p := #in~p;~q := #in~q; 194191#L20 assume !(~p <= 0); 194189#L21 assume ~q <= 0;#res := 0; 194187#partsFINAL assume true; 194135#partsEXIT >#65#return; 194134#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 194132#partsFINAL assume true; 194127#partsEXIT >#67#return; 194124#L36-1 havoc main_#t~ret8; 194123#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 194122#L35-3 assume !!(main_~q~0 <= main_~x~0); 193305#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 193306#partsENTRY ~p := #in~p;~q := #in~q; 193468#L20 assume !(~p <= 0); 193466#L21 assume !(~q <= 0); 193467#L22 assume !(~q > ~p); 193450#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193463#partsENTRY ~p := #in~p;~q := #in~q; 193823#L20 assume ~p <= 0;#res := 1; 193822#partsFINAL assume true; 193449#partsEXIT >#63#return; 193452#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 194095#partsENTRY ~p := #in~p;~q := #in~q; 194086#L20 assume !(~p <= 0); 194085#L21 assume !(~q <= 0); 194048#L22 assume !(~q > ~p); 193512#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193688#partsENTRY ~p := #in~p;~q := #in~q; 193679#L20 assume !(~p <= 0); 193676#L21 assume !(~q <= 0); 193668#L22 assume ~q > ~p; 193494#L22-1 call #t~ret0 := parts(~p, ~p);< 193501#partsENTRY ~p := #in~p;~q := #in~q; 193637#L20 assume !(~p <= 0); 193633#L21 assume !(~q <= 0); 193631#L22 assume !(~q > ~p); 193548#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193549#partsENTRY ~p := #in~p;~q := #in~q; 193556#L20 assume ~p <= 0;#res := 1; 193552#partsFINAL assume true; 193547#partsEXIT >#63#return; 193545#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 193546#partsENTRY ~p := #in~p;~q := #in~q; 193570#L20 assume !(~p <= 0); 193566#L21 assume ~q <= 0;#res := 0; 193562#partsFINAL assume true; 193544#partsEXIT >#65#return; 193514#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 193510#partsFINAL assume true; 193493#partsEXIT >#61#return; 193499#L22-2 #res := #t~ret0;havoc #t~ret0; 194174#partsFINAL assume true; 194166#partsEXIT >#63#return; 194167#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 194216#partsENTRY ~p := #in~p;~q := #in~q; 194219#L20 assume !(~p <= 0); 194218#L21 assume ~q <= 0;#res := 0; 194217#partsFINAL assume true; 194215#partsEXIT >#65#return; 194214#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 194212#partsFINAL assume true; 194210#partsEXIT >#65#return; 194209#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 194208#partsFINAL assume true; 194207#partsEXIT >#67#return; 193301#L36-1 havoc main_#t~ret8; 192822#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 192823#L35-3 assume !!(main_~q~0 <= main_~x~0); 192813#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 192814#partsENTRY ~p := #in~p;~q := #in~q; 192835#L20 assume !(~p <= 0); 192832#L21 assume !(~q <= 0); 192830#L22 assume ~q > ~p; 192827#L22-1 call #t~ret0 := parts(~p, ~p);< 192859#partsENTRY ~p := #in~p;~q := #in~q; 192857#L20 assume !(~p <= 0); 192853#L21 assume !(~q <= 0); 192850#L22 assume !(~q > ~p); 192845#L23 call #t~ret1 := parts(~p - ~q, ~q);< 192846#partsENTRY ~p := #in~p;~q := #in~q; 192851#L20 assume ~p <= 0;#res := 1; 192847#partsFINAL assume true; 192843#partsEXIT >#63#return; 192839#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 192842#partsENTRY ~p := #in~p;~q := #in~q; 193211#L20 assume !(~p <= 0); 193207#L21 assume !(~q <= 0); 193203#L22 assume !(~q > ~p); 193184#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193185#partsENTRY ~p := #in~p;~q := #in~q; 193294#L20 assume !(~p <= 0); 193293#L21 assume !(~q <= 0); 193290#L22 assume ~q > ~p; 193196#L22-1 call #t~ret0 := parts(~p, ~p);< 193197#partsENTRY ~p := #in~p;~q := #in~q; 193214#L20 assume !(~p <= 0); 193213#L21 assume !(~q <= 0); 193212#L22 assume !(~q > ~p); 193209#L23 call #t~ret1 := parts(~p - ~q, ~q);< 193210#partsENTRY ~p := #in~p;~q := #in~q; 193216#L20 assume ~p <= 0;#res := 1; 193215#partsFINAL assume true; 193208#partsEXIT >#63#return; 193205#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 193206#partsENTRY ~p := #in~p;~q := #in~q; 193223#L20 assume !(~p <= 0); 193218#L21 assume ~q <= 0;#res := 0; 193217#partsFINAL assume true; 193204#partsEXIT >#65#return; 193202#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 193201#partsFINAL assume true; 193195#partsEXIT >#61#return; 193193#L22-2 #res := #t~ret0;havoc #t~ret0; 193192#partsFINAL assume true; 193182#partsEXIT >#63#return; 193173#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 193177#partsENTRY ~p := #in~p;~q := #in~q; 193264#L20 assume !(~p <= 0); 193191#L21 assume ~q <= 0;#res := 0; 193179#partsFINAL assume true; 193172#partsEXIT >#65#return; 192871#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 192867#partsFINAL assume true; 192838#partsEXIT >#65#return; 192834#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 192831#partsFINAL assume true; 192826#partsEXIT >#61#return; 192825#L22-2 #res := #t~ret0;havoc #t~ret0; 192824#partsFINAL assume true; 192812#partsEXIT >#67#return; 192811#L36-1 [2018-11-23 13:13:23,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:23,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1086999448, now seen corresponding path program 9 times [2018-11-23 13:13:23,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:23,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:23,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:23,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:23,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:23,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3690 backedges. 563 proven. 263 refuted. 0 times theorem prover too weak. 2864 trivial. 0 not checked. [2018-11-23 13:13:23,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:23,534 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:13:23,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:13:23,584 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 13:13:23,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:23,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3690 backedges. 768 proven. 25 refuted. 0 times theorem prover too weak. 2897 trivial. 0 not checked. [2018-11-23 13:13:23,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:23,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2018-11-23 13:13:23,688 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:13:23,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:23,688 INFO L82 PathProgramCache]: Analyzing trace with hash -500958004, now seen corresponding path program 4 times [2018-11-23 13:13:23,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:23,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:23,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:23,689 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:23,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:23,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1598 backedges. 178 proven. 182 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [2018-11-23 13:13:23,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:23,758 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:13:23,766 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 13:13:23,795 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 13:13:23,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:23,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1598 backedges. 870 proven. 209 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2018-11-23 13:13:23,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:23,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15] total 20 [2018-11-23 13:13:23,917 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:13:23,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 13:13:23,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-11-23 13:13:23,918 INFO L87 Difference]: Start difference. First operand 2931 states and 3361 transitions. cyclomatic complexity: 453 Second operand 20 states. [2018-11-23 13:13:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:24,475 INFO L93 Difference]: Finished difference Result 3626 states and 4388 transitions. [2018-11-23 13:13:24,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 13:13:24,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3626 states and 4388 transitions. [2018-11-23 13:13:24,484 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-11-23 13:13:24,493 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3626 states to 3314 states and 3996 transitions. [2018-11-23 13:13:24,493 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 477 [2018-11-23 13:13:24,493 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 477 [2018-11-23 13:13:24,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3314 states and 3996 transitions. [2018-11-23 13:13:24,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:13:24,494 INFO L705 BuchiCegarLoop]: Abstraction has 3314 states and 3996 transitions. [2018-11-23 13:13:24,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3314 states and 3996 transitions. [2018-11-23 13:13:24,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3314 to 2661. [2018-11-23 13:13:24,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2661 states. [2018-11-23 13:13:24,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 3033 transitions. [2018-11-23 13:13:24,517 INFO L728 BuchiCegarLoop]: Abstraction has 2661 states and 3033 transitions. [2018-11-23 13:13:24,517 INFO L608 BuchiCegarLoop]: Abstraction has 2661 states and 3033 transitions. [2018-11-23 13:13:24,517 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-23 13:13:24,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2661 states and 3033 transitions. [2018-11-23 13:13:24,522 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2018-11-23 13:13:24,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:13:24,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:13:24,524 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [37, 37, 25, 14, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2018-11-23 13:13:24,524 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [41, 41, 33, 20, 16, 16, 16, 16, 16, 16, 13, 8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1] [2018-11-23 13:13:24,525 INFO L794 eck$LassoCheckResult]: Stem: 200813#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 200807#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 200808#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 200809#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 200810#L35-3 assume !!(main_~q~0 <= main_~x~0); 201289#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 201290#partsENTRY ~p := #in~p;~q := #in~q; 201292#L20 assume ~p <= 0;#res := 1; 201291#partsFINAL assume true; 201288#partsEXIT >#67#return; 201287#L36-1 havoc main_#t~ret8; 201286#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 201284#L35-3 assume !!(main_~q~0 <= main_~x~0); 201280#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 201281#partsENTRY ~p := #in~p;~q := #in~q; 201285#L20 assume ~p <= 0;#res := 1; 201283#partsFINAL assume true; 201279#partsEXIT >#67#return; 201277#L36-1 havoc main_#t~ret8; 201275#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 201201#L35-3 assume !!(main_~q~0 <= main_~x~0); 201197#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 201199#partsENTRY ~p := #in~p;~q := #in~q; 201262#L20 assume ~p <= 0;#res := 1; 201261#partsFINAL assume true; 201196#partsEXIT >#67#return; 201195#L36-1 havoc main_#t~ret8; 201119#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 201117#L35-3 assume !!(main_~q~0 <= main_~x~0); 201113#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 201115#partsENTRY ~p := #in~p;~q := #in~q; 201123#L20 assume ~p <= 0;#res := 1; 201121#partsFINAL assume true; 201112#partsEXIT >#67#return; 200901#L36-1 havoc main_#t~ret8; 200900#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 200899#L35-3 assume !(main_~q~0 <= main_~x~0); 200818#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 200811#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 200812#L35-3 assume !!(main_~q~0 <= main_~x~0); 200816#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 201566#partsENTRY ~p := #in~p;~q := #in~q; 201591#L20 assume !(~p <= 0); 201590#L21 assume ~q <= 0;#res := 0; 201589#partsFINAL assume true; 201564#partsEXIT >#67#return; 201565#L36-1 havoc main_#t~ret8; 200835#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 200836#L35-3 assume !!(main_~q~0 <= main_~x~0); 201585#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 201588#partsENTRY ~p := #in~p;~q := #in~q; 201625#L20 assume !(~p <= 0); 201624#L21 assume !(~q <= 0); 201621#L22 assume !(~q > ~p); 201616#L23 call #t~ret1 := parts(~p - ~q, ~q);< 201617#partsENTRY ~p := #in~p;~q := #in~q; 201623#L20 assume ~p <= 0;#res := 1; 201620#partsFINAL assume true; 201615#partsEXIT >#63#return; 201611#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201612#partsENTRY ~p := #in~p;~q := #in~q; 201622#L20 assume !(~p <= 0); 201619#L21 assume ~q <= 0;#res := 0; 201614#partsFINAL assume true; 201610#partsEXIT >#65#return; 201608#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201584#partsFINAL assume true; 201586#partsEXIT >#67#return; 201559#L36-1 havoc main_#t~ret8; 201560#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 201587#L35-3 assume !!(main_~q~0 <= main_~x~0); 200872#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 200873#partsENTRY ~p := #in~p;~q := #in~q; 202361#L20 assume !(~p <= 0); 202301#L21 assume !(~q <= 0); 202295#L22 assume ~q > ~p; 202264#L22-1 call #t~ret0 := parts(~p, ~p);< 202285#partsENTRY ~p := #in~p;~q := #in~q; 202284#L20 assume !(~p <= 0); 202282#L21 assume !(~q <= 0); 202278#L22 assume !(~q > ~p); 202258#L23 call #t~ret1 := parts(~p - ~q, ~q);< 202262#partsENTRY ~p := #in~p;~q := #in~q; 202267#L20 assume ~p <= 0;#res := 1; 202263#partsFINAL assume true; 202257#partsEXIT >#63#return; 202261#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 202398#partsENTRY ~p := #in~p;~q := #in~q; 202401#L20 assume !(~p <= 0); 202400#L21 assume ~q <= 0;#res := 0; 202399#partsFINAL assume true; 202397#partsEXIT >#65#return; 202396#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 202395#partsFINAL assume true; 202391#partsEXIT >#61#return; 202392#L22-2 #res := #t~ret0;havoc #t~ret0; 202390#partsFINAL assume true; 202386#partsEXIT >#67#return; 200855#L36-1 havoc main_#t~ret8; 200856#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 201108#L35-3 assume !!(main_~q~0 <= main_~x~0); 201105#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 201107#partsENTRY ~p := #in~p;~q := #in~q; 201137#L20 assume !(~p <= 0); 201132#L21 assume !(~q <= 0); 201129#L22 assume ~q > ~p; 201125#L22-1 call #t~ret0 := parts(~p, ~p);< 201126#partsENTRY ~p := #in~p;~q := #in~q; 201161#L20 assume !(~p <= 0); 201158#L21 assume !(~q <= 0); 201153#L22 assume !(~q > ~p); 201144#L23 call #t~ret1 := parts(~p - ~q, ~q);< 201147#partsENTRY ~p := #in~p;~q := #in~q; 201156#L20 assume ~p <= 0;#res := 1; 201151#partsFINAL assume true; 201143#partsEXIT >#63#return; 201135#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201136#partsENTRY ~p := #in~p;~q := #in~q; 201155#L20 assume !(~p <= 0); 201150#L21 assume ~q <= 0;#res := 0; 201142#partsFINAL assume true; 201134#partsEXIT >#65#return; 201131#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201128#partsFINAL assume true; 201124#partsEXIT >#61#return; 201122#L22-2 #res := #t~ret0;havoc #t~ret0; 201120#partsFINAL assume true; 201104#partsEXIT >#67#return; 201103#L36-1 havoc main_#t~ret8; 201101#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 201099#L35-3 assume !(main_~q~0 <= main_~x~0); 201097#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 201095#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 200987#L35-3 assume !!(main_~q~0 <= main_~x~0); 200984#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 200985#partsENTRY ~p := #in~p;~q := #in~q; 201005#L20 assume !(~p <= 0); 201003#L21 assume ~q <= 0;#res := 0; 200997#partsFINAL assume true; 200983#partsEXIT >#67#return; 200977#L36-1 havoc main_#t~ret8; 200973#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 200971#L35-3 assume !!(main_~q~0 <= main_~x~0); 200968#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 200969#partsENTRY ~p := #in~p;~q := #in~q; 201044#L20 assume !(~p <= 0); 201043#L21 assume !(~q <= 0); 201042#L22 assume !(~q > ~p); 200979#L23 call #t~ret1 := parts(~p - ~q, ~q);< 200982#partsENTRY ~p := #in~p;~q := #in~q; 201167#L20 assume !(~p <= 0); 201165#L21 assume !(~q <= 0); 201164#L22 assume !(~q > ~p); 201052#L23 call #t~ret1 := parts(~p - ~q, ~q);< 201054#partsENTRY ~p := #in~p;~q := #in~q; 201066#L20 assume ~p <= 0;#res := 1; 201055#partsFINAL assume true; 201051#partsEXIT >#63#return; 201047#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201050#partsENTRY ~p := #in~p;~q := #in~q; 201063#L20 assume !(~p <= 0); 201061#L21 assume ~q <= 0;#res := 0; 201058#partsFINAL assume true; 201046#partsEXIT >#65#return; 201045#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201040#partsFINAL assume true; 200978#partsEXIT >#63#return; 200981#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201110#partsENTRY ~p := #in~p;~q := #in~q; 201118#L20 assume !(~p <= 0); 201116#L21 assume ~q <= 0;#res := 0; 201111#partsFINAL assume true; 201109#partsEXIT >#65#return; 201096#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 200988#partsFINAL assume true; 200967#partsEXIT >#67#return; 200965#L36-1 havoc main_#t~ret8; 200932#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 200933#L35-3 assume !!(main_~q~0 <= main_~x~0); 200914#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 200918#partsENTRY ~p := #in~p;~q := #in~q; 201092#L20 assume !(~p <= 0); 201090#L21 assume !(~q <= 0); 201087#L22 assume !(~q > ~p); 200959#L23 call #t~ret1 := parts(~p - ~q, ~q);< 200961#partsENTRY ~p := #in~p;~q := #in~q; 200990#L20 assume ~p <= 0;#res := 1; 200986#partsFINAL assume true; 200957#partsEXIT >#63#return; 200960#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201024#partsENTRY ~p := #in~p;~q := #in~q; 201019#L20 assume !(~p <= 0); 201011#L21 assume !(~q <= 0); 201009#L22 assume !(~q > ~p); 201000#L23 call #t~ret1 := parts(~p - ~q, ~q);< 201002#partsENTRY ~p := #in~p;~q := #in~q; 201102#L20 assume !(~p <= 0); 201100#L21 assume !(~q <= 0); 201098#L22 assume !(~q > ~p); 201022#L23 call #t~ret1 := parts(~p - ~q, ~q);< 201023#partsENTRY ~p := #in~p;~q := #in~q; 201076#L20 assume ~p <= 0;#res := 1; 201072#partsFINAL assume true; 201020#partsEXIT >#63#return; 201015#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201018#partsENTRY ~p := #in~p;~q := #in~q; 201089#L20 assume !(~p <= 0); 201086#L21 assume ~q <= 0;#res := 0; 201081#partsFINAL assume true; 201012#partsEXIT >#65#return; 201010#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201008#partsFINAL assume true; 200998#partsEXIT >#63#return; 201001#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201141#partsENTRY ~p := #in~p;~q := #in~q; 201154#L20 assume !(~p <= 0); 201149#L21 assume ~q <= 0;#res := 0; 201148#partsFINAL assume true; 201140#partsEXIT >#65#return; 201139#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201138#partsFINAL assume true; 201133#partsEXIT >#65#return; 201130#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201127#partsFINAL assume true; 200913#partsEXIT >#67#return; 200910#L36-1 havoc main_#t~ret8; 200897#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 200898#L35-3 assume !!(main_~q~0 <= main_~x~0); 200889#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 200891#partsENTRY ~p := #in~p;~q := #in~q; 201208#L20 assume !(~p <= 0); 201207#L21 assume !(~q <= 0); 201206#L22 assume ~q > ~p; 201174#L22-1 call #t~ret0 := parts(~p, ~p);< 201175#partsENTRY ~p := #in~p;~q := #in~q; 201802#L20 assume !(~p <= 0); 201800#L21 assume !(~q <= 0); 201793#L22 assume !(~q > ~p); 201794#L23 call #t~ret1 := parts(~p - ~q, ~q);< 201812#partsENTRY ~p := #in~p;~q := #in~q; 201813#L20 assume ~p <= 0;#res := 1; 201805#partsFINAL assume true; 201806#partsEXIT >#63#return; 201778#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201779#partsENTRY ~p := #in~p;~q := #in~q; 201843#L20 assume !(~p <= 0); 201838#L21 assume !(~q <= 0); 201835#L22 assume !(~q > ~p); 201828#L23 call #t~ret1 := parts(~p - ~q, ~q);< 201832#partsENTRY ~p := #in~p;~q := #in~q; 201855#L20 assume !(~p <= 0); 201854#L21 assume !(~q <= 0); 201851#L22 assume !(~q > ~p); 201846#L23 call #t~ret1 := parts(~p - ~q, ~q);< 201847#partsENTRY ~p := #in~p;~q := #in~q; 201853#L20 assume ~p <= 0;#res := 1; 201850#partsFINAL assume true; 201845#partsEXIT >#63#return; 201840#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201841#partsENTRY ~p := #in~p;~q := #in~q; 201852#L20 assume !(~p <= 0); 201849#L21 assume ~q <= 0;#res := 0; 201844#partsFINAL assume true; 201839#partsEXIT >#65#return; 201836#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201833#partsFINAL assume true; 201827#partsEXIT >#63#return; 201822#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201824#partsENTRY ~p := #in~p;~q := #in~q; 201887#L20 assume !(~p <= 0); 201879#L21 assume ~q <= 0;#res := 0; 201880#partsFINAL assume true; 201821#partsEXIT >#65#return; 201823#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201814#partsFINAL assume true; 201815#partsEXIT >#65#return; 201775#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201774#partsFINAL assume true; 201173#partsEXIT >#61#return; 200912#L22-2 #res := #t~ret0;havoc #t~ret0; 200908#partsFINAL assume true; 200909#partsEXIT >#67#return; 200884#L36-1 [2018-11-23 13:13:24,525 INFO L796 eck$LassoCheckResult]: Loop: 200884#L36-1 havoc main_#t~ret8; 200834#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 200814#L35-3 assume !(main_~q~0 <= main_~x~0); 200815#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 200817#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 200885#L35-3 assume !!(main_~q~0 <= main_~x~0); 200870#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 200871#partsENTRY ~p := #in~p;~q := #in~q; 200895#L20 assume !(~p <= 0); 200894#L21 assume ~q <= 0;#res := 0; 200893#partsFINAL assume true; 200892#partsEXIT >#67#return; 200853#L36-1 havoc main_#t~ret8; 200854#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 201485#L35-3 assume !!(main_~q~0 <= main_~x~0); 201482#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 201483#partsENTRY ~p := #in~p;~q := #in~q; 201514#L20 assume !(~p <= 0); 201512#L21 assume !(~q <= 0); 201510#L22 assume !(~q > ~p); 201508#L23 call #t~ret1 := parts(~p - ~q, ~q);< 201509#partsENTRY ~p := #in~p;~q := #in~q; 201709#L20 assume !(~p <= 0); 201708#L21 assume !(~q <= 0); 201707#L22 assume !(~q > ~p); 201704#L23 call #t~ret1 := parts(~p - ~q, ~q);< 201706#partsENTRY ~p := #in~p;~q := #in~q; 201715#L20 assume !(~p <= 0); 201714#L21 assume !(~q <= 0); 201712#L22 assume !(~q > ~p); 201713#L23 call #t~ret1 := parts(~p - ~q, ~q);< 203122#partsENTRY ~p := #in~p;~q := #in~q; 203124#L20 assume ~p <= 0;#res := 1; 203123#partsFINAL assume true; 203121#partsEXIT >#63#return; 203119#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 203120#partsENTRY ~p := #in~p;~q := #in~q; 203131#L20 assume !(~p <= 0); 203130#L21 assume ~q <= 0;#res := 0; 203128#partsFINAL assume true; 203118#partsEXIT >#65#return; 201700#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 203095#partsFINAL assume true; 201703#partsEXIT >#63#return; 201698#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201701#partsENTRY ~p := #in~p;~q := #in~q; 201773#L20 assume !(~p <= 0); 201711#L21 assume ~q <= 0;#res := 0; 201710#partsFINAL assume true; 201697#partsEXIT >#65#return; 201694#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201691#partsFINAL assume true; 201507#partsEXIT >#63#return; 201504#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201505#partsENTRY ~p := #in~p;~q := #in~q; 201513#L20 assume !(~p <= 0); 201511#L21 assume ~q <= 0;#res := 0; 201506#partsFINAL assume true; 201503#partsEXIT >#65#return; 201501#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201499#partsFINAL assume true; 201481#partsEXIT >#67#return; 201478#L36-1 havoc main_#t~ret8; 201474#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 201472#L35-3 assume !!(main_~q~0 <= main_~x~0); 201468#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 201470#partsENTRY ~p := #in~p;~q := #in~q; 201502#L20 assume !(~p <= 0); 201500#L21 assume !(~q <= 0); 201498#L22 assume !(~q > ~p); 201094#L23 call #t~ret1 := parts(~p - ~q, ~q);< 200962#partsENTRY ~p := #in~p;~q := #in~q; 201464#L20 assume !(~p <= 0); 202410#L21 assume !(~q <= 0); 202408#L22 assume ~q > ~p; 201449#L22-1 call #t~ret0 := parts(~p, ~p);< 201454#partsENTRY ~p := #in~p;~q := #in~q; 201453#L20 assume !(~p <= 0); 201452#L21 assume !(~q <= 0); 201451#L22 assume !(~q > ~p); 201447#L23 call #t~ret1 := parts(~p - ~q, ~q);< 201415#partsENTRY ~p := #in~p;~q := #in~q; 201462#L20 assume ~p <= 0;#res := 1; 201446#partsFINAL assume true; 201448#partsEXIT >#63#return; 201770#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201411#partsENTRY ~p := #in~p;~q := #in~q; 201934#L20 assume !(~p <= 0); 201890#L21 assume !(~q <= 0); 201891#L22 assume !(~q > ~p); 201790#L23 call #t~ret1 := parts(~p - ~q, ~q);< 201792#partsENTRY ~p := #in~p;~q := #in~q; 201918#L20 assume !(~p <= 0); 201914#L21 assume !(~q <= 0); 201912#L22 assume !(~q > ~p); 201909#L23 call #t~ret1 := parts(~p - ~q, ~q);< 201910#partsENTRY ~p := #in~p;~q := #in~q; 201932#L20 assume ~p <= 0;#res := 1; 201930#partsFINAL assume true; 201908#partsEXIT >#63#return; 201896#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201897#partsENTRY ~p := #in~p;~q := #in~q; 201905#L20 assume !(~p <= 0); 201903#L21 assume ~q <= 0;#res := 0; 201901#partsFINAL assume true; 201895#partsEXIT >#65#return; 201892#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201893#partsFINAL assume true; 201789#partsEXIT >#63#return; 201791#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 202008#partsENTRY ~p := #in~p;~q := #in~q; 201807#L20 assume !(~p <= 0); 201808#L21 assume ~q <= 0;#res := 0; 201795#partsFINAL assume true; 201796#partsEXIT >#65#return; 201780#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201781#partsFINAL assume true; 202006#partsEXIT >#65#return; 202007#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 202432#partsFINAL assume true; 202428#partsEXIT >#61#return; 202429#L22-2 #res := #t~ret0;havoc #t~ret0; 202678#partsFINAL assume true; 201480#partsEXIT >#63#return; 201476#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201477#partsENTRY ~p := #in~p;~q := #in~q; 201497#L20 assume !(~p <= 0); 201496#L21 assume !(~q <= 0); 201494#L22 assume !(~q > ~p); 201491#L23 call #t~ret1 := parts(~p - ~q, ~q);< 201492#partsENTRY ~p := #in~p;~q := #in~q; 201618#L20 assume !(~p <= 0); 201613#L21 assume !(~q <= 0); 201609#L22 assume !(~q > ~p); 201084#L23 call #t~ret1 := parts(~p - ~q, ~q);< 201607#partsENTRY ~p := #in~p;~q := #in~q; 202064#L20 assume !(~p <= 0); 202063#L21 assume !(~q <= 0); 202061#L22 assume !(~q > ~p); 202058#L23 call #t~ret1 := parts(~p - ~q, ~q);< 202059#partsENTRY ~p := #in~p;~q := #in~q; 202062#L20 assume ~p <= 0;#res := 1; 202060#partsFINAL assume true; 202057#partsEXIT >#63#return; 201013#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201018#partsENTRY ~p := #in~p;~q := #in~q; 201089#L20 assume !(~p <= 0); 201086#L21 assume ~q <= 0;#res := 0; 201081#partsFINAL assume true; 201012#partsEXIT >#65#return; 201016#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 202365#partsFINAL assume true; 201606#partsEXIT >#63#return; 201573#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201577#partsENTRY ~p := #in~p;~q := #in~q; 201600#L20 assume !(~p <= 0); 201597#L21 assume ~q <= 0;#res := 0; 201596#partsFINAL assume true; 201572#partsEXIT >#65#return; 201567#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201561#partsFINAL assume true; 201490#partsEXIT >#63#return; 201487#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201488#partsENTRY ~p := #in~p;~q := #in~q; 201495#L20 assume !(~p <= 0); 201493#L21 assume ~q <= 0;#res := 0; 201489#partsFINAL assume true; 201486#partsEXIT >#65#return; 201484#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201479#partsFINAL assume true; 201475#partsEXIT >#65#return; 201473#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201471#partsFINAL assume true; 201467#partsEXIT >#67#return; 201465#L36-1 havoc main_#t~ret8; 200924#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 200923#L35-3 assume !!(main_~q~0 <= main_~x~0); 200887#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 200920#partsENTRY ~p := #in~p;~q := #in~q; 201646#L20 assume !(~p <= 0); 201647#L21 assume !(~q <= 0); 201758#L22 assume ~q > ~p; 201627#L22-1 call #t~ret0 := parts(~p, ~p);< 201628#partsENTRY ~p := #in~p;~q := #in~q; 201675#L20 assume !(~p <= 0); 201673#L21 assume !(~q <= 0); 201670#L22 assume !(~q > ~p); 201659#L23 call #t~ret1 := parts(~p - ~q, ~q);< 201662#partsENTRY ~p := #in~p;~q := #in~q; 202588#L20 assume ~p <= 0;#res := 1; 202587#partsFINAL assume true; 201657#partsEXIT >#63#return; 201661#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 202529#partsENTRY ~p := #in~p;~q := #in~q; 202530#L20 assume !(~p <= 0); 202525#L21 assume !(~q <= 0); 202526#L22 assume !(~q > ~p); 202515#L23 call #t~ret1 := parts(~p - ~q, ~q);< 202518#partsENTRY ~p := #in~p;~q := #in~q; 202718#L20 assume !(~p <= 0); 202716#L21 assume !(~q <= 0); 202714#L22 assume ~q > ~p; 202695#L22-1 call #t~ret0 := parts(~p, ~p);< 202697#partsENTRY ~p := #in~p;~q := #in~q; 202712#L20 assume !(~p <= 0); 202710#L21 assume !(~q <= 0); 202709#L22 assume !(~q > ~p); 202707#L23 call #t~ret1 := parts(~p - ~q, ~q);< 202708#partsENTRY ~p := #in~p;~q := #in~q; 202713#L20 assume ~p <= 0;#res := 1; 202711#partsFINAL assume true; 202706#partsEXIT >#63#return; 202704#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 202705#partsENTRY ~p := #in~p;~q := #in~q; 202722#L20 assume !(~p <= 0); 202721#L21 assume ~q <= 0;#res := 0; 202720#partsFINAL assume true; 202703#partsEXIT >#65#return; 202702#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 202701#partsFINAL assume true; 202694#partsEXIT >#61#return; 202690#L22-2 #res := #t~ret0;havoc #t~ret0; 202687#partsFINAL assume true; 202514#partsEXIT >#63#return; 202512#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 202513#partsENTRY ~p := #in~p;~q := #in~q; 202699#L20 assume !(~p <= 0); 202698#L21 assume ~q <= 0;#res := 0; 202692#partsFINAL assume true; 202688#partsEXIT >#65#return; 202490#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 202483#partsFINAL assume true; 202484#partsEXIT >#65#return; 201645#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201641#partsFINAL assume true; 201626#partsEXIT >#61#return; 200935#L22-2 #res := #t~ret0;havoc #t~ret0; 200929#partsFINAL assume true; 200915#partsEXIT >#67#return; 200916#L36-1 havoc main_#t~ret8; 200925#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 200896#L35-3 assume !!(main_~q~0 <= main_~x~0); 200888#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 200922#partsENTRY ~p := #in~p;~q := #in~q; 201681#L20 assume !(~p <= 0); 201682#L21 assume !(~q <= 0); 200939#L22 assume ~q > ~p; 200937#L22-1 call #t~ret0 := parts(~p, ~p);< 200938#partsENTRY ~p := #in~p;~q := #in~q; 201222#L20 assume !(~p <= 0); 201219#L21 assume !(~q <= 0); 201217#L22 assume !(~q > ~p); 201214#L23 call #t~ret1 := parts(~p - ~q, ~q);< 201216#partsENTRY ~p := #in~p;~q := #in~q; 201221#L20 assume ~p <= 0;#res := 1; 201218#partsFINAL assume true; 201213#partsEXIT >#63#return; 201182#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201187#partsENTRY ~p := #in~p;~q := #in~q; 201249#L20 assume !(~p <= 0); 201242#L21 assume !(~q <= 0); 201241#L22 assume !(~q > ~p); 201234#L23 call #t~ret1 := parts(~p - ~q, ~q);< 201240#partsENTRY ~p := #in~p;~q := #in~q; 201722#L20 assume !(~p <= 0); 201720#L21 assume !(~q <= 0); 201717#L22 assume !(~q > ~p); 201718#L23 call #t~ret1 := parts(~p - ~q, ~q);< 202015#partsENTRY ~p := #in~p;~q := #in~q; 202020#L20 assume ~p <= 0;#res := 1; 202013#partsFINAL assume true; 202014#partsEXIT >#63#return; 201257#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201260#partsENTRY ~p := #in~p;~q := #in~q; 201268#L20 assume !(~p <= 0); 201266#L21 assume ~q <= 0;#res := 0; 201263#partsFINAL assume true; 201255#partsEXIT >#65#return; 201254#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201243#partsFINAL assume true; 201233#partsEXIT >#63#return; 201229#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 201232#partsENTRY ~p := #in~p;~q := #in~q; 201282#L20 assume !(~p <= 0); 201278#L21 assume ~q <= 0;#res := 0; 201276#partsFINAL assume true; 201228#partsEXIT >#65#return; 201223#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201209#partsFINAL assume true; 201180#partsEXIT >#65#return; 201178#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 201176#partsFINAL assume true; 200936#partsEXIT >#61#return; 200931#L22-2 #res := #t~ret0;havoc #t~ret0; 200930#partsFINAL assume true; 200886#partsEXIT >#67#return; 200884#L36-1 [2018-11-23 13:13:24,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:24,526 INFO L82 PathProgramCache]: Analyzing trace with hash -2031234513, now seen corresponding path program 10 times [2018-11-23 13:13:24,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:24,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:24,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:24,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:24,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:24,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:24,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:24,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:24,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1376411771, now seen corresponding path program 5 times [2018-11-23 13:13:24,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:24,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:24,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:24,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:24,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4415 backedges. 469 proven. 134 refuted. 0 times theorem prover too weak. 3812 trivial. 0 not checked. [2018-11-23 13:13:24,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:24,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:13:24,663 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:13:24,714 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 13:13:24,714 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:24,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:24,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4415 backedges. 2619 proven. 192 refuted. 0 times theorem prover too weak. 1604 trivial. 0 not checked. [2018-11-23 13:13:24,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:24,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13] total 17 [2018-11-23 13:13:24,873 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:13:24,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:13:24,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:13:24,874 INFO L87 Difference]: Start difference. First operand 2661 states and 3033 transitions. cyclomatic complexity: 393 Second operand 17 states. [2018-11-23 13:13:25,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:25,648 INFO L93 Difference]: Finished difference Result 3722 states and 4480 transitions. [2018-11-23 13:13:25,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 13:13:25,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3722 states and 4480 transitions. [2018-11-23 13:13:25,658 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2018-11-23 13:13:25,665 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3722 states to 2708 states and 3171 transitions. [2018-11-23 13:13:25,665 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 349 [2018-11-23 13:13:25,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 349 [2018-11-23 13:13:25,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2708 states and 3171 transitions. [2018-11-23 13:13:25,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:13:25,665 INFO L705 BuchiCegarLoop]: Abstraction has 2708 states and 3171 transitions. [2018-11-23 13:13:25,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2708 states and 3171 transitions. [2018-11-23 13:13:25,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2708 to 2224. [2018-11-23 13:13:25,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2018-11-23 13:13:25,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 2492 transitions. [2018-11-23 13:13:25,692 INFO L728 BuchiCegarLoop]: Abstraction has 2224 states and 2492 transitions. [2018-11-23 13:13:25,692 INFO L608 BuchiCegarLoop]: Abstraction has 2224 states and 2492 transitions. [2018-11-23 13:13:25,692 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-11-23 13:13:25,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2224 states and 2492 transitions. [2018-11-23 13:13:25,697 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2018-11-23 13:13:25,697 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:13:25,697 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:13:25,699 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [37, 37, 25, 14, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2018-11-23 13:13:25,699 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [41, 41, 33, 20, 16, 16, 16, 16, 16, 16, 13, 8, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1] [2018-11-23 13:13:25,699 INFO L794 eck$LassoCheckResult]: Stem: 208158#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 208146#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 208147#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 208148#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 208149#L35-3 assume !!(main_~q~0 <= main_~x~0); 208157#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 208202#partsENTRY ~p := #in~p;~q := #in~q; 209023#L20 assume ~p <= 0;#res := 1; 209022#partsFINAL assume true; 209019#partsEXIT >#67#return; 209016#L36-1 havoc main_#t~ret8; 208983#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 208978#L35-3 assume !!(main_~q~0 <= main_~x~0); 208975#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 208976#partsENTRY ~p := #in~p;~q := #in~q; 209011#L20 assume ~p <= 0;#res := 1; 209010#partsFINAL assume true; 208974#partsEXIT >#67#return; 208972#L36-1 havoc main_#t~ret8; 208970#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 208856#L35-3 assume !!(main_~q~0 <= main_~x~0); 208850#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 208852#partsENTRY ~p := #in~p;~q := #in~q; 208873#L20 assume ~p <= 0;#res := 1; 208871#partsFINAL assume true; 208849#partsEXIT >#67#return; 208848#L36-1 havoc main_#t~ret8; 208841#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 208838#L35-3 assume !!(main_~q~0 <= main_~x~0); 208825#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 208826#partsENTRY ~p := #in~p;~q := #in~q; 208835#L20 assume ~p <= 0;#res := 1; 208834#partsFINAL assume true; 208824#partsEXIT >#67#return; 208820#L36-1 havoc main_#t~ret8; 208816#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 208809#L35-3 assume !(main_~q~0 <= main_~x~0); 208806#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 208801#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 208795#L35-3 assume !!(main_~q~0 <= main_~x~0); 208791#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 208792#partsENTRY ~p := #in~p;~q := #in~q; 208805#L20 assume !(~p <= 0); 208800#L21 assume ~q <= 0;#res := 0; 208794#partsFINAL assume true; 208790#partsEXIT >#67#return; 208788#L36-1 havoc main_#t~ret8; 208785#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 208782#L35-3 assume !!(main_~q~0 <= main_~x~0); 208725#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 208726#partsENTRY ~p := #in~p;~q := #in~q; 208765#L20 assume !(~p <= 0); 208763#L21 assume !(~q <= 0); 208759#L22 assume !(~q > ~p); 208754#L23 call #t~ret1 := parts(~p - ~q, ~q);< 208755#partsENTRY ~p := #in~p;~q := #in~q; 208762#L20 assume ~p <= 0;#res := 1; 208758#partsFINAL assume true; 208753#partsEXIT >#63#return; 208749#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 208750#partsENTRY ~p := #in~p;~q := #in~q; 208761#L20 assume !(~p <= 0); 208757#L21 assume ~q <= 0;#res := 0; 208752#partsFINAL assume true; 208748#partsEXIT >#65#return; 208745#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 208741#partsFINAL assume true; 208724#partsEXIT >#67#return; 208709#L36-1 havoc main_#t~ret8; 208701#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 208697#L35-3 assume !!(main_~q~0 <= main_~x~0); 208690#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 208692#partsENTRY ~p := #in~p;~q := #in~q; 208718#L20 assume !(~p <= 0); 208716#L21 assume !(~q <= 0); 208715#L22 assume ~q > ~p; 208705#L22-1 call #t~ret0 := parts(~p, ~p);< 208708#partsENTRY ~p := #in~p;~q := #in~q; 208786#L20 assume !(~p <= 0); 208783#L21 assume !(~q <= 0); 208779#L22 assume !(~q > ~p); 208770#L23 call #t~ret1 := parts(~p - ~q, ~q);< 208774#partsENTRY ~p := #in~p;~q := #in~q; 208781#L20 assume ~p <= 0;#res := 1; 208776#partsFINAL assume true; 208768#partsEXIT >#63#return; 208720#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 208721#partsENTRY ~p := #in~p;~q := #in~q; 208738#L20 assume !(~p <= 0); 208736#L21 assume ~q <= 0;#res := 0; 208734#partsFINAL assume true; 208719#partsEXIT >#65#return; 208717#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 208714#partsFINAL assume true; 208704#partsEXIT >#61#return; 208707#L22-2 #res := #t~ret0;havoc #t~ret0; 209095#partsFINAL assume true; 208689#partsEXIT >#67#return; 208687#L36-1 havoc main_#t~ret8; 208685#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 208684#L35-3 assume !!(main_~q~0 <= main_~x~0); 208681#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 208682#partsENTRY ~p := #in~p;~q := #in~q; 208713#L20 assume !(~p <= 0); 208703#L21 assume !(~q <= 0); 208699#L22 assume ~q > ~p; 208694#L22-1 call #t~ret0 := parts(~p, ~p);< 208695#partsENTRY ~p := #in~p;~q := #in~q; 208739#L20 assume !(~p <= 0); 208737#L21 assume !(~q <= 0); 208735#L22 assume !(~q > ~p); 208731#L23 call #t~ret1 := parts(~p - ~q, ~q);< 208733#partsENTRY ~p := #in~p;~q := #in~q; 208746#L20 assume ~p <= 0;#res := 1; 208743#partsFINAL assume true; 208729#partsEXIT >#63#return; 208711#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 208712#partsENTRY ~p := #in~p;~q := #in~q; 208742#L20 assume !(~p <= 0); 208728#L21 assume ~q <= 0;#res := 0; 208727#partsFINAL assume true; 208710#partsEXIT >#65#return; 208702#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 208698#partsFINAL assume true; 208693#partsEXIT >#61#return; 208688#L22-2 #res := #t~ret0;havoc #t~ret0; 208686#partsFINAL assume true; 208680#partsEXIT >#67#return; 208679#L36-1 havoc main_#t~ret8; 208678#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 208676#L35-3 assume !(main_~q~0 <= main_~x~0); 208674#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 208672#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 208671#L35-3 assume !!(main_~q~0 <= main_~x~0); 208669#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 208670#partsENTRY ~p := #in~p;~q := #in~q; 208677#L20 assume !(~p <= 0); 208675#L21 assume ~q <= 0;#res := 0; 208673#partsFINAL assume true; 208668#partsEXIT >#67#return; 208666#L36-1 havoc main_#t~ret8; 208664#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 208661#L35-3 assume !!(main_~q~0 <= main_~x~0); 208645#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 208651#partsENTRY ~p := #in~p;~q := #in~q; 208649#L20 assume !(~p <= 0); 208648#L21 assume !(~q <= 0); 208647#L22 assume !(~q > ~p); 208623#L23 call #t~ret1 := parts(~p - ~q, ~q);< 208626#partsENTRY ~p := #in~p;~q := #in~q; 208667#L20 assume !(~p <= 0); 208665#L21 assume !(~q <= 0); 208662#L22 assume !(~q > ~p); 208659#L23 call #t~ret1 := parts(~p - ~q, ~q);< 208660#partsENTRY ~p := #in~p;~q := #in~q; 209097#L20 assume ~p <= 0;#res := 1; 209096#partsFINAL assume true; 208657#partsEXIT >#63#return; 208653#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 208656#partsENTRY ~p := #in~p;~q := #in~q; 209090#L20 assume !(~p <= 0); 209089#L21 assume ~q <= 0;#res := 0; 209087#partsFINAL assume true; 208652#partsEXIT >#65#return; 208650#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 208644#partsFINAL assume true; 208622#partsEXIT >#63#return; 208625#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 209080#partsENTRY ~p := #in~p;~q := #in~q; 209084#L20 assume !(~p <= 0); 209082#L21 assume ~q <= 0;#res := 0; 209081#partsFINAL assume true; 209079#partsEXIT >#65#return; 209078#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 209077#partsFINAL assume true; 209076#partsEXIT >#67#return; 208269#L36-1 havoc main_#t~ret8; 208265#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 208263#L35-3 assume !!(main_~q~0 <= main_~x~0); 208224#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 208228#partsENTRY ~p := #in~p;~q := #in~q; 208592#L20 assume !(~p <= 0); 208591#L21 assume !(~q <= 0); 208590#L22 assume !(~q > ~p); 208259#L23 call #t~ret1 := parts(~p - ~q, ~q);< 208261#partsENTRY ~p := #in~p;~q := #in~q; 208589#L20 assume ~p <= 0;#res := 1; 208588#partsFINAL assume true; 208258#partsEXIT >#63#return; 208253#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 208254#partsENTRY ~p := #in~p;~q := #in~q; 208444#L20 assume !(~p <= 0); 208443#L21 assume !(~q <= 0); 208441#L22 assume !(~q > ~p); 208436#L23 call #t~ret1 := parts(~p - ~q, ~q);< 208439#partsENTRY ~p := #in~p;~q := #in~q; 208478#L20 assume !(~p <= 0); 208476#L21 assume !(~q <= 0); 208472#L22 assume !(~q > ~p); 208466#L23 call #t~ret1 := parts(~p - ~q, ~q);< 208468#partsENTRY ~p := #in~p;~q := #in~q; 208474#L20 assume ~p <= 0;#res := 1; 208471#partsFINAL assume true; 208465#partsEXIT >#63#return; 208457#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 208461#partsENTRY ~p := #in~p;~q := #in~q; 208473#L20 assume !(~p <= 0); 208470#L21 assume ~q <= 0;#res := 0; 208463#partsFINAL assume true; 208455#partsEXIT >#65#return; 208452#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 208447#partsFINAL assume true; 208435#partsEXIT >#63#return; 208428#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 208429#partsENTRY ~p := #in~p;~q := #in~q; 208454#L20 assume !(~p <= 0); 208448#L21 assume ~q <= 0;#res := 0; 208434#partsFINAL assume true; 208427#partsEXIT >#65#return; 208423#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 208421#partsFINAL assume true; 208252#partsEXIT >#65#return; 208250#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 208248#partsFINAL assume true; 208223#partsEXIT >#67#return; 208218#L36-1 havoc main_#t~ret8; 208219#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 208236#L35-3 assume !!(main_~q~0 <= main_~x~0); 208206#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 208208#partsENTRY ~p := #in~p;~q := #in~q; 208335#L20 assume !(~p <= 0); 208333#L21 assume !(~q <= 0); 208331#L22 assume ~q > ~p; 208221#L22-1 call #t~ret0 := parts(~p, ~p);< 208222#partsENTRY ~p := #in~p;~q := #in~q; 208567#L20 assume !(~p <= 0); 208560#L21 assume !(~q <= 0); 208557#L22 assume !(~q > ~p); 208547#L23 call #t~ret1 := parts(~p - ~q, ~q);< 208548#partsENTRY ~p := #in~p;~q := #in~q; 208556#L20 assume ~p <= 0;#res := 1; 208552#partsFINAL assume true; 208546#partsEXIT >#63#return; 208542#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 208543#partsENTRY ~p := #in~p;~q := #in~q; 208576#L20 assume !(~p <= 0); 208572#L21 assume !(~q <= 0); 208570#L22 assume !(~q > ~p); 208563#L23 call #t~ret1 := parts(~p - ~q, ~q);< 208564#partsENTRY ~p := #in~p;~q := #in~q; 208587#L20 assume !(~p <= 0); 208586#L21 assume !(~q <= 0); 208583#L22 assume !(~q > ~p); 208579#L23 call #t~ret1 := parts(~p - ~q, ~q);< 208580#partsENTRY ~p := #in~p;~q := #in~q; 208585#L20 assume ~p <= 0;#res := 1; 208582#partsFINAL assume true; 208578#partsEXIT >#63#return; 208574#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 208575#partsENTRY ~p := #in~p;~q := #in~q; 208584#L20 assume !(~p <= 0); 208581#L21 assume ~q <= 0;#res := 0; 208577#partsFINAL assume true; 208573#partsEXIT >#65#return; 208571#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 208569#partsFINAL assume true; 208562#partsEXIT >#63#return; 208554#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 208555#partsENTRY ~p := #in~p;~q := #in~q; 208566#L20 assume !(~p <= 0); 208565#L21 assume ~q <= 0;#res := 0; 208559#partsFINAL assume true; 208553#partsEXIT >#65#return; 208551#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 208545#partsFINAL assume true; 208541#partsEXIT >#65#return; 208539#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 208538#partsFINAL assume true; 208220#partsEXIT >#61#return; 208217#L22-2 #res := #t~ret0;havoc #t~ret0; 208214#partsFINAL assume true; 208215#partsEXIT >#67#return; 208203#L36-1 [2018-11-23 13:13:25,700 INFO L796 eck$LassoCheckResult]: Loop: 208203#L36-1 havoc main_#t~ret8; 208166#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 208167#L35-3 assume !(main_~q~0 <= main_~x~0); 208152#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 208153#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 208155#L35-3 assume !!(main_~q~0 <= main_~x~0); 208156#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 208201#partsENTRY ~p := #in~p;~q := #in~q; 208212#L20 assume !(~p <= 0); 208211#L21 assume ~q <= 0;#res := 0; 208210#partsFINAL assume true; 208209#partsEXIT >#67#return; 208187#L36-1 havoc main_#t~ret8; 208188#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 208330#L35-3 assume !!(main_~q~0 <= main_~x~0); 208325#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 208326#partsENTRY ~p := #in~p;~q := #in~q; 208609#L20 assume !(~p <= 0); 208608#L21 assume !(~q <= 0); 208607#L22 assume !(~q > ~p); 208605#L23 call #t~ret1 := parts(~p - ~q, ~q);< 208606#partsENTRY ~p := #in~p;~q := #in~q; 209155#L20 assume !(~p <= 0); 209154#L21 assume !(~q <= 0); 209153#L22 assume !(~q > ~p); 209145#L23 call #t~ret1 := parts(~p - ~q, ~q);< 209152#partsENTRY ~p := #in~p;~q := #in~q; 209159#L20 assume !(~p <= 0); 209158#L21 assume !(~q <= 0); 209156#L22 assume !(~q > ~p); 209157#L23 call #t~ret1 := parts(~p - ~q, ~q);< 210122#partsENTRY ~p := #in~p;~q := #in~q; 210126#L20 assume ~p <= 0;#res := 1; 210125#partsFINAL assume true; 210121#partsEXIT >#63#return; 210118#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 210119#partsENTRY ~p := #in~p;~q := #in~q; 210124#L20 assume !(~p <= 0); 210123#L21 assume ~q <= 0;#res := 0; 210120#partsFINAL assume true; 210117#partsEXIT >#65#return; 209141#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 210092#partsFINAL assume true; 209151#partsEXIT >#63#return; 209139#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 209142#partsENTRY ~p := #in~p;~q := #in~q; 209160#L20 assume !(~p <= 0); 209146#L21 assume ~q <= 0;#res := 0; 209143#partsFINAL assume true; 209138#partsEXIT >#65#return; 209136#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 209120#partsFINAL assume true; 208604#partsEXIT >#63#return; 208602#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 208603#partsENTRY ~p := #in~p;~q := #in~q; 208612#L20 assume !(~p <= 0); 208611#L21 assume ~q <= 0;#res := 0; 208610#partsFINAL assume true; 208601#partsEXIT >#65#return; 208600#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 208599#partsFINAL assume true; 208324#partsEXIT >#67#return; 208322#L36-1 havoc main_#t~ret8; 208320#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 208319#L35-3 assume !!(main_~q~0 <= main_~x~0); 208241#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 208244#partsENTRY ~p := #in~p;~q := #in~q; 210133#L20 assume !(~p <= 0); 210132#L21 assume !(~q <= 0); 210131#L22 assume !(~q > ~p); 209114#L23 call #t~ret1 := parts(~p - ~q, ~q);< 208262#partsENTRY ~p := #in~p;~q := #in~q; 209276#L20 assume !(~p <= 0); 209274#L21 assume !(~q <= 0); 209272#L22 assume ~q > ~p; 208288#L22-1 call #t~ret0 := parts(~p, ~p);< 208294#partsENTRY ~p := #in~p;~q := #in~q; 208293#L20 assume !(~p <= 0); 208291#L21 assume !(~q <= 0); 208290#L22 assume !(~q > ~p); 208280#L23 call #t~ret1 := parts(~p - ~q, ~q);< 208283#partsENTRY ~p := #in~p;~q := #in~q; 208292#L20 assume ~p <= 0;#res := 1; 208287#partsFINAL assume true; 208279#partsEXIT >#63#return; 208282#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 210294#partsENTRY ~p := #in~p;~q := #in~q; 210299#L20 assume !(~p <= 0); 210298#L21 assume ~q <= 0;#res := 0; 210297#partsFINAL assume true; 210293#partsEXIT >#65#return; 210291#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 210289#partsFINAL assume true; 210284#partsEXIT >#61#return; 210285#L22-2 #res := #t~ret0;havoc #t~ret0; 210271#partsFINAL assume true; 210242#partsEXIT >#63#return; 210216#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 210217#partsENTRY ~p := #in~p;~q := #in~q; 210255#L20 assume !(~p <= 0); 210251#L21 assume !(~q <= 0); 210250#L22 assume !(~q > ~p); 210225#L23 call #t~ret1 := parts(~p - ~q, ~q);< 210226#partsENTRY ~p := #in~p;~q := #in~q; 210244#L20 assume !(~p <= 0); 210243#L21 assume !(~q <= 0); 210241#L22 assume !(~q > ~p); 209132#L23 call #t~ret1 := parts(~p - ~q, ~q);< 209378#partsENTRY ~p := #in~p;~q := #in~q; 209376#L20 assume !(~p <= 0); 209137#L21 assume !(~q <= 0); 209135#L22 assume !(~q > ~p); 209130#L23 call #t~ret1 := parts(~p - ~q, ~q);< 209134#partsENTRY ~p := #in~p;~q := #in~q; 209172#L20 assume ~p <= 0;#res := 1; 209167#partsFINAL assume true; 209129#partsEXIT >#63#return; 208456#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 208461#partsENTRY ~p := #in~p;~q := #in~q; 208473#L20 assume !(~p <= 0); 208470#L21 assume ~q <= 0;#res := 0; 208463#partsFINAL assume true; 208455#partsEXIT >#65#return; 208459#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 210248#partsFINAL assume true; 210239#partsEXIT >#63#return; 210232#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 210236#partsENTRY ~p := #in~p;~q := #in~q; 210240#L20 assume !(~p <= 0); 210238#L21 assume ~q <= 0;#res := 0; 210237#partsFINAL assume true; 210231#partsEXIT >#65#return; 210230#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 210229#partsFINAL assume true; 210224#partsEXIT >#63#return; 210221#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 210222#partsENTRY ~p := #in~p;~q := #in~q; 210228#L20 assume !(~p <= 0); 210227#L21 assume ~q <= 0;#res := 0; 210223#partsFINAL assume true; 210220#partsEXIT >#65#return; 210219#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 210218#partsFINAL assume true; 210215#partsEXIT >#65#return; 210213#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 210210#partsFINAL assume true; 208239#partsEXIT >#67#return; 208238#L36-1 havoc main_#t~ret8; 208237#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 208235#L35-3 assume !!(main_~q~0 <= main_~x~0); 208173#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 208229#partsENTRY ~p := #in~p;~q := #in~q; 209778#L20 assume !(~p <= 0); 209777#L21 assume !(~q <= 0); 209775#L22 assume ~q > ~p; 208526#L22-1 call #t~ret0 := parts(~p, ~p);< 208527#partsENTRY ~p := #in~p;~q := #in~q; 209748#L20 assume !(~p <= 0); 209746#L21 assume !(~q <= 0); 209747#L22 assume !(~q > ~p); 210037#L23 call #t~ret1 := parts(~p - ~q, ~q);< 209707#partsENTRY ~p := #in~p;~q := #in~q; 210040#L20 assume ~p <= 0;#res := 1; 210039#partsFINAL assume true; 210036#partsEXIT >#63#return; 209883#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 210034#partsENTRY ~p := #in~p;~q := #in~q; 210033#L20 assume !(~p <= 0); 210032#L21 assume !(~q <= 0); 210031#L22 assume !(~q > ~p); 209882#L23 call #t~ret1 := parts(~p - ~q, ~q);< 209884#partsENTRY ~p := #in~p;~q := #in~q; 210004#L20 assume !(~p <= 0); 210002#L21 assume !(~q <= 0); 210000#L22 assume !(~q > ~p); 209839#L23 call #t~ret1 := parts(~p - ~q, ~q);< 209841#partsENTRY ~p := #in~p;~q := #in~q; 209860#L20 assume ~p <= 0;#res := 1; 209856#partsFINAL assume true; 209838#partsEXIT >#63#return; 209825#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 209829#partsENTRY ~p := #in~p;~q := #in~q; 209862#L20 assume !(~p <= 0); 209861#L21 assume ~q <= 0;#res := 0; 209833#partsFINAL assume true; 209823#partsEXIT >#65#return; 209827#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 209963#partsFINAL assume true; 209967#partsEXIT >#63#return; 209982#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 210030#partsENTRY ~p := #in~p;~q := #in~q; 210047#L20 assume !(~p <= 0); 210046#L21 assume ~q <= 0;#res := 0; 210045#partsFINAL assume true; 210043#partsEXIT >#65#return; 210042#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 210041#partsFINAL assume true; 210035#partsEXIT >#65#return; 208534#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 208532#partsFINAL assume true; 208525#partsEXIT >#61#return; 208247#L22-2 #res := #t~ret0;havoc #t~ret0; 208233#partsFINAL assume true; 208225#partsEXIT >#67#return; 208226#L36-1 havoc main_#t~ret8; 208216#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 208213#L35-3 assume !!(main_~q~0 <= main_~x~0); 208205#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 208232#partsENTRY ~p := #in~p;~q := #in~q; 209149#L20 assume !(~p <= 0); 209150#L21 assume !(~q <= 0); 208349#L22 assume ~q > ~p; 208328#L22-1 call #t~ret0 := parts(~p, ~p);< 208329#partsENTRY ~p := #in~p;~q := #in~q; 208361#L20 assume !(~p <= 0); 208359#L21 assume !(~q <= 0); 208357#L22 assume !(~q > ~p); 208347#L23 call #t~ret1 := parts(~p - ~q, ~q);< 208348#partsENTRY ~p := #in~p;~q := #in~q; 208358#L20 assume ~p <= 0;#res := 1; 208356#partsFINAL assume true; 208345#partsEXIT >#63#return; 208342#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 208344#partsENTRY ~p := #in~p;~q := #in~q; 208392#L20 assume !(~p <= 0); 208386#L21 assume !(~q <= 0); 208382#L22 assume !(~q > ~p); 208374#L23 call #t~ret1 := parts(~p - ~q, ~q);< 208375#partsENTRY ~p := #in~p;~q := #in~q; 208403#L20 assume !(~p <= 0); 208398#L21 assume !(~q <= 0); 208395#L22 assume ~q > ~p; 208388#L22-1 call #t~ret0 := parts(~p, ~p);< 208391#partsENTRY ~p := #in~p;~q := #in~q; 208418#L20 assume !(~p <= 0); 208415#L21 assume !(~q <= 0); 208411#L22 assume !(~q > ~p); 208406#L23 call #t~ret1 := parts(~p - ~q, ~q);< 208407#partsENTRY ~p := #in~p;~q := #in~q; 208414#L20 assume ~p <= 0;#res := 1; 208410#partsFINAL assume true; 208405#partsEXIT >#63#return; 208400#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 208401#partsENTRY ~p := #in~p;~q := #in~q; 208413#L20 assume !(~p <= 0); 208409#L21 assume ~q <= 0;#res := 0; 208404#partsFINAL assume true; 208399#partsEXIT >#65#return; 208396#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 208393#partsFINAL assume true; 208387#partsEXIT >#61#return; 208384#L22-2 #res := #t~ret0;havoc #t~ret0; 208378#partsFINAL assume true; 208372#partsEXIT >#63#return; 208365#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 208368#partsENTRY ~p := #in~p;~q := #in~q; 209284#L20 assume !(~p <= 0); 209283#L21 assume !(~q <= 0); 209282#L22 assume !(~q > ~p); 208494#L23 call #t~ret1 := parts(~p - ~q, ~q);< 208502#partsENTRY ~p := #in~p;~q := #in~q; 210051#L20 assume !(~p <= 0); 210049#L21 assume !(~q <= 0); 209728#L22 assume !(~q > ~p); 209724#L23 call #t~ret1 := parts(~p - ~q, ~q);< 209725#partsENTRY ~p := #in~p;~q := #in~q; 209761#L20 assume ~p <= 0;#res := 1; 209733#partsFINAL assume true; 209736#partsEXIT >#63#return; 208510#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 208514#partsENTRY ~p := #in~p;~q := #in~q; 208522#L20 assume !(~p <= 0); 208520#L21 assume ~q <= 0;#res := 0; 208517#partsFINAL assume true; 208509#partsEXIT >#65#return; 208506#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 208501#partsFINAL assume true; 208492#partsEXIT >#63#return; 208498#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 209178#partsENTRY ~p := #in~p;~q := #in~q; 209647#L20 assume !(~p <= 0); 209527#L21 assume ~q <= 0;#res := 0; 209240#partsFINAL assume true; 209174#partsEXIT >#65#return; 209173#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 209127#partsFINAL assume true; 208364#partsEXIT >#65#return; 208362#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 208350#partsFINAL assume true; 208340#partsEXIT >#65#return; 208334#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 208332#partsFINAL assume true; 208327#partsEXIT >#61#return; 208323#L22-2 #res := #t~ret0;havoc #t~ret0; 208321#partsFINAL assume true; 208204#partsEXIT >#67#return; 208203#L36-1 [2018-11-23 13:13:25,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:25,700 INFO L82 PathProgramCache]: Analyzing trace with hash -2031234513, now seen corresponding path program 11 times [2018-11-23 13:13:25,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:25,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:25,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:25,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:25,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:25,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:25,732 INFO L82 PathProgramCache]: Analyzing trace with hash 483782795, now seen corresponding path program 6 times [2018-11-23 13:13:25,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:25,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:25,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:25,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:25,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4415 backedges. 1009 proven. 66 refuted. 0 times theorem prover too weak. 3340 trivial. 0 not checked. [2018-11-23 13:13:25,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:25,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:13:25,863 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 13:13:25,939 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2018-11-23 13:13:25,939 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:25,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:26,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4415 backedges. 2214 proven. 252 refuted. 0 times theorem prover too weak. 1949 trivial. 0 not checked. [2018-11-23 13:13:26,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:26,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2018-11-23 13:13:26,133 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:13:26,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:13:26,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:13:26,133 INFO L87 Difference]: Start difference. First operand 2224 states and 2492 transitions. cyclomatic complexity: 290 Second operand 19 states. [2018-11-23 13:13:26,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:26,732 INFO L93 Difference]: Finished difference Result 2470 states and 2813 transitions. [2018-11-23 13:13:26,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 13:13:26,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2470 states and 2813 transitions. [2018-11-23 13:13:26,739 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 53 [2018-11-23 13:13:26,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2470 states to 2408 states and 2718 transitions. [2018-11-23 13:13:26,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 312 [2018-11-23 13:13:26,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 312 [2018-11-23 13:13:26,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2408 states and 2718 transitions. [2018-11-23 13:13:26,744 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:13:26,744 INFO L705 BuchiCegarLoop]: Abstraction has 2408 states and 2718 transitions. [2018-11-23 13:13:26,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states and 2718 transitions. [2018-11-23 13:13:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2100. [2018-11-23 13:13:26,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2018-11-23 13:13:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2295 transitions. [2018-11-23 13:13:26,758 INFO L728 BuchiCegarLoop]: Abstraction has 2100 states and 2295 transitions. [2018-11-23 13:13:26,758 INFO L608 BuchiCegarLoop]: Abstraction has 2100 states and 2295 transitions. [2018-11-23 13:13:26,759 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2018-11-23 13:13:26,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2100 states and 2295 transitions. [2018-11-23 13:13:26,761 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2018-11-23 13:13:26,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:13:26,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:13:26,763 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [37, 37, 25, 14, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2018-11-23 13:13:26,763 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [42, 42, 34, 20, 17, 17, 17, 17, 17, 17, 14, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1] [2018-11-23 13:13:26,764 INFO L794 eck$LassoCheckResult]: Stem: 213795#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 213789#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 213790#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 213791#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 213792#L35-3 assume !!(main_~q~0 <= main_~x~0); 213798#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 213842#partsENTRY ~p := #in~p;~q := #in~q; 215644#L20 assume ~p <= 0;#res := 1; 215643#partsFINAL assume true; 215641#partsEXIT >#67#return; 213832#L36-1 havoc main_#t~ret8; 213810#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 213811#L35-3 assume !!(main_~q~0 <= main_~x~0); 215380#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 215381#partsENTRY ~p := #in~p;~q := #in~q; 215383#L20 assume ~p <= 0;#res := 1; 215382#partsFINAL assume true; 215379#partsEXIT >#67#return; 215378#L36-1 havoc main_#t~ret8; 215377#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 215374#L35-3 assume !!(main_~q~0 <= main_~x~0); 215370#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 215371#partsENTRY ~p := #in~p;~q := #in~q; 215376#L20 assume ~p <= 0;#res := 1; 215373#partsFINAL assume true; 215369#partsEXIT >#67#return; 215367#L36-1 havoc main_#t~ret8; 215366#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 215364#L35-3 assume !!(main_~q~0 <= main_~x~0); 215360#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 215361#partsENTRY ~p := #in~p;~q := #in~q; 215365#L20 assume ~p <= 0;#res := 1; 215363#partsFINAL assume true; 215359#partsEXIT >#67#return; 215358#L36-1 havoc main_#t~ret8; 215357#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 215356#L35-3 assume !(main_~q~0 <= main_~x~0); 213800#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 213793#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 213794#L35-3 assume !!(main_~q~0 <= main_~x~0); 214546#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 214547#partsENTRY ~p := #in~p;~q := #in~q; 214565#L20 assume !(~p <= 0); 214560#L21 assume ~q <= 0;#res := 0; 214558#partsFINAL assume true; 214545#partsEXIT >#67#return; 214544#L36-1 havoc main_#t~ret8; 214543#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 214541#L35-3 assume !!(main_~q~0 <= main_~x~0); 214538#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 214539#partsENTRY ~p := #in~p;~q := #in~q; 214576#L20 assume !(~p <= 0); 214575#L21 assume !(~q <= 0); 214572#L22 assume !(~q > ~p); 214568#L23 call #t~ret1 := parts(~p - ~q, ~q);< 214569#partsENTRY ~p := #in~p;~q := #in~q; 214574#L20 assume ~p <= 0;#res := 1; 214571#partsFINAL assume true; 214567#partsEXIT >#63#return; 214563#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 214564#partsENTRY ~p := #in~p;~q := #in~q; 214573#L20 assume !(~p <= 0); 214570#L21 assume ~q <= 0;#res := 0; 214566#partsFINAL assume true; 214562#partsEXIT >#65#return; 214559#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 214557#partsFINAL assume true; 214537#partsEXIT >#67#return; 214531#L36-1 havoc main_#t~ret8; 214527#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 214523#L35-3 assume !!(main_~q~0 <= main_~x~0); 214412#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 214414#partsENTRY ~p := #in~p;~q := #in~q; 214450#L20 assume !(~p <= 0); 214448#L21 assume !(~q <= 0); 214446#L22 assume ~q > ~p; 214442#L22-1 call #t~ret0 := parts(~p, ~p);< 214444#partsENTRY ~p := #in~p;~q := #in~q; 214486#L20 assume !(~p <= 0); 214482#L21 assume !(~q <= 0); 214481#L22 assume !(~q > ~p); 214476#L23 call #t~ret1 := parts(~p - ~q, ~q);< 214480#partsENTRY ~p := #in~p;~q := #in~q; 214488#L20 assume ~p <= 0;#res := 1; 214483#partsFINAL assume true; 214474#partsEXIT >#63#return; 214472#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 214473#partsENTRY ~p := #in~p;~q := #in~q; 214491#L20 assume !(~p <= 0); 214490#L21 assume ~q <= 0;#res := 0; 214489#partsFINAL assume true; 214471#partsEXIT >#65#return; 214468#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 214455#partsFINAL assume true; 214440#partsEXIT >#61#return; 214438#L22-2 #res := #t~ret0;havoc #t~ret0; 214436#partsFINAL assume true; 214411#partsEXIT >#67#return; 214407#L36-1 havoc main_#t~ret8; 214401#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 214397#L35-3 assume !!(main_~q~0 <= main_~x~0); 214388#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 214389#partsENTRY ~p := #in~p;~q := #in~q; 214432#L20 assume !(~p <= 0); 214430#L21 assume !(~q <= 0); 214410#L22 assume ~q > ~p; 214405#L22-1 call #t~ret0 := parts(~p, ~p);< 214406#partsENTRY ~p := #in~p;~q := #in~q; 214433#L20 assume !(~p <= 0); 214431#L21 assume !(~q <= 0); 214429#L22 assume !(~q > ~p); 214424#L23 call #t~ret1 := parts(~p - ~q, ~q);< 214426#partsENTRY ~p := #in~p;~q := #in~q; 214494#L20 assume ~p <= 0;#res := 1; 214434#partsFINAL assume true; 214422#partsEXIT >#63#return; 214419#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 214420#partsENTRY ~p := #in~p;~q := #in~q; 214536#L20 assume !(~p <= 0); 214530#L21 assume ~q <= 0;#res := 0; 214526#partsFINAL assume true; 214418#partsEXIT >#65#return; 214416#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 214409#partsFINAL assume true; 214404#partsEXIT >#61#return; 214400#L22-2 #res := #t~ret0;havoc #t~ret0; 214396#partsFINAL assume true; 214387#partsEXIT >#67#return; 214382#L36-1 havoc main_#t~ret8; 214374#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 214365#L35-3 assume !(main_~q~0 <= main_~x~0); 214361#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 214271#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 214270#L35-3 assume !!(main_~q~0 <= main_~x~0); 214266#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 214267#partsENTRY ~p := #in~p;~q := #in~q; 214582#L20 assume !(~p <= 0); 214579#L21 assume ~q <= 0;#res := 0; 214578#partsFINAL assume true; 214265#partsEXIT >#67#return; 214263#L36-1 havoc main_#t~ret8; 214261#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 214260#L35-3 assume !!(main_~q~0 <= main_~x~0); 214258#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 214259#partsENTRY ~p := #in~p;~q := #in~q; 214358#L20 assume !(~p <= 0); 214356#L21 assume !(~q <= 0); 214354#L22 assume !(~q > ~p); 214228#L23 call #t~ret1 := parts(~p - ~q, ~q);< 214230#partsENTRY ~p := #in~p;~q := #in~q; 214328#L20 assume !(~p <= 0); 214327#L21 assume !(~q <= 0); 214325#L22 assume !(~q > ~p); 214315#L23 call #t~ret1 := parts(~p - ~q, ~q);< 214317#partsENTRY ~p := #in~p;~q := #in~q; 214326#L20 assume ~p <= 0;#res := 1; 214324#partsFINAL assume true; 214314#partsEXIT >#63#return; 214304#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 214306#partsENTRY ~p := #in~p;~q := #in~q; 214320#L20 assume !(~p <= 0); 214318#L21 assume ~q <= 0;#res := 0; 214311#partsFINAL assume true; 214302#partsEXIT >#65#return; 214300#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 214299#partsFINAL assume true; 214226#partsEXIT >#63#return; 214229#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 214269#partsENTRY ~p := #in~p;~q := #in~q; 214359#L20 assume !(~p <= 0); 214347#L21 assume ~q <= 0;#res := 0; 214346#partsFINAL assume true; 214268#partsEXIT >#65#return; 214264#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 214262#partsFINAL assume true; 214257#partsEXIT >#67#return; 214255#L36-1 havoc main_#t~ret8; 214254#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 214253#L35-3 assume !!(main_~q~0 <= main_~x~0); 214244#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 214251#partsENTRY ~p := #in~p;~q := #in~q; 214250#L20 assume !(~p <= 0); 214248#L21 assume !(~q <= 0); 214246#L22 assume !(~q > ~p); 214195#L23 call #t~ret1 := parts(~p - ~q, ~q);< 214198#partsENTRY ~p := #in~p;~q := #in~q; 214252#L20 assume ~p <= 0;#res := 1; 214243#partsFINAL assume true; 214193#partsEXIT >#63#return; 214196#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 214386#partsENTRY ~p := #in~p;~q := #in~q; 214381#L20 assume !(~p <= 0); 214373#L21 assume !(~q <= 0); 214364#L22 assume !(~q > ~p); 214350#L23 call #t~ret1 := parts(~p - ~q, ~q);< 214352#partsENTRY ~p := #in~p;~q := #in~q; 214399#L20 assume !(~p <= 0); 214395#L21 assume !(~q <= 0); 214385#L22 assume !(~q > ~p); 214378#L23 call #t~ret1 := parts(~p - ~q, ~q);< 214380#partsENTRY ~p := #in~p;~q := #in~q; 214391#L20 assume ~p <= 0;#res := 1; 214384#partsFINAL assume true; 214377#partsEXIT >#63#return; 214367#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 214372#partsENTRY ~p := #in~p;~q := #in~q; 214734#L20 assume !(~p <= 0); 214383#L21 assume ~q <= 0;#res := 0; 214375#partsFINAL assume true; 214366#partsEXIT >#65#return; 214363#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 214360#partsFINAL assume true; 214348#partsEXIT >#63#return; 214351#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 215437#partsENTRY ~p := #in~p;~q := #in~q; 215440#L20 assume !(~p <= 0); 215439#L21 assume ~q <= 0;#res := 0; 215438#partsFINAL assume true; 215436#partsEXIT >#65#return; 215435#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 215434#partsFINAL assume true; 215433#partsEXIT >#65#return; 215431#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 215429#partsFINAL assume true; 215427#partsEXIT >#67#return; 215417#L36-1 havoc main_#t~ret8; 213856#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 213853#L35-3 assume !!(main_~q~0 <= main_~x~0); 213854#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 213976#partsENTRY ~p := #in~p;~q := #in~q; 213974#L20 assume !(~p <= 0); 213972#L21 assume !(~q <= 0); 213865#L22 assume ~q > ~p; 213860#L22-1 call #t~ret0 := parts(~p, ~p);< 213861#partsENTRY ~p := #in~p;~q := #in~q; 214101#L20 assume !(~p <= 0); 214098#L21 assume !(~q <= 0); 214095#L22 assume !(~q > ~p); 214031#L23 call #t~ret1 := parts(~p - ~q, ~q);< 214032#partsENTRY ~p := #in~p;~q := #in~q; 214044#L20 assume ~p <= 0;#res := 1; 214042#partsFINAL assume true; 214030#partsEXIT >#63#return; 213871#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 213877#partsENTRY ~p := #in~p;~q := #in~q; 214107#L20 assume !(~p <= 0); 214103#L21 assume !(~q <= 0); 214100#L22 assume !(~q > ~p); 213817#L23 call #t~ret1 := parts(~p - ~q, ~q);< 214097#partsENTRY ~p := #in~p;~q := #in~q; 214208#L20 assume !(~p <= 0); 214206#L21 assume !(~q <= 0); 213816#L22 assume !(~q > ~p); 213818#L23 call #t~ret1 := parts(~p - ~q, ~q);< 214110#partsENTRY ~p := #in~p;~q := #in~q; 214114#L20 assume ~p <= 0;#res := 1; 214112#partsFINAL assume true; 214109#partsEXIT >#63#return; 214105#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 214106#partsENTRY ~p := #in~p;~q := #in~q; 214113#L20 assume !(~p <= 0); 214111#L21 assume ~q <= 0;#res := 0; 214108#partsFINAL assume true; 214104#partsEXIT >#65#return; 214102#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 214099#partsFINAL assume true; 214096#partsEXIT >#63#return; 214038#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 214039#partsENTRY ~p := #in~p;~q := #in~q; 214043#L20 assume !(~p <= 0); 214041#L21 assume ~q <= 0;#res := 0; 214040#partsFINAL assume true; 214037#partsEXIT >#65#return; 214036#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 214034#partsFINAL assume true; 213870#partsEXIT >#65#return; 213866#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 213862#partsFINAL assume true; 213859#partsEXIT >#61#return; 213857#L22-2 #res := #t~ret0;havoc #t~ret0; 213858#partsFINAL assume true; 213978#partsEXIT >#67#return; 213843#L36-1 [2018-11-23 13:13:26,764 INFO L796 eck$LassoCheckResult]: Loop: 213843#L36-1 havoc main_#t~ret8; 213809#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 213796#L35-3 assume !(main_~q~0 <= main_~x~0); 213797#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 213799#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 213844#L35-3 assume !!(main_~q~0 <= main_~x~0); 213840#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 213841#partsENTRY ~p := #in~p;~q := #in~q; 213852#L20 assume !(~p <= 0); 213851#L21 assume ~q <= 0;#res := 0; 213850#partsFINAL assume true; 213849#partsEXIT >#67#return; 213830#L36-1 havoc main_#t~ret8; 213831#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 214284#L35-3 assume !!(main_~q~0 <= main_~x~0); 214282#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 214283#partsENTRY ~p := #in~p;~q := #in~q; 214542#L20 assume !(~p <= 0); 214540#L21 assume !(~q <= 0); 214532#L22 assume !(~q > ~p); 214293#L23 call #t~ret1 := parts(~p - ~q, ~q);< 214294#partsENTRY ~p := #in~p;~q := #in~q; 215065#L20 assume !(~p <= 0); 215064#L21 assume !(~q <= 0); 215063#L22 assume !(~q > ~p); 213787#L23 call #t~ret1 := parts(~p - ~q, ~q);< 215059#partsENTRY ~p := #in~p;~q := #in~q; 215062#L20 assume !(~p <= 0); 215061#L21 assume !(~q <= 0); 215060#L22 assume !(~q > ~p); 213785#L23 call #t~ret1 := parts(~p - ~q, ~q);< 213788#partsENTRY ~p := #in~p;~q := #in~q; 215733#L20 assume ~p <= 0;#res := 1; 215731#partsFINAL assume true; 215729#partsEXIT >#63#return; 215726#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 215727#partsENTRY ~p := #in~p;~q := #in~q; 215732#L20 assume !(~p <= 0); 215730#L21 assume ~q <= 0;#res := 0; 215728#partsFINAL assume true; 215725#partsEXIT >#65#return; 214998#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 215723#partsFINAL assume true; 215058#partsEXIT >#63#return; 214996#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 214999#partsENTRY ~p := #in~p;~q := #in~q; 215009#L20 assume !(~p <= 0); 215005#L21 assume ~q <= 0;#res := 0; 215003#partsFINAL assume true; 214995#partsEXIT >#65#return; 214993#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 214891#partsFINAL assume true; 214292#partsEXIT >#63#return; 214289#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 214290#partsENTRY ~p := #in~p;~q := #in~q; 214345#L20 assume !(~p <= 0); 214344#L21 assume ~q <= 0;#res := 0; 214339#partsFINAL assume true; 214288#partsEXIT >#65#return; 214286#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 214285#partsFINAL assume true; 214281#partsEXIT >#67#return; 214280#L36-1 havoc main_#t~ret8; 214279#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 214277#L35-3 assume !!(main_~q~0 <= main_~x~0); 214201#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 214202#partsENTRY ~p := #in~p;~q := #in~q; 215405#L20 assume !(~p <= 0); 215404#L21 assume !(~q <= 0); 215403#L22 assume !(~q > ~p); 214616#L23 call #t~ret1 := parts(~p - ~q, ~q);< 214197#partsENTRY ~p := #in~p;~q := #in~q; 214663#L20 assume !(~p <= 0); 214664#L21 assume !(~q <= 0); 214624#L22 assume ~q > ~p; 214625#L22-1 call #t~ret0 := parts(~p, ~p);< 215484#partsENTRY ~p := #in~p;~q := #in~q; 215479#L20 assume !(~p <= 0); 215478#L21 assume !(~q <= 0); 215472#L22 assume !(~q > ~p); 215460#L23 call #t~ret1 := parts(~p - ~q, ~q);< 215463#partsENTRY ~p := #in~p;~q := #in~q; 215471#L20 assume ~p <= 0;#res := 1; 215465#partsFINAL assume true; 215459#partsEXIT >#63#return; 215462#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 215765#partsENTRY ~p := #in~p;~q := #in~q; 215769#L20 assume !(~p <= 0); 215768#L21 assume ~q <= 0;#res := 0; 215767#partsFINAL assume true; 215764#partsEXIT >#65#return; 215763#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 215762#partsFINAL assume true; 215760#partsEXIT >#61#return; 215759#L22-2 #res := #t~ret0;havoc #t~ret0; 215755#partsFINAL assume true; 215402#partsEXIT >#63#return; 215386#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 215387#partsENTRY ~p := #in~p;~q := #in~q; 215401#L20 assume !(~p <= 0); 215400#L21 assume !(~q <= 0); 215398#L22 assume !(~q > ~p); 215395#L23 call #t~ret1 := parts(~p - ~q, ~q);< 215396#partsENTRY ~p := #in~p;~q := #in~q; 215449#L20 assume !(~p <= 0); 215445#L21 assume !(~q <= 0); 215443#L22 assume !(~q > ~p); 214653#L23 call #t~ret1 := parts(~p - ~q, ~q);< 214661#partsENTRY ~p := #in~p;~q := #in~q; 214660#L20 assume !(~p <= 0); 214659#L21 assume !(~q <= 0); 214657#L22 assume !(~q > ~p); 214651#L23 call #t~ret1 := parts(~p - ~q, ~q);< 214655#partsENTRY ~p := #in~p;~q := #in~q; 214658#L20 assume ~p <= 0;#res := 1; 214656#partsFINAL assume true; 214650#partsEXIT >#63#return; 214369#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 214372#partsENTRY ~p := #in~p;~q := #in~q; 214734#L20 assume !(~p <= 0); 214383#L21 assume ~q <= 0;#res := 0; 214375#partsFINAL assume true; 214366#partsEXIT >#65#return; 214370#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 215720#partsFINAL assume true; 215441#partsEXIT >#63#return; 215422#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 215425#partsENTRY ~p := #in~p;~q := #in~q; 215432#L20 assume !(~p <= 0); 215430#L21 assume ~q <= 0;#res := 0; 215428#partsFINAL assume true; 215420#partsEXIT >#65#return; 215418#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 215406#partsFINAL assume true; 215394#partsEXIT >#63#return; 215391#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 215392#partsENTRY ~p := #in~p;~q := #in~q; 215399#L20 assume !(~p <= 0); 215397#L21 assume ~q <= 0;#res := 0; 215393#partsFINAL assume true; 215390#partsEXIT >#65#return; 215389#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 215388#partsFINAL assume true; 215385#partsEXIT >#65#return; 215384#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 215355#partsFINAL assume true; 214200#partsEXIT >#67#return; 214192#L36-1 havoc main_#t~ret8; 214160#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 214137#L35-3 assume !!(main_~q~0 <= main_~x~0); 213783#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 214158#partsENTRY ~p := #in~p;~q := #in~q; 215288#L20 assume !(~p <= 0); 215286#L21 assume !(~q <= 0); 215287#L22 assume !(~q > ~p); 215587#L23 call #t~ret1 := parts(~p - ~q, ~q);< 215588#partsENTRY ~p := #in~p;~q := #in~q; 215609#L20 assume ~p <= 0;#res := 1; 215600#partsFINAL assume true; 215586#partsEXIT >#63#return; 214218#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 214219#partsENTRY ~p := #in~p;~q := #in~q; 215223#L20 assume !(~p <= 0); 215222#L21 assume !(~q <= 0); 215221#L22 assume !(~q > ~p); 215170#L23 call #t~ret1 := parts(~p - ~q, ~q);< 215219#partsENTRY ~p := #in~p;~q := #in~q; 215226#L20 assume !(~p <= 0); 215189#L21 assume !(~q <= 0); 215178#L22 assume ~q > ~p; 215157#L22-1 call #t~ret0 := parts(~p, ~p);< 215160#partsENTRY ~p := #in~p;~q := #in~q; 215263#L20 assume !(~p <= 0); 215248#L21 assume !(~q <= 0); 215225#L22 assume !(~q > ~p); 215187#L23 call #t~ret1 := parts(~p - ~q, ~q);< 215188#partsENTRY ~p := #in~p;~q := #in~q; 215208#L20 assume ~p <= 0;#res := 1; 215206#partsFINAL assume true; 215186#partsEXIT >#63#return; 215183#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 215184#partsENTRY ~p := #in~p;~q := #in~q; 215200#L20 assume !(~p <= 0); 215198#L21 assume ~q <= 0;#res := 0; 215196#partsFINAL assume true; 215182#partsEXIT >#65#return; 215176#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 215169#partsFINAL assume true; 215156#partsEXIT >#61#return; 215159#L22-2 #res := #t~ret0;havoc #t~ret0; 215224#partsFINAL assume true; 215218#partsEXIT >#63#return; 215215#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 215216#partsENTRY ~p := #in~p;~q := #in~q; 215266#L20 assume !(~p <= 0); 215265#L21 assume !(~q <= 0); 215264#L22 assume !(~q > ~p); 215244#L23 call #t~ret1 := parts(~p - ~q, ~q);< 215246#partsENTRY ~p := #in~p;~q := #in~q; 215340#L20 assume !(~p <= 0); 215337#L21 assume !(~q <= 0); 215334#L22 assume !(~q > ~p); 215162#L23 call #t~ret1 := parts(~p - ~q, ~q);< 215311#partsENTRY ~p := #in~p;~q := #in~q; 215310#L20 assume !(~p <= 0); 215309#L21 assume !(~q <= 0); 215307#L22 assume !(~q > ~p); 215304#L23 call #t~ret1 := parts(~p - ~q, ~q);< 215305#partsENTRY ~p := #in~p;~q := #in~q; 215308#L20 assume ~p <= 0;#res := 1; 215306#partsFINAL assume true; 215303#partsEXIT >#63#return; 215152#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 215155#partsENTRY ~p := #in~p;~q := #in~q; 215294#L20 assume !(~p <= 0); 215172#L21 assume ~q <= 0;#res := 0; 215161#partsFINAL assume true; 215149#partsEXIT >#65#return; 215153#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 215722#partsFINAL assume true; 215333#partsEXIT >#63#return; 215323#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 215327#partsENTRY ~p := #in~p;~q := #in~q; 215330#L20 assume !(~p <= 0); 215329#L21 assume ~q <= 0;#res := 0; 215328#partsFINAL assume true; 215322#partsEXIT >#65#return; 215320#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 215313#partsFINAL assume true; 215243#partsEXIT >#63#return; 215236#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 215238#partsENTRY ~p := #in~p;~q := #in~q; 215252#L20 assume !(~p <= 0); 215250#L21 assume ~q <= 0;#res := 0; 215241#partsFINAL assume true; 215234#partsEXIT >#65#return; 215231#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 215228#partsFINAL assume true; 215214#partsEXIT >#65#return; 215212#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 215210#partsFINAL assume true; 215202#partsEXIT >#65#return; 214215#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 214213#partsFINAL assume true; 214181#partsEXIT >#67#return; 214117#L36-1 havoc main_#t~ret8; 214035#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 214033#L35-3 assume !!(main_~q~0 <= main_~x~0); 213846#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 213848#partsENTRY ~p := #in~p;~q := #in~q; 214116#L20 assume !(~p <= 0); 214010#L21 assume !(~q <= 0); 213916#L22 assume ~q > ~p; 213878#L22-1 call #t~ret0 := parts(~p, ~p);< 213913#partsENTRY ~p := #in~p;~q := #in~q; 213908#L20 assume !(~p <= 0); 213906#L21 assume !(~q <= 0); 213907#L22 assume !(~q > ~p); 213992#L23 call #t~ret1 := parts(~p - ~q, ~q);< 213994#partsENTRY ~p := #in~p;~q := #in~q; 213999#L20 assume ~p <= 0;#res := 1; 213995#partsFINAL assume true; 213991#partsEXIT >#63#return; 213989#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 213990#partsENTRY ~p := #in~p;~q := #in~q; 214093#L20 assume !(~p <= 0); 214091#L21 assume !(~q <= 0); 214089#L22 assume !(~q > ~p); 214006#L23 call #t~ret1 := parts(~p - ~q, ~q);< 214008#partsENTRY ~p := #in~p;~q := #in~q; 214094#L20 assume !(~p <= 0); 214092#L21 assume !(~q <= 0); 214090#L22 assume !(~q > ~p); 214026#L23 call #t~ret1 := parts(~p - ~q, ~q);< 214028#partsENTRY ~p := #in~p;~q := #in~q; 214048#L20 assume ~p <= 0;#res := 1; 214045#partsFINAL assume true; 214025#partsEXIT >#63#return; 214018#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 214023#partsENTRY ~p := #in~p;~q := #in~q; 214606#L20 assume !(~p <= 0); 214086#L21 assume ~q <= 0;#res := 0; 214052#partsFINAL assume true; 214017#partsEXIT >#65#return; 214015#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 214011#partsFINAL assume true; 214005#partsEXIT >#63#return; 214002#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 214004#partsENTRY ~p := #in~p;~q := #in~q; 214059#L20 assume !(~p <= 0); 214057#L21 assume ~q <= 0;#res := 0; 214054#partsFINAL assume true; 214000#partsEXIT >#65#return; 213998#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 213996#partsFINAL assume true; 213987#partsEXIT >#65#return; 213875#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 213986#partsFINAL assume true; 213985#partsEXIT >#61#return; 213983#L22-2 #res := #t~ret0;havoc #t~ret0; 213855#partsFINAL assume true; 213845#partsEXIT >#67#return; 213843#L36-1 [2018-11-23 13:13:26,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:26,764 INFO L82 PathProgramCache]: Analyzing trace with hash -2031234513, now seen corresponding path program 12 times [2018-11-23 13:13:26,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:26,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:26,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:26,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:26,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:26,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:26,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1583571096, now seen corresponding path program 7 times [2018-11-23 13:13:26,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:26,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:26,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:26,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:26,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4654 backedges. 692 proven. 641 refuted. 0 times theorem prover too weak. 3321 trivial. 0 not checked. [2018-11-23 13:13:26,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:26,936 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:13:26,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:26,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4654 backedges. 743 proven. 635 refuted. 0 times theorem prover too weak. 3276 trivial. 0 not checked. [2018-11-23 13:13:27,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:27,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 18 [2018-11-23 13:13:27,149 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:13:27,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 13:13:27,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:13:27,149 INFO L87 Difference]: Start difference. First operand 2100 states and 2295 transitions. cyclomatic complexity: 217 Second operand 19 states. [2018-11-23 13:13:27,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:27,759 INFO L93 Difference]: Finished difference Result 2762 states and 3151 transitions. [2018-11-23 13:13:27,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 13:13:27,760 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2762 states and 3151 transitions. [2018-11-23 13:13:27,767 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2018-11-23 13:13:27,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2762 states to 2682 states and 3062 transitions. [2018-11-23 13:13:27,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 355 [2018-11-23 13:13:27,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 355 [2018-11-23 13:13:27,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2682 states and 3062 transitions. [2018-11-23 13:13:27,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:13:27,773 INFO L705 BuchiCegarLoop]: Abstraction has 2682 states and 3062 transitions. [2018-11-23 13:13:27,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states and 3062 transitions. [2018-11-23 13:13:27,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2262. [2018-11-23 13:13:27,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2262 states. [2018-11-23 13:13:27,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2262 states to 2262 states and 2490 transitions. [2018-11-23 13:13:27,796 INFO L728 BuchiCegarLoop]: Abstraction has 2262 states and 2490 transitions. [2018-11-23 13:13:27,796 INFO L608 BuchiCegarLoop]: Abstraction has 2262 states and 2490 transitions. [2018-11-23 13:13:27,796 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2018-11-23 13:13:27,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2262 states and 2490 transitions. [2018-11-23 13:13:27,800 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2018-11-23 13:13:27,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:13:27,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:13:27,802 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [37, 37, 25, 14, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2018-11-23 13:13:27,802 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [49, 49, 40, 24, 20, 20, 20, 20, 20, 20, 16, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1] [2018-11-23 13:13:27,803 INFO L794 eck$LassoCheckResult]: Stem: 219643#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 219631#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 219632#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 219633#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 219634#L35-3 assume !!(main_~q~0 <= main_~x~0); 220229#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 220230#partsENTRY ~p := #in~p;~q := #in~q; 220236#L20 assume ~p <= 0;#res := 1; 220234#partsFINAL assume true; 220228#partsEXIT >#67#return; 220225#L36-1 havoc main_#t~ret8; 220224#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 220223#L35-3 assume !!(main_~q~0 <= main_~x~0); 220221#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 220222#partsENTRY ~p := #in~p;~q := #in~q; 220233#L20 assume ~p <= 0;#res := 1; 220227#partsFINAL assume true; 220220#partsEXIT >#67#return; 220217#L36-1 havoc main_#t~ret8; 220213#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 220208#L35-3 assume !!(main_~q~0 <= main_~x~0); 220189#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 220191#partsENTRY ~p := #in~p;~q := #in~q; 220205#L20 assume ~p <= 0;#res := 1; 220204#partsFINAL assume true; 220188#partsEXIT >#67#return; 220185#L36-1 havoc main_#t~ret8; 220181#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 220173#L35-3 assume !!(main_~q~0 <= main_~x~0); 220167#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 220168#partsENTRY ~p := #in~p;~q := #in~q; 220261#L20 assume ~p <= 0;#res := 1; 220259#partsFINAL assume true; 220166#partsEXIT >#67#return; 220164#L36-1 havoc main_#t~ret8; 220162#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 220161#L35-3 assume !(main_~q~0 <= main_~x~0); 220160#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 220159#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 220157#L35-3 assume !!(main_~q~0 <= main_~x~0); 220080#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 220081#partsENTRY ~p := #in~p;~q := #in~q; 220137#L20 assume !(~p <= 0); 220136#L21 assume ~q <= 0;#res := 0; 220135#partsFINAL assume true; 220079#partsEXIT >#67#return; 220078#L36-1 havoc main_#t~ret8; 220077#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 220075#L35-3 assume !!(main_~q~0 <= main_~x~0); 220072#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 220073#partsENTRY ~p := #in~p;~q := #in~q; 220112#L20 assume !(~p <= 0); 220110#L21 assume !(~q <= 0); 220108#L22 assume !(~q > ~p); 220105#L23 call #t~ret1 := parts(~p - ~q, ~q);< 220106#partsENTRY ~p := #in~p;~q := #in~q; 220119#L20 assume ~p <= 0;#res := 1; 220117#partsFINAL assume true; 220104#partsEXIT >#63#return; 220101#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 220102#partsENTRY ~p := #in~p;~q := #in~q; 220305#L20 assume !(~p <= 0); 220302#L21 assume ~q <= 0;#res := 0; 220301#partsFINAL assume true; 220100#partsEXIT >#65#return; 220098#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 220096#partsFINAL assume true; 220071#partsEXIT >#67#return; 220069#L36-1 havoc main_#t~ret8; 220063#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 220061#L35-3 assume !!(main_~q~0 <= main_~x~0); 220054#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 220056#partsENTRY ~p := #in~p;~q := #in~q; 220304#L20 assume !(~p <= 0); 220092#L21 assume !(~q <= 0); 220086#L22 assume ~q > ~p; 220065#L22-1 call #t~ret0 := parts(~p, ~p);< 220068#partsENTRY ~p := #in~p;~q := #in~q; 220256#L20 assume !(~p <= 0); 220255#L21 assume !(~q <= 0); 220253#L22 assume !(~q > ~p); 220147#L23 call #t~ret1 := parts(~p - ~q, ~q);< 220150#partsENTRY ~p := #in~p;~q := #in~q; 220266#L20 assume ~p <= 0;#res := 1; 220262#partsFINAL assume true; 220144#partsEXIT >#63#return; 220149#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 220248#partsENTRY ~p := #in~p;~q := #in~q; 220254#L20 assume !(~p <= 0); 220252#L21 assume ~q <= 0;#res := 0; 220250#partsFINAL assume true; 220247#partsEXIT >#65#return; 220245#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 220082#partsFINAL assume true; 220064#partsEXIT >#61#return; 220067#L22-2 #res := #t~ret0;havoc #t~ret0; 220059#partsFINAL assume true; 220053#partsEXIT >#67#return; 220050#L36-1 havoc main_#t~ret8; 220046#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 220044#L35-3 assume !!(main_~q~0 <= main_~x~0); 220040#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 220042#partsENTRY ~p := #in~p;~q := #in~q; 220093#L20 assume !(~p <= 0); 220058#L21 assume !(~q <= 0); 220052#L22 assume ~q > ~p; 220048#L22-1 call #t~ret0 := parts(~p, ~p);< 220049#partsENTRY ~p := #in~p;~q := #in~q; 220307#L20 assume !(~p <= 0); 220306#L21 assume !(~q <= 0); 220303#L22 assume !(~q > ~p); 220089#L23 call #t~ret1 := parts(~p - ~q, ~q);< 220091#partsENTRY ~p := #in~p;~q := #in~q; 220272#L20 assume ~p <= 0;#res := 1; 220094#partsFINAL assume true; 220087#partsEXIT >#63#return; 220084#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 220085#partsENTRY ~p := #in~p;~q := #in~q; 220251#L20 assume !(~p <= 0); 220249#L21 assume ~q <= 0;#res := 0; 220246#partsFINAL assume true; 220083#partsEXIT >#65#return; 220057#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 220051#partsFINAL assume true; 220047#partsEXIT >#61#return; 220045#L22-2 #res := #t~ret0;havoc #t~ret0; 220043#partsFINAL assume true; 220039#partsEXIT >#67#return; 220038#L36-1 havoc main_#t~ret8; 220037#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 220036#L35-3 assume !(main_~q~0 <= main_~x~0); 220035#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 220033#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 220031#L35-3 assume !!(main_~q~0 <= main_~x~0); 220028#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 220029#partsENTRY ~p := #in~p;~q := #in~q; 220034#L20 assume !(~p <= 0); 220032#L21 assume ~q <= 0;#res := 0; 220030#partsFINAL assume true; 220027#partsEXIT >#67#return; 220026#L36-1 havoc main_#t~ret8; 220025#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 220024#L35-3 assume !!(main_~q~0 <= main_~x~0); 220018#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 220023#partsENTRY ~p := #in~p;~q := #in~q; 220022#L20 assume !(~p <= 0); 220021#L21 assume !(~q <= 0); 220020#L22 assume !(~q > ~p); 220017#L23 call #t~ret1 := parts(~p - ~q, ~q);< 220019#partsENTRY ~p := #in~p;~q := #in~q; 220358#L20 assume !(~p <= 0); 220356#L21 assume !(~q <= 0); 220353#L22 assume !(~q > ~p); 220347#L23 call #t~ret1 := parts(~p - ~q, ~q);< 220349#partsENTRY ~p := #in~p;~q := #in~q; 220352#L20 assume ~p <= 0;#res := 1; 220351#partsFINAL assume true; 220346#partsEXIT >#63#return; 220340#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 220342#partsENTRY ~p := #in~p;~q := #in~q; 220354#L20 assume !(~p <= 0); 220350#L21 assume ~q <= 0;#res := 0; 220343#partsFINAL assume true; 220338#partsEXIT >#65#return; 220337#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 220335#partsFINAL assume true; 220329#partsEXIT >#63#return; 220324#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 220325#partsENTRY ~p := #in~p;~q := #in~q; 220336#L20 assume !(~p <= 0); 220334#L21 assume ~q <= 0;#res := 0; 220328#partsFINAL assume true; 220323#partsEXIT >#65#return; 220317#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 220309#partsFINAL assume true; 220134#partsEXIT >#67#return; 220130#L36-1 havoc main_#t~ret8; 219653#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 219639#L35-3 assume !!(main_~q~0 <= main_~x~0); 219640#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 219687#partsENTRY ~p := #in~p;~q := #in~q; 221409#L20 assume !(~p <= 0); 221359#L21 assume !(~q <= 0); 221355#L22 assume !(~q > ~p); 221305#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221308#partsENTRY ~p := #in~p;~q := #in~q; 221365#L20 assume ~p <= 0;#res := 1; 221353#partsFINAL assume true; 221304#partsEXIT >#63#return; 221299#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221300#partsENTRY ~p := #in~p;~q := #in~q; 221399#L20 assume !(~p <= 0); 221397#L21 assume !(~q <= 0); 221395#L22 assume !(~q > ~p); 219985#L23 call #t~ret1 := parts(~p - ~q, ~q);< 219994#partsENTRY ~p := #in~p;~q := #in~q; 219993#L20 assume !(~p <= 0); 219992#L21 assume !(~q <= 0); 219991#L22 assume !(~q > ~p); 219983#L23 call #t~ret1 := parts(~p - ~q, ~q);< 219988#partsENTRY ~p := #in~p;~q := #in~q; 219990#L20 assume ~p <= 0;#res := 1; 219989#partsFINAL assume true; 219982#partsEXIT >#63#return; 219967#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 219972#partsENTRY ~p := #in~p;~q := #in~q; 219980#L20 assume !(~p <= 0); 219978#L21 assume ~q <= 0;#res := 0; 219973#partsFINAL assume true; 219966#partsEXIT >#65#return; 219970#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 221344#partsFINAL assume true; 221339#partsEXIT >#63#return; 221334#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221335#partsENTRY ~p := #in~p;~q := #in~q; 221368#L20 assume !(~p <= 0); 221367#L21 assume ~q <= 0;#res := 0; 221366#partsFINAL assume true; 221333#partsEXIT >#65#return; 221329#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 221327#partsFINAL assume true; 221298#partsEXIT >#65#return; 221295#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 221291#partsFINAL assume true; 221231#partsEXIT >#67#return; 221229#L36-1 havoc main_#t~ret8; 221228#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 219697#L35-3 assume !!(main_~q~0 <= main_~x~0); 219698#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 221219#partsENTRY ~p := #in~p;~q := #in~q; 221217#L20 assume !(~p <= 0); 221215#L21 assume !(~q <= 0); 221213#L22 assume ~q > ~p; 219702#L22-1 call #t~ret0 := parts(~p, ~p);< 219703#partsENTRY ~p := #in~p;~q := #in~q; 221206#L20 assume !(~p <= 0); 221187#L21 assume !(~q <= 0); 221188#L22 assume !(~q > ~p); 221183#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221184#partsENTRY ~p := #in~p;~q := #in~q; 221193#L20 assume ~p <= 0;#res := 1; 221189#partsFINAL assume true; 221182#partsEXIT >#63#return; 221092#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221099#partsENTRY ~p := #in~p;~q := #in~q; 221376#L20 assume !(~p <= 0); 221374#L21 assume !(~q <= 0); 221372#L22 assume !(~q > ~p); 221324#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221325#partsENTRY ~p := #in~p;~q := #in~q; 221400#L20 assume !(~p <= 0); 221398#L21 assume !(~q <= 0); 221342#L22 assume !(~q > ~p); 221337#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221338#partsENTRY ~p := #in~p;~q := #in~q; 221393#L20 assume ~p <= 0;#res := 1; 221390#partsFINAL assume true; 221336#partsEXIT >#63#return; 221331#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221332#partsENTRY ~p := #in~p;~q := #in~q; 221364#L20 assume !(~p <= 0); 221362#L21 assume ~q <= 0;#res := 0; 221361#partsFINAL assume true; 221330#partsEXIT >#65#return; 221328#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 221326#partsFINAL assume true; 221323#partsEXIT >#63#return; 221321#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221322#partsENTRY ~p := #in~p;~q := #in~q; 221414#L20 assume !(~p <= 0); 221412#L21 assume ~q <= 0;#res := 0; 221360#partsFINAL assume true; 221320#partsEXIT >#65#return; 221319#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 221318#partsFINAL assume true; 221091#partsEXIT >#65#return; 221089#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 221090#partsFINAL assume true; 221285#partsEXIT >#61#return; 221283#L22-2 #res := #t~ret0;havoc #t~ret0; 221281#partsFINAL assume true; 221227#partsEXIT >#67#return; 219690#L36-1 [2018-11-23 13:13:27,803 INFO L796 eck$LassoCheckResult]: Loop: 219690#L36-1 havoc main_#t~ret8; 219652#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 219637#L35-3 assume !(main_~q~0 <= main_~x~0); 219638#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 219641#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 219691#L35-3 assume !!(main_~q~0 <= main_~x~0); 219685#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 219686#partsENTRY ~p := #in~p;~q := #in~q; 219711#L20 assume !(~p <= 0); 219707#L21 assume ~q <= 0;#res := 0; 219706#partsFINAL assume true; 219705#partsEXIT >#67#return; 219674#L36-1 havoc main_#t~ret8; 219675#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 220498#L35-3 assume !!(main_~q~0 <= main_~x~0); 219895#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 219896#partsENTRY ~p := #in~p;~q := #in~q; 220520#L20 assume !(~p <= 0); 220517#L21 assume !(~q <= 0); 220497#L22 assume !(~q > ~p); 220012#L23 call #t~ret1 := parts(~p - ~q, ~q);< 220013#partsENTRY ~p := #in~p;~q := #in~q; 220397#L20 assume !(~p <= 0); 220396#L21 assume !(~q <= 0); 220395#L22 assume !(~q > ~p); 219628#L23 call #t~ret1 := parts(~p - ~q, ~q);< 220394#partsENTRY ~p := #in~p;~q := #in~q; 220406#L20 assume !(~p <= 0); 220405#L21 assume !(~q <= 0); 220404#L22 assume !(~q > ~p); 219627#L23 call #t~ret1 := parts(~p - ~q, ~q);< 219630#partsENTRY ~p := #in~p;~q := #in~q; 221759#L20 assume ~p <= 0;#res := 1; 221757#partsFINAL assume true; 221755#partsEXIT >#63#return; 221752#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221753#partsENTRY ~p := #in~p;~q := #in~q; 221758#L20 assume !(~p <= 0); 221756#L21 assume ~q <= 0;#res := 0; 221754#partsFINAL assume true; 221751#partsEXIT >#65#return; 220390#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 221747#partsFINAL assume true; 220393#partsEXIT >#63#return; 220388#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 220391#partsENTRY ~p := #in~p;~q := #in~q; 220412#L20 assume !(~p <= 0); 220409#L21 assume ~q <= 0;#res := 0; 220401#partsFINAL assume true; 220387#partsEXIT >#65#return; 220385#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 220016#partsFINAL assume true; 220011#partsEXIT >#63#return; 220005#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 220006#partsENTRY ~p := #in~p;~q := #in~q; 220443#L20 assume !(~p <= 0); 220441#L21 assume ~q <= 0;#res := 0; 220439#partsFINAL assume true; 220004#partsEXIT >#65#return; 220000#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 220001#partsFINAL assume true; 219894#partsEXIT >#67#return; 219892#L36-1 havoc main_#t~ret8; 219893#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 221406#L35-3 assume !!(main_~q~0 <= main_~x~0); 219731#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 221405#partsENTRY ~p := #in~p;~q := #in~q; 221403#L20 assume !(~p <= 0); 221402#L21 assume !(~q <= 0); 221401#L22 assume !(~q > ~p); 219877#L23 call #t~ret1 := parts(~p - ~q, ~q);< 219880#partsENTRY ~p := #in~p;~q := #in~q; 221556#L20 assume !(~p <= 0); 221557#L21 assume !(~q <= 0); 221552#L22 assume ~q > ~p; 221358#L22-1 call #t~ret0 := parts(~p, ~p);< 221411#partsENTRY ~p := #in~p;~q := #in~q; 221410#L20 assume !(~p <= 0); 221408#L21 assume !(~q <= 0); 221407#L22 assume !(~q > ~p); 221310#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221313#partsENTRY ~p := #in~p;~q := #in~q; 221363#L20 assume ~p <= 0;#res := 1; 221356#partsFINAL assume true; 221309#partsEXIT >#63#return; 221312#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221769#partsENTRY ~p := #in~p;~q := #in~q; 221772#L20 assume !(~p <= 0); 221771#L21 assume ~q <= 0;#res := 0; 221770#partsFINAL assume true; 221768#partsEXIT >#65#return; 221767#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 221766#partsFINAL assume true; 221764#partsEXIT >#61#return; 221763#L22-2 #res := #t~ret0;havoc #t~ret0; 221760#partsFINAL assume true; 219876#partsEXIT >#63#return; 219741#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 219742#partsENTRY ~p := #in~p;~q := #in~q; 219834#L20 assume !(~p <= 0); 219831#L21 assume !(~q <= 0); 219754#L22 assume !(~q > ~p); 219750#L23 call #t~ret1 := parts(~p - ~q, ~q);< 219751#partsENTRY ~p := #in~p;~q := #in~q; 219872#L20 assume !(~p <= 0); 219871#L21 assume !(~q <= 0); 219870#L22 assume !(~q > ~p); 219867#L23 call #t~ret1 := parts(~p - ~q, ~q);< 219869#partsENTRY ~p := #in~p;~q := #in~q; 219903#L20 assume !(~p <= 0); 219899#L21 assume !(~q <= 0); 219900#L22 assume !(~q > ~p); 219976#L23 call #t~ret1 := parts(~p - ~q, ~q);< 219977#partsENTRY ~p := #in~p;~q := #in~q; 219981#L20 assume ~p <= 0;#res := 1; 219979#partsFINAL assume true; 219975#partsEXIT >#63#return; 219968#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 219972#partsENTRY ~p := #in~p;~q := #in~q; 219980#L20 assume !(~p <= 0); 219978#L21 assume ~q <= 0;#res := 0; 219973#partsFINAL assume true; 219966#partsEXIT >#65#return; 219859#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 219897#partsFINAL assume true; 219865#partsEXIT >#63#return; 219856#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 219860#partsENTRY ~p := #in~p;~q := #in~q; 219874#L20 assume !(~p <= 0); 219873#L21 assume ~q <= 0;#res := 0; 219863#partsFINAL assume true; 219854#partsEXIT >#65#return; 219842#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 219833#partsFINAL assume true; 219749#partsEXIT >#63#return; 219746#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 219747#partsENTRY ~p := #in~p;~q := #in~q; 219753#L20 assume !(~p <= 0); 219752#L21 assume ~q <= 0;#res := 0; 219748#partsFINAL assume true; 219745#partsEXIT >#65#return; 219744#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 219743#partsFINAL assume true; 219740#partsEXIT >#65#return; 219738#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 219736#partsFINAL assume true; 219730#partsEXIT >#67#return; 219729#L36-1 havoc main_#t~ret8; 219728#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 219727#L35-3 assume !!(main_~q~0 <= main_~x~0); 219655#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 219726#partsENTRY ~p := #in~p;~q := #in~q; 219829#L20 assume !(~p <= 0); 219827#L21 assume !(~q <= 0); 219825#L22 assume !(~q > ~p); 219808#L23 call #t~ret1 := parts(~p - ~q, ~q);< 219809#partsENTRY ~p := #in~p;~q := #in~q; 219823#L20 assume ~p <= 0;#res := 1; 219822#partsFINAL assume true; 219807#partsEXIT >#63#return; 219780#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 219798#partsENTRY ~p := #in~p;~q := #in~q; 219793#L20 assume !(~p <= 0); 219787#L21 assume !(~q <= 0); 219785#L22 assume !(~q > ~p); 219782#L23 call #t~ret1 := parts(~p - ~q, ~q);< 219783#partsENTRY ~p := #in~p;~q := #in~q; 219806#L20 assume !(~p <= 0); 219801#L21 assume !(~q <= 0); 219797#L22 assume ~q > ~p; 219789#L22-1 call #t~ret0 := parts(~p, ~p);< 219792#partsENTRY ~p := #in~p;~q := #in~q; 219821#L20 assume !(~p <= 0); 219819#L21 assume !(~q <= 0); 219817#L22 assume !(~q > ~p); 219814#L23 call #t~ret1 := parts(~p - ~q, ~q);< 219815#partsENTRY ~p := #in~p;~q := #in~q; 219826#L20 assume ~p <= 0;#res := 1; 219824#partsFINAL assume true; 219813#partsEXIT >#63#return; 219803#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 219804#partsENTRY ~p := #in~p;~q := #in~q; 219812#L20 assume !(~p <= 0); 219811#L21 assume ~q <= 0;#res := 0; 219810#partsFINAL assume true; 219802#partsEXIT >#65#return; 219799#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 219794#partsFINAL assume true; 219788#partsEXIT >#61#return; 219786#L22-2 #res := #t~ret0;havoc #t~ret0; 219784#partsFINAL assume true; 219781#partsEXIT >#63#return; 219766#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 219779#partsENTRY ~p := #in~p;~q := #in~q; 219778#L20 assume !(~p <= 0); 219776#L21 assume !(~q <= 0); 219774#L22 assume !(~q > ~p); 219769#L23 call #t~ret1 := parts(~p - ~q, ~q);< 219770#partsENTRY ~p := #in~p;~q := #in~q; 219853#L20 assume !(~p <= 0); 219852#L21 assume !(~q <= 0); 219851#L22 assume !(~q > ~p); 219847#L23 call #t~ret1 := parts(~p - ~q, ~q);< 219850#partsENTRY ~p := #in~p;~q := #in~q; 219888#L20 assume !(~p <= 0); 219884#L21 assume !(~q <= 0); 219885#L22 assume !(~q > ~p); 219937#L23 call #t~ret1 := parts(~p - ~q, ~q);< 219938#partsENTRY ~p := #in~p;~q := #in~q; 219942#L20 assume ~p <= 0;#res := 1; 219940#partsFINAL assume true; 219936#partsEXIT >#63#return; 219929#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 219932#partsENTRY ~p := #in~p;~q := #in~q; 219941#L20 assume !(~p <= 0); 219939#L21 assume ~q <= 0;#res := 0; 219933#partsFINAL assume true; 219926#partsEXIT >#65#return; 219839#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 219882#partsFINAL assume true; 219846#partsEXIT >#63#return; 219838#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 219841#partsENTRY ~p := #in~p;~q := #in~q; 219862#L20 assume !(~p <= 0); 219861#L21 assume ~q <= 0;#res := 0; 219843#partsFINAL assume true; 219835#partsEXIT >#65#return; 219832#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 219830#partsFINAL assume true; 219767#partsEXIT >#63#return; 219761#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 219764#partsENTRY ~p := #in~p;~q := #in~q; 219773#L20 assume !(~p <= 0); 219771#L21 assume ~q <= 0;#res := 0; 219765#partsFINAL assume true; 219760#partsEXIT >#65#return; 219763#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 221521#partsFINAL assume true; 221520#partsEXIT >#65#return; 221519#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 221518#partsFINAL assume true; 221500#partsEXIT >#65#return; 221496#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 221495#partsFINAL assume true; 221235#partsEXIT >#67#return; 221230#L36-1 havoc main_#t~ret8; 221223#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 221222#L35-3 assume !!(main_~q~0 <= main_~x~0); 221211#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 221218#partsENTRY ~p := #in~p;~q := #in~q; 221216#L20 assume !(~p <= 0); 221214#L21 assume !(~q <= 0); 221212#L22 assume ~q > ~p; 219721#L22-1 call #t~ret0 := parts(~p, ~p);< 221209#partsENTRY ~p := #in~p;~q := #in~q; 221207#L20 assume !(~p <= 0); 221194#L21 assume !(~q <= 0); 221195#L22 assume !(~q > ~p); 221104#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221107#partsENTRY ~p := #in~p;~q := #in~q; 221120#L20 assume ~p <= 0;#res := 1; 221114#partsFINAL assume true; 221103#partsEXIT >#63#return; 221094#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221249#partsENTRY ~p := #in~p;~q := #in~q; 221247#L20 assume !(~p <= 0); 221243#L21 assume !(~q <= 0); 221240#L22 assume !(~q > ~p); 221127#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221129#partsENTRY ~p := #in~p;~q := #in~q; 221174#L20 assume !(~p <= 0); 221172#L21 assume !(~q <= 0); 221166#L22 assume ~q > ~p; 221148#L22-1 call #t~ret0 := parts(~p, ~p);< 221150#partsENTRY ~p := #in~p;~q := #in~q; 221181#L20 assume !(~p <= 0); 221180#L21 assume !(~q <= 0); 221179#L22 assume !(~q > ~p); 221170#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221171#partsENTRY ~p := #in~p;~q := #in~q; 221178#L20 assume ~p <= 0;#res := 1; 221176#partsFINAL assume true; 221169#partsEXIT >#63#return; 221161#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221162#partsENTRY ~p := #in~p;~q := #in~q; 221175#L20 assume !(~p <= 0); 221173#L21 assume ~q <= 0;#res := 0; 221168#partsFINAL assume true; 221160#partsEXIT >#65#return; 221158#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 221154#partsFINAL assume true; 221146#partsEXIT >#61#return; 221139#L22-2 #res := #t~ret0;havoc #t~ret0; 221137#partsFINAL assume true; 221124#partsEXIT >#63#return; 221110#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221113#partsENTRY ~p := #in~p;~q := #in~q; 221588#L20 assume !(~p <= 0); 221566#L21 assume !(~q <= 0); 221565#L22 assume !(~q > ~p); 221143#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221145#partsENTRY ~p := #in~p;~q := #in~q; 221539#L20 assume !(~p <= 0); 221538#L21 assume !(~q <= 0); 221537#L22 assume !(~q > ~p); 221533#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221536#partsENTRY ~p := #in~p;~q := #in~q; 221624#L20 assume !(~p <= 0); 221622#L21 assume !(~q <= 0); 221620#L22 assume !(~q > ~p); 221616#L23 call #t~ret1 := parts(~p - ~q, ~q);< 221617#partsENTRY ~p := #in~p;~q := #in~q; 221630#L20 assume ~p <= 0;#res := 1; 221626#partsFINAL assume true; 221615#partsEXIT >#63#return; 219663#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221440#partsENTRY ~p := #in~p;~q := #in~q; 221453#L20 assume !(~p <= 0); 221449#L21 assume ~q <= 0;#res := 0; 221443#partsFINAL assume true; 221435#partsEXIT >#65#return; 221438#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 221692#partsFINAL assume true; 221531#partsEXIT >#63#return; 221527#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221529#partsENTRY ~p := #in~p;~q := #in~q; 221550#L20 assume !(~p <= 0); 221549#L21 assume ~q <= 0;#res := 0; 221544#partsFINAL assume true; 221524#partsEXIT >#65#return; 221523#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 221522#partsFINAL assume true; 221142#partsEXIT >#63#return; 221134#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 221136#partsENTRY ~p := #in~p;~q := #in~q; 221153#L20 assume !(~p <= 0); 221152#L21 assume ~q <= 0;#res := 0; 221141#partsFINAL assume true; 221132#partsEXIT >#65#return; 221123#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 221116#partsFINAL assume true; 221108#partsEXIT >#65#return; 221102#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 221101#partsFINAL assume true; 221093#partsEXIT >#65#return; 221097#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 221273#partsFINAL assume true; 221265#partsEXIT >#61#return; 221262#L22-2 #res := #t~ret0;havoc #t~ret0; 221259#partsFINAL assume true; 221226#partsEXIT >#67#return; 219690#L36-1 [2018-11-23 13:13:27,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:27,803 INFO L82 PathProgramCache]: Analyzing trace with hash -2031234513, now seen corresponding path program 13 times [2018-11-23 13:13:27,804 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:27,804 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:27,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:27,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:27,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:27,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:27,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:27,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1417764729, now seen corresponding path program 8 times [2018-11-23 13:13:27,832 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:27,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:27,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:27,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:27,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:27,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:27,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1441646439, now seen corresponding path program 14 times [2018-11-23 13:13:27,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:27,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:27,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:27,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:27,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:28,128 INFO L134 CoverageAnalysis]: Checked inductivity of 19415 backedges. 563 proven. 295 refuted. 0 times theorem prover too weak. 18557 trivial. 0 not checked. [2018-11-23 13:13:28,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:28,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:13:28,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:13:28,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:13:28,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:28,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:28,459 INFO L134 CoverageAnalysis]: Checked inductivity of 19415 backedges. 5799 proven. 247 refuted. 0 times theorem prover too weak. 13369 trivial. 0 not checked. [2018-11-23 13:13:28,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:28,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2018-11-23 13:13:30,749 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 106 [2018-11-23 13:13:30,772 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:13:30,772 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:13:30,772 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:13:30,772 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:13:30,772 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:13:30,772 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:30,772 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:13:30,772 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:13:30,772 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration29_Loop [2018-11-23 13:13:30,772 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:13:30,773 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:13:30,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:30,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:30,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:30,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:30,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:30,817 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:13:30,817 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:30,819 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:13:30,819 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:30,839 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:13:30,840 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:13:30,913 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:13:30,915 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:13:30,915 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:13:30,915 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:13:30,915 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:13:30,915 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:13:30,915 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:30,915 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:13:30,915 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:13:30,915 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration29_Loop [2018-11-23 13:13:30,915 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:13:30,915 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:13:30,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:30,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:30,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:30,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:30,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:30,956 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:13:30,956 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:13:30,957 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:13:30,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:13:30,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:13:30,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:13:30,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:13:30,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:13:30,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:13:30,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:13:30,959 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:13:30,960 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:13:30,960 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 13:13:30,960 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:13:30,960 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:13:30,960 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:13:30,960 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0) = -2*ULTIMATE.start_main_~p~0 + 5 Supporting invariants [] [2018-11-23 13:13:30,960 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:13:30,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:31,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:31,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6387 backedges. 40 proven. 881 refuted. 0 times theorem prover too weak. 5466 trivial. 0 not checked. [2018-11-23 13:13:31,441 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 12 loop predicates [2018-11-23 13:13:31,442 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2262 states and 2490 transitions. cyclomatic complexity: 253 Second operand 15 states. [2018-11-23 13:13:31,957 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2262 states and 2490 transitions. cyclomatic complexity: 253. Second operand 15 states. Result 7049 states and 8383 transitions. Complement of second has 121 states. [2018-11-23 13:13:31,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 17 states 2 stem states 14 non-accepting loop states 1 accepting loop states [2018-11-23 13:13:31,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:13:31,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 112 transitions. [2018-11-23 13:13:31,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 112 transitions. Stem has 282 letters. Loop has 351 letters. [2018-11-23 13:13:31,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:31,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 112 transitions. Stem has 633 letters. Loop has 351 letters. [2018-11-23 13:13:31,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:31,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 112 transitions. Stem has 282 letters. Loop has 702 letters. [2018-11-23 13:13:31,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:31,960 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7049 states and 8383 transitions. [2018-11-23 13:13:31,980 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 54 [2018-11-23 13:13:31,996 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7049 states to 4987 states and 5917 transitions. [2018-11-23 13:13:31,996 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 466 [2018-11-23 13:13:31,996 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 466 [2018-11-23 13:13:31,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4987 states and 5917 transitions. [2018-11-23 13:13:31,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:13:31,996 INFO L705 BuchiCegarLoop]: Abstraction has 4987 states and 5917 transitions. [2018-11-23 13:13:31,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states and 5917 transitions. [2018-11-23 13:13:32,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 3390. [2018-11-23 13:13:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3390 states. [2018-11-23 13:13:32,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 3752 transitions. [2018-11-23 13:13:32,029 INFO L728 BuchiCegarLoop]: Abstraction has 3390 states and 3752 transitions. [2018-11-23 13:13:32,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 13:13:32,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2018-11-23 13:13:32,029 INFO L87 Difference]: Start difference. First operand 3390 states and 3752 transitions. Second operand 25 states. [2018-11-23 13:13:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:32,674 INFO L93 Difference]: Finished difference Result 4255 states and 4944 transitions. [2018-11-23 13:13:32,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 13:13:32,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4255 states and 4944 transitions. [2018-11-23 13:13:32,685 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2018-11-23 13:13:32,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4255 states to 3987 states and 4583 transitions. [2018-11-23 13:13:32,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 324 [2018-11-23 13:13:32,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 380 [2018-11-23 13:13:32,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3987 states and 4583 transitions. [2018-11-23 13:13:32,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:13:32,697 INFO L705 BuchiCegarLoop]: Abstraction has 3987 states and 4583 transitions. [2018-11-23 13:13:32,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3987 states and 4583 transitions. [2018-11-23 13:13:32,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3987 to 3685. [2018-11-23 13:13:32,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3685 states. [2018-11-23 13:13:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 3685 states and 4158 transitions. [2018-11-23 13:13:32,725 INFO L728 BuchiCegarLoop]: Abstraction has 3685 states and 4158 transitions. [2018-11-23 13:13:32,725 INFO L608 BuchiCegarLoop]: Abstraction has 3685 states and 4158 transitions. [2018-11-23 13:13:32,725 INFO L442 BuchiCegarLoop]: ======== Iteration 30============ [2018-11-23 13:13:32,725 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3685 states and 4158 transitions. [2018-11-23 13:13:32,731 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2018-11-23 13:13:32,731 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:13:32,731 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:13:32,732 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [65, 61, 49, 29, 24, 23, 21, 21, 20, 20, 20, 16, 16, 16, 15, 15, 15, 5, 5, 5, 5, 4, 3, 3, 1, 1, 1] [2018-11-23 13:13:32,732 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:13:32,732 INFO L794 eck$LassoCheckResult]: Stem: 240639#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 240627#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 240628#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 240633#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 241903#L35-3 assume !!(main_~q~0 <= main_~x~0); 241901#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 241902#partsENTRY ~p := #in~p;~q := #in~q; 241905#L20 assume ~p <= 0;#res := 1; 241904#partsFINAL assume true; 241900#partsEXIT >#67#return; 241898#L36-1 havoc main_#t~ret8; 241896#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 241895#L35-3 assume !!(main_~q~0 <= main_~x~0); 241893#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 241894#partsENTRY ~p := #in~p;~q := #in~q; 241899#L20 assume ~p <= 0;#res := 1; 241897#partsFINAL assume true; 241892#partsEXIT >#67#return; 241890#L36-1 havoc main_#t~ret8; 241888#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 241887#L35-3 assume !!(main_~q~0 <= main_~x~0); 241884#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 241885#partsENTRY ~p := #in~p;~q := #in~q; 241891#L20 assume ~p <= 0;#res := 1; 241889#partsFINAL assume true; 241883#partsEXIT >#67#return; 241881#L36-1 havoc main_#t~ret8; 241879#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 241877#L35-3 assume !!(main_~q~0 <= main_~x~0); 241626#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 241629#partsENTRY ~p := #in~p;~q := #in~q; 241634#L20 assume ~p <= 0;#res := 1; 241632#partsFINAL assume true; 241625#partsEXIT >#67#return; 241624#L36-1 havoc main_#t~ret8; 241623#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 241622#L35-3 assume !(main_~q~0 <= main_~x~0); 241620#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 241618#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 241617#L35-3 assume !!(main_~q~0 <= main_~x~0); 241613#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 241616#partsENTRY ~p := #in~p;~q := #in~q; 241639#L20 assume !(~p <= 0); 241637#L21 assume ~q <= 0;#res := 0; 241636#partsFINAL assume true; 241612#partsEXIT >#67#return; 241611#L36-1 havoc main_#t~ret8; 241609#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 241607#L35-3 assume !!(main_~q~0 <= main_~x~0); 241602#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 241605#partsENTRY ~p := #in~p;~q := #in~q; 241703#L20 assume !(~p <= 0); 241701#L21 assume !(~q <= 0); 241700#L22 assume !(~q > ~p); 241698#L23 call #t~ret1 := parts(~p - ~q, ~q);< 241699#partsENTRY ~p := #in~p;~q := #in~q; 241704#L20 assume ~p <= 0;#res := 1; 241702#partsFINAL assume true; 241697#partsEXIT >#63#return; 241695#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 241696#partsENTRY ~p := #in~p;~q := #in~q; 241711#L20 assume !(~p <= 0); 241709#L21 assume ~q <= 0;#res := 0; 241707#partsFINAL assume true; 241694#partsEXIT >#65#return; 241693#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 241691#partsFINAL assume true; 241601#partsEXIT >#67#return; 241600#L36-1 havoc main_#t~ret8; 241599#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 241598#L35-3 assume !!(main_~q~0 <= main_~x~0); 241594#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 241596#partsENTRY ~p := #in~p;~q := #in~q; 241651#L20 assume !(~p <= 0); 241650#L21 assume !(~q <= 0); 241648#L22 assume ~q > ~p; 241644#L22-1 call #t~ret0 := parts(~p, ~p);< 241646#partsENTRY ~p := #in~p;~q := #in~q; 241681#L20 assume !(~p <= 0); 241677#L21 assume !(~q <= 0); 241676#L22 assume !(~q > ~p); 241670#L23 call #t~ret1 := parts(~p - ~q, ~q);< 241675#partsENTRY ~p := #in~p;~q := #in~q; 241682#L20 assume ~p <= 0;#res := 1; 241678#partsFINAL assume true; 241669#partsEXIT >#63#return; 241667#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 241668#partsENTRY ~p := #in~p;~q := #in~q; 241686#L20 assume !(~p <= 0); 241684#L21 assume ~q <= 0;#res := 0; 241683#partsFINAL assume true; 241666#partsEXIT >#65#return; 241665#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 241654#partsFINAL assume true; 241642#partsEXIT >#61#return; 241641#L22-2 #res := #t~ret0;havoc #t~ret0; 241606#partsFINAL assume true; 241592#partsEXIT >#67#return; 241590#L36-1 havoc main_#t~ret8; 241587#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 241586#L35-3 assume !!(main_~q~0 <= main_~x~0); 241582#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 241585#partsENTRY ~p := #in~p;~q := #in~q; 241722#L20 assume !(~p <= 0); 241720#L21 assume !(~q <= 0); 241719#L22 assume ~q > ~p; 241717#L22-1 call #t~ret0 := parts(~p, ~p);< 241718#partsENTRY ~p := #in~p;~q := #in~q; 241736#L20 assume !(~p <= 0); 241733#L21 assume !(~q <= 0); 241732#L22 assume !(~q > ~p); 241729#L23 call #t~ret1 := parts(~p - ~q, ~q);< 241731#partsENTRY ~p := #in~p;~q := #in~q; 241740#L20 assume ~p <= 0;#res := 1; 241734#partsFINAL assume true; 241727#partsEXIT >#63#return; 241725#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 241726#partsENTRY ~p := #in~p;~q := #in~q; 241747#L20 assume !(~p <= 0); 241745#L21 assume ~q <= 0;#res := 0; 241743#partsFINAL assume true; 241724#partsEXIT >#65#return; 241723#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 241721#partsFINAL assume true; 241716#partsEXIT >#61#return; 241715#L22-2 #res := #t~ret0;havoc #t~ret0; 241588#partsFINAL assume true; 241579#partsEXIT >#67#return; 241576#L36-1 havoc main_#t~ret8; 241574#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 241572#L35-3 assume !(main_~q~0 <= main_~x~0); 241571#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 241570#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 241567#L35-3 assume !!(main_~q~0 <= main_~x~0); 241561#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 241565#partsENTRY ~p := #in~p;~q := #in~q; 241757#L20 assume !(~p <= 0); 241755#L21 assume ~q <= 0;#res := 0; 241750#partsFINAL assume true; 241559#partsEXIT >#67#return; 241432#L36-1 havoc main_#t~ret8; 241428#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 241424#L35-3 assume !!(main_~q~0 <= main_~x~0); 241419#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 241422#partsENTRY ~p := #in~p;~q := #in~q; 241505#L20 assume !(~p <= 0); 241503#L21 assume !(~q <= 0); 241502#L22 assume !(~q > ~p); 241051#L23 call #t~ret1 := parts(~p - ~q, ~q);< 241055#partsENTRY ~p := #in~p;~q := #in~q; 241088#L20 assume !(~p <= 0); 241085#L21 assume !(~q <= 0); 241082#L22 assume !(~q > ~p); 241077#L23 call #t~ret1 := parts(~p - ~q, ~q);< 241079#partsENTRY ~p := #in~p;~q := #in~q; 241086#L20 assume ~p <= 0;#res := 1; 241081#partsFINAL assume true; 241076#partsEXIT >#63#return; 241069#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 241071#partsENTRY ~p := #in~p;~q := #in~q; 241083#L20 assume !(~p <= 0); 241080#L21 assume ~q <= 0;#res := 0; 241073#partsFINAL assume true; 241067#partsEXIT >#65#return; 241065#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 241058#partsFINAL assume true; 241049#partsEXIT >#63#return; 241054#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 241501#partsENTRY ~p := #in~p;~q := #in~q; 241507#L20 assume !(~p <= 0); 241506#L21 assume ~q <= 0;#res := 0; 241504#partsFINAL assume true; 241500#partsEXIT >#65#return; 241498#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 241494#partsFINAL assume true; 241416#partsEXIT >#67#return; 241412#L36-1 havoc main_#t~ret8; 241414#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 243940#L35-3 assume !!(main_~q~0 <= main_~x~0); 243815#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 243916#partsENTRY ~p := #in~p;~q := #in~q; 243914#L20 assume !(~p <= 0); 243912#L21 assume !(~q <= 0); 243909#L22 assume !(~q > ~p); 243807#L23 call #t~ret1 := parts(~p - ~q, ~q);< 243810#partsENTRY ~p := #in~p;~q := #in~q; 243820#L20 assume ~p <= 0;#res := 1; 243814#partsFINAL assume true; 243806#partsEXIT >#63#return; 243808#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 243895#partsENTRY ~p := #in~p;~q := #in~q; 243894#L20 assume !(~p <= 0); 243893#L21 assume !(~q <= 0); 243891#L22 assume !(~q > ~p); 243832#L23 call #t~ret1 := parts(~p - ~q, ~q);< 243837#partsENTRY ~p := #in~p;~q := #in~q; 243859#L20 assume !(~p <= 0); 243858#L21 assume !(~q <= 0); 243856#L22 assume !(~q > ~p); 243853#L23 call #t~ret1 := parts(~p - ~q, ~q);< 243854#partsENTRY ~p := #in~p;~q := #in~q; 243863#L20 assume ~p <= 0;#res := 1; 243860#partsFINAL assume true; 243851#partsEXIT >#63#return; 243846#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 243849#partsENTRY ~p := #in~p;~q := #in~q; 243880#L20 assume !(~p <= 0); 243876#L21 assume ~q <= 0;#res := 0; 243867#partsFINAL assume true; 243843#partsEXIT >#65#return; 243842#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 243840#partsFINAL assume true; 243831#partsEXIT >#63#return; 243836#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 243978#partsENTRY ~p := #in~p;~q := #in~q; 243981#L20 assume !(~p <= 0); 243980#L21 assume ~q <= 0;#res := 0; 243979#partsFINAL assume true; 243977#partsEXIT >#65#return; 243976#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 243975#partsFINAL assume true; 243974#partsEXIT >#65#return; 243973#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 243972#partsFINAL assume true; 243970#partsEXIT >#67#return; 243968#L36-1 havoc main_#t~ret8; 243967#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 243958#L35-3 assume !!(main_~q~0 <= main_~x~0); 243197#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 243185#partsENTRY ~p := #in~p;~q := #in~q; 243420#L20 assume !(~p <= 0); 243415#L21 assume !(~q <= 0); 243412#L22 assume ~q > ~p; 243408#L22-1 call #t~ret0 := parts(~p, ~p);< 243409#partsENTRY ~p := #in~p;~q := #in~q; 243447#L20 assume !(~p <= 0); 243442#L21 assume !(~q <= 0); 243434#L22 assume !(~q > ~p); 243425#L23 call #t~ret1 := parts(~p - ~q, ~q);< 243426#partsENTRY ~p := #in~p;~q := #in~q; 243433#L20 assume ~p <= 0;#res := 1; 243432#partsFINAL assume true; 243424#partsEXIT >#63#return; 243418#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 243419#partsENTRY ~p := #in~p;~q := #in~q; 243469#L20 assume !(~p <= 0); 243468#L21 assume !(~q <= 0); 243467#L22 assume !(~q > ~p); 243445#L23 call #t~ret1 := parts(~p - ~q, ~q);< 243446#partsENTRY ~p := #in~p;~q := #in~q; 243466#L20 assume !(~p <= 0); 243465#L21 assume !(~q <= 0); 243462#L22 assume !(~q > ~p); 243457#L23 call #t~ret1 := parts(~p - ~q, ~q);< 243458#partsENTRY ~p := #in~p;~q := #in~q; 243464#L20 assume ~p <= 0;#res := 1; 243461#partsFINAL assume true; 243456#partsEXIT >#63#return; 243453#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 243454#partsENTRY ~p := #in~p;~q := #in~q; 243463#L20 assume !(~p <= 0); 243459#L21 assume ~q <= 0;#res := 0; 243455#partsFINAL assume true; 243452#partsEXIT >#65#return; 243451#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 243449#partsFINAL assume true; 243444#partsEXIT >#63#return; 243430#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 243431#partsENTRY ~p := #in~p;~q := #in~q; 243460#L20 assume !(~p <= 0); 243440#L21 assume ~q <= 0;#res := 0; 243438#partsFINAL assume true; 243429#partsEXIT >#65#return; 243423#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 243422#partsFINAL assume true; 243417#partsEXIT >#65#return; 243414#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 243411#partsFINAL assume true; 243407#partsEXIT >#61#return; 243405#L22-2 #res := #t~ret0;havoc #t~ret0; 243402#partsFINAL assume true; 243195#partsEXIT >#67#return; 243194#L36-1 havoc main_#t~ret8; 243189#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 243186#L35-3 assume !(main_~q~0 <= main_~x~0); 240638#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 240631#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 240632#L35-3 assume !!(main_~q~0 <= main_~x~0); 243134#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 243137#partsENTRY ~p := #in~p;~q := #in~q; 243157#L20 assume !(~p <= 0); 243150#L21 assume ~q <= 0;#res := 0; 243143#partsFINAL assume true; 243133#partsEXIT >#67#return; 243136#L36-1 havoc main_#t~ret8; 243190#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 243187#L35-3 assume !!(main_~q~0 <= main_~x~0); 243109#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 243112#partsENTRY ~p := #in~p;~q := #in~q; 243129#L20 assume !(~p <= 0); 243128#L21 assume !(~q <= 0); 243126#L22 assume !(~q > ~p); 243123#L23 call #t~ret1 := parts(~p - ~q, ~q);< 243124#partsENTRY ~p := #in~p;~q := #in~q; 243173#L20 assume !(~p <= 0); 243168#L21 assume !(~q <= 0); 243162#L22 assume !(~q > ~p); 243153#L23 call #t~ret1 := parts(~p - ~q, ~q);< 243156#partsENTRY ~p := #in~p;~q := #in~q; 243174#L20 assume !(~p <= 0); 243169#L21 assume !(~q <= 0); 243163#L22 assume !(~q > ~p); 243164#L23 call #t~ret1 := parts(~p - ~q, ~q);< 243172#partsENTRY ~p := #in~p;~q := #in~q; 243178#L20 assume ~p <= 0;#res := 1; 243176#partsFINAL assume true; 243171#partsEXIT >#63#return; 243166#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 243167#partsENTRY ~p := #in~p;~q := #in~q; 243177#L20 assume !(~p <= 0); 243175#L21 assume ~q <= 0;#res := 0; 243170#partsFINAL assume true; 243165#partsEXIT >#65#return; 243161#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 243160#partsFINAL assume true; 243155#partsEXIT >#63#return; 243146#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 243149#partsENTRY ~p := #in~p;~q := #in~q; 243159#L20 assume !(~p <= 0); 243158#L21 assume ~q <= 0;#res := 0; 243152#partsFINAL assume true; 243145#partsEXIT >#65#return; 243142#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 243132#partsFINAL assume true; 243122#partsEXIT >#63#return; 243117#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 243118#partsENTRY ~p := #in~p;~q := #in~q; 243138#L20 assume !(~p <= 0); 243131#L21 assume ~q <= 0;#res := 0; 243121#partsFINAL assume true; 243116#partsEXIT >#65#return; 243114#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 243113#partsFINAL assume true; 243108#partsEXIT >#67#return; 243107#L36-1 havoc main_#t~ret8; 243102#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 243100#L35-3 assume !!(main_~q~0 <= main_~x~0); 242847#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 242969#partsENTRY ~p := #in~p;~q := #in~q; 242967#L20 assume !(~p <= 0); 242965#L21 assume !(~q <= 0); 242961#L22 assume !(~q > ~p); 241025#L23 call #t~ret1 := parts(~p - ~q, ~q);< 240906#partsENTRY ~p := #in~p;~q := #in~q; 243043#L20 assume !(~p <= 0); 243042#L21 assume !(~q <= 0); 243041#L22 assume ~q > ~p; 243038#L22-1 call #t~ret0 := parts(~p, ~p);< 243040#partsENTRY ~p := #in~p;~q := #in~q; 243059#L20 assume !(~p <= 0); 243058#L21 assume !(~q <= 0); 243056#L22 assume !(~q > ~p); 243051#L23 call #t~ret1 := parts(~p - ~q, ~q);< 243054#partsENTRY ~p := #in~p;~q := #in~q; 243063#L20 assume ~p <= 0;#res := 1; 243060#partsFINAL assume true; 243050#partsEXIT >#63#return; 243047#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 243048#partsENTRY ~p := #in~p;~q := #in~q; 243057#L20 assume !(~p <= 0); 243055#L21 assume ~q <= 0;#res := 0; 243049#partsFINAL assume true; 243046#partsEXIT >#65#return; 243045#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 243044#partsFINAL assume true; 243037#partsEXIT >#61#return; 243036#L22-2 #res := #t~ret0;havoc #t~ret0; 243028#partsFINAL assume true; 242840#partsEXIT >#63#return; 242465#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 242838#partsENTRY ~p := #in~p;~q := #in~q; 242469#L20 assume !(~p <= 0); 242470#L21 assume !(~q <= 0); 242464#L22 assume !(~q > ~p); 242455#L23 call #t~ret1 := parts(~p - ~q, ~q);< 242459#partsENTRY ~p := #in~p;~q := #in~q; 242460#L20 assume !(~p <= 0); 242454#L21 assume !(~q <= 0); 242456#L22 assume !(~q > ~p); 242023#L23 call #t~ret1 := parts(~p - ~q, ~q);< 242030#partsENTRY ~p := #in~p;~q := #in~q; 242029#L20 assume !(~p <= 0); 242028#L21 assume !(~q <= 0); 242026#L22 assume !(~q > ~p); 242020#L23 call #t~ret1 := parts(~p - ~q, ~q);< 242024#partsENTRY ~p := #in~p;~q := #in~q; 242027#L20 assume ~p <= 0;#res := 1; 242025#partsFINAL assume true; 242019#partsEXIT >#63#return; 240983#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 240988#partsENTRY ~p := #in~p;~q := #in~q; 241003#L20 assume !(~p <= 0); 240998#L21 assume ~q <= 0;#res := 0; 240991#partsFINAL assume true; 240982#partsEXIT >#65#return; 240986#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 242980#partsFINAL assume true; 242978#partsEXIT >#63#return; 242972#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 242976#partsENTRY ~p := #in~p;~q := #in~q; 242981#L20 assume !(~p <= 0); 242979#L21 assume ~q <= 0;#res := 0; 242977#partsFINAL assume true; 242971#partsEXIT >#65#return; 242970#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 242968#partsFINAL assume true; 242966#partsEXIT >#63#return; 242963#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 242964#partsENTRY ~p := #in~p;~q := #in~q; 242984#L20 assume !(~p <= 0); 242983#L21 assume ~q <= 0;#res := 0; 242982#partsFINAL assume true; 242962#partsEXIT >#65#return; 242960#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 242846#partsFINAL assume true; 242836#partsEXIT >#65#return; 242837#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 243099#partsFINAL assume true; 243097#partsEXIT >#67#return; 243072#L36-1 havoc main_#t~ret8; 240654#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 240655#L35-3 assume !!(main_~q~0 <= main_~x~0); 240851#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 241036#partsENTRY ~p := #in~p;~q := #in~q; 241034#L20 assume !(~p <= 0); 241032#L21 assume !(~q <= 0); 241029#L22 assume !(~q > ~p); 240782#L23 call #t~ret1 := parts(~p - ~q, ~q);< 241027#partsENTRY ~p := #in~p;~q := #in~q; 241195#L20 assume !(~p <= 0); 241191#L21 assume !(~q <= 0); 241126#L22 assume ~q > ~p; 240730#L22-1 call #t~ret0 := parts(~p, ~p);< 240786#partsENTRY ~p := #in~p;~q := #in~q; 240784#L20 assume !(~p <= 0); 240757#L21 assume !(~q <= 0); 240758#L22 assume !(~q > ~p); 241175#L23 call #t~ret1 := parts(~p - ~q, ~q);< 241177#partsENTRY ~p := #in~p;~q := #in~q; 241180#L20 assume ~p <= 0;#res := 1; 241179#partsFINAL assume true; 241173#partsEXIT >#63#return; 241169#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 241170#partsENTRY ~p := #in~p;~q := #in~q; 241183#L20 assume !(~p <= 0); 241182#L21 assume ~q <= 0;#res := 0; 241181#partsFINAL assume true; 241168#partsEXIT >#65#return; 241166#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 241165#partsFINAL assume true; 241146#partsEXIT >#61#return; 241147#L22-2 #res := #t~ret0;havoc #t~ret0; 241926#partsFINAL assume true; 241026#partsEXIT >#63#return; 241012#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 241022#partsENTRY ~p := #in~p;~q := #in~q; 241020#L20 assume !(~p <= 0); 241018#L21 assume !(~q <= 0); 241016#L22 assume !(~q > ~p); 240990#L23 call #t~ret1 := parts(~p - ~q, ~q);< 241010#partsENTRY ~p := #in~p;~q := #in~q; 241007#L20 assume !(~p <= 0); 241002#L21 assume !(~q <= 0); 240997#L22 assume !(~q > ~p); 240944#L23 call #t~ret1 := parts(~p - ~q, ~q);< 240946#partsENTRY ~p := #in~p;~q := #in~q; 240979#L20 assume !(~p <= 0); 240976#L21 assume !(~q <= 0); 240968#L22 assume !(~q > ~p); 240942#L23 [2018-11-23 13:13:32,733 INFO L796 eck$LassoCheckResult]: Loop: 240942#L23 call #t~ret1 := parts(~p - ~q, ~q);< 240946#partsENTRY ~p := #in~p;~q := #in~q; 240979#L20 assume !(~p <= 0); 240976#L21 assume !(~q <= 0); 240968#L22 assume !(~q > ~p); 240942#L23 [2018-11-23 13:13:32,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:32,733 INFO L82 PathProgramCache]: Analyzing trace with hash -2017599125, now seen corresponding path program 15 times [2018-11-23 13:13:32,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:32,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:32,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:32,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:32,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:32,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 1116 proven. 428 refuted. 0 times theorem prover too weak. 9041 trivial. 0 not checked. [2018-11-23 13:13:32,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:32,943 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:13:32,955 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:13:33,026 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 13:13:33,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:33,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 1775 proven. 68 refuted. 0 times theorem prover too weak. 8742 trivial. 0 not checked. [2018-11-23 13:13:33,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:33,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19] total 32 [2018-11-23 13:13:33,359 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:13:33,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:33,359 INFO L82 PathProgramCache]: Analyzing trace with hash 85891559, now seen corresponding path program 7 times [2018-11-23 13:13:33,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:33,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:33,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:33,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:33,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:33,407 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:13:33,407 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:13:33,407 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:13:33,407 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:13:33,407 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:13:33,407 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:33,407 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:13:33,407 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:13:33,407 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration30_Loop [2018-11-23 13:13:33,407 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:13:33,407 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:13:33,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:33,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:33,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:33,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:33,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:33,457 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:13:33,457 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:33,459 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:13:33,459 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:13:33,461 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:13:33,461 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:33,486 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:13:33,486 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:13:33,488 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:13:33,489 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:33,510 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:13:33,510 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 94 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 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:33,529 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:13:33,529 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:13:39,774 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:13:39,775 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:13:39,775 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:13:39,775 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:13:39,776 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:13:39,776 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:13:39,776 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:39,776 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:13:39,776 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:13:39,776 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration30_Loop [2018-11-23 13:13:39,776 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:13:39,776 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:13:39,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:39,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:39,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:39,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:39,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:39,812 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:13:39,812 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:13:39,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:13:39,813 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:13:39,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:13:39,813 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:13:39,813 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:13:39,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:13:39,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:13:39,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:13:39,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:13:39,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:13:39,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:13:39,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:13:39,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:13:39,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:13:39,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:13:39,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:13:39,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:13:39,816 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:13:39,819 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-23 13:13:39,819 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 13:13:39,819 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:13:39,819 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:13:39,820 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:13:39,820 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2018-11-23 13:13:39,820 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:13:39,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:40,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:40,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:40,091 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:13:40,091 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3685 states and 4158 transitions. cyclomatic complexity: 509 Second operand 7 states. [2018-11-23 13:13:40,125 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3685 states and 4158 transitions. cyclomatic complexity: 509. Second operand 7 states. Result 3690 states and 4163 transitions. Complement of second has 10 states. [2018-11-23 13:13:40,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:13:40,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:13:40,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-23 13:13:40,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 479 letters. Loop has 5 letters. [2018-11-23 13:13:40,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:40,126 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:13:40,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:40,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:40,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:40,381 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:40,407 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:13:40,407 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3685 states and 4158 transitions. cyclomatic complexity: 509 Second operand 7 states. [2018-11-23 13:13:40,452 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3685 states and 4158 transitions. cyclomatic complexity: 509. Second operand 7 states. Result 3690 states and 4163 transitions. Complement of second has 10 states. [2018-11-23 13:13:40,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:13:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:13:40,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-23 13:13:40,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 479 letters. Loop has 5 letters. [2018-11-23 13:13:40,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:40,454 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:13:40,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:40,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:40,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:40,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:40,793 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:13:40,793 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3685 states and 4158 transitions. cyclomatic complexity: 509 Second operand 7 states. [2018-11-23 13:13:40,851 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3685 states and 4158 transitions. cyclomatic complexity: 509. Second operand 7 states. Result 4754 states and 5386 transitions. Complement of second has 40 states. [2018-11-23 13:13:40,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 13:13:40,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:13:40,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-23 13:13:40,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 479 letters. Loop has 5 letters. [2018-11-23 13:13:40,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:40,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 484 letters. Loop has 5 letters. [2018-11-23 13:13:40,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:40,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 479 letters. Loop has 10 letters. [2018-11-23 13:13:40,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:40,852 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4754 states and 5386 transitions. [2018-11-23 13:13:40,866 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2018-11-23 13:13:40,876 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4754 states to 3687 states and 4160 transitions. [2018-11-23 13:13:40,876 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 310 [2018-11-23 13:13:40,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331 [2018-11-23 13:13:40,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3687 states and 4160 transitions. [2018-11-23 13:13:40,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:13:40,876 INFO L705 BuchiCegarLoop]: Abstraction has 3687 states and 4160 transitions. [2018-11-23 13:13:40,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3687 states and 4160 transitions. [2018-11-23 13:13:40,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3687 to 3685. [2018-11-23 13:13:40,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3685 states. [2018-11-23 13:13:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 3685 states and 4158 transitions. [2018-11-23 13:13:40,905 INFO L728 BuchiCegarLoop]: Abstraction has 3685 states and 4158 transitions. [2018-11-23 13:13:40,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 13:13:40,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=899, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:13:40,906 INFO L87 Difference]: Start difference. First operand 3685 states and 4158 transitions. Second operand 32 states. [2018-11-23 13:13:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:42,375 INFO L93 Difference]: Finished difference Result 4524 states and 5136 transitions. [2018-11-23 13:13:42,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-23 13:13:42,375 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4524 states and 5136 transitions. [2018-11-23 13:13:42,386 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2018-11-23 13:13:42,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4524 states to 3941 states and 4446 transitions. [2018-11-23 13:13:42,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 368 [2018-11-23 13:13:42,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 368 [2018-11-23 13:13:42,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3941 states and 4446 transitions. [2018-11-23 13:13:42,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:13:42,397 INFO L705 BuchiCegarLoop]: Abstraction has 3941 states and 4446 transitions. [2018-11-23 13:13:42,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3941 states and 4446 transitions. [2018-11-23 13:13:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3941 to 3656. [2018-11-23 13:13:42,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3656 states. [2018-11-23 13:13:42,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 4097 transitions. [2018-11-23 13:13:42,426 INFO L728 BuchiCegarLoop]: Abstraction has 3656 states and 4097 transitions. [2018-11-23 13:13:42,426 INFO L608 BuchiCegarLoop]: Abstraction has 3656 states and 4097 transitions. [2018-11-23 13:13:42,426 INFO L442 BuchiCegarLoop]: ======== Iteration 31============ [2018-11-23 13:13:42,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3656 states and 4097 transitions. [2018-11-23 13:13:42,434 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2018-11-23 13:13:42,435 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:13:42,435 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:13:42,436 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [67, 62, 50, 30, 25, 24, 22, 22, 20, 20, 20, 17, 16, 16, 15, 15, 15, 5, 5, 5, 5, 4, 3, 3, 1, 1, 1] [2018-11-23 13:13:42,436 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:13:42,437 INFO L794 eck$LassoCheckResult]: Stem: 270721#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 270708#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 270709#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 270714#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 271207#L35-3 assume !!(main_~q~0 <= main_~x~0); 271202#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 271203#partsENTRY ~p := #in~p;~q := #in~q; 271208#L20 assume ~p <= 0;#res := 1; 271206#partsFINAL assume true; 271201#partsEXIT >#67#return; 271199#L36-1 havoc main_#t~ret8; 271196#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 271193#L35-3 assume !!(main_~q~0 <= main_~x~0); 271186#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 271187#partsENTRY ~p := #in~p;~q := #in~q; 271204#L20 assume ~p <= 0;#res := 1; 271192#partsFINAL assume true; 271185#partsEXIT >#67#return; 271184#L36-1 havoc main_#t~ret8; 271183#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 271180#L35-3 assume !!(main_~q~0 <= main_~x~0); 271176#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 271177#partsENTRY ~p := #in~p;~q := #in~q; 271182#L20 assume ~p <= 0;#res := 1; 271179#partsFINAL assume true; 271175#partsEXIT >#67#return; 271138#L36-1 havoc main_#t~ret8; 271130#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 271126#L35-3 assume !!(main_~q~0 <= main_~x~0); 271120#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 271123#partsENTRY ~p := #in~p;~q := #in~q; 271166#L20 assume ~p <= 0;#res := 1; 271162#partsFINAL assume true; 271119#partsEXIT >#67#return; 271118#L36-1 havoc main_#t~ret8; 271116#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 271114#L35-3 assume !(main_~q~0 <= main_~x~0); 271112#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 271110#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 271105#L35-3 assume !!(main_~q~0 <= main_~x~0); 271089#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 271091#partsENTRY ~p := #in~p;~q := #in~q; 271157#L20 assume !(~p <= 0); 271155#L21 assume ~q <= 0;#res := 0; 271153#partsFINAL assume true; 271087#partsEXIT >#67#return; 271090#L36-1 havoc main_#t~ret8; 271094#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 271092#L35-3 assume !!(main_~q~0 <= main_~x~0); 271080#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 271082#partsENTRY ~p := #in~p;~q := #in~q; 271205#L20 assume !(~p <= 0); 271200#L21 assume !(~q <= 0); 271198#L22 assume !(~q > ~p); 271190#L23 call #t~ret1 := parts(~p - ~q, ~q);< 271191#partsENTRY ~p := #in~p;~q := #in~q; 271197#L20 assume ~p <= 0;#res := 1; 271195#partsFINAL assume true; 271189#partsEXIT >#63#return; 271151#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 271152#partsENTRY ~p := #in~p;~q := #in~q; 271161#L20 assume !(~p <= 0); 271160#L21 assume ~q <= 0;#res := 0; 271158#partsFINAL assume true; 271150#partsEXIT >#65#return; 271145#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 271086#partsFINAL assume true; 271078#partsEXIT >#67#return; 271081#L36-1 havoc main_#t~ret8; 271156#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 271154#L35-3 assume !!(main_~q~0 <= main_~x~0); 271067#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 271071#partsENTRY ~p := #in~p;~q := #in~q; 271144#L20 assume !(~p <= 0); 271142#L21 assume !(~q <= 0); 271140#L22 assume ~q > ~p; 271052#L22-1 call #t~ret0 := parts(~p, ~p);< 271055#partsENTRY ~p := #in~p;~q := #in~q; 271181#L20 assume !(~p <= 0); 271178#L21 assume !(~q <= 0); 271174#L22 assume !(~q > ~p); 271133#L23 call #t~ret1 := parts(~p - ~q, ~q);< 271137#partsENTRY ~p := #in~p;~q := #in~q; 271159#L20 assume ~p <= 0;#res := 1; 271146#partsFINAL assume true; 271131#partsEXIT >#63#return; 271128#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 271129#partsENTRY ~p := #in~p;~q := #in~q; 271170#L20 assume !(~p <= 0); 271168#L21 assume ~q <= 0;#res := 0; 271165#partsFINAL assume true; 271127#partsEXIT >#65#return; 271125#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 271065#partsFINAL assume true; 271051#partsEXIT >#61#return; 271054#L22-2 #res := #t~ret0;havoc #t~ret0; 271077#partsFINAL assume true; 271069#partsEXIT >#67#return; 271057#L36-1 havoc main_#t~ret8; 271056#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 271044#L35-3 assume !!(main_~q~0 <= main_~x~0); 271023#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 271026#partsENTRY ~p := #in~p;~q := #in~q; 271049#L20 assume !(~p <= 0); 271042#L21 assume !(~q <= 0); 271039#L22 assume ~q > ~p; 271035#L22-1 call #t~ret0 := parts(~p, ~p);< 271036#partsENTRY ~p := #in~p;~q := #in~q; 271143#L20 assume !(~p <= 0); 271141#L21 assume !(~q <= 0); 271068#L22 assume !(~q > ~p); 271062#L23 call #t~ret1 := parts(~p - ~q, ~q);< 271064#partsENTRY ~p := #in~p;~q := #in~q; 271101#L20 assume ~p <= 0;#res := 1; 271098#partsFINAL assume true; 271060#partsEXIT >#63#return; 271047#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 271048#partsENTRY ~p := #in~p;~q := #in~q; 271073#L20 assume !(~p <= 0); 271072#L21 assume ~q <= 0;#res := 0; 271059#partsFINAL assume true; 271046#partsEXIT >#65#return; 271041#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 271038#partsFINAL assume true; 271034#partsEXIT >#61#return; 271032#L22-2 #res := #t~ret0;havoc #t~ret0; 271030#partsFINAL assume true; 271020#partsEXIT >#67#return; 271024#L36-1 havoc main_#t~ret8; 271869#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 271868#L35-3 assume !(main_~q~0 <= main_~x~0); 271867#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 271346#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 271347#L35-3 assume !!(main_~q~0 <= main_~x~0); 271004#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 271008#partsENTRY ~p := #in~p;~q := #in~q; 271013#L20 assume !(~p <= 0); 271011#L21 assume ~q <= 0;#res := 0; 271009#partsFINAL assume true; 271002#partsEXIT >#67#return; 271007#L36-1 havoc main_#t~ret8; 271855#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 271854#L35-3 assume !!(main_~q~0 <= main_~x~0); 270991#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 270995#partsENTRY ~p := #in~p;~q := #in~q; 271263#L20 assume !(~p <= 0); 271256#L21 assume !(~q <= 0); 271251#L22 assume !(~q > ~p); 271229#L23 call #t~ret1 := parts(~p - ~q, ~q);< 271234#partsENTRY ~p := #in~p;~q := #in~q; 271280#L20 assume !(~p <= 0); 271278#L21 assume !(~q <= 0); 271276#L22 assume !(~q > ~p); 271269#L23 call #t~ret1 := parts(~p - ~q, ~q);< 271270#partsENTRY ~p := #in~p;~q := #in~q; 271273#L20 assume ~p <= 0;#res := 1; 271272#partsFINAL assume true; 271267#partsEXIT >#63#return; 271259#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 271262#partsENTRY ~p := #in~p;~q := #in~q; 271274#L20 assume !(~p <= 0); 271271#L21 assume ~q <= 0;#res := 0; 271264#partsFINAL assume true; 271258#partsEXIT >#65#return; 271255#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 271242#partsFINAL assume true; 271228#partsEXIT >#63#return; 271218#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 271219#partsENTRY ~p := #in~p;~q := #in~q; 271254#L20 assume !(~p <= 0); 271241#L21 assume ~q <= 0;#res := 0; 271227#partsFINAL assume true; 271217#partsEXIT >#65#return; 271211#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 270997#partsFINAL assume true; 270989#partsEXIT >#67#return; 270994#L36-1 havoc main_#t~ret8; 271029#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 274038#L35-3 assume !!(main_~q~0 <= main_~x~0); 273634#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 273712#partsENTRY ~p := #in~p;~q := #in~q; 273711#L20 assume !(~p <= 0); 273708#L21 assume !(~q <= 0); 273704#L22 assume !(~q > ~p); 273489#L23 call #t~ret1 := parts(~p - ~q, ~q);< 273492#partsENTRY ~p := #in~p;~q := #in~q; 273636#L20 assume ~p <= 0;#res := 1; 273633#partsFINAL assume true; 273488#partsEXIT >#63#return; 273491#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 273954#partsENTRY ~p := #in~p;~q := #in~q; 274085#L20 assume !(~p <= 0); 274082#L21 assume !(~q <= 0); 274079#L22 assume !(~q > ~p); 273503#L23 call #t~ret1 := parts(~p - ~q, ~q);< 273506#partsENTRY ~p := #in~p;~q := #in~q; 273615#L20 assume !(~p <= 0); 273613#L21 assume !(~q <= 0); 273612#L22 assume !(~q > ~p); 273609#L23 call #t~ret1 := parts(~p - ~q, ~q);< 273611#partsENTRY ~p := #in~p;~q := #in~q; 273619#L20 assume ~p <= 0;#res := 1; 273614#partsFINAL assume true; 273608#partsEXIT >#63#return; 273545#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 273550#partsENTRY ~p := #in~p;~q := #in~q; 273591#L20 assume !(~p <= 0); 273589#L21 assume ~q <= 0;#res := 0; 273564#partsFINAL assume true; 273544#partsEXIT >#65#return; 273548#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 273604#partsFINAL assume true; 273500#partsEXIT >#63#return; 273504#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 273967#partsENTRY ~p := #in~p;~q := #in~q; 273974#L20 assume !(~p <= 0); 273973#L21 assume ~q <= 0;#res := 0; 273972#partsFINAL assume true; 273966#partsEXIT >#65#return; 273964#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 273960#partsFINAL assume true; 273953#partsEXIT >#65#return; 273952#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 273951#partsFINAL assume true; 273946#partsEXIT >#67#return; 273947#L36-1 havoc main_#t~ret8; 273988#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 273986#L35-3 assume !!(main_~q~0 <= main_~x~0); 273821#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 273829#partsENTRY ~p := #in~p;~q := #in~q; 273950#L20 assume !(~p <= 0); 273948#L21 assume !(~q <= 0); 273945#L22 assume ~q > ~p; 273942#L22-1 call #t~ret0 := parts(~p, ~p);< 273943#partsENTRY ~p := #in~p;~q := #in~q; 273970#L20 assume !(~p <= 0); 273968#L21 assume !(~q <= 0); 273965#L22 assume !(~q > ~p); 273962#L23 call #t~ret1 := parts(~p - ~q, ~q);< 273963#partsENTRY ~p := #in~p;~q := #in~q; 273976#L20 assume ~p <= 0;#res := 1; 273975#partsFINAL assume true; 273961#partsEXIT >#63#return; 273958#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 273959#partsENTRY ~p := #in~p;~q := #in~q; 274250#L20 assume !(~p <= 0); 274246#L21 assume !(~q <= 0); 274242#L22 assume !(~q > ~p); 274036#L23 call #t~ret1 := parts(~p - ~q, ~q);< 274037#partsENTRY ~p := #in~p;~q := #in~q; 274055#L20 assume !(~p <= 0); 274054#L21 assume !(~q <= 0); 274052#L22 assume !(~q > ~p); 274049#L23 call #t~ret1 := parts(~p - ~q, ~q);< 274050#partsENTRY ~p := #in~p;~q := #in~q; 274057#L20 assume ~p <= 0;#res := 1; 274056#partsFINAL assume true; 274048#partsEXIT >#63#return; 274045#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 274046#partsENTRY ~p := #in~p;~q := #in~q; 274060#L20 assume !(~p <= 0); 274059#L21 assume ~q <= 0;#res := 0; 274058#partsFINAL assume true; 274044#partsEXIT >#65#return; 274043#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 274042#partsFINAL assume true; 274035#partsEXIT >#63#return; 274033#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 274034#partsENTRY ~p := #in~p;~q := #in~q; 274053#L20 assume !(~p <= 0); 274051#L21 assume ~q <= 0;#res := 0; 274047#partsFINAL assume true; 274032#partsEXIT >#65#return; 273982#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 273979#partsFINAL assume true; 273957#partsEXIT >#65#return; 273956#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 273955#partsFINAL assume true; 273941#partsEXIT >#61#return; 273939#L22-2 #res := #t~ret0;havoc #t~ret0; 273937#partsFINAL assume true; 273819#partsEXIT >#67#return; 273818#L36-1 havoc main_#t~ret8; 273817#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 273816#L35-3 assume !(main_~q~0 <= main_~x~0); 273815#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 273814#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 273813#L35-3 assume !!(main_~q~0 <= main_~x~0); 272624#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 272630#partsENTRY ~p := #in~p;~q := #in~q; 272671#L20 assume !(~p <= 0); 272670#L21 assume ~q <= 0;#res := 0; 272633#partsFINAL assume true; 272622#partsEXIT >#67#return; 272628#L36-1 havoc main_#t~ret8; 273812#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 273811#L35-3 assume !!(main_~q~0 <= main_~x~0); 272442#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 272446#partsENTRY ~p := #in~p;~q := #in~q; 272515#L20 assume !(~p <= 0); 272513#L21 assume !(~q <= 0); 272512#L22 assume !(~q > ~p); 272510#L23 call #t~ret1 := parts(~p - ~q, ~q);< 272511#partsENTRY ~p := #in~p;~q := #in~q; 272529#L20 assume !(~p <= 0); 272527#L21 assume !(~q <= 0); 272526#L22 assume !(~q > ~p); 272524#L23 call #t~ret1 := parts(~p - ~q, ~q);< 272525#partsENTRY ~p := #in~p;~q := #in~q; 272533#L20 assume !(~p <= 0); 272532#L21 assume !(~q <= 0); 272530#L22 assume !(~q > ~p); 272531#L23 call #t~ret1 := parts(~p - ~q, ~q);< 272539#partsENTRY ~p := #in~p;~q := #in~q; 272542#L20 assume ~p <= 0;#res := 1; 272541#partsFINAL assume true; 272538#partsEXIT >#63#return; 272536#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 272537#partsENTRY ~p := #in~p;~q := #in~q; 272545#L20 assume !(~p <= 0); 272544#L21 assume ~q <= 0;#res := 0; 272543#partsFINAL assume true; 272535#partsEXIT >#65#return; 272534#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 272528#partsFINAL assume true; 272522#partsEXIT >#63#return; 272519#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 272521#partsENTRY ~p := #in~p;~q := #in~q; 272548#L20 assume !(~p <= 0); 272547#L21 assume ~q <= 0;#res := 0; 272546#partsFINAL assume true; 272517#partsEXIT >#65#return; 272516#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 272514#partsFINAL assume true; 272509#partsEXIT >#63#return; 272507#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 272508#partsENTRY ~p := #in~p;~q := #in~q; 272555#L20 assume !(~p <= 0); 272554#L21 assume ~q <= 0;#res := 0; 272553#partsFINAL assume true; 272506#partsEXIT >#65#return; 272504#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 272501#partsFINAL assume true; 272438#partsEXIT >#67#return; 272445#L36-1 havoc main_#t~ret8; 273805#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 273802#L35-3 assume !!(main_~q~0 <= main_~x~0); 271479#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 271641#partsENTRY ~p := #in~p;~q := #in~q; 271636#L20 assume !(~p <= 0); 271565#L21 assume !(~q <= 0); 271566#L22 assume !(~q > ~p); 271334#L23 call #t~ret1 := parts(~p - ~q, ~q);< 271239#partsENTRY ~p := #in~p;~q := #in~q; 271564#L20 assume !(~p <= 0); 271563#L21 assume !(~q <= 0); 271561#L22 assume ~q > ~p; 271493#L22-1 call #t~ret0 := parts(~p, ~p);< 271496#partsENTRY ~p := #in~p;~q := #in~q; 271551#L20 assume !(~p <= 0); 271548#L21 assume !(~q <= 0); 271543#L22 assume !(~q > ~p); 271511#L23 call #t~ret1 := parts(~p - ~q, ~q);< 271514#partsENTRY ~p := #in~p;~q := #in~q; 271525#L20 assume ~p <= 0;#res := 1; 271519#partsFINAL assume true; 271510#partsEXIT >#63#return; 271507#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 271508#partsENTRY ~p := #in~p;~q := #in~q; 271539#L20 assume !(~p <= 0); 271535#L21 assume ~q <= 0;#res := 0; 271530#partsFINAL assume true; 271506#partsEXIT >#65#return; 271504#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 271503#partsFINAL assume true; 271490#partsEXIT >#61#return; 271495#L22-2 #res := #t~ret0;havoc #t~ret0; 271567#partsFINAL assume true; 271478#partsEXIT >#63#return; 271420#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 271427#partsENTRY ~p := #in~p;~q := #in~q; 271451#L20 assume !(~p <= 0); 271444#L21 assume !(~q <= 0); 271441#L22 assume !(~q > ~p); 271437#L23 call #t~ret1 := parts(~p - ~q, ~q);< 271438#partsENTRY ~p := #in~p;~q := #in~q; 271460#L20 assume !(~p <= 0); 271459#L21 assume !(~q <= 0); 271457#L22 assume !(~q > ~p); 271361#L23 call #t~ret1 := parts(~p - ~q, ~q);< 271368#partsENTRY ~p := #in~p;~q := #in~q; 271367#L20 assume !(~p <= 0); 271366#L21 assume !(~q <= 0); 271364#L22 assume !(~q > ~p); 271358#L23 call #t~ret1 := parts(~p - ~q, ~q);< 271362#partsENTRY ~p := #in~p;~q := #in~q; 271365#L20 assume ~p <= 0;#res := 1; 271363#partsFINAL assume true; 271357#partsEXIT >#63#return; 271303#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 271308#partsENTRY ~p := #in~p;~q := #in~q; 271319#L20 assume !(~p <= 0); 271316#L21 assume ~q <= 0;#res := 0; 271310#partsFINAL assume true; 271302#partsEXIT >#65#return; 271307#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 271456#partsFINAL assume true; 271454#partsEXIT >#63#return; 271448#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 271450#partsENTRY ~p := #in~p;~q := #in~q; 271458#L20 assume !(~p <= 0); 271455#L21 assume ~q <= 0;#res := 0; 271452#partsFINAL assume true; 271445#partsEXIT >#65#return; 271443#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 271440#partsFINAL assume true; 271436#partsEXIT >#63#return; 271433#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 271434#partsENTRY ~p := #in~p;~q := #in~q; 271442#L20 assume !(~p <= 0); 271439#L21 assume ~q <= 0;#res := 0; 271435#partsFINAL assume true; 271432#partsEXIT >#65#return; 271431#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 271428#partsFINAL assume true; 271419#partsEXIT >#65#return; 271425#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 273801#partsFINAL assume true; 273798#partsEXIT >#67#return; 270739#L36-1 havoc main_#t~ret8; 270728#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 270715#L35-3 assume !!(main_~q~0 <= main_~x~0); 270706#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 270722#partsENTRY ~p := #in~p;~q := #in~q; 270723#L20 assume !(~p <= 0); 270742#L21 assume !(~q <= 0); 270743#L22 assume !(~q > ~p); 270695#L23 call #t~ret1 := parts(~p - ~q, ~q);< 270705#partsENTRY ~p := #in~p;~q := #in~q; 274341#L20 assume ~p <= 0;#res := 1; 274340#partsFINAL assume true; 274339#partsEXIT >#63#return; 270691#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 271355#partsENTRY ~p := #in~p;~q := #in~q; 271354#L20 assume !(~p <= 0); 271352#L21 assume !(~q <= 0); 271350#L22 assume !(~q > ~p); 270690#L23 call #t~ret1 := parts(~p - ~q, ~q);< 271345#partsENTRY ~p := #in~p;~q := #in~q; 271344#L20 assume !(~p <= 0); 271343#L21 assume !(~q <= 0); 271340#L22 assume ~q > ~p; 270838#L22-1 call #t~ret0 := parts(~p, ~p);< 270843#partsENTRY ~p := #in~p;~q := #in~q; 270928#L20 assume !(~p <= 0); 270899#L21 assume !(~q <= 0); 270897#L22 assume !(~q > ~p); 270857#L23 call #t~ret1 := parts(~p - ~q, ~q);< 270858#partsENTRY ~p := #in~p;~q := #in~q; 270879#L20 assume ~p <= 0;#res := 1; 270876#partsFINAL assume true; 270856#partsEXIT >#63#return; 270854#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 270855#partsENTRY ~p := #in~p;~q := #in~q; 270869#L20 assume !(~p <= 0); 270868#L21 assume ~q <= 0;#res := 0; 270866#partsFINAL assume true; 270853#partsEXIT >#65#return; 270851#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 270846#partsFINAL assume true; 270837#partsEXIT >#61#return; 270841#L22-2 #res := #t~ret0;havoc #t~ret0; 273747#partsFINAL assume true; 271650#partsEXIT >#63#return; 270948#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 270956#partsENTRY ~p := #in~p;~q := #in~q; 270954#L20 assume !(~p <= 0); 270952#L21 assume !(~q <= 0); 270950#L22 assume !(~q > ~p); 270926#L23 call #t~ret1 := parts(~p - ~q, ~q);< 270947#partsENTRY ~p := #in~p;~q := #in~q; 270946#L20 assume !(~p <= 0); 270945#L21 assume !(~q <= 0); 270942#L22 assume !(~q > ~p); 270891#L23 call #t~ret1 := parts(~p - ~q, ~q);< 270893#partsENTRY ~p := #in~p;~q := #in~q; 270935#L20 assume !(~p <= 0); 270934#L21 assume !(~q <= 0); 270932#L22 assume !(~q > ~p); 270890#L23 [2018-11-23 13:13:42,437 INFO L796 eck$LassoCheckResult]: Loop: 270890#L23 call #t~ret1 := parts(~p - ~q, ~q);< 270893#partsENTRY ~p := #in~p;~q := #in~q; 270935#L20 assume !(~p <= 0); 270934#L21 assume !(~q <= 0); 270932#L22 assume !(~q > ~p); 270890#L23 [2018-11-23 13:13:42,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:42,438 INFO L82 PathProgramCache]: Analyzing trace with hash -239384825, now seen corresponding path program 16 times [2018-11-23 13:13:42,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:42,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:42,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:42,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:42,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:42,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:42,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:42,494 INFO L82 PathProgramCache]: Analyzing trace with hash 85891559, now seen corresponding path program 8 times [2018-11-23 13:13:42,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:42,495 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:42,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:42,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:42,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:42,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:42,497 INFO L82 PathProgramCache]: Analyzing trace with hash 580175521, now seen corresponding path program 17 times [2018-11-23 13:13:42,498 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:42,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:42,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:42,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:42,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:42,706 INFO L134 CoverageAnalysis]: Checked inductivity of 11329 backedges. 1320 proven. 451 refuted. 0 times theorem prover too weak. 9558 trivial. 0 not checked. [2018-11-23 13:13:42,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:42,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:13:42,720 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 13:13:42,828 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-23 13:13:42,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:42,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:43,075 INFO L134 CoverageAnalysis]: Checked inductivity of 11329 backedges. 1165 proven. 22 refuted. 0 times theorem prover too weak. 10142 trivial. 0 not checked. [2018-11-23 13:13:43,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:43,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 27 [2018-11-23 13:13:43,135 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:13:43,136 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:13:43,136 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:13:43,136 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:13:43,136 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:13:43,136 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:43,136 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:13:43,136 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:13:43,136 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration31_Loop [2018-11-23 13:13:43,136 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:13:43,136 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:13:43,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:43,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:43,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:43,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:43,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:43,171 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:13:43,171 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 96 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:43,178 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:13:43,178 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:13:43,181 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:13:43,181 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 97 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 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:43,197 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:13:43,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:13:43,200 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:13:43,200 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 98 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 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:43,224 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:13:43,224 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:13:43,228 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:13:43,228 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 99 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 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:43,243 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:13:43,243 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 100 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 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:43,275 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:13:43,276 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:13:53,789 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:13:53,791 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:13:53,791 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:13:53,791 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:13:53,791 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:13:53,791 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:13:53,791 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:53,791 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:13:53,791 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:13:53,791 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration31_Loop [2018-11-23 13:13:53,791 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:13:53,791 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:13:53,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:53,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:53,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:53,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:53,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:53,824 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:13:53,824 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:13:53,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:13:53,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:13:53,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:13:53,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:13:53,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:13:53,825 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:13:53,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:13:53,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:13:53,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:13:53,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:13:53,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:13:53,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:13:53,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:13:53,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:13:53,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:13:53,826 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:13:53,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:13:53,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:13:53,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:13:53,827 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:13:53,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:13:53,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:13:53,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:13:53,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:13:53,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:13:53,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:13:53,829 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:13:53,830 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:13:53,830 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 13:13:53,830 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:13:53,830 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:13:53,831 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:13:53,831 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2018-11-23 13:13:53,831 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:13:53,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:54,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:54,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:54,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:54,141 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:13:54,141 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3656 states and 4097 transitions. cyclomatic complexity: 475 Second operand 7 states. [2018-11-23 13:13:54,193 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3656 states and 4097 transitions. cyclomatic complexity: 475. Second operand 7 states. Result 3661 states and 4102 transitions. Complement of second has 10 states. [2018-11-23 13:13:54,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:13:54,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:13:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-23 13:13:54,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 489 letters. Loop has 5 letters. [2018-11-23 13:13:54,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:54,194 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:13:54,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:54,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:54,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:54,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:54,467 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:13:54,467 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3656 states and 4097 transitions. cyclomatic complexity: 475 Second operand 7 states. [2018-11-23 13:13:54,503 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3656 states and 4097 transitions. cyclomatic complexity: 475. Second operand 7 states. Result 3661 states and 4102 transitions. Complement of second has 10 states. [2018-11-23 13:13:54,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:13:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:13:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-23 13:13:54,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 489 letters. Loop has 5 letters. [2018-11-23 13:13:54,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:54,504 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:13:54,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:54,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:54,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:54,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:13:54,780 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:13:54,780 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 3656 states and 4097 transitions. cyclomatic complexity: 475 Second operand 7 states. [2018-11-23 13:13:54,843 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 3656 states and 4097 transitions. cyclomatic complexity: 475. Second operand 7 states. Result 4617 states and 5173 transitions. Complement of second has 40 states. [2018-11-23 13:13:54,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 13:13:54,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:13:54,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-23 13:13:54,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 489 letters. Loop has 5 letters. [2018-11-23 13:13:54,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:54,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 494 letters. Loop has 5 letters. [2018-11-23 13:13:54,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:54,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 489 letters. Loop has 10 letters. [2018-11-23 13:13:54,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:13:54,844 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4617 states and 5173 transitions. [2018-11-23 13:13:54,854 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2018-11-23 13:13:54,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4617 states to 3659 states and 4102 transitions. [2018-11-23 13:13:54,864 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 [2018-11-23 13:13:54,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 335 [2018-11-23 13:13:54,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3659 states and 4102 transitions. [2018-11-23 13:13:54,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:13:54,864 INFO L705 BuchiCegarLoop]: Abstraction has 3659 states and 4102 transitions. [2018-11-23 13:13:54,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3659 states and 4102 transitions. [2018-11-23 13:13:54,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3659 to 3656. [2018-11-23 13:13:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3656 states. [2018-11-23 13:13:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 4097 transitions. [2018-11-23 13:13:54,889 INFO L728 BuchiCegarLoop]: Abstraction has 3656 states and 4097 transitions. [2018-11-23 13:13:54,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 13:13:54,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=609, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:13:54,889 INFO L87 Difference]: Start difference. First operand 3656 states and 4097 transitions. Second operand 27 states. [2018-11-23 13:13:56,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:56,004 INFO L93 Difference]: Finished difference Result 6043 states and 6761 transitions. [2018-11-23 13:13:56,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 13:13:56,005 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6043 states and 6761 transitions. [2018-11-23 13:13:56,017 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 42 [2018-11-23 13:13:56,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6043 states to 5276 states and 5814 transitions. [2018-11-23 13:13:56,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 354 [2018-11-23 13:13:56,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 472 [2018-11-23 13:13:56,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5276 states and 5814 transitions. [2018-11-23 13:13:56,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:13:56,029 INFO L705 BuchiCegarLoop]: Abstraction has 5276 states and 5814 transitions. [2018-11-23 13:13:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5276 states and 5814 transitions. [2018-11-23 13:13:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5276 to 5021. [2018-11-23 13:13:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5021 states. [2018-11-23 13:13:56,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5021 states to 5021 states and 5461 transitions. [2018-11-23 13:13:56,076 INFO L728 BuchiCegarLoop]: Abstraction has 5021 states and 5461 transitions. [2018-11-23 13:13:56,076 INFO L608 BuchiCegarLoop]: Abstraction has 5021 states and 5461 transitions. [2018-11-23 13:13:56,076 INFO L442 BuchiCegarLoop]: ======== Iteration 32============ [2018-11-23 13:13:56,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5021 states and 5461 transitions. [2018-11-23 13:13:56,082 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 40 [2018-11-23 13:13:56,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:13:56,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:13:56,085 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [99, 99, 74, 44, 35, 35, 35, 35, 35, 35, 30, 25, 20, 20, 20, 19, 19, 9, 9, 9, 9, 4, 3, 3, 1, 1, 1] [2018-11-23 13:13:56,085 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [51, 51, 42, 25, 21, 21, 21, 21, 21, 21, 17, 9, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1] [2018-11-23 13:13:56,085 INFO L794 eck$LassoCheckResult]: Stem: 302133#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 302123#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 302124#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 302125#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 302126#L35-3 assume !!(main_~q~0 <= main_~x~0); 302872#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 302873#partsENTRY ~p := #in~p;~q := #in~q; 302880#L20 assume ~p <= 0;#res := 1; 302879#partsFINAL assume true; 302871#partsEXIT >#67#return; 302866#L36-1 havoc main_#t~ret8; 302863#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 302859#L35-3 assume !!(main_~q~0 <= main_~x~0); 302847#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 302848#partsENTRY ~p := #in~p;~q := #in~q; 302862#L20 assume ~p <= 0;#res := 1; 302858#partsFINAL assume true; 302846#partsEXIT >#67#return; 302842#L36-1 havoc main_#t~ret8; 302840#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 302838#L35-3 assume !!(main_~q~0 <= main_~x~0); 302777#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 302778#partsENTRY ~p := #in~p;~q := #in~q; 302812#L20 assume ~p <= 0;#res := 1; 302808#partsFINAL assume true; 302776#partsEXIT >#67#return; 302774#L36-1 havoc main_#t~ret8; 302772#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 302768#L35-3 assume !!(main_~q~0 <= main_~x~0); 302764#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 302742#partsENTRY ~p := #in~p;~q := #in~q; 302800#L20 assume ~p <= 0;#res := 1; 302796#partsFINAL assume true; 302763#partsEXIT >#67#return; 302762#L36-1 havoc main_#t~ret8; 302757#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 302753#L35-3 assume !!(main_~q~0 <= main_~x~0); 302741#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 302743#partsENTRY ~p := #in~p;~q := #in~q; 302756#L20 assume ~p <= 0;#res := 1; 302752#partsFINAL assume true; 302740#partsEXIT >#67#return; 302737#L36-1 havoc main_#t~ret8; 302731#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 302727#L35-3 assume !(main_~q~0 <= main_~x~0); 302722#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 302716#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 302713#L35-3 assume !!(main_~q~0 <= main_~x~0); 302683#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 302684#partsENTRY ~p := #in~p;~q := #in~q; 302697#L20 assume !(~p <= 0); 302695#L21 assume ~q <= 0;#res := 0; 302693#partsFINAL assume true; 302682#partsEXIT >#67#return; 302680#L36-1 havoc main_#t~ret8; 302673#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 302669#L35-3 assume !!(main_~q~0 <= main_~x~0); 302658#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 302659#partsENTRY ~p := #in~p;~q := #in~q; 302698#L20 assume !(~p <= 0); 302696#L21 assume !(~q <= 0); 302694#L22 assume !(~q > ~p); 302691#L23 call #t~ret1 := parts(~p - ~q, ~q);< 302692#partsENTRY ~p := #in~p;~q := #in~q; 302705#L20 assume ~p <= 0;#res := 1; 302702#partsFINAL assume true; 302690#partsEXIT >#63#return; 302678#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 302679#partsENTRY ~p := #in~p;~q := #in~q; 302704#L20 assume !(~p <= 0); 302701#L21 assume ~q <= 0;#res := 0; 302689#partsFINAL assume true; 302677#partsEXIT >#65#return; 302672#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 302668#partsFINAL assume true; 302657#partsEXIT >#67#return; 302652#L36-1 havoc main_#t~ret8; 302648#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 302644#L35-3 assume !!(main_~q~0 <= main_~x~0); 302589#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 302590#partsENTRY ~p := #in~p;~q := #in~q; 302626#L20 assume !(~p <= 0); 302622#L21 assume !(~q <= 0); 302620#L22 assume ~q > ~p; 302613#L22-1 call #t~ret0 := parts(~p, ~p);< 302616#partsENTRY ~p := #in~p;~q := #in~q; 302700#L20 assume !(~p <= 0); 302688#L21 assume !(~q <= 0); 302676#L22 assume !(~q > ~p); 302630#L23 call #t~ret1 := parts(~p - ~q, ~q);< 302635#partsENTRY ~p := #in~p;~q := #in~q; 302643#L20 assume ~p <= 0;#res := 1; 302639#partsFINAL assume true; 302627#partsEXIT >#63#return; 302624#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 302625#partsENTRY ~p := #in~p;~q := #in~q; 302656#L20 assume !(~p <= 0); 302651#L21 assume ~q <= 0;#res := 0; 302647#partsFINAL assume true; 302623#partsEXIT >#65#return; 302621#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 302619#partsFINAL assume true; 302612#partsEXIT >#61#return; 302615#L22-2 #res := #t~ret0;havoc #t~ret0; 302618#partsFINAL assume true; 302588#partsEXIT >#67#return; 302586#L36-1 havoc main_#t~ret8; 302584#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 302582#L35-3 assume !!(main_~q~0 <= main_~x~0); 302580#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 302554#partsENTRY ~p := #in~p;~q := #in~q; 302661#L20 assume !(~p <= 0); 302654#L21 assume !(~q <= 0); 302649#L22 assume ~q > ~p; 302614#L22-1 call #t~ret0 := parts(~p, ~p);< 302616#partsENTRY ~p := #in~p;~q := #in~q; 302700#L20 assume !(~p <= 0); 302688#L21 assume !(~q <= 0); 302676#L22 assume !(~q > ~p); 302630#L23 call #t~ret1 := parts(~p - ~q, ~q);< 302635#partsENTRY ~p := #in~p;~q := #in~q; 302643#L20 assume ~p <= 0;#res := 1; 302639#partsFINAL assume true; 302627#partsEXIT >#63#return; 302624#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 302625#partsENTRY ~p := #in~p;~q := #in~q; 302656#L20 assume !(~p <= 0); 302651#L21 assume ~q <= 0;#res := 0; 302647#partsFINAL assume true; 302623#partsEXIT >#65#return; 302621#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 302619#partsFINAL assume true; 302612#partsEXIT >#61#return; 302609#L22-2 #res := #t~ret0;havoc #t~ret0; 302608#partsFINAL assume true; 302579#partsEXIT >#67#return; 302578#L36-1 havoc main_#t~ret8; 302577#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 302570#L35-3 assume !!(main_~q~0 <= main_~x~0); 302553#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 302555#partsENTRY ~p := #in~p;~q := #in~q; 302605#L20 assume !(~p <= 0); 302603#L21 assume !(~q <= 0); 302597#L22 assume ~q > ~p; 302575#L22-1 call #t~ret0 := parts(~p, ~p);< 302576#partsENTRY ~p := #in~p;~q := #in~q; 302607#L20 assume !(~p <= 0); 302606#L21 assume !(~q <= 0); 302604#L22 assume !(~q > ~p); 302599#L23 call #t~ret1 := parts(~p - ~q, ~q);< 302602#partsENTRY ~p := #in~p;~q := #in~q; 302646#L20 assume ~p <= 0;#res := 1; 302610#partsFINAL assume true; 302598#partsEXIT >#63#return; 302595#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 302596#partsENTRY ~p := #in~p;~q := #in~q; 302638#L20 assume !(~p <= 0); 302637#L21 assume ~q <= 0;#res := 0; 302636#partsFINAL assume true; 302594#partsEXIT >#65#return; 302593#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 302592#partsFINAL assume true; 302574#partsEXIT >#61#return; 302569#L22-2 #res := #t~ret0;havoc #t~ret0; 302564#partsFINAL assume true; 302552#partsEXIT >#67#return; 302551#L36-1 havoc main_#t~ret8; 302542#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 302535#L35-3 assume !(main_~q~0 <= main_~x~0); 302531#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 302527#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 302522#L35-3 assume !!(main_~q~0 <= main_~x~0); 302517#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 302518#partsENTRY ~p := #in~p;~q := #in~q; 302960#L20 assume !(~p <= 0); 302959#L21 assume ~q <= 0;#res := 0; 302958#partsFINAL assume true; 302516#partsEXIT >#67#return; 302514#L36-1 havoc main_#t~ret8; 302512#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 302511#L35-3 assume !!(main_~q~0 <= main_~x~0); 302509#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 302510#partsENTRY ~p := #in~p;~q := #in~q; 302541#L20 assume !(~p <= 0); 302534#L21 assume !(~q <= 0); 302530#L22 assume !(~q > ~p); 302525#L23 call #t~ret1 := parts(~p - ~q, ~q);< 302526#partsENTRY ~p := #in~p;~q := #in~q; 302573#L20 assume !(~p <= 0); 302568#L21 assume !(~q <= 0); 302563#L22 assume !(~q > ~p); 302548#L23 call #t~ret1 := parts(~p - ~q, ~q);< 302550#partsENTRY ~p := #in~p;~q := #in~q; 302566#L20 assume ~p <= 0;#res := 1; 302560#partsFINAL assume true; 302545#partsEXIT >#63#return; 302537#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 302540#partsENTRY ~p := #in~p;~q := #in~q; 302557#L20 assume !(~p <= 0); 302556#L21 assume ~q <= 0;#res := 0; 302543#partsFINAL assume true; 302536#partsEXIT >#65#return; 302533#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 302529#partsFINAL assume true; 302524#partsEXIT >#63#return; 302520#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 302521#partsENTRY ~p := #in~p;~q := #in~q; 302532#L20 assume !(~p <= 0); 302528#L21 assume ~q <= 0;#res := 0; 302523#partsFINAL assume true; 302519#partsEXIT >#65#return; 302515#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 302513#partsFINAL assume true; 302508#partsEXIT >#67#return; 302505#L36-1 havoc main_#t~ret8; 302506#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 305199#L35-3 assume !!(main_~q~0 <= main_~x~0); 304513#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 304514#partsENTRY ~p := #in~p;~q := #in~q; 304591#L20 assume !(~p <= 0); 304588#L21 assume !(~q <= 0); 304584#L22 assume !(~q > ~p); 304578#L23 call #t~ret1 := parts(~p - ~q, ~q);< 304580#partsENTRY ~p := #in~p;~q := #in~q; 304618#L20 assume ~p <= 0;#res := 1; 304611#partsFINAL assume true; 304577#partsEXIT >#63#return; 304574#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 304575#partsENTRY ~p := #in~p;~q := #in~q; 304639#L20 assume !(~p <= 0); 304635#L21 assume !(~q <= 0); 304631#L22 assume !(~q > ~p); 304628#L23 call #t~ret1 := parts(~p - ~q, ~q);< 304629#partsENTRY ~p := #in~p;~q := #in~q; 304667#L20 assume !(~p <= 0); 304664#L21 assume !(~q <= 0); 304663#L22 assume !(~q > ~p); 304658#L23 call #t~ret1 := parts(~p - ~q, ~q);< 304662#partsENTRY ~p := #in~p;~q := #in~q; 304668#L20 assume ~p <= 0;#res := 1; 304665#partsFINAL assume true; 304657#partsEXIT >#63#return; 304651#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 304656#partsENTRY ~p := #in~p;~q := #in~q; 304675#L20 assume !(~p <= 0); 304671#L21 assume ~q <= 0;#res := 0; 304669#partsFINAL assume true; 304650#partsEXIT >#65#return; 304649#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 304647#partsFINAL assume true; 304627#partsEXIT >#63#return; 304624#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 304625#partsENTRY ~p := #in~p;~q := #in~q; 304689#L20 assume !(~p <= 0); 304688#L21 assume ~q <= 0;#res := 0; 304687#partsFINAL assume true; 304623#partsEXIT >#65#return; 304622#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 304621#partsFINAL assume true; 304573#partsEXIT >#65#return; 304571#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 304570#partsFINAL assume true; 304512#partsEXIT >#67#return; 304510#L36-1 havoc main_#t~ret8; 304508#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 304506#L35-3 assume !!(main_~q~0 <= main_~x~0); 304340#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 304331#partsENTRY ~p := #in~p;~q := #in~q; 304360#L20 assume !(~p <= 0); 304358#L21 assume !(~q <= 0); 304354#L22 assume ~q > ~p; 304351#L22-1 call #t~ret0 := parts(~p, ~p);< 304352#partsENTRY ~p := #in~p;~q := #in~q; 306151#L20 assume !(~p <= 0); 306149#L21 assume !(~q <= 0); 306147#L22 assume !(~q > ~p); 304378#L23 call #t~ret1 := parts(~p - ~q, ~q);< 304383#partsENTRY ~p := #in~p;~q := #in~q; 305195#L20 assume ~p <= 0;#res := 1; 305179#partsFINAL assume true; 304377#partsEXIT >#63#return; 304374#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 304375#partsENTRY ~p := #in~p;~q := #in~q; 304597#L20 assume !(~p <= 0); 304593#L21 assume !(~q <= 0); 304590#L22 assume !(~q > ~p); 304586#L23 call #t~ret1 := parts(~p - ~q, ~q);< 304587#partsENTRY ~p := #in~p;~q := #in~q; 304608#L20 assume !(~p <= 0); 304607#L21 assume !(~q <= 0); 304604#L22 assume !(~q > ~p); 304600#L23 call #t~ret1 := parts(~p - ~q, ~q);< 304601#partsENTRY ~p := #in~p;~q := #in~q; 304606#L20 assume ~p <= 0;#res := 1; 304603#partsFINAL assume true; 304599#partsEXIT >#63#return; 304595#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 304596#partsENTRY ~p := #in~p;~q := #in~q; 304605#L20 assume !(~p <= 0); 304602#L21 assume ~q <= 0;#res := 0; 304598#partsFINAL assume true; 304594#partsEXIT >#65#return; 304592#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 304589#partsFINAL assume true; 304585#partsEXIT >#63#return; 304582#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 304583#partsENTRY ~p := #in~p;~q := #in~q; 304614#L20 assume !(~p <= 0); 304610#L21 assume ~q <= 0;#res := 0; 304609#partsFINAL assume true; 304581#partsEXIT >#65#return; 304576#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 304572#partsFINAL assume true; 304373#partsEXIT >#65#return; 304369#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 304365#partsFINAL assume true; 304350#partsEXIT >#61#return; 304348#L22-2 #res := #t~ret0;havoc #t~ret0; 304347#partsFINAL assume true; 304339#partsEXIT >#67#return; 304338#L36-1 havoc main_#t~ret8; 304336#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 304334#L35-3 assume !!(main_~q~0 <= main_~x~0); 304330#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 304332#partsENTRY ~p := #in~p;~q := #in~q; 304362#L20 assume !(~p <= 0); 304361#L21 assume !(~q <= 0); 304359#L22 assume ~q > ~p; 304356#L22-1 call #t~ret0 := parts(~p, ~p);< 304357#partsENTRY ~p := #in~p;~q := #in~q; 304386#L20 assume !(~p <= 0); 304384#L21 assume !(~q <= 0); 304376#L22 assume !(~q > ~p); 304371#L23 call #t~ret1 := parts(~p - ~q, ~q);< 304372#partsENTRY ~p := #in~p;~q := #in~q; 304519#L20 assume ~p <= 0;#res := 1; 304517#partsFINAL assume true; 304370#partsEXIT >#63#return; 304367#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 304368#partsENTRY ~p := #in~p;~q := #in~q; 304511#L20 assume !(~p <= 0); 304509#L21 assume !(~q <= 0); 304507#L22 assume !(~q > ~p); 304504#L23 call #t~ret1 := parts(~p - ~q, ~q);< 304505#partsENTRY ~p := #in~p;~q := #in~q; 304642#L20 assume !(~p <= 0); 304641#L21 assume !(~q <= 0); 304640#L22 assume !(~q > ~p); 304637#L23 call #t~ret1 := parts(~p - ~q, ~q);< 304638#partsENTRY ~p := #in~p;~q := #in~q; 304644#L20 assume ~p <= 0;#res := 1; 304643#partsFINAL assume true; 304636#partsEXIT >#63#return; 304633#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 304634#partsENTRY ~p := #in~p;~q := #in~q; 304648#L20 assume !(~p <= 0); 304646#L21 assume ~q <= 0;#res := 0; 304645#partsFINAL assume true; 304632#partsEXIT >#65#return; 304630#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 304626#partsFINAL assume true; 304503#partsEXIT >#63#return; 304500#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 304501#partsENTRY ~p := #in~p;~q := #in~q; 304968#L20 assume !(~p <= 0); 304965#L21 assume ~q <= 0;#res := 0; 304958#partsFINAL assume true; 304499#partsEXIT >#65#return; 304498#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 304497#partsFINAL assume true; 304366#partsEXIT >#65#return; 304364#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 304363#partsFINAL assume true; 304355#partsEXIT >#61#return; 304353#L22-2 #res := #t~ret0;havoc #t~ret0; 304349#partsFINAL assume true; 304329#partsEXIT >#67#return; 304328#L36-1 havoc main_#t~ret8; 304326#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 304196#L35-3 assume !(main_~q~0 <= main_~x~0); 302136#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 302127#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 302128#L35-3 assume !!(main_~q~0 <= main_~x~0); 305022#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 305023#partsENTRY ~p := #in~p;~q := #in~q; 305038#L20 assume !(~p <= 0); 305035#L21 assume ~q <= 0;#res := 0; 305028#partsFINAL assume true; 305021#partsEXIT >#67#return; 305018#L36-1 havoc main_#t~ret8; 305014#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 305013#L35-3 assume !!(main_~q~0 <= main_~x~0); 305011#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 305012#partsENTRY ~p := #in~p;~q := #in~q; 305049#L20 assume !(~p <= 0); 305044#L21 assume !(~q <= 0); 305040#L22 assume !(~q > ~p); 305032#L23 call #t~ret1 := parts(~p - ~q, ~q);< 305033#partsENTRY ~p := #in~p;~q := #in~q; 305069#L20 assume !(~p <= 0); 305055#L21 assume !(~q <= 0); 305052#L22 assume !(~q > ~p); 305047#L23 call #t~ret1 := parts(~p - ~q, ~q);< 305048#partsENTRY ~p := #in~p;~q := #in~q; 305095#L20 assume !(~p <= 0); 305089#L21 assume !(~q <= 0); 305085#L22 assume !(~q > ~p); 305071#L23 call #t~ret1 := parts(~p - ~q, ~q);< 305072#partsENTRY ~p := #in~p;~q := #in~q; 305082#L20 assume ~p <= 0;#res := 1; 305079#partsFINAL assume true; 305070#partsEXIT >#63#return; 305067#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 305068#partsENTRY ~p := #in~p;~q := #in~q; 305078#L20 assume !(~p <= 0); 305077#L21 assume ~q <= 0;#res := 0; 305076#partsFINAL assume true; 305066#partsEXIT >#65#return; 305054#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 305051#partsFINAL assume true; 305046#partsEXIT >#63#return; 305042#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 305043#partsENTRY ~p := #in~p;~q := #in~q; 305053#L20 assume !(~p <= 0); 305050#L21 assume ~q <= 0;#res := 0; 305045#partsFINAL assume true; 305041#partsEXIT >#65#return; 305039#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 305036#partsFINAL assume true; 305031#partsEXIT >#63#return; 305026#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 305027#partsENTRY ~p := #in~p;~q := #in~q; 305037#L20 assume !(~p <= 0); 305034#L21 assume ~q <= 0;#res := 0; 305030#partsFINAL assume true; 305025#partsEXIT >#65#return; 305020#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 305017#partsFINAL assume true; 305010#partsEXIT >#67#return; 305001#L36-1 havoc main_#t~ret8; 305002#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 305507#L35-3 assume !!(main_~q~0 <= main_~x~0); 305487#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 305502#partsENTRY ~p := #in~p;~q := #in~q; 305503#L20 assume !(~p <= 0); 305494#L21 assume !(~q <= 0); 305495#L22 assume !(~q > ~p); 305481#L23 call #t~ret1 := parts(~p - ~q, ~q);< 305486#partsENTRY ~p := #in~p;~q := #in~q; 305485#L20 assume !(~p <= 0); 305484#L21 assume !(~q <= 0); 305482#L22 assume ~q > ~p; 305474#L22-1 call #t~ret0 := parts(~p, ~p);< 305479#partsENTRY ~p := #in~p;~q := #in~q; 305478#L20 assume !(~p <= 0); 305477#L21 assume !(~q <= 0); 305476#L22 assume !(~q > ~p); 305463#L23 call #t~ret1 := parts(~p - ~q, ~q);< 305466#partsENTRY ~p := #in~p;~q := #in~q; 305475#L20 assume ~p <= 0;#res := 1; 305473#partsFINAL assume true; 305462#partsEXIT >#63#return; 305465#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 306513#partsENTRY ~p := #in~p;~q := #in~q; 306521#L20 assume !(~p <= 0); 306519#L21 assume ~q <= 0;#res := 0; 306516#partsFINAL assume true; 306512#partsEXIT >#65#return; 306508#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 306506#partsFINAL assume true; 306504#partsEXIT >#61#return; 306502#L22-2 #res := #t~ret0;havoc #t~ret0; 306225#partsFINAL assume true; 306031#partsEXIT >#63#return; 306028#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 306029#partsENTRY ~p := #in~p;~q := #in~q; 306132#L20 assume !(~p <= 0); 306130#L21 assume !(~q <= 0); 306128#L22 assume !(~q > ~p); 306059#L23 call #t~ret1 := parts(~p - ~q, ~q);< 306060#partsENTRY ~p := #in~p;~q := #in~q; 306146#L20 assume !(~p <= 0); 306144#L21 assume !(~q <= 0); 306142#L22 assume !(~q > ~p); 306135#L23 call #t~ret1 := parts(~p - ~q, ~q);< 306140#partsENTRY ~p := #in~p;~q := #in~q; 306262#L20 assume !(~p <= 0); 306258#L21 assume !(~q <= 0); 306253#L22 assume !(~q > ~p); 306239#L23 call #t~ret1 := parts(~p - ~q, ~q);< 306240#partsENTRY ~p := #in~p;~q := #in~q; 306249#L20 assume ~p <= 0;#res := 1; 306247#partsFINAL assume true; 306238#partsEXIT >#63#return; 306232#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 306235#partsENTRY ~p := #in~p;~q := #in~q; 306254#L20 assume !(~p <= 0); 306241#L21 assume ~q <= 0;#res := 0; 306236#partsFINAL assume true; 306231#partsEXIT >#65#return; 306230#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 306227#partsFINAL assume true; 306134#partsEXIT >#63#return; 306067#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 306068#partsENTRY ~p := #in~p;~q := #in~q; 306073#L20 assume !(~p <= 0); 306071#L21 assume ~q <= 0;#res := 0; 306069#partsFINAL assume true; 306066#partsEXIT >#65#return; 306065#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 306063#partsFINAL assume true; 306058#partsEXIT >#63#return; 306056#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 306057#partsENTRY ~p := #in~p;~q := #in~q; 306074#L20 assume !(~p <= 0); 306072#L21 assume ~q <= 0;#res := 0; 306070#partsFINAL assume true; 306055#partsEXIT >#65#return; 306049#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 306046#partsFINAL assume true; 306027#partsEXIT >#65#return; 306026#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 306025#partsFINAL assume true; 306022#partsEXIT >#67#return; 306020#L36-1 havoc main_#t~ret8; 306014#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 306010#L35-3 assume !!(main_~q~0 <= main_~x~0); 306004#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 306006#partsENTRY ~p := #in~p;~q := #in~q; 306042#L20 assume !(~p <= 0); 306040#L21 assume !(~q <= 0); 306039#L22 assume !(~q > ~p); 306037#L23 call #t~ret1 := parts(~p - ~q, ~q);< 306038#partsENTRY ~p := #in~p;~q := #in~q; 306043#L20 assume ~p <= 0;#res := 1; 306041#partsFINAL assume true; 306036#partsEXIT >#63#return; 306016#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 306017#partsENTRY ~p := #in~p;~q := #in~q; 306133#L20 assume !(~p <= 0); 306131#L21 assume !(~q <= 0); 306129#L22 assume !(~q > ~p); 303418#L23 call #t~ret1 := parts(~p - ~q, ~q);< 306127#partsENTRY ~p := #in~p;~q := #in~q; 305412#L20 assume !(~p <= 0); 305402#L21 assume !(~q <= 0); 305400#L22 assume ~q > ~p; 303410#L22-1 call #t~ret0 := parts(~p, ~p);< 303416#partsENTRY ~p := #in~p;~q := #in~q; 303415#L20 assume !(~p <= 0); 303414#L21 assume !(~q <= 0); 303412#L22 assume !(~q > ~p); 303399#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303402#partsENTRY ~p := #in~p;~q := #in~q; 303413#L20 assume ~p <= 0;#res := 1; 303409#partsFINAL assume true; 303398#partsEXIT >#63#return; 303401#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 306106#partsENTRY ~p := #in~p;~q := #in~q; 306112#L20 assume !(~p <= 0); 306111#L21 assume ~q <= 0;#res := 0; 306110#partsFINAL assume true; 306105#partsEXIT >#65#return; 306104#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 306103#partsFINAL assume true; 306095#partsEXIT >#61#return; 306096#L22-2 #res := #t~ret0;havoc #t~ret0; 306229#partsFINAL assume true; 306126#partsEXIT >#63#return; 306034#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 306035#partsENTRY ~p := #in~p;~q := #in~q; 306084#L20 assume !(~p <= 0); 306081#L21 assume !(~q <= 0); 306079#L22 assume !(~q > ~p); 306076#L23 call #t~ret1 := parts(~p - ~q, ~q);< 306077#partsENTRY ~p := #in~p;~q := #in~q; 306101#L20 assume !(~p <= 0); 306099#L21 assume !(~q <= 0); 306097#L22 assume !(~q > ~p); 303303#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303308#partsENTRY ~p := #in~p;~q := #in~q; 303464#L20 assume !(~p <= 0); 303463#L21 assume !(~q <= 0); 303461#L22 assume !(~q > ~p); 303458#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303459#partsENTRY ~p := #in~p;~q := #in~q; 303466#L20 assume ~p <= 0;#res := 1; 303465#partsFINAL assume true; 303457#partsEXIT >#63#return; 303454#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 303455#partsENTRY ~p := #in~p;~q := #in~q; 303469#L20 assume !(~p <= 0); 303468#L21 assume ~q <= 0;#res := 0; 303467#partsFINAL assume true; 303453#partsEXIT >#65#return; 303452#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 303450#partsFINAL assume true; 303301#partsEXIT >#63#return; 303306#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 306092#partsENTRY ~p := #in~p;~q := #in~q; 306109#L20 assume !(~p <= 0); 306108#L21 assume ~q <= 0;#res := 0; 306107#partsFINAL assume true; 306090#partsEXIT >#65#return; 306089#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 306088#partsFINAL assume true; 306075#partsEXIT >#63#return; 306051#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 306052#partsENTRY ~p := #in~p;~q := #in~q; 306064#L20 assume !(~p <= 0); 306062#L21 assume ~q <= 0;#res := 0; 306061#partsFINAL assume true; 306050#partsEXIT >#65#return; 306047#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 306044#partsFINAL assume true; 306033#partsEXIT >#65#return; 306032#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 306030#partsFINAL assume true; 306015#partsEXIT >#65#return; 306012#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 306008#partsFINAL assume true; 306003#partsEXIT >#67#return; 306001#L36-1 havoc main_#t~ret8; 306000#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 305950#L35-3 assume !!(main_~q~0 <= main_~x~0); 305911#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 305934#partsENTRY ~p := #in~p;~q := #in~q; 305931#L20 assume !(~p <= 0); 305928#L21 assume !(~q <= 0); 305925#L22 assume ~q > ~p; 303206#L22-1 call #t~ret0 := parts(~p, ~p);< 302182#partsENTRY ~p := #in~p;~q := #in~q; 304185#L20 assume !(~p <= 0); 303214#L21 assume !(~q <= 0); 303212#L22 assume !(~q > ~p); 303191#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303194#partsENTRY ~p := #in~p;~q := #in~q; 303268#L20 assume ~p <= 0;#res := 1; 303204#partsFINAL assume true; 303190#partsEXIT >#63#return; 303193#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 303506#partsENTRY ~p := #in~p;~q := #in~q; 303502#L20 assume !(~p <= 0); 303499#L21 assume !(~q <= 0); 303497#L22 assume !(~q > ~p); 303489#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303496#partsENTRY ~p := #in~p;~q := #in~q; 303494#L20 assume !(~p <= 0); 303492#L21 assume !(~q <= 0); 303490#L22 assume ~q > ~p; 303482#L22-1 call #t~ret0 := parts(~p, ~p);< 303488#partsENTRY ~p := #in~p;~q := #in~q; 303486#L20 assume !(~p <= 0); 303485#L21 assume !(~q <= 0); 303484#L22 assume !(~q > ~p); 303476#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303478#partsENTRY ~p := #in~p;~q := #in~q; 303487#L20 assume ~p <= 0;#res := 1; 303481#partsFINAL assume true; 303474#partsEXIT >#63#return; 303477#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 303722#partsENTRY ~p := #in~p;~q := #in~q; 303726#L20 assume !(~p <= 0); 303725#L21 assume ~q <= 0;#res := 0; 303724#partsFINAL assume true; 303721#partsEXIT >#65#return; 303719#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 303717#partsFINAL assume true; 303707#partsEXIT >#61#return; 303704#L22-2 #res := #t~ret0;havoc #t~ret0; 303697#partsFINAL assume true; 303695#partsEXIT >#63#return; 303687#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 303692#partsENTRY ~p := #in~p;~q := #in~q; 303691#L20 assume !(~p <= 0); 303690#L21 assume !(~q <= 0); 303689#L22 assume !(~q > ~p); 303664#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303683#partsENTRY ~p := #in~p;~q := #in~q; 303679#L20 assume !(~p <= 0); 303673#L21 assume !(~q <= 0); 303668#L22 assume !(~q > ~p); 303658#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303661#partsENTRY ~p := #in~p;~q := #in~q; 303688#L20 assume !(~p <= 0); 303686#L21 assume !(~q <= 0); 303682#L22 assume !(~q > ~p); 303677#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303678#partsENTRY ~p := #in~p;~q := #in~q; 303685#L20 assume ~p <= 0;#res := 1; 303681#partsFINAL assume true; 303676#partsEXIT >#63#return; 303671#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 303672#partsENTRY ~p := #in~p;~q := #in~q; 303684#L20 assume !(~p <= 0); 303680#L21 assume ~q <= 0;#res := 0; 303675#partsFINAL assume true; 303670#partsEXIT >#65#return; 303667#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 303663#partsFINAL assume true; 303657#partsEXIT >#63#return; 303660#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 305970#partsENTRY ~p := #in~p;~q := #in~q; 305979#L20 assume !(~p <= 0); 305977#L21 assume ~q <= 0;#res := 0; 305975#partsFINAL assume true; 305969#partsEXIT >#65#return; 305965#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 305963#partsFINAL assume true; 305959#partsEXIT >#63#return; 305945#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 305946#partsENTRY ~p := #in~p;~q := #in~q; 305962#L20 assume !(~p <= 0); 305958#L21 assume ~q <= 0;#res := 0; 305957#partsFINAL assume true; 305944#partsEXIT >#65#return; 305942#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 305940#partsFINAL assume true; 305937#partsEXIT >#65#return; 305935#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 305933#partsFINAL assume true; 305930#partsEXIT >#65#return; 305927#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 305924#partsFINAL assume true; 305922#partsEXIT >#61#return; 305918#L22-2 #res := #t~ret0;havoc #t~ret0; 305910#partsFINAL assume true; 305912#partsEXIT >#67#return; 302212#L36-1 [2018-11-23 13:13:56,086 INFO L796 eck$LassoCheckResult]: Loop: 302212#L36-1 havoc main_#t~ret8; 302198#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 302197#L35-3 assume !(main_~q~0 <= main_~x~0); 302134#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 302135#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 305333#L35-3 assume !!(main_~q~0 <= main_~x~0); 303112#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 303114#partsENTRY ~p := #in~p;~q := #in~q; 303518#L20 assume !(~p <= 0); 303517#L21 assume ~q <= 0;#res := 0; 303516#partsFINAL assume true; 303110#partsEXIT >#67#return; 303113#L36-1 havoc main_#t~ret8; 305329#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 305328#L35-3 assume !!(main_~q~0 <= main_~x~0); 302214#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 302220#partsENTRY ~p := #in~p;~q := #in~q; 303577#L20 assume !(~p <= 0); 303576#L21 assume !(~q <= 0); 303575#L22 assume !(~q > ~p); 302237#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303526#partsENTRY ~p := #in~p;~q := #in~q; 303641#L20 assume !(~p <= 0); 303637#L21 assume !(~q <= 0); 303631#L22 assume !(~q > ~p); 303620#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303622#partsENTRY ~p := #in~p;~q := #in~q; 303636#L20 assume !(~p <= 0); 303630#L21 assume !(~q <= 0); 303628#L22 assume !(~q > ~p); 303619#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303622#partsENTRY ~p := #in~p;~q := #in~q; 303636#L20 assume !(~p <= 0); 303630#L21 assume !(~q <= 0); 303628#L22 assume !(~q > ~p); 303629#L23 call #t~ret1 := parts(~p - ~q, ~q);< 304960#partsENTRY ~p := #in~p;~q := #in~q; 304969#L20 assume ~p <= 0;#res := 1; 304966#partsFINAL assume true; 304959#partsEXIT >#63#return; 304437#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 304438#partsENTRY ~p := #in~p;~q := #in~q; 304452#L20 assume !(~p <= 0); 304450#L21 assume ~q <= 0;#res := 0; 304448#partsFINAL assume true; 304436#partsEXIT >#65#return; 304431#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 304425#partsFINAL assume true; 304420#partsEXIT >#63#return; 304187#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 304188#partsENTRY ~p := #in~p;~q := #in~q; 304192#L20 assume !(~p <= 0); 304190#L21 assume ~q <= 0;#res := 0; 304189#partsFINAL assume true; 304186#partsEXIT >#65#return; 303615#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 304184#partsFINAL assume true; 303621#partsEXIT >#63#return; 303614#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 303616#partsENTRY ~p := #in~p;~q := #in~q; 303627#L20 assume !(~p <= 0); 303626#L21 assume ~q <= 0;#res := 0; 303618#partsFINAL assume true; 303612#partsEXIT >#65#return; 303030#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 302236#partsFINAL assume true; 302238#partsEXIT >#63#return; 302224#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 302225#partsENTRY ~p := #in~p;~q := #in~q; 303360#L20 assume !(~p <= 0); 303359#L21 assume ~q <= 0;#res := 0; 303358#partsFINAL assume true; 302223#partsEXIT >#65#return; 302222#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 302221#partsFINAL assume true; 302213#partsEXIT >#67#return; 302219#L36-1 havoc main_#t~ret8; 305326#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 305325#L35-3 assume !!(main_~q~0 <= main_~x~0); 302204#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 302207#partsENTRY ~p := #in~p;~q := #in~q; 306753#L20 assume !(~p <= 0); 306754#L21 assume !(~q <= 0); 306748#L22 assume !(~q > ~p); 302177#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303227#partsENTRY ~p := #in~p;~q := #in~q; 305496#L20 assume !(~p <= 0); 305497#L21 assume !(~q <= 0); 305488#L22 assume ~q > ~p; 305433#L22-1 call #t~ret0 := parts(~p, ~p);< 305436#partsENTRY ~p := #in~p;~q := #in~q; 305472#L20 assume !(~p <= 0); 305470#L21 assume !(~q <= 0); 305468#L22 assume !(~q > ~p); 305464#L23 call #t~ret1 := parts(~p - ~q, ~q);< 305466#partsENTRY ~p := #in~p;~q := #in~q; 305475#L20 assume ~p <= 0;#res := 1; 305473#partsFINAL assume true; 305462#partsEXIT >#63#return; 305460#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 305461#partsENTRY ~p := #in~p;~q := #in~q; 305471#L20 assume !(~p <= 0); 305469#L21 assume ~q <= 0;#res := 0; 305467#partsFINAL assume true; 305459#partsEXIT >#65#return; 305458#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 305453#partsFINAL assume true; 305430#partsEXIT >#61#return; 305435#L22-2 #res := #t~ret0;havoc #t~ret0; 306695#partsFINAL assume true; 306694#partsEXIT >#63#return; 305406#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 305411#partsENTRY ~p := #in~p;~q := #in~q; 305907#L20 assume !(~p <= 0); 305908#L21 assume !(~q <= 0); 305896#L22 assume !(~q > ~p); 305897#L23 call #t~ret1 := parts(~p - ~q, ~q);< 306448#partsENTRY ~p := #in~p;~q := #in~q; 306334#L20 assume !(~p <= 0); 306335#L21 assume !(~q <= 0); 306294#L22 assume !(~q > ~p); 306137#L23 call #t~ret1 := parts(~p - ~q, ~q);< 306140#partsENTRY ~p := #in~p;~q := #in~q; 306262#L20 assume !(~p <= 0); 306258#L21 assume !(~q <= 0); 306253#L22 assume !(~q > ~p); 306239#L23 call #t~ret1 := parts(~p - ~q, ~q);< 306240#partsENTRY ~p := #in~p;~q := #in~q; 306249#L20 assume ~p <= 0;#res := 1; 306247#partsFINAL assume true; 306238#partsEXIT >#63#return; 306232#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 306235#partsENTRY ~p := #in~p;~q := #in~q; 306254#L20 assume !(~p <= 0); 306241#L21 assume ~q <= 0;#res := 0; 306236#partsFINAL assume true; 306231#partsEXIT >#65#return; 306230#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 306227#partsFINAL assume true; 306134#partsEXIT >#63#return; 306139#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 306488#partsENTRY ~p := #in~p;~q := #in~q; 306491#L20 assume !(~p <= 0); 306490#L21 assume ~q <= 0;#res := 0; 306489#partsFINAL assume true; 306481#partsEXIT >#65#return; 306480#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 306479#partsFINAL assume true; 306470#partsEXIT >#63#return; 305885#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 305888#partsENTRY ~p := #in~p;~q := #in~q; 305891#L20 assume !(~p <= 0); 305890#L21 assume ~q <= 0;#res := 0; 305889#partsFINAL assume true; 305884#partsEXIT >#65#return; 305887#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 306469#partsFINAL assume true; 305403#partsEXIT >#65#return; 305409#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 307072#partsFINAL assume true; 302202#partsEXIT >#67#return; 302206#L36-1 havoc main_#t~ret8; 305324#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 305323#L35-3 assume !!(main_~q~0 <= main_~x~0); 302158#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 305321#partsENTRY ~p := #in~p;~q := #in~q; 305381#L20 assume !(~p <= 0); 305379#L21 assume !(~q <= 0); 305377#L22 assume !(~q > ~p); 303208#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303211#partsENTRY ~p := #in~p;~q := #in~q; 303270#L20 assume ~p <= 0;#res := 1; 303269#partsFINAL assume true; 303207#partsEXIT >#63#return; 303198#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 303203#partsENTRY ~p := #in~p;~q := #in~q; 303407#L20 assume !(~p <= 0); 303405#L21 assume !(~q <= 0); 303403#L22 assume !(~q > ~p); 303388#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303394#partsENTRY ~p := #in~p;~q := #in~q; 303392#L20 assume !(~p <= 0); 303391#L21 assume !(~q <= 0); 303390#L22 assume ~q > ~p; 303382#L22-1 call #t~ret0 := parts(~p, ~p);< 303384#partsENTRY ~p := #in~p;~q := #in~q; 303408#L20 assume !(~p <= 0); 303406#L21 assume !(~q <= 0); 303404#L22 assume !(~q > ~p); 303400#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303402#partsENTRY ~p := #in~p;~q := #in~q; 303413#L20 assume ~p <= 0;#res := 1; 303409#partsFINAL assume true; 303398#partsEXIT >#63#return; 303396#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 303397#partsENTRY ~p := #in~p;~q := #in~q; 303420#L20 assume !(~p <= 0); 303419#L21 assume ~q <= 0;#res := 0; 303417#partsFINAL assume true; 303395#partsEXIT >#65#return; 303393#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 303387#partsFINAL assume true; 303380#partsEXIT >#61#return; 303383#L22-2 #res := #t~ret0;havoc #t~ret0; 303507#partsFINAL assume true; 303504#partsEXIT >#63#return; 303266#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 303267#partsENTRY ~p := #in~p;~q := #in~q; 303286#L20 assume !(~p <= 0); 303284#L21 assume !(~q <= 0); 303282#L22 assume !(~q > ~p); 303279#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303280#partsENTRY ~p := #in~p;~q := #in~q; 303514#L20 assume !(~p <= 0); 303511#L21 assume !(~q <= 0); 303509#L22 assume !(~q > ~p); 303304#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303308#partsENTRY ~p := #in~p;~q := #in~q; 303464#L20 assume !(~p <= 0); 303463#L21 assume !(~q <= 0); 303461#L22 assume !(~q > ~p); 303458#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303459#partsENTRY ~p := #in~p;~q := #in~q; 303466#L20 assume ~p <= 0;#res := 1; 303465#partsFINAL assume true; 303457#partsEXIT >#63#return; 303454#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 303455#partsENTRY ~p := #in~p;~q := #in~q; 303469#L20 assume !(~p <= 0); 303468#L21 assume ~q <= 0;#res := 0; 303467#partsFINAL assume true; 303453#partsEXIT >#65#return; 303452#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 303450#partsFINAL assume true; 303301#partsEXIT >#63#return; 303298#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 303300#partsENTRY ~p := #in~p;~q := #in~q; 303462#L20 assume !(~p <= 0); 303460#L21 assume ~q <= 0;#res := 0; 303456#partsFINAL assume true; 303296#partsEXIT >#65#return; 303294#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 303292#partsFINAL assume true; 303278#partsEXIT >#63#return; 303274#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 303275#partsENTRY ~p := #in~p;~q := #in~q; 303503#L20 assume !(~p <= 0); 303500#L21 assume ~q <= 0;#res := 0; 303498#partsFINAL assume true; 303273#partsEXIT >#65#return; 303272#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 303271#partsFINAL assume true; 303265#partsEXIT >#65#return; 303263#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 303261#partsFINAL assume true; 303197#partsEXIT >#65#return; 303201#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 305960#partsFINAL assume true; 305947#partsEXIT >#67#return; 305943#L36-1 havoc main_#t~ret8; 305941#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 305939#L35-3 assume !!(main_~q~0 <= main_~x~0); 305903#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 305904#partsENTRY ~p := #in~p;~q := #in~q; 305932#L20 assume !(~p <= 0); 305929#L21 assume !(~q <= 0); 305926#L22 assume ~q > ~p; 303144#L22-1 call #t~ret0 := parts(~p, ~p);< 303149#partsENTRY ~p := #in~p;~q := #in~q; 304119#L20 assume !(~p <= 0); 303264#L21 assume !(~q <= 0); 303262#L22 assume !(~q > ~p); 303192#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303194#partsENTRY ~p := #in~p;~q := #in~q; 303268#L20 assume ~p <= 0;#res := 1; 303204#partsFINAL assume true; 303190#partsEXIT >#63#return; 303188#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 303189#partsENTRY ~p := #in~p;~q := #in~q; 303246#L20 assume !(~p <= 0); 303244#L21 assume !(~q <= 0); 303241#L22 assume !(~q > ~p); 303239#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303240#partsENTRY ~p := #in~p;~q := #in~q; 303508#L20 assume !(~p <= 0); 303505#L21 assume !(~q <= 0); 303501#L22 assume ~q > ~p; 303257#L22-1 call #t~ret0 := parts(~p, ~p);< 303260#partsENTRY ~p := #in~p;~q := #in~q; 303483#L20 assume !(~p <= 0); 303480#L21 assume !(~q <= 0); 303479#L22 assume !(~q > ~p); 303475#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303478#partsENTRY ~p := #in~p;~q := #in~q; 303487#L20 assume ~p <= 0;#res := 1; 303481#partsFINAL assume true; 303474#partsEXIT >#63#return; 303472#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 303473#partsENTRY ~p := #in~p;~q := #in~q; 303495#L20 assume !(~p <= 0); 303493#L21 assume ~q <= 0;#res := 0; 303491#partsFINAL assume true; 303471#partsEXIT >#65#return; 303470#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 303276#partsFINAL assume true; 303256#partsEXIT >#61#return; 303255#L22-2 #res := #t~ret0;havoc #t~ret0; 303253#partsFINAL assume true; 303238#partsEXIT >#63#return; 303234#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 303237#partsENTRY ~p := #in~p;~q := #in~q; 303652#L20 assume !(~p <= 0); 303644#L21 assume !(~q <= 0); 303640#L22 assume !(~q > ~p); 303634#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303635#partsENTRY ~p := #in~p;~q := #in~q; 303674#L20 assume !(~p <= 0); 303669#L21 assume !(~q <= 0); 303665#L22 assume !(~q > ~p); 303659#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303661#partsENTRY ~p := #in~p;~q := #in~q; 303688#L20 assume !(~p <= 0); 303686#L21 assume !(~q <= 0); 303682#L22 assume !(~q > ~p); 303677#L23 call #t~ret1 := parts(~p - ~q, ~q);< 303678#partsENTRY ~p := #in~p;~q := #in~q; 303685#L20 assume ~p <= 0;#res := 1; 303681#partsFINAL assume true; 303676#partsEXIT >#63#return; 303671#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 303672#partsENTRY ~p := #in~p;~q := #in~q; 303684#L20 assume !(~p <= 0); 303680#L21 assume ~q <= 0;#res := 0; 303675#partsFINAL assume true; 303670#partsEXIT >#65#return; 303667#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 303663#partsFINAL assume true; 303657#partsEXIT >#63#return; 303647#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 303651#partsENTRY ~p := #in~p;~q := #in~q; 303666#L20 assume !(~p <= 0); 303662#L21 assume ~q <= 0;#res := 0; 303653#partsFINAL assume true; 303645#partsEXIT >#65#return; 303643#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 303639#partsFINAL assume true; 303633#partsEXIT >#63#return; 303624#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 303625#partsENTRY ~p := #in~p;~q := #in~q; 303642#L20 assume !(~p <= 0); 303638#L21 assume ~q <= 0;#res := 0; 303632#partsFINAL assume true; 303623#partsEXIT >#65#return; 303617#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 303322#partsFINAL assume true; 303233#partsEXIT >#65#return; 303231#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 303229#partsFINAL assume true; 303187#partsEXIT >#65#return; 303184#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 303159#partsFINAL assume true; 303142#partsEXIT >#61#return; 303147#L22-2 #res := #t~ret0;havoc #t~ret0; 305956#partsFINAL assume true; 305902#partsEXIT >#67#return; 302212#L36-1 [2018-11-23 13:13:56,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:56,086 INFO L82 PathProgramCache]: Analyzing trace with hash 556061419, now seen corresponding path program 18 times [2018-11-23 13:13:56,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:56,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:56,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:56,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:56,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:56,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:56,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:56,137 INFO L82 PathProgramCache]: Analyzing trace with hash -285629185, now seen corresponding path program 9 times [2018-11-23 13:13:56,138 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:56,138 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:56,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:56,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:56,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 6948 backedges. 249 proven. 1034 refuted. 0 times theorem prover too weak. 5665 trivial. 0 not checked. [2018-11-23 13:13:56,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:56,289 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:13:56,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:13:56,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 13:13:56,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:13:56,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6948 backedges. 1214 proven. 1137 refuted. 0 times theorem prover too weak. 4597 trivial. 0 not checked. [2018-11-23 13:13:56,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:56,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 21] total 31 [2018-11-23 13:13:56,715 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 13:13:56,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 13:13:56,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2018-11-23 13:13:56,715 INFO L87 Difference]: Start difference. First operand 5021 states and 5461 transitions. cyclomatic complexity: 474 Second operand 32 states. [2018-11-23 13:13:58,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:13:58,643 INFO L93 Difference]: Finished difference Result 5687 states and 6303 transitions. [2018-11-23 13:13:58,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 13:13:58,643 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5687 states and 6303 transitions. [2018-11-23 13:13:58,654 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 32 [2018-11-23 13:13:58,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5687 states to 4763 states and 5176 transitions. [2018-11-23 13:13:58,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 393 [2018-11-23 13:13:58,664 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 440 [2018-11-23 13:13:58,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4763 states and 5176 transitions. [2018-11-23 13:13:58,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:13:58,664 INFO L705 BuchiCegarLoop]: Abstraction has 4763 states and 5176 transitions. [2018-11-23 13:13:58,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4763 states and 5176 transitions. [2018-11-23 13:13:58,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4763 to 4508. [2018-11-23 13:13:58,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4508 states. [2018-11-23 13:13:58,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4508 states to 4508 states and 4854 transitions. [2018-11-23 13:13:58,696 INFO L728 BuchiCegarLoop]: Abstraction has 4508 states and 4854 transitions. [2018-11-23 13:13:58,696 INFO L608 BuchiCegarLoop]: Abstraction has 4508 states and 4854 transitions. [2018-11-23 13:13:58,696 INFO L442 BuchiCegarLoop]: ======== Iteration 33============ [2018-11-23 13:13:58,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4508 states and 4854 transitions. [2018-11-23 13:13:58,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2018-11-23 13:13:58,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:13:58,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:13:58,705 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [140, 136, 108, 65, 55, 54, 52, 52, 51, 51, 43, 32, 24, 24, 23, 23, 23, 10, 10, 10, 10, 5, 4, 4, 1, 1, 1] [2018-11-23 13:13:58,705 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:13:58,706 INFO L794 eck$LassoCheckResult]: Stem: 314087#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 314075#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 314076#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 314081#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 315586#L35-3 assume !!(main_~q~0 <= main_~x~0); 315584#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 315585#partsENTRY ~p := #in~p;~q := #in~q; 315588#L20 assume ~p <= 0;#res := 1; 315587#partsFINAL assume true; 315583#partsEXIT >#67#return; 315582#L36-1 havoc main_#t~ret8; 315581#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 315579#L35-3 assume !!(main_~q~0 <= main_~x~0); 315576#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 315577#partsENTRY ~p := #in~p;~q := #in~q; 315590#L20 assume ~p <= 0;#res := 1; 315589#partsFINAL assume true; 315575#partsEXIT >#67#return; 315574#L36-1 havoc main_#t~ret8; 315573#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 315572#L35-3 assume !!(main_~q~0 <= main_~x~0); 315569#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 315570#partsENTRY ~p := #in~p;~q := #in~q; 315580#L20 assume ~p <= 0;#res := 1; 315578#partsFINAL assume true; 315568#partsEXIT >#67#return; 315566#L36-1 havoc main_#t~ret8; 315565#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 315564#L35-3 assume !!(main_~q~0 <= main_~x~0); 315563#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 315556#partsENTRY ~p := #in~p;~q := #in~q; 315571#L20 assume ~p <= 0;#res := 1; 315567#partsFINAL assume true; 315562#partsEXIT >#67#return; 315560#L36-1 havoc main_#t~ret8; 315558#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 315557#L35-3 assume !!(main_~q~0 <= main_~x~0); 315554#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 315555#partsENTRY ~p := #in~p;~q := #in~q; 315561#L20 assume ~p <= 0;#res := 1; 315559#partsFINAL assume true; 315553#partsEXIT >#67#return; 315552#L36-1 havoc main_#t~ret8; 315550#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 315548#L35-3 assume !(main_~q~0 <= main_~x~0); 315546#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 315545#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 315544#L35-3 assume !!(main_~q~0 <= main_~x~0); 315542#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 315543#partsENTRY ~p := #in~p;~q := #in~q; 315551#L20 assume !(~p <= 0); 315549#L21 assume ~q <= 0;#res := 0; 315547#partsFINAL assume true; 315541#partsEXIT >#67#return; 315539#L36-1 havoc main_#t~ret8; 315537#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 315535#L35-3 assume !!(main_~q~0 <= main_~x~0); 315528#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 315529#partsENTRY ~p := #in~p;~q := #in~q; 315616#L20 assume !(~p <= 0); 315614#L21 assume !(~q <= 0); 315613#L22 assume !(~q > ~p); 315611#L23 call #t~ret1 := parts(~p - ~q, ~q);< 315612#partsENTRY ~p := #in~p;~q := #in~q; 315617#L20 assume ~p <= 0;#res := 1; 315615#partsFINAL assume true; 315610#partsEXIT >#63#return; 315608#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 315609#partsENTRY ~p := #in~p;~q := #in~q; 315620#L20 assume !(~p <= 0); 315619#L21 assume ~q <= 0;#res := 0; 315618#partsFINAL assume true; 315607#partsEXIT >#65#return; 315605#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 315604#partsFINAL assume true; 315527#partsEXIT >#67#return; 315525#L36-1 havoc main_#t~ret8; 315523#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 315522#L35-3 assume !!(main_~q~0 <= main_~x~0); 315520#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 315521#partsENTRY ~p := #in~p;~q := #in~q; 315540#L20 assume !(~p <= 0); 315538#L21 assume !(~q <= 0); 315536#L22 assume ~q > ~p; 315531#L22-1 call #t~ret0 := parts(~p, ~p);< 315534#partsENTRY ~p := #in~p;~q := #in~q; 315601#L20 assume !(~p <= 0); 315599#L21 assume !(~q <= 0); 315598#L22 assume !(~q > ~p); 315190#L23 call #t~ret1 := parts(~p - ~q, ~q);< 315195#partsENTRY ~p := #in~p;~q := #in~q; 315202#L20 assume ~p <= 0;#res := 1; 315198#partsFINAL assume true; 315187#partsEXIT >#63#return; 315193#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 315596#partsENTRY ~p := #in~p;~q := #in~q; 315603#L20 assume !(~p <= 0); 315602#L21 assume ~q <= 0;#res := 0; 315600#partsFINAL assume true; 315595#partsEXIT >#65#return; 315593#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 315591#partsFINAL assume true; 315530#partsEXIT >#61#return; 315526#L22-2 #res := #t~ret0;havoc #t~ret0; 315524#partsFINAL assume true; 315519#partsEXIT >#67#return; 315518#L36-1 havoc main_#t~ret8; 315517#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 315515#L35-3 assume !!(main_~q~0 <= main_~x~0); 315513#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 315476#partsENTRY ~p := #in~p;~q := #in~q; 315597#L20 assume !(~p <= 0); 315594#L21 assume !(~q <= 0); 315592#L22 assume ~q > ~p; 315532#L22-1 call #t~ret0 := parts(~p, ~p);< 315534#partsENTRY ~p := #in~p;~q := #in~q; 315601#L20 assume !(~p <= 0); 315599#L21 assume !(~q <= 0); 315598#L22 assume !(~q > ~p); 315190#L23 call #t~ret1 := parts(~p - ~q, ~q);< 315195#partsENTRY ~p := #in~p;~q := #in~q; 315202#L20 assume ~p <= 0;#res := 1; 315198#partsFINAL assume true; 315187#partsEXIT >#63#return; 315193#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 315596#partsENTRY ~p := #in~p;~q := #in~q; 315603#L20 assume !(~p <= 0); 315602#L21 assume ~q <= 0;#res := 0; 315600#partsFINAL assume true; 315595#partsEXIT >#65#return; 315593#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 315591#partsFINAL assume true; 315530#partsEXIT >#61#return; 315533#L22-2 #res := #t~ret0;havoc #t~ret0; 315606#partsFINAL assume true; 315512#partsEXIT >#67#return; 315510#L36-1 havoc main_#t~ret8; 315506#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 315499#L35-3 assume !!(main_~q~0 <= main_~x~0); 315475#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 315477#partsENTRY ~p := #in~p;~q := #in~q; 315516#L20 assume !(~p <= 0); 315514#L21 assume !(~q <= 0); 315511#L22 assume ~q > ~p; 315508#L22-1 call #t~ret0 := parts(~p, ~p);< 315509#partsENTRY ~p := #in~p;~q := #in~q; 315635#L20 assume !(~p <= 0); 315632#L21 assume !(~q <= 0); 315631#L22 assume !(~q > ~p); 315627#L23 call #t~ret1 := parts(~p - ~q, ~q);< 315630#partsENTRY ~p := #in~p;~q := #in~q; 315639#L20 assume ~p <= 0;#res := 1; 315633#partsFINAL assume true; 315626#partsEXIT >#63#return; 315624#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 315625#partsENTRY ~p := #in~p;~q := #in~q; 315647#L20 assume !(~p <= 0); 315645#L21 assume ~q <= 0;#res := 0; 315643#partsFINAL assume true; 315623#partsEXIT >#65#return; 315622#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 315621#partsFINAL assume true; 315507#partsEXIT >#61#return; 315492#L22-2 #res := #t~ret0;havoc #t~ret0; 315488#partsFINAL assume true; 315474#partsEXIT >#67#return; 315472#L36-1 havoc main_#t~ret8; 315467#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 315459#L35-3 assume !(main_~q~0 <= main_~x~0); 315444#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 315441#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 315440#L35-3 assume !!(main_~q~0 <= main_~x~0); 315438#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 315439#partsENTRY ~p := #in~p;~q := #in~q; 315456#L20 assume !(~p <= 0); 315454#L21 assume ~q <= 0;#res := 0; 315443#partsFINAL assume true; 315437#partsEXIT >#67#return; 315436#L36-1 havoc main_#t~ret8; 315435#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 315430#L35-3 assume !!(main_~q~0 <= main_~x~0); 315406#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 315407#partsENTRY ~p := #in~p;~q := #in~q; 315480#L20 assume !(~p <= 0); 315478#L21 assume !(~q <= 0); 315473#L22 assume !(~q > ~p); 315470#L23 call #t~ret1 := parts(~p - ~q, ~q);< 315471#partsENTRY ~p := #in~p;~q := #in~q; 315664#L20 assume !(~p <= 0); 315663#L21 assume !(~q <= 0); 315657#L22 assume !(~q > ~p); 315502#L23 call #t~ret1 := parts(~p - ~q, ~q);< 315505#partsENTRY ~p := #in~p;~q := #in~q; 315658#L20 assume ~p <= 0;#res := 1; 315653#partsFINAL assume true; 315500#partsEXIT >#63#return; 315496#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 315498#partsENTRY ~p := #in~p;~q := #in~q; 315660#L20 assume !(~p <= 0); 315656#L21 assume ~q <= 0;#res := 0; 315651#partsFINAL assume true; 315494#partsEXIT >#65#return; 315491#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 315487#partsFINAL assume true; 315469#partsEXIT >#63#return; 315419#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 315420#partsENTRY ~p := #in~p;~q := #in~q; 315431#L20 assume !(~p <= 0); 315426#L21 assume ~q <= 0;#res := 0; 315422#partsFINAL assume true; 315418#partsEXIT >#65#return; 315416#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 315414#partsFINAL assume true; 315405#partsEXIT >#67#return; 315397#L36-1 havoc main_#t~ret8; 315398#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 316385#L35-3 assume !!(main_~q~0 <= main_~x~0); 316329#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 316330#partsENTRY ~p := #in~p;~q := #in~q; 316439#L20 assume !(~p <= 0); 316351#L21 assume !(~q <= 0); 316347#L22 assume !(~q > ~p); 316340#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316343#partsENTRY ~p := #in~p;~q := #in~q; 316396#L20 assume ~p <= 0;#res := 1; 316381#partsFINAL assume true; 316339#partsEXIT >#63#return; 316336#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316337#partsENTRY ~p := #in~p;~q := #in~q; 316457#L20 assume !(~p <= 0); 316455#L21 assume !(~q <= 0); 316453#L22 assume !(~q > ~p); 316379#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316380#partsENTRY ~p := #in~p;~q := #in~q; 316473#L20 assume !(~p <= 0); 316472#L21 assume !(~q <= 0); 316469#L22 assume !(~q > ~p); 316463#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316465#partsENTRY ~p := #in~p;~q := #in~q; 316471#L20 assume ~p <= 0;#res := 1; 316467#partsFINAL assume true; 316460#partsEXIT >#63#return; 316388#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316393#partsENTRY ~p := #in~p;~q := #in~q; 316401#L20 assume !(~p <= 0); 316400#L21 assume ~q <= 0;#res := 0; 316394#partsFINAL assume true; 316387#partsEXIT >#65#return; 316386#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 316384#partsFINAL assume true; 316378#partsEXIT >#63#return; 316376#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316377#partsENTRY ~p := #in~p;~q := #in~q; 316406#L20 assume !(~p <= 0); 316404#L21 assume ~q <= 0;#res := 0; 316402#partsFINAL assume true; 316375#partsEXIT >#65#return; 316373#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 316371#partsFINAL assume true; 316335#partsEXIT >#65#return; 316334#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 316333#partsFINAL assume true; 316328#partsEXIT >#67#return; 316327#L36-1 havoc main_#t~ret8; 316325#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 316314#L35-3 assume !!(main_~q~0 <= main_~x~0); 316296#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 316272#partsENTRY ~p := #in~p;~q := #in~q; 316326#L20 assume !(~p <= 0); 316324#L21 assume !(~q <= 0); 316323#L22 assume ~q > ~p; 316321#L22-1 call #t~ret0 := parts(~p, ~p);< 316322#partsENTRY ~p := #in~p;~q := #in~q; 316374#L20 assume !(~p <= 0); 316372#L21 assume !(~q <= 0); 316370#L22 assume !(~q > ~p); 316363#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316366#partsENTRY ~p := #in~p;~q := #in~q; 316445#L20 assume ~p <= 0;#res := 1; 316441#partsFINAL assume true; 316360#partsEXIT >#63#return; 316357#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316358#partsENTRY ~p := #in~p;~q := #in~q; 316416#L20 assume !(~p <= 0); 316414#L21 assume !(~q <= 0); 316413#L22 assume !(~q > ~p); 316411#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316412#partsENTRY ~p := #in~p;~q := #in~q; 316427#L20 assume !(~p <= 0); 316425#L21 assume !(~q <= 0); 316424#L22 assume !(~q > ~p); 316422#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316423#partsENTRY ~p := #in~p;~q := #in~q; 316428#L20 assume ~p <= 0;#res := 1; 316426#partsFINAL assume true; 316421#partsEXIT >#63#return; 316419#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316420#partsENTRY ~p := #in~p;~q := #in~q; 316432#L20 assume !(~p <= 0); 316430#L21 assume ~q <= 0;#res := 0; 316429#partsFINAL assume true; 316418#partsEXIT >#65#return; 316417#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 316415#partsFINAL assume true; 316410#partsEXIT >#63#return; 316408#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316409#partsENTRY ~p := #in~p;~q := #in~q; 316434#L20 assume !(~p <= 0); 316433#L21 assume ~q <= 0;#res := 0; 316431#partsFINAL assume true; 316407#partsEXIT >#65#return; 316405#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 316403#partsFINAL assume true; 316356#partsEXIT >#65#return; 316354#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 316353#partsFINAL assume true; 316320#partsEXIT >#61#return; 316313#L22-2 #res := #t~ret0;havoc #t~ret0; 316305#partsFINAL assume true; 316295#partsEXIT >#67#return; 316294#L36-1 havoc main_#t~ret8; 316289#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 316285#L35-3 assume !!(main_~q~0 <= main_~x~0); 316270#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 316271#partsENTRY ~p := #in~p;~q := #in~q; 316319#L20 assume !(~p <= 0); 316312#L21 assume !(~q <= 0); 316304#L22 assume ~q > ~p; 316292#L22-1 call #t~ret0 := parts(~p, ~p);< 316293#partsENTRY ~p := #in~p;~q := #in~q; 316444#L20 assume !(~p <= 0); 316440#L21 assume !(~q <= 0); 316352#L22 assume !(~q > ~p); 316317#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316318#partsENTRY ~p := #in~p;~q := #in~q; 316332#L20 assume ~p <= 0;#res := 1; 316331#partsFINAL assume true; 316316#partsEXIT >#63#return; 316307#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316308#partsENTRY ~p := #in~p;~q := #in~q; 316446#L20 assume !(~p <= 0); 316443#L21 assume !(~q <= 0); 316438#L22 assume !(~q > ~p); 316349#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316350#partsENTRY ~p := #in~p;~q := #in~q; 316456#L20 assume !(~p <= 0); 316454#L21 assume !(~q <= 0); 316451#L22 assume !(~q > ~p); 316448#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316449#partsENTRY ~p := #in~p;~q := #in~q; 316452#L20 assume ~p <= 0;#res := 1; 316450#partsFINAL assume true; 316447#partsEXIT >#63#return; 316368#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316369#partsENTRY ~p := #in~p;~q := #in~q; 316437#L20 assume !(~p <= 0); 316436#L21 assume ~q <= 0;#res := 0; 316435#partsFINAL assume true; 316367#partsEXIT >#65#return; 316359#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 316355#partsFINAL assume true; 316348#partsEXIT >#63#return; 316345#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316346#partsENTRY ~p := #in~p;~q := #in~q; 316399#L20 assume !(~p <= 0); 316398#L21 assume ~q <= 0;#res := 0; 316397#partsFINAL assume true; 316344#partsEXIT >#65#return; 316338#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 316315#partsFINAL assume true; 316306#partsEXIT >#65#return; 316298#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 316297#partsFINAL assume true; 316291#partsEXIT >#61#return; 316288#L22-2 #res := #t~ret0;havoc #t~ret0; 316284#partsFINAL assume true; 316269#partsEXIT >#67#return; 316268#L36-1 havoc main_#t~ret8; 316262#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 316261#L35-3 assume !(main_~q~0 <= main_~x~0); 316260#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 316258#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 316252#L35-3 assume !!(main_~q~0 <= main_~x~0); 316245#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 316246#partsENTRY ~p := #in~p;~q := #in~q; 316280#L20 assume !(~p <= 0); 316264#L21 assume ~q <= 0;#res := 0; 316251#partsFINAL assume true; 316244#partsEXIT >#67#return; 316239#L36-1 havoc main_#t~ret8; 316235#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 316233#L35-3 assume !!(main_~q~0 <= main_~x~0); 316230#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 316231#partsENTRY ~p := #in~p;~q := #in~q; 316259#L20 assume !(~p <= 0); 316257#L21 assume !(~q <= 0); 316250#L22 assume !(~q > ~p); 316242#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316243#partsENTRY ~p := #in~p;~q := #in~q; 316290#L20 assume !(~p <= 0); 316287#L21 assume !(~q <= 0); 316283#L22 assume !(~q > ~p); 316266#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316267#partsENTRY ~p := #in~p;~q := #in~q; 316310#L20 assume !(~p <= 0); 316303#L21 assume !(~q <= 0); 316302#L22 assume !(~q > ~p); 316300#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316301#partsENTRY ~p := #in~p;~q := #in~q; 316311#L20 assume ~p <= 0;#res := 1; 316309#partsFINAL assume true; 316299#partsEXIT >#63#return; 316278#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316279#partsENTRY ~p := #in~p;~q := #in~q; 316286#L20 assume !(~p <= 0); 316282#L21 assume ~q <= 0;#res := 0; 316281#partsFINAL assume true; 316277#partsEXIT >#65#return; 316276#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 316274#partsFINAL assume true; 316265#partsEXIT >#63#return; 316255#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316256#partsENTRY ~p := #in~p;~q := #in~q; 316275#L20 assume !(~p <= 0); 316273#L21 assume ~q <= 0;#res := 0; 316263#partsFINAL assume true; 316254#partsEXIT >#65#return; 316249#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 316248#partsFINAL assume true; 316241#partsEXIT >#63#return; 316237#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316238#partsENTRY ~p := #in~p;~q := #in~q; 316253#L20 assume !(~p <= 0); 316247#L21 assume ~q <= 0;#res := 0; 316240#partsFINAL assume true; 316236#partsEXIT >#65#return; 316234#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 316232#partsFINAL assume true; 316229#partsEXIT >#67#return; 316227#L36-1 havoc main_#t~ret8; 316228#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 316591#L35-3 assume !!(main_~q~0 <= main_~x~0); 316586#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 316590#partsENTRY ~p := #in~p;~q := #in~q; 316589#L20 assume !(~p <= 0); 316588#L21 assume !(~q <= 0); 316587#L22 assume !(~q > ~p); 316570#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316383#partsENTRY ~p := #in~p;~q := #in~q; 316581#L20 assume !(~p <= 0); 316577#L21 assume !(~q <= 0); 316575#L22 assume ~q > ~p; 316442#L22-1 call #t~ret0 := parts(~p, ~p);< 317370#partsENTRY ~p := #in~p;~q := #in~q; 317986#L20 assume !(~p <= 0); 317985#L21 assume !(~q <= 0); 317984#L22 assume !(~q > ~p); 316361#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316366#partsENTRY ~p := #in~p;~q := #in~q; 316445#L20 assume ~p <= 0;#res := 1; 316441#partsFINAL assume true; 316360#partsEXIT >#63#return; 316364#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 317381#partsENTRY ~p := #in~p;~q := #in~q; 317385#L20 assume !(~p <= 0); 317384#L21 assume ~q <= 0;#res := 0; 317382#partsFINAL assume true; 317380#partsEXIT >#65#return; 317378#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 317374#partsFINAL assume true; 317369#partsEXIT >#61#return; 317368#L22-2 #res := #t~ret0;havoc #t~ret0; 317366#partsFINAL assume true; 317364#partsEXIT >#63#return; 317361#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 317362#partsENTRY ~p := #in~p;~q := #in~q; 317399#L20 assume !(~p <= 0); 317397#L21 assume !(~q <= 0); 317396#L22 assume !(~q > ~p); 316602#L23 call #t~ret1 := parts(~p - ~q, ~q);< 317395#partsENTRY ~p := #in~p;~q := #in~q; 318055#L20 assume !(~p <= 0); 318053#L21 assume !(~q <= 0); 317998#L22 assume !(~q > ~p); 316543#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316598#partsENTRY ~p := #in~p;~q := #in~q; 316593#L20 assume !(~p <= 0); 316551#L21 assume !(~q <= 0); 316548#L22 assume !(~q > ~p); 316542#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316545#partsENTRY ~p := #in~p;~q := #in~q; 316549#L20 assume ~p <= 0;#res := 1; 316546#partsFINAL assume true; 316541#partsEXIT >#63#return; 316389#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316393#partsENTRY ~p := #in~p;~q := #in~q; 316401#L20 assume !(~p <= 0); 316400#L21 assume ~q <= 0;#res := 0; 316394#partsFINAL assume true; 316387#partsEXIT >#65#return; 316391#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 317325#partsFINAL assume true; 317318#partsEXIT >#63#return; 317319#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 317402#partsENTRY ~p := #in~p;~q := #in~q; 317406#L20 assume !(~p <= 0); 317404#L21 assume ~q <= 0;#res := 0; 317403#partsFINAL assume true; 317401#partsEXIT >#65#return; 317400#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 317398#partsFINAL assume true; 317394#partsEXIT >#63#return; 317392#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 317393#partsENTRY ~p := #in~p;~q := #in~q; 317408#L20 assume !(~p <= 0); 317407#L21 assume ~q <= 0;#res := 0; 317405#partsFINAL assume true; 317391#partsEXIT >#65#return; 317389#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 317387#partsFINAL assume true; 317360#partsEXIT >#65#return; 317358#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 317352#partsFINAL assume true; 317347#partsEXIT >#67#return; 317345#L36-1 havoc main_#t~ret8; 317344#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 317343#L35-3 assume !!(main_~q~0 <= main_~x~0); 317329#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 317338#partsENTRY ~p := #in~p;~q := #in~q; 317336#L20 assume !(~p <= 0); 317335#L21 assume !(~q <= 0); 317334#L22 assume !(~q > ~p); 317332#L23 call #t~ret1 := parts(~p - ~q, ~q);< 317333#partsENTRY ~p := #in~p;~q := #in~q; 317981#L20 assume ~p <= 0;#res := 1; 317978#partsFINAL assume true; 317331#partsEXIT >#63#return; 317219#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 317224#partsENTRY ~p := #in~p;~q := #in~q; 317222#L20 assume !(~p <= 0); 317221#L21 assume !(~q <= 0); 317220#L22 assume !(~q > ~p); 317208#L23 call #t~ret1 := parts(~p - ~q, ~q);< 317217#partsENTRY ~p := #in~p;~q := #in~q; 317215#L20 assume !(~p <= 0); 317213#L21 assume !(~q <= 0); 317210#L22 assume ~q > ~p; 317201#L22-1 call #t~ret0 := parts(~p, ~p);< 317207#partsENTRY ~p := #in~p;~q := #in~q; 317206#L20 assume !(~p <= 0); 317205#L21 assume !(~q <= 0); 317203#L22 assume !(~q > ~p); 317040#L23 call #t~ret1 := parts(~p - ~q, ~q);< 317042#partsENTRY ~p := #in~p;~q := #in~q; 317204#L20 assume ~p <= 0;#res := 1; 317200#partsFINAL assume true; 317038#partsEXIT >#63#return; 317041#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 317837#partsENTRY ~p := #in~p;~q := #in~q; 317843#L20 assume !(~p <= 0); 317841#L21 assume ~q <= 0;#res := 0; 317840#partsFINAL assume true; 317836#partsEXIT >#65#return; 317834#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 317832#partsFINAL assume true; 317796#partsEXIT >#61#return; 317797#L22-2 #res := #t~ret0;havoc #t~ret0; 317842#partsFINAL assume true; 317839#partsEXIT >#63#return; 317830#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 317838#partsENTRY ~p := #in~p;~q := #in~q; 317835#L20 assume !(~p <= 0); 317833#L21 assume !(~q <= 0); 317831#L22 assume !(~q > ~p); 317823#L23 call #t~ret1 := parts(~p - ~q, ~q);< 317829#partsENTRY ~p := #in~p;~q := #in~q; 317828#L20 assume !(~p <= 0); 317827#L21 assume !(~q <= 0); 317826#L22 assume !(~q > ~p); 317087#L23 call #t~ret1 := parts(~p - ~q, ~q);< 317091#partsENTRY ~p := #in~p;~q := #in~q; 317130#L20 assume !(~p <= 0); 317129#L21 assume !(~q <= 0); 317128#L22 assume !(~q > ~p); 317126#L23 call #t~ret1 := parts(~p - ~q, ~q);< 317127#partsENTRY ~p := #in~p;~q := #in~q; 317132#L20 assume ~p <= 0;#res := 1; 317131#partsFINAL assume true; 317125#partsEXIT >#63#return; 317122#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 317123#partsENTRY ~p := #in~p;~q := #in~q; 317136#L20 assume !(~p <= 0); 317134#L21 assume ~q <= 0;#res := 0; 317133#partsFINAL assume true; 317121#partsEXIT >#65#return; 317119#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 317117#partsFINAL assume true; 317084#partsEXIT >#63#return; 317090#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 317815#partsENTRY ~p := #in~p;~q := #in~q; 317825#L20 assume !(~p <= 0); 317824#L21 assume ~q <= 0;#res := 0; 317822#partsFINAL assume true; 317813#partsEXIT >#65#return; 317814#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 318071#partsFINAL assume true; 318068#partsEXIT >#63#return; 318065#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 318066#partsENTRY ~p := #in~p;~q := #in~q; 318070#L20 assume !(~p <= 0); 318069#L21 assume ~q <= 0;#res := 0; 318067#partsFINAL assume true; 318064#partsEXIT >#65#return; 318063#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 318062#partsFINAL assume true; 318061#partsEXIT >#65#return; 318060#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 318058#partsFINAL assume true; 318057#partsEXIT >#65#return; 318056#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 318054#partsFINAL assume true; 318050#partsEXIT >#67#return; 318049#L36-1 havoc main_#t~ret8; 316875#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 316873#L35-3 assume !!(main_~q~0 <= main_~x~0); 314132#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 316698#partsENTRY ~p := #in~p;~q := #in~q; 317644#L20 assume !(~p <= 0); 317642#L21 assume !(~q <= 0); 317639#L22 assume ~q > ~p; 316791#L22-1 call #t~ret0 := parts(~p, ~p);< 317620#partsENTRY ~p := #in~p;~q := #in~q; 317990#L20 assume !(~p <= 0); 316796#L21 assume !(~q <= 0); 316794#L22 assume !(~q > ~p); 316776#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316778#partsENTRY ~p := #in~p;~q := #in~q; 316795#L20 assume ~p <= 0;#res := 1; 316790#partsFINAL assume true; 316774#partsEXIT >#63#return; 316777#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316849#partsENTRY ~p := #in~p;~q := #in~q; 316847#L20 assume !(~p <= 0); 316846#L21 assume !(~q <= 0); 316844#L22 assume !(~q > ~p); 316829#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316841#partsENTRY ~p := #in~p;~q := #in~q; 316839#L20 assume !(~p <= 0); 316837#L21 assume !(~q <= 0); 316835#L22 assume ~q > ~p; 316805#L22-1 call #t~ret0 := parts(~p, ~p);< 316823#partsENTRY ~p := #in~p;~q := #in~q; 316819#L20 assume !(~p <= 0); 316815#L21 assume !(~q <= 0); 316808#L22 assume !(~q > ~p); 316766#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316768#partsENTRY ~p := #in~p;~q := #in~q; 316807#L20 assume ~p <= 0;#res := 1; 316804#partsFINAL assume true; 316764#partsEXIT >#63#return; 316767#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316863#partsENTRY ~p := #in~p;~q := #in~q; 316869#L20 assume !(~p <= 0); 316867#L21 assume ~q <= 0;#res := 0; 316865#partsFINAL assume true; 316862#partsEXIT >#65#return; 316861#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 316859#partsFINAL assume true; 316855#partsEXIT >#61#return; 316851#L22-2 #res := #t~ret0;havoc #t~ret0; 316850#partsFINAL assume true; 316848#partsEXIT >#63#return; 316838#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316845#partsENTRY ~p := #in~p;~q := #in~q; 316843#L20 assume !(~p <= 0); 316842#L21 assume !(~q <= 0); 316840#L22 assume !(~q > ~p); 316817#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316836#partsENTRY ~p := #in~p;~q := #in~q; 316834#L20 assume !(~p <= 0); 316828#L21 assume !(~q <= 0); 316822#L22 assume !(~q > ~p); 316811#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316814#partsENTRY ~p := #in~p;~q := #in~q; 316860#L20 assume !(~p <= 0); 316858#L21 assume !(~q <= 0); 316854#L22 assume !(~q > ~p); 316832#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316833#partsENTRY ~p := #in~p;~q := #in~q; 316857#L20 assume ~p <= 0;#res := 1; 316853#partsFINAL assume true; 316831#partsEXIT >#63#return; 316825#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316826#partsENTRY ~p := #in~p;~q := #in~q; 316856#L20 assume !(~p <= 0); 316852#L21 assume ~q <= 0;#res := 0; 316830#partsFINAL assume true; 316824#partsEXIT >#65#return; 316820#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 316816#partsFINAL assume true; 316810#partsEXIT >#63#return; 316813#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 317957#partsENTRY ~p := #in~p;~q := #in~q; 317962#L20 assume !(~p <= 0); 317961#L21 assume ~q <= 0;#res := 0; 317960#partsFINAL assume true; 317956#partsEXIT >#65#return; 317954#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 317953#partsFINAL assume true; 317952#partsEXIT >#63#return; 317950#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 317951#partsENTRY ~p := #in~p;~q := #in~q; 317959#L20 assume !(~p <= 0); 317958#L21 assume ~q <= 0;#res := 0; 317955#partsFINAL assume true; 317949#partsEXIT >#65#return; 317947#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 317945#partsFINAL assume true; 317924#partsEXIT >#65#return; 317920#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 317918#partsFINAL assume true; 317896#partsEXIT >#65#return; 317894#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 317646#partsFINAL assume true; 317618#partsEXIT >#61#return; 317617#L22-2 #res := #t~ret0;havoc #t~ret0; 317614#partsFINAL assume true; 316697#partsEXIT >#67#return; 316677#L36-1 havoc main_#t~ret8; 316690#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 316689#L35-3 assume !(main_~q~0 <= main_~x~0); 316688#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 316687#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 316685#L35-3 assume !!(main_~q~0 <= main_~x~0); 316656#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 316659#partsENTRY ~p := #in~p;~q := #in~q; 316686#L20 assume !(~p <= 0); 316684#L21 assume ~q <= 0;#res := 0; 316683#partsFINAL assume true; 316655#partsEXIT >#67#return; 316648#L36-1 havoc main_#t~ret8; 316642#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 316638#L35-3 assume !!(main_~q~0 <= main_~x~0); 316632#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 316636#partsENTRY ~p := #in~p;~q := #in~q; 316779#L20 assume !(~p <= 0); 316773#L21 assume !(~q <= 0); 316682#L22 assume !(~q > ~p); 316652#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316653#partsENTRY ~p := #in~p;~q := #in~q; 316756#L20 assume !(~p <= 0); 316755#L21 assume !(~q <= 0); 316741#L22 assume !(~q > ~p); 316680#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316681#partsENTRY ~p := #in~p;~q := #in~q; 316871#L20 assume !(~p <= 0); 316870#L21 assume !(~q <= 0); 316868#L22 assume !(~q > ~p); 316783#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316784#partsENTRY ~p := #in~p;~q := #in~q; 316789#L20 assume ~p <= 0;#res := 1; 316787#partsFINAL assume true; 316782#partsEXIT >#63#return; 316723#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316724#partsENTRY ~p := #in~p;~q := #in~q; 316735#L20 assume !(~p <= 0); 316733#L21 assume ~q <= 0;#res := 0; 316729#partsFINAL assume true; 316722#partsEXIT >#65#return; 316720#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 316716#partsFINAL assume true; 316679#partsEXIT >#63#return; 316671#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316672#partsENTRY ~p := #in~p;~q := #in~q; 316700#L20 assume !(~p <= 0); 316694#L21 assume ~q <= 0;#res := 0; 316691#partsFINAL assume true; 316670#partsEXIT >#65#return; 316668#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 316666#partsFINAL assume true; 316651#partsEXIT >#63#return; 316645#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316646#partsENTRY ~p := #in~p;~q := #in~q; 316662#L20 assume !(~p <= 0); 316660#L21 assume ~q <= 0;#res := 0; 316650#partsFINAL assume true; 316644#partsEXIT >#65#return; 316640#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 316637#partsFINAL assume true; 316631#partsEXIT >#67#return; 316628#L36-1 havoc main_#t~ret8; 316623#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 316620#L35-3 assume !!(main_~q~0 <= main_~x~0); 314057#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 316618#partsENTRY ~p := #in~p;~q := #in~q; 317457#L20 assume !(~p <= 0); 317455#L21 assume !(~q <= 0); 317454#L22 assume !(~q > ~p); 317452#L23 call #t~ret1 := parts(~p - ~q, ~q);< 314259#partsENTRY ~p := #in~p;~q := #in~q; 317471#L20 assume !(~p <= 0); 317469#L21 assume !(~q <= 0); 317466#L22 assume !(~q > ~p); 317467#L23 call #t~ret1 := parts(~p - ~q, ~q);< 317501#partsENTRY ~p := #in~p;~q := #in~q; 317525#L20 assume ~p <= 0;#res := 1; 317502#partsFINAL assume true; 317499#partsEXIT >#63#return; 314254#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 314267#partsENTRY ~p := #in~p;~q := #in~q; 314264#L20 assume !(~p <= 0); 314261#L21 assume !(~q <= 0); 314256#L22 assume !(~q > ~p); 314245#L23 call #t~ret1 := parts(~p - ~q, ~q);< 314252#partsENTRY ~p := #in~p;~q := #in~q; 314249#L20 assume !(~p <= 0); 314248#L21 assume !(~q <= 0); 314247#L22 assume !(~q > ~p); 314239#L23 call #t~ret1 := parts(~p - ~q, ~q);< 314240#partsENTRY ~p := #in~p;~q := #in~q; 314251#L20 assume ~p <= 0;#res := 1; 314244#partsFINAL assume true; 314237#partsEXIT >#63#return; 314225#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 314230#partsENTRY ~p := #in~p;~q := #in~q; 314250#L20 assume !(~p <= 0); 314243#L21 assume ~q <= 0;#res := 0; 314231#partsFINAL assume true; 314224#partsEXIT >#65#return; 314228#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 317513#partsFINAL assume true; 317511#partsEXIT >#63#return; 317508#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 317509#partsENTRY ~p := #in~p;~q := #in~q; 317527#L20 assume !(~p <= 0); 317526#L21 assume ~q <= 0;#res := 0; 317524#partsFINAL assume true; 317507#partsEXIT >#65#return; 317505#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 317503#partsFINAL assume true; 317496#partsEXIT >#65#return; 317495#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 317494#partsFINAL assume true; 317491#partsEXIT >#63#return; 314105#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 316627#partsENTRY ~p := #in~p;~q := #in~q; 317547#L20 assume !(~p <= 0); 317545#L21 assume !(~q <= 0); 317544#L22 assume !(~q > ~p); 317431#L23 call #t~ret1 := parts(~p - ~q, ~q);< 317435#partsENTRY ~p := #in~p;~q := #in~q; 317580#L20 assume !(~p <= 0); 317578#L21 assume !(~q <= 0); 317577#L22 assume !(~q > ~p); 314236#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316176#partsENTRY ~p := #in~p;~q := #in~q; 316174#L20 assume !(~p <= 0); 316172#L21 assume !(~q <= 0); 316170#L22 assume !(~q > ~p); 316167#L23 call #t~ret1 := parts(~p - ~q, ~q);< 316168#partsENTRY ~p := #in~p;~q := #in~q; 316171#L20 assume ~p <= 0;#res := 1; 316169#partsFINAL assume true; 316166#partsEXIT >#63#return; 314227#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 314230#partsENTRY ~p := #in~p;~q := #in~q; 314250#L20 assume !(~p <= 0); 314243#L21 assume ~q <= 0;#res := 0; 314231#partsFINAL assume true; 314224#partsEXIT >#65#return; 314229#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 317579#partsFINAL assume true; 317574#partsEXIT >#63#return; 317555#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 317561#partsENTRY ~p := #in~p;~q := #in~q; 317569#L20 assume !(~p <= 0); 317567#L21 assume ~q <= 0;#res := 0; 317565#partsFINAL assume true; 317553#partsEXIT >#65#return; 317560#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 317573#partsFINAL assume true; 317430#partsEXIT >#63#return; 317425#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 317428#partsENTRY ~p := #in~p;~q := #in~q; 317973#L20 assume !(~p <= 0); 317970#L21 assume ~q <= 0;#res := 0; 317581#partsFINAL assume true; 317424#partsEXIT >#65#return; 317423#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 316874#partsFINAL assume true; 316625#partsEXIT >#65#return; 316622#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 316619#partsFINAL assume true; 316617#partsEXIT >#67#return; 316615#L36-1 havoc main_#t~ret8; 316613#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 316611#L35-3 assume !!(main_~q~0 <= main_~x~0); 314068#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 316603#partsENTRY ~p := #in~p;~q := #in~q; 316604#L20 assume !(~p <= 0); 316475#L21 assume !(~q <= 0); 316476#L22 assume !(~q > ~p); 314066#L23 call #t~ret1 := parts(~p - ~q, ~q);< 314069#partsENTRY ~p := #in~p;~q := #in~q; 318440#L20 assume !(~p <= 0); 318357#L21 assume !(~q <= 0); 318358#L22 assume !(~q > ~p); 314888#L23 call #t~ret1 := parts(~p - ~q, ~q);< 314889#partsENTRY ~p := #in~p;~q := #in~q; 314891#L20 assume ~p <= 0;#res := 1; 314890#partsFINAL assume true; 314886#partsEXIT >#63#return; 314281#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 314824#partsENTRY ~p := #in~p;~q := #in~q; 314821#L20 assume !(~p <= 0); 314327#L21 assume !(~q <= 0); 314326#L22 assume !(~q > ~p); 314129#L23 call #t~ret1 := parts(~p - ~q, ~q);< 314323#partsENTRY ~p := #in~p;~q := #in~q; 314454#L20 assume !(~p <= 0); 314452#L21 assume !(~q <= 0); 314450#L22 assume ~q > ~p; 314128#L22-1 call #t~ret0 := parts(~p, ~p);< 314130#partsENTRY ~p := #in~p;~q := #in~q; 314486#L20 assume !(~p <= 0); 314484#L21 assume !(~q <= 0); 314483#L22 assume !(~q > ~p); 314480#L23 call #t~ret1 := parts(~p - ~q, ~q);< 314482#partsENTRY ~p := #in~p;~q := #in~q; 314490#L20 assume ~p <= 0;#res := 1; 314485#partsFINAL assume true; 314478#partsEXIT >#63#return; 314476#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 314477#partsENTRY ~p := #in~p;~q := #in~q; 314501#L20 assume !(~p <= 0); 314495#L21 assume ~q <= 0;#res := 0; 314491#partsFINAL assume true; 314475#partsEXIT >#65#return; 314474#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 314414#partsFINAL assume true; 314306#partsEXIT >#61#return; 314308#L22-2 #res := #t~ret0;havoc #t~ret0; 314781#partsFINAL assume true; 314322#partsEXIT >#63#return; 314276#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 314278#partsENTRY ~p := #in~p;~q := #in~q; 314362#L20 assume !(~p <= 0); 314360#L21 assume !(~q <= 0); 314359#L22 assume !(~q > ~p); 314357#L23 call #t~ret1 := parts(~p - ~q, ~q);< 314358#partsENTRY ~p := #in~p;~q := #in~q; 314381#L20 assume !(~p <= 0); 314379#L21 assume !(~q <= 0); 314376#L22 assume !(~q > ~p); 314373#L23 call #t~ret1 := parts(~p - ~q, ~q);< 314375#partsENTRY ~p := #in~p;~q := #in~q; 314401#L20 assume !(~p <= 0); 314399#L21 assume !(~q <= 0); 314396#L22 assume !(~q > ~p); 314392#L23 call #t~ret1 := parts(~p - ~q, ~q);< 314393#partsENTRY ~p := #in~p;~q := #in~q; 314398#L20 assume ~p <= 0;#res := 1; 314395#partsFINAL assume true; 314391#partsEXIT >#63#return; 314388#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 314389#partsENTRY ~p := #in~p;~q := #in~q; 314434#L20 assume !(~p <= 0); 314425#L21 assume ~q <= 0;#res := 0; 314423#partsFINAL assume true; 314387#partsEXIT >#65#return; 314385#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 314377#partsFINAL assume true; 314371#partsEXIT >#63#return; 314366#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 314370#partsENTRY ~p := #in~p;~q := #in~q; 314790#L20 assume !(~p <= 0); 314789#L21 assume ~q <= 0;#res := 0; 314784#partsFINAL assume true; 314364#partsEXIT >#65#return; 314363#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 314361#partsFINAL assume true; 314356#partsEXIT >#63#return; 314299#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 314300#partsENTRY ~p := #in~p;~q := #in~q; 314355#L20 assume !(~p <= 0); 314354#L21 assume ~q <= 0;#res := 0; 314349#partsFINAL assume true; 314298#partsEXIT >#65#return; 314287#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 314280#partsFINAL assume true; 314274#partsEXIT >#65#return; 314277#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 318412#partsFINAL assume true; 318411#partsEXIT >#65#return; 318408#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 318404#partsFINAL assume true; 318399#partsEXIT >#63#return; 318384#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 318397#partsENTRY ~p := #in~p;~q := #in~q; 318396#L20 assume !(~p <= 0); 318395#L21 assume !(~q <= 0); 318393#L22 assume !(~q > ~p); 318338#L23 call #t~ret1 := parts(~p - ~q, ~q);< 318379#partsENTRY ~p := #in~p;~q := #in~q; 318376#L20 assume !(~p <= 0); 318369#L21 assume !(~q <= 0); 318362#L22 assume !(~q > ~p); 314787#L23 call #t~ret1 := parts(~p - ~q, ~q);< 318212#partsENTRY ~p := #in~p;~q := #in~q; 318439#L20 assume !(~p <= 0); 318367#L21 assume !(~q <= 0); 318365#L22 assume !(~q > ~p); 314786#L23 [2018-11-23 13:13:58,707 INFO L796 eck$LassoCheckResult]: Loop: 314786#L23 call #t~ret1 := parts(~p - ~q, ~q);< 318212#partsENTRY ~p := #in~p;~q := #in~q; 318439#L20 assume !(~p <= 0); 318367#L21 assume !(~q <= 0); 318365#L22 assume !(~q > ~p); 314786#L23 [2018-11-23 13:13:58,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:58,707 INFO L82 PathProgramCache]: Analyzing trace with hash -823851496, now seen corresponding path program 19 times [2018-11-23 13:13:58,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:58,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:58,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:58,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:13:58,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 50976 backedges. 3946 proven. 1132 refuted. 0 times theorem prover too weak. 45898 trivial. 0 not checked. [2018-11-23 13:13:59,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:13:59,200 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:13:59,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:13:59,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:13:59,800 INFO L134 CoverageAnalysis]: Checked inductivity of 50976 backedges. 20827 proven. 56 refuted. 0 times theorem prover too weak. 30093 trivial. 0 not checked. [2018-11-23 13:13:59,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:13:59,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2018-11-23 13:13:59,817 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:13:59,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:13:59,817 INFO L82 PathProgramCache]: Analyzing trace with hash 85891559, now seen corresponding path program 9 times [2018-11-23 13:13:59,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:13:59,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:13:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:59,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:13:59,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:13:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:13:59,851 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:13:59,851 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:13:59,851 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:13:59,851 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:13:59,851 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:13:59,851 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:59,851 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:13:59,851 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:13:59,851 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration33_Loop [2018-11-23 13:13:59,851 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:13:59,852 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:13:59,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:59,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:59,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:59,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:59,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:13:59,894 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:13:59,894 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 103 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 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:59,901 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:13:59,901 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:13:59,903 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:13:59,903 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 104 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 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:59,920 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:13:59,920 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:13:59,922 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:13:59,922 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 105 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 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:59,937 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:13:59,938 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 106 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 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:13:59,959 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:13:59,959 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:14:05,440 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:14:05,442 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:14:05,442 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:14:05,443 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:14:05,443 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:14:05,443 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:14:05,443 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:14:05,443 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:14:05,443 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:14:05,443 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration33_Loop [2018-11-23 13:14:05,443 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:14:05,443 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:14:05,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:14:05,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:14:05,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:14:05,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:14:05,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:14:05,478 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:14:05,478 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:14:05,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:14:05,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:14:05,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:14:05,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:14:05,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:14:05,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:14:05,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:14:05,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:14:05,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:14:05,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:14:05,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:14:05,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:14:05,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:14:05,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:14:05,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:14:05,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:14:05,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:14:05,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:14:05,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:14:05,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:14:05,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:14:05,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:14:05,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:14:05,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:14:05,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:14:05,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:14:05,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 13:14:05,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:14:05,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:14:05,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:14:05,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:14:05,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:14:05,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:14:05,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:14:05,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:14:05,484 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:14:05,485 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 13:14:05,485 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 13:14:05,485 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:14:05,485 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:14:05,485 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:14:05,485 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2018-11-23 13:14:05,486 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:14:05,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:05,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:06,006 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:06,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:06,027 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:14:06,027 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4508 states and 4854 transitions. cyclomatic complexity: 372 Second operand 7 states. [2018-11-23 13:14:06,063 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4508 states and 4854 transitions. cyclomatic complexity: 372. Second operand 7 states. Result 4513 states and 4859 transitions. Complement of second has 10 states. [2018-11-23 13:14:06,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:14:06,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:14:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-23 13:14:06,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 1012 letters. Loop has 5 letters. [2018-11-23 13:14:06,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:14:06,064 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:14:06,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:06,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:06,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:06,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:06,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:06,619 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:14:06,619 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4508 states and 4854 transitions. cyclomatic complexity: 372 Second operand 7 states. [2018-11-23 13:14:06,656 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4508 states and 4854 transitions. cyclomatic complexity: 372. Second operand 7 states. Result 4513 states and 4859 transitions. Complement of second has 10 states. [2018-11-23 13:14:06,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:14:06,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:14:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-23 13:14:06,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 1012 letters. Loop has 5 letters. [2018-11-23 13:14:06,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:14:06,657 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:14:06,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:07,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:07,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:07,255 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:14:07,255 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4508 states and 4854 transitions. cyclomatic complexity: 372 Second operand 7 states. [2018-11-23 13:14:07,323 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4508 states and 4854 transitions. cyclomatic complexity: 372. Second operand 7 states. Result 5749 states and 6216 transitions. Complement of second has 40 states. [2018-11-23 13:14:07,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 13:14:07,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:14:07,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-23 13:14:07,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 1012 letters. Loop has 5 letters. [2018-11-23 13:14:07,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:14:07,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 1017 letters. Loop has 5 letters. [2018-11-23 13:14:07,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:14:07,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 1012 letters. Loop has 10 letters. [2018-11-23 13:14:07,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:14:07,326 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5749 states and 6216 transitions. [2018-11-23 13:14:07,338 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2018-11-23 13:14:07,348 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5749 states to 4511 states and 4858 transitions. [2018-11-23 13:14:07,349 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 328 [2018-11-23 13:14:07,349 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 369 [2018-11-23 13:14:07,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4511 states and 4858 transitions. [2018-11-23 13:14:07,349 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:14:07,349 INFO L705 BuchiCegarLoop]: Abstraction has 4511 states and 4858 transitions. [2018-11-23 13:14:07,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4511 states and 4858 transitions. [2018-11-23 13:14:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4511 to 4508. [2018-11-23 13:14:07,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4508 states. [2018-11-23 13:14:07,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4508 states to 4508 states and 4854 transitions. [2018-11-23 13:14:07,393 INFO L728 BuchiCegarLoop]: Abstraction has 4508 states and 4854 transitions. [2018-11-23 13:14:07,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 13:14:07,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:14:07,394 INFO L87 Difference]: Start difference. First operand 4508 states and 4854 transitions. Second operand 31 states. [2018-11-23 13:14:08,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:08,857 INFO L93 Difference]: Finished difference Result 2926 states and 3110 transitions. [2018-11-23 13:14:08,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 13:14:08,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2926 states and 3110 transitions. [2018-11-23 13:14:08,863 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2018-11-23 13:14:08,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2926 states to 1609 states and 1728 transitions. [2018-11-23 13:14:08,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2018-11-23 13:14:08,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 345 [2018-11-23 13:14:08,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1609 states and 1728 transitions. [2018-11-23 13:14:08,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:14:08,867 INFO L705 BuchiCegarLoop]: Abstraction has 1609 states and 1728 transitions. [2018-11-23 13:14:08,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1609 states and 1728 transitions. [2018-11-23 13:14:08,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1609 to 1536. [2018-11-23 13:14:08,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1536 states. [2018-11-23 13:14:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 1618 transitions. [2018-11-23 13:14:08,876 INFO L728 BuchiCegarLoop]: Abstraction has 1536 states and 1618 transitions. [2018-11-23 13:14:08,876 INFO L608 BuchiCegarLoop]: Abstraction has 1536 states and 1618 transitions. [2018-11-23 13:14:08,876 INFO L442 BuchiCegarLoop]: ======== Iteration 34============ [2018-11-23 13:14:08,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1536 states and 1618 transitions. [2018-11-23 13:14:08,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2018-11-23 13:14:08,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:14:08,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:14:08,881 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [143, 138, 111, 67, 57, 56, 53, 53, 52, 52, 44, 32, 24, 24, 23, 23, 23, 10, 10, 10, 10, 5, 4, 4, 1, 1, 1] [2018-11-23 13:14:08,881 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-23 13:14:08,882 INFO L794 eck$LassoCheckResult]: Stem: 353214#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~ret8, main_#t~post7, main_~q~0, main_#t~post6, main_~p~0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3; 353208#L28 assume !(main_~x~0 < 0);main_~y~0 := main_#t~nondet4;havoc main_#t~nondet4; 353209#L31 assume !(main_~y~0 < 0);main_~z~0 := main_#t~nondet5;havoc main_#t~nondet5;main_~p~0 := 0; 353210#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 353211#L35-3 assume !!(main_~q~0 <= main_~x~0); 353929#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353930#partsENTRY ~p := #in~p;~q := #in~q; 353934#L20 assume ~p <= 0;#res := 1; 353933#partsFINAL assume true; 353928#partsEXIT >#67#return; 353927#L36-1 havoc main_#t~ret8; 353926#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353925#L35-3 assume !!(main_~q~0 <= main_~x~0); 353922#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353923#partsENTRY ~p := #in~p;~q := #in~q; 353932#L20 assume ~p <= 0;#res := 1; 353931#partsFINAL assume true; 353921#partsEXIT >#67#return; 353919#L36-1 havoc main_#t~ret8; 353918#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353917#L35-3 assume !!(main_~q~0 <= main_~x~0); 353915#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353916#partsENTRY ~p := #in~p;~q := #in~q; 353924#L20 assume ~p <= 0;#res := 1; 353920#partsFINAL assume true; 353914#partsEXIT >#67#return; 353912#L36-1 havoc main_#t~ret8; 353910#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353909#L35-3 assume !!(main_~q~0 <= main_~x~0); 353908#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353901#partsENTRY ~p := #in~p;~q := #in~q; 353913#L20 assume ~p <= 0;#res := 1; 353911#partsFINAL assume true; 353907#partsEXIT >#67#return; 353906#L36-1 havoc main_#t~ret8; 353905#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353903#L35-3 assume !!(main_~q~0 <= main_~x~0); 353899#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353900#partsENTRY ~p := #in~p;~q := #in~q; 353904#L20 assume ~p <= 0;#res := 1; 353902#partsFINAL assume true; 353898#partsEXIT >#67#return; 353897#L36-1 havoc main_#t~ret8; 353851#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353852#L35-3 assume !(main_~q~0 <= main_~x~0); 353221#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 353212#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 353213#L35-3 assume !!(main_~q~0 <= main_~x~0); 354018#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 354019#partsENTRY ~p := #in~p;~q := #in~q; 354204#L20 assume !(~p <= 0); 354202#L21 assume ~q <= 0;#res := 0; 354200#partsFINAL assume true; 354017#partsEXIT >#67#return; 354013#L36-1 havoc main_#t~ret8; 354012#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 354011#L35-3 assume !!(main_~q~0 <= main_~x~0); 354008#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 354009#partsENTRY ~p := #in~p;~q := #in~q; 354045#L20 assume !(~p <= 0); 354043#L21 assume !(~q <= 0); 354041#L22 assume !(~q > ~p); 354038#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354039#partsENTRY ~p := #in~p;~q := #in~q; 354047#L20 assume ~p <= 0;#res := 1; 354046#partsFINAL assume true; 354037#partsEXIT >#63#return; 354030#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354031#partsENTRY ~p := #in~p;~q := #in~q; 354060#L20 assume !(~p <= 0); 354058#L21 assume ~q <= 0;#res := 0; 354056#partsFINAL assume true; 354029#partsEXIT >#65#return; 354025#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354023#partsFINAL assume true; 354007#partsEXIT >#67#return; 354005#L36-1 havoc main_#t~ret8; 354003#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353999#L35-3 assume !!(main_~q~0 <= main_~x~0); 353993#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353997#partsENTRY ~p := #in~p;~q := #in~q; 354010#L20 assume !(~p <= 0); 354006#L21 assume !(~q <= 0); 354004#L22 assume ~q > ~p; 353985#L22-1 call #t~ret0 := parts(~p, ~p);< 353987#partsENTRY ~p := #in~p;~q := #in~q; 354121#L20 assume !(~p <= 0); 354120#L21 assume !(~q <= 0); 354119#L22 assume !(~q > ~p); 354112#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354114#partsENTRY ~p := #in~p;~q := #in~q; 354122#L20 assume ~p <= 0;#res := 1; 354117#partsFINAL assume true; 354111#partsEXIT >#63#return; 354001#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354002#partsENTRY ~p := #in~p;~q := #in~q; 354198#L20 assume !(~p <= 0); 354197#L21 assume ~q <= 0;#res := 0; 354195#partsFINAL assume true; 354000#partsEXIT >#65#return; 353998#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353992#partsFINAL assume true; 353983#partsEXIT >#61#return; 353986#L22-2 #res := #t~ret0;havoc #t~ret0; 354021#partsFINAL assume true; 353996#partsEXIT >#67#return; 353991#L36-1 havoc main_#t~ret8; 353988#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353982#L35-3 assume !!(main_~q~0 <= main_~x~0); 353971#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353871#partsENTRY ~p := #in~p;~q := #in~q; 354020#L20 assume !(~p <= 0); 353995#L21 assume !(~q <= 0); 353990#L22 assume ~q > ~p; 353984#L22-1 call #t~ret0 := parts(~p, ~p);< 353987#partsENTRY ~p := #in~p;~q := #in~q; 354121#L20 assume !(~p <= 0); 354120#L21 assume !(~q <= 0); 354119#L22 assume !(~q > ~p); 354112#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354114#partsENTRY ~p := #in~p;~q := #in~q; 354122#L20 assume ~p <= 0;#res := 1; 354117#partsFINAL assume true; 354111#partsEXIT >#63#return; 354001#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354002#partsENTRY ~p := #in~p;~q := #in~q; 354198#L20 assume !(~p <= 0); 354197#L21 assume ~q <= 0;#res := 0; 354195#partsFINAL assume true; 354000#partsEXIT >#65#return; 353998#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353992#partsFINAL assume true; 353983#partsEXIT >#61#return; 353981#L22-2 #res := #t~ret0;havoc #t~ret0; 353980#partsFINAL assume true; 353970#partsEXIT >#67#return; 353968#L36-1 havoc main_#t~ret8; 353967#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353966#L35-3 assume !!(main_~q~0 <= main_~x~0); 353870#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353872#partsENTRY ~p := #in~p;~q := #in~q; 354203#L20 assume !(~p <= 0); 354201#L21 assume !(~q <= 0); 354199#L22 assume ~q > ~p; 354015#L22-1 call #t~ret0 := parts(~p, ~p);< 354016#partsENTRY ~p := #in~p;~q := #in~q; 354044#L20 assume !(~p <= 0); 354042#L21 assume !(~q <= 0); 354040#L22 assume !(~q > ~p); 354034#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354036#partsENTRY ~p := #in~p;~q := #in~q; 354052#L20 assume ~p <= 0;#res := 1; 354048#partsFINAL assume true; 354032#partsEXIT >#63#return; 354027#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354028#partsENTRY ~p := #in~p;~q := #in~q; 354070#L20 assume !(~p <= 0); 354067#L21 assume ~q <= 0;#res := 0; 354065#partsFINAL assume true; 354026#partsEXIT >#65#return; 354024#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354022#partsFINAL assume true; 354014#partsEXIT >#61#return; 353994#L22-2 #res := #t~ret0;havoc #t~ret0; 353989#partsFINAL assume true; 353869#partsEXIT >#67#return; 353866#L36-1 havoc main_#t~ret8; 353867#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353844#L35-3 assume !(main_~q~0 <= main_~x~0); 353845#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 353895#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 353893#L35-3 assume !!(main_~q~0 <= main_~x~0); 353890#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353891#partsENTRY ~p := #in~p;~q := #in~q; 353896#L20 assume !(~p <= 0); 353894#L21 assume ~q <= 0;#res := 0; 353892#partsFINAL assume true; 353889#partsEXIT >#67#return; 353888#L36-1 havoc main_#t~ret8; 353887#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353886#L35-3 assume !!(main_~q~0 <= main_~x~0); 353881#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353885#partsENTRY ~p := #in~p;~q := #in~q; 353884#L20 assume !(~p <= 0); 353883#L21 assume !(~q <= 0); 353882#L22 assume !(~q > ~p); 353875#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353880#partsENTRY ~p := #in~p;~q := #in~q; 353879#L20 assume !(~p <= 0); 353878#L21 assume !(~q <= 0); 353877#L22 assume !(~q > ~p); 353856#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353876#partsENTRY ~p := #in~p;~q := #in~q; 353937#L20 assume ~p <= 0;#res := 1; 353938#partsFINAL assume true; 353855#partsEXIT >#63#return; 353858#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354101#partsENTRY ~p := #in~p;~q := #in~q; 354107#L20 assume !(~p <= 0); 354105#L21 assume ~q <= 0;#res := 0; 354103#partsFINAL assume true; 354100#partsEXIT >#65#return; 354098#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354096#partsFINAL assume true; 354095#partsEXIT >#63#return; 354093#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354094#partsENTRY ~p := #in~p;~q := #in~q; 354102#L20 assume !(~p <= 0); 354099#L21 assume ~q <= 0;#res := 0; 354097#partsFINAL assume true; 354092#partsEXIT >#65#return; 354091#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354090#partsFINAL assume true; 354087#partsEXIT >#67#return; 354084#L36-1 havoc main_#t~ret8; 354085#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 354388#L35-3 assume !!(main_~q~0 <= main_~x~0); 353267#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353268#partsENTRY ~p := #in~p;~q := #in~q; 354391#L20 assume !(~p <= 0); 354390#L21 assume !(~q <= 0); 354389#L22 assume !(~q > ~p); 354255#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354256#partsENTRY ~p := #in~p;~q := #in~q; 354384#L20 assume ~p <= 0;#res := 1; 354381#partsFINAL assume true; 354254#partsEXIT >#63#return; 354249#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354250#partsENTRY ~p := #in~p;~q := #in~q; 354276#L20 assume !(~p <= 0); 354274#L21 assume !(~q <= 0); 354273#L22 assume !(~q > ~p); 354271#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354272#partsENTRY ~p := #in~p;~q := #in~q; 354287#L20 assume !(~p <= 0); 354285#L21 assume !(~q <= 0); 354284#L22 assume !(~q > ~p); 354282#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354283#partsENTRY ~p := #in~p;~q := #in~q; 354288#L20 assume ~p <= 0;#res := 1; 354286#partsFINAL assume true; 354281#partsEXIT >#63#return; 354279#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354280#partsENTRY ~p := #in~p;~q := #in~q; 354293#L20 assume !(~p <= 0); 354291#L21 assume ~q <= 0;#res := 0; 354289#partsFINAL assume true; 354278#partsEXIT >#65#return; 354277#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354275#partsFINAL assume true; 354270#partsEXIT >#63#return; 354268#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354269#partsENTRY ~p := #in~p;~q := #in~q; 354294#L20 assume !(~p <= 0); 354292#L21 assume ~q <= 0;#res := 0; 354290#partsFINAL assume true; 354267#partsEXIT >#65#return; 354266#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354265#partsFINAL assume true; 354248#partsEXIT >#65#return; 354246#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354242#partsFINAL assume true; 354237#partsEXIT >#67#return; 354231#L36-1 havoc main_#t~ret8; 354230#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 354229#L35-3 assume !!(main_~q~0 <= main_~x~0); 353257#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353865#partsENTRY ~p := #in~p;~q := #in~q; 354225#L20 assume !(~p <= 0); 354223#L21 assume !(~q <= 0); 354217#L22 assume ~q > ~p; 353256#L22-1 call #t~ret0 := parts(~p, ~p);< 353258#partsENTRY ~p := #in~p;~q := #in~q; 354387#L20 assume !(~p <= 0); 354386#L21 assume !(~q <= 0); 354383#L22 assume !(~q > ~p); 354379#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354380#partsENTRY ~p := #in~p;~q := #in~q; 354385#L20 assume ~p <= 0;#res := 1; 354382#partsFINAL assume true; 354378#partsEXIT >#63#return; 354340#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354341#partsENTRY ~p := #in~p;~q := #in~q; 354366#L20 assume !(~p <= 0); 354362#L21 assume !(~q <= 0); 354359#L22 assume !(~q > ~p); 354355#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354356#partsENTRY ~p := #in~p;~q := #in~q; 354377#L20 assume !(~p <= 0); 354376#L21 assume !(~q <= 0); 354373#L22 assume !(~q > ~p); 354369#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354370#partsENTRY ~p := #in~p;~q := #in~q; 354375#L20 assume ~p <= 0;#res := 1; 354372#partsFINAL assume true; 354368#partsEXIT >#63#return; 354364#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354365#partsENTRY ~p := #in~p;~q := #in~q; 354374#L20 assume !(~p <= 0); 354371#L21 assume ~q <= 0;#res := 0; 354367#partsFINAL assume true; 354363#partsEXIT >#65#return; 354361#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354358#partsFINAL assume true; 354354#partsEXIT >#63#return; 354350#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354351#partsENTRY ~p := #in~p;~q := #in~q; 354360#L20 assume !(~p <= 0); 354357#L21 assume ~q <= 0;#res := 0; 354353#partsFINAL assume true; 354349#partsEXIT >#65#return; 354347#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354344#partsFINAL assume true; 354339#partsEXIT >#65#return; 354337#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354335#partsFINAL assume true; 354331#partsEXIT >#61#return; 354329#L22-2 #res := #t~ret0;havoc #t~ret0; 354327#partsFINAL assume true; 354324#partsEXIT >#67#return; 353252#L36-1 havoc main_#t~ret8; 353235#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353217#L35-3 assume !!(main_~q~0 <= main_~x~0); 353218#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353864#partsENTRY ~p := #in~p;~q := #in~q; 354228#L20 assume !(~p <= 0); 354219#L21 assume !(~q <= 0); 354205#L22 assume ~q > ~p; 354206#L22-1 call #t~ret0 := parts(~p, ~p);< 354213#partsENTRY ~p := #in~p;~q := #in~q; 354261#L20 assume !(~p <= 0); 354260#L21 assume !(~q <= 0); 354259#L22 assume !(~q > ~p); 354234#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354235#partsENTRY ~p := #in~p;~q := #in~q; 354258#L20 assume ~p <= 0;#res := 1; 354257#partsFINAL assume true; 354233#partsEXIT >#63#return; 354221#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354222#partsENTRY ~p := #in~p;~q := #in~q; 354330#L20 assume !(~p <= 0); 354328#L21 assume !(~q <= 0); 354325#L22 assume !(~q > ~p); 354300#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354301#partsENTRY ~p := #in~p;~q := #in~q; 354342#L20 assume !(~p <= 0); 354338#L21 assume !(~q <= 0); 354336#L22 assume !(~q > ~p); 354333#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354334#partsENTRY ~p := #in~p;~q := #in~q; 354345#L20 assume ~p <= 0;#res := 1; 354343#partsFINAL assume true; 354332#partsEXIT >#63#return; 354320#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354321#partsENTRY ~p := #in~p;~q := #in~q; 354326#L20 assume !(~p <= 0); 354323#L21 assume ~q <= 0;#res := 0; 354322#partsFINAL assume true; 354319#partsEXIT >#65#return; 354317#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354315#partsFINAL assume true; 354299#partsEXIT >#63#return; 354252#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354253#partsENTRY ~p := #in~p;~q := #in~q; 354264#L20 assume !(~p <= 0); 354263#L21 assume ~q <= 0;#res := 0; 354262#partsFINAL assume true; 354251#partsEXIT >#65#return; 354247#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354232#partsFINAL assume true; 354220#partsEXIT >#65#return; 354216#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354215#partsFINAL assume true; 354212#partsEXIT >#61#return; 354210#L22-2 #res := #t~ret0;havoc #t~ret0; 354208#partsFINAL assume true; 354207#partsEXIT >#67#return; 353849#L36-1 havoc main_#t~ret8; 353850#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353840#L35-3 assume !(main_~q~0 <= main_~x~0); 353841#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 353826#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 353827#L35-3 assume !!(main_~q~0 <= main_~x~0); 353805#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353806#partsENTRY ~p := #in~p;~q := #in~q; 353832#L20 assume !(~p <= 0); 353825#L21 assume ~q <= 0;#res := 0; 353821#partsFINAL assume true; 353804#partsEXIT >#67#return; 353802#L36-1 havoc main_#t~ret8; 353792#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353793#L35-3 assume !!(main_~q~0 <= main_~x~0); 353782#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353965#partsENTRY ~p := #in~p;~q := #in~q; 353964#L20 assume !(~p <= 0); 353962#L21 assume !(~q <= 0); 353960#L22 assume !(~q > ~p); 353819#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353820#partsENTRY ~p := #in~p;~q := #in~q; 353963#L20 assume !(~p <= 0); 353961#L21 assume !(~q <= 0); 353959#L22 assume !(~q > ~p); 353859#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353860#partsENTRY ~p := #in~p;~q := #in~q; 353952#L20 assume !(~p <= 0); 353949#L21 assume !(~q <= 0); 353946#L22 assume !(~q > ~p); 353943#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353944#partsENTRY ~p := #in~p;~q := #in~q; 353956#L20 assume ~p <= 0;#res := 1; 353955#partsFINAL assume true; 353942#partsEXIT >#63#return; 353940#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353941#partsENTRY ~p := #in~p;~q := #in~q; 353951#L20 assume !(~p <= 0); 353948#L21 assume ~q <= 0;#res := 0; 353945#partsFINAL assume true; 353939#partsEXIT >#65#return; 353936#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353873#partsFINAL assume true; 353874#partsEXIT >#63#return; 353836#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353838#partsENTRY ~p := #in~p;~q := #in~q; 353868#L20 assume !(~p <= 0); 353853#L21 assume ~q <= 0;#res := 0; 353854#partsFINAL assume true; 353835#partsEXIT >#65#return; 353837#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353824#partsFINAL assume true; 353818#partsEXIT >#63#return; 353795#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353797#partsENTRY ~p := #in~p;~q := #in~q; 353817#L20 assume !(~p <= 0); 353812#L21 assume ~q <= 0;#res := 0; 353813#partsFINAL assume true; 353794#partsEXIT >#65#return; 353796#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353781#partsFINAL assume true; 353783#partsEXIT >#67#return; 353353#L36-1 havoc main_#t~ret8; 353349#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353347#L35-3 assume !!(main_~q~0 <= main_~x~0); 353311#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353312#partsENTRY ~p := #in~p;~q := #in~q; 353342#L20 assume !(~p <= 0); 353340#L21 assume !(~q <= 0); 353338#L22 assume !(~q > ~p); 353336#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353337#partsENTRY ~p := #in~p;~q := #in~q; 353685#L20 assume !(~p <= 0); 353684#L21 assume !(~q <= 0); 353682#L22 assume ~q > ~p; 353683#L22-1 call #t~ret0 := parts(~p, ~p);< 353730#partsENTRY ~p := #in~p;~q := #in~q; 353754#L20 assume !(~p <= 0); 353753#L21 assume !(~q <= 0); 353752#L22 assume !(~q > ~p); 353747#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353750#partsENTRY ~p := #in~p;~q := #in~q; 353760#L20 assume ~p <= 0;#res := 1; 353757#partsFINAL assume true; 353746#partsEXIT >#63#return; 353739#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353740#partsENTRY ~p := #in~p;~q := #in~q; 353756#L20 assume !(~p <= 0); 353745#L21 assume ~q <= 0;#res := 0; 353744#partsFINAL assume true; 353738#partsEXIT >#65#return; 353734#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353732#partsFINAL assume true; 353729#partsEXIT >#61#return; 353727#L22-2 #res := #t~ret0;havoc #t~ret0; 353717#partsFINAL assume true; 353335#partsEXIT >#63#return; 353321#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353322#partsENTRY ~p := #in~p;~q := #in~q; 353666#L20 assume !(~p <= 0); 353664#L21 assume !(~q <= 0); 353660#L22 assume !(~q > ~p); 353619#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353620#partsENTRY ~p := #in~p;~q := #in~q; 353638#L20 assume !(~p <= 0); 353637#L21 assume !(~q <= 0); 353636#L22 assume !(~q > ~p); 353630#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353634#partsENTRY ~p := #in~p;~q := #in~q; 353656#L20 assume !(~p <= 0); 353654#L21 assume !(~q <= 0); 353653#L22 assume !(~q > ~p); 353651#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353652#partsENTRY ~p := #in~p;~q := #in~q; 353657#L20 assume ~p <= 0;#res := 1; 353655#partsFINAL assume true; 353650#partsEXIT >#63#return; 353646#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353649#partsENTRY ~p := #in~p;~q := #in~q; 353678#L20 assume !(~p <= 0); 353677#L21 assume ~q <= 0;#res := 0; 353658#partsFINAL assume true; 353645#partsEXIT >#65#return; 353644#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353639#partsFINAL assume true; 353628#partsEXIT >#63#return; 353625#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353626#partsENTRY ~p := #in~p;~q := #in~q; 353698#L20 assume !(~p <= 0); 353695#L21 assume ~q <= 0;#res := 0; 353641#partsFINAL assume true; 353624#partsEXIT >#65#return; 353622#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353621#partsFINAL assume true; 353618#partsEXIT >#63#return; 353616#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353617#partsENTRY ~p := #in~p;~q := #in~q; 353635#L20 assume !(~p <= 0); 353627#L21 assume ~q <= 0;#res := 0; 353623#partsFINAL assume true; 353615#partsEXIT >#65#return; 353441#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353334#partsFINAL assume true; 353320#partsEXIT >#65#return; 353316#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353315#partsFINAL assume true; 353310#partsEXIT >#67#return; 353309#L36-1 havoc main_#t~ret8; 353308#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353306#L35-3 assume !!(main_~q~0 <= main_~x~0); 353302#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353304#partsENTRY ~p := #in~p;~q := #in~q; 353716#L20 assume !(~p <= 0); 353715#L21 assume !(~q <= 0); 353713#L22 assume !(~q > ~p); 353433#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353434#partsENTRY ~p := #in~p;~q := #in~q; 353448#L20 assume ~p <= 0;#res := 1; 353444#partsFINAL assume true; 353432#partsEXIT >#63#return; 353331#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353332#partsENTRY ~p := #in~p;~q := #in~q; 353714#L20 assume !(~p <= 0); 353712#L21 assume !(~q <= 0); 353711#L22 assume !(~q > ~p); 353429#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353430#partsENTRY ~p := #in~p;~q := #in~q; 353477#L20 assume !(~p <= 0); 353475#L21 assume !(~q <= 0); 353473#L22 assume ~q > ~p; 353468#L22-1 call #t~ret0 := parts(~p, ~p);< 353471#partsENTRY ~p := #in~p;~q := #in~q; 353491#L20 assume !(~p <= 0); 353490#L21 assume !(~q <= 0); 353489#L22 assume !(~q > ~p); 353487#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353488#partsENTRY ~p := #in~p;~q := #in~q; 353493#L20 assume ~p <= 0;#res := 1; 353492#partsFINAL assume true; 353486#partsEXIT >#63#return; 353483#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353484#partsENTRY ~p := #in~p;~q := #in~q; 353497#L20 assume !(~p <= 0); 353496#L21 assume ~q <= 0;#res := 0; 353494#partsFINAL assume true; 353482#partsEXIT >#65#return; 353480#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353478#partsFINAL assume true; 353467#partsEXIT >#61#return; 353463#L22-2 #res := #t~ret0;havoc #t~ret0; 353459#partsFINAL assume true; 353428#partsEXIT >#63#return; 353426#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353427#partsENTRY ~p := #in~p;~q := #in~q; 353519#L20 assume !(~p <= 0); 353517#L21 assume !(~q <= 0); 353515#L22 assume !(~q > ~p); 353512#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353513#partsENTRY ~p := #in~p;~q := #in~q; 353536#L20 assume !(~p <= 0); 353534#L21 assume !(~q <= 0); 353532#L22 assume !(~q > ~p); 353529#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353531#partsENTRY ~p := #in~p;~q := #in~q; 353552#L20 assume !(~p <= 0); 353550#L21 assume !(~q <= 0); 353549#L22 assume !(~q > ~p); 353547#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353548#partsENTRY ~p := #in~p;~q := #in~q; 353553#L20 assume ~p <= 0;#res := 1; 353551#partsFINAL assume true; 353546#partsEXIT >#63#return; 353544#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353545#partsENTRY ~p := #in~p;~q := #in~q; 353557#L20 assume !(~p <= 0); 353555#L21 assume ~q <= 0;#res := 0; 353554#partsFINAL assume true; 353543#partsEXIT >#65#return; 353541#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353539#partsFINAL assume true; 353528#partsEXIT >#63#return; 353525#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353527#partsENTRY ~p := #in~p;~q := #in~q; 353559#L20 assume !(~p <= 0); 353558#L21 assume ~q <= 0;#res := 0; 353556#partsFINAL assume true; 353523#partsEXIT >#65#return; 353521#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353520#partsFINAL assume true; 353511#partsEXIT >#63#return; 353506#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353507#partsENTRY ~p := #in~p;~q := #in~q; 353563#L20 assume !(~p <= 0); 353561#L21 assume ~q <= 0;#res := 0; 353560#partsFINAL assume true; 353505#partsEXIT >#65#return; 353501#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353499#partsFINAL assume true; 353425#partsEXIT >#65#return; 353424#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353422#partsFINAL assume true; 353330#partsEXIT >#65#return; 353326#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353318#partsFINAL assume true; 353301#partsEXIT >#67#return; 353295#L36-1 havoc main_#t~ret8; 353290#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353284#L35-3 assume !!(main_~q~0 <= main_~x~0); 353277#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353278#partsENTRY ~p := #in~p;~q := #in~q; 353307#L20 assume !(~p <= 0); 353305#L21 assume !(~q <= 0); 353300#L22 assume ~q > ~p; 353293#L22-1 call #t~ret0 := parts(~p, ~p);< 353294#partsENTRY ~p := #in~p;~q := #in~q; 353401#L20 assume !(~p <= 0); 353399#L21 assume !(~q <= 0); 353397#L22 assume !(~q > ~p); 353328#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353329#partsENTRY ~p := #in~p;~q := #in~q; 353365#L20 assume ~p <= 0;#res := 1; 353363#partsFINAL assume true; 353327#partsEXIT >#63#return; 353324#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353325#partsENTRY ~p := #in~p;~q := #in~q; 353570#L20 assume !(~p <= 0); 353569#L21 assume !(~q <= 0); 353568#L22 assume !(~q > ~p); 353254#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353567#partsENTRY ~p := #in~p;~q := #in~q; 353696#L20 assume !(~p <= 0); 353693#L21 assume !(~q <= 0); 353691#L22 assume ~q > ~p; 353253#L22-1 call #t~ret0 := parts(~p, ~p);< 353255#partsENTRY ~p := #in~p;~q := #in~q; 353592#L20 assume !(~p <= 0); 353590#L21 assume !(~q <= 0); 353589#L22 assume !(~q > ~p); 353582#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353584#partsENTRY ~p := #in~p;~q := #in~q; 353591#L20 assume ~p <= 0;#res := 1; 353588#partsFINAL assume true; 353580#partsEXIT >#63#return; 353583#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353703#partsENTRY ~p := #in~p;~q := #in~q; 353708#L20 assume !(~p <= 0); 353706#L21 assume ~q <= 0;#res := 0; 353705#partsFINAL assume true; 353702#partsEXIT >#65#return; 353700#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353612#partsFINAL assume true; 353611#partsEXIT >#61#return; 353259#L22-2 #res := #t~ret0;havoc #t~ret0; 353260#partsFINAL assume true; 353566#partsEXIT >#63#return; 353344#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353345#partsENTRY ~p := #in~p;~q := #in~q; 353364#L20 assume !(~p <= 0); 353362#L21 assume !(~q <= 0); 353358#L22 assume !(~q > ~p); 353355#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353356#partsENTRY ~p := #in~p;~q := #in~q; 353383#L20 assume !(~p <= 0); 353380#L21 assume !(~q <= 0); 353379#L22 assume !(~q > ~p); 353375#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353378#partsENTRY ~p := #in~p;~q := #in~q; 353606#L20 assume !(~p <= 0); 353604#L21 assume !(~q <= 0); 353600#L22 assume !(~q > ~p); 353394#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353395#partsENTRY ~p := #in~p;~q := #in~q; 353579#L20 assume ~p <= 0;#res := 1; 353575#partsFINAL assume true; 353393#partsEXIT >#63#return; 353390#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353391#partsENTRY ~p := #in~p;~q := #in~q; 353602#L20 assume !(~p <= 0); 353596#L21 assume ~q <= 0;#res := 0; 353594#partsFINAL assume true; 353389#partsEXIT >#65#return; 353387#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353381#partsFINAL assume true; 353374#partsEXIT >#63#return; 353372#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353373#partsENTRY ~p := #in~p;~q := #in~q; 353537#L20 assume !(~p <= 0); 353535#L21 assume ~q <= 0;#res := 0; 353533#partsFINAL assume true; 353371#partsEXIT >#65#return; 353370#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353368#partsFINAL assume true; 353354#partsEXIT >#63#return; 353351#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353352#partsENTRY ~p := #in~p;~q := #in~q; 353439#L20 assume !(~p <= 0); 353435#L21 assume ~q <= 0;#res := 0; 353431#partsFINAL assume true; 353350#partsEXIT >#65#return; 353348#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353346#partsFINAL assume true; 353343#partsEXIT >#65#return; 353341#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353339#partsFINAL assume true; 353323#partsEXIT >#65#return; 353317#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353299#partsFINAL assume true; 353292#partsEXIT >#61#return; 353289#L22-2 #res := #t~ret0;havoc #t~ret0; 353283#partsFINAL assume true; 353276#partsEXIT >#67#return; 353272#L36-1 havoc main_#t~ret8; 353270#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353269#L35-3 assume !(main_~q~0 <= main_~x~0); 353219#L34-2 main_#t~post6 := main_~p~0;main_~p~0 := 1 + main_#t~post6;havoc main_#t~post6; 353220#L34-3 assume !!(main_~p~0 <= main_~x~0);main_~q~0 := 0; 353215#L35-3 assume !!(main_~q~0 <= main_~x~0); 353216#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353609#partsENTRY ~p := #in~p;~q := #in~q; 353643#L20 assume !(~p <= 0); 353642#L21 assume ~q <= 0;#res := 0; 353610#partsFINAL assume true; 353608#partsEXIT >#67#return; 353250#L36-1 havoc main_#t~ret8; 353251#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353314#L35-3 assume !!(main_~q~0 <= main_~x~0); 353297#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353298#partsENTRY ~p := #in~p;~q := #in~q; 353607#L20 assume !(~p <= 0); 353605#L21 assume !(~q <= 0); 353603#L22 assume !(~q > ~p); 353598#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353599#partsENTRY ~p := #in~p;~q := #in~q; 353790#L20 assume !(~p <= 0); 353789#L21 assume !(~q <= 0); 353788#L22 assume !(~q > ~p); 353778#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353787#partsENTRY ~p := #in~p;~q := #in~q; 353801#L20 assume !(~p <= 0); 353800#L21 assume !(~q <= 0); 353798#L22 assume !(~q > ~p); 353777#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353787#partsENTRY ~p := #in~p;~q := #in~q; 353801#L20 assume !(~p <= 0); 353800#L21 assume !(~q <= 0); 353798#L22 assume !(~q > ~p); 353799#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354494#partsENTRY ~p := #in~p;~q := #in~q; 354498#L20 assume ~p <= 0;#res := 1; 354496#partsFINAL assume true; 354493#partsEXIT >#63#return; 354490#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354491#partsENTRY ~p := #in~p;~q := #in~q; 354497#L20 assume !(~p <= 0); 354495#L21 assume ~q <= 0;#res := 0; 354492#partsFINAL assume true; 354489#partsEXIT >#65#return; 354488#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354486#partsFINAL assume true; 354484#partsEXIT >#63#return; 354481#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354482#partsENTRY ~p := #in~p;~q := #in~q; 354487#L20 assume !(~p <= 0); 354485#L21 assume ~q <= 0;#res := 0; 354483#partsFINAL assume true; 354480#partsEXIT >#65#return; 353774#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354477#partsFINAL assume true; 353786#partsEXIT >#63#return; 353772#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353775#partsENTRY ~p := #in~p;~q := #in~q; 353780#L20 assume !(~p <= 0); 353779#L21 assume ~q <= 0;#res := 0; 353776#partsFINAL assume true; 353771#partsEXIT >#65#return; 353765#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353725#partsFINAL assume true; 353597#partsEXIT >#63#return; 353360#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353361#partsENTRY ~p := #in~p;~q := #in~q; 353369#L20 assume !(~p <= 0); 353367#L21 assume ~q <= 0;#res := 0; 353366#partsFINAL assume true; 353359#partsEXIT >#65#return; 353357#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353313#partsFINAL assume true; 353296#partsEXIT >#67#return; 353291#L36-1 havoc main_#t~ret8; 353288#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353282#L35-3 assume !!(main_~q~0 <= main_~x~0); 353274#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353275#partsENTRY ~p := #in~p;~q := #in~q; 353724#L20 assume !(~p <= 0); 353723#L21 assume !(~q <= 0); 353722#L22 assume !(~q > ~p); 353719#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353721#partsENTRY ~p := #in~p;~q := #in~q; 353811#L20 assume !(~p <= 0); 354452#L21 assume !(~q <= 0); 354450#L22 assume !(~q > ~p); 354451#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354551#partsENTRY ~p := #in~p;~q := #in~q; 354553#L20 assume ~p <= 0;#res := 1; 354552#partsFINAL assume true; 354550#partsEXIT >#63#return; 354538#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354546#partsENTRY ~p := #in~p;~q := #in~q; 354543#L20 assume !(~p <= 0); 354542#L21 assume !(~q <= 0); 354541#L22 assume !(~q > ~p); 354524#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354536#partsENTRY ~p := #in~p;~q := #in~q; 354535#L20 assume !(~p <= 0); 354534#L21 assume !(~q <= 0); 354533#L22 assume !(~q > ~p); 354530#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354531#partsENTRY ~p := #in~p;~q := #in~q; 354540#L20 assume ~p <= 0;#res := 1; 354537#partsFINAL assume true; 354529#partsEXIT >#63#return; 354519#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354522#partsENTRY ~p := #in~p;~q := #in~q; 354532#L20 assume !(~p <= 0); 354528#L21 assume ~q <= 0;#res := 0; 354523#partsFINAL assume true; 354518#partsEXIT >#65#return; 354521#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354576#partsFINAL assume true; 354574#partsEXIT >#63#return; 354571#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354572#partsENTRY ~p := #in~p;~q := #in~q; 354577#L20 assume !(~p <= 0); 354575#L21 assume ~q <= 0;#res := 0; 354573#partsFINAL assume true; 354570#partsEXIT >#65#return; 354569#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354568#partsFINAL assume true; 354566#partsEXIT >#65#return; 354567#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354601#partsFINAL assume true; 354438#partsEXIT >#63#return; 353286#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353287#partsENTRY ~p := #in~p;~q := #in~q; 354476#L20 assume !(~p <= 0); 354475#L21 assume !(~q <= 0); 354474#L22 assume !(~q > ~p); 354472#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354473#partsENTRY ~p := #in~p;~q := #in~q; 354580#L20 assume !(~p <= 0); 354581#L21 assume !(~q <= 0); 354562#L22 assume !(~q > ~p); 354512#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354515#partsENTRY ~p := #in~p;~q := #in~q; 354549#L20 assume !(~p <= 0); 354548#L21 assume !(~q <= 0); 354545#L22 assume !(~q > ~p); 354526#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354527#partsENTRY ~p := #in~p;~q := #in~q; 354547#L20 assume ~p <= 0;#res := 1; 354544#partsFINAL assume true; 354525#partsEXIT >#63#return; 354520#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354522#partsENTRY ~p := #in~p;~q := #in~q; 354532#L20 assume !(~p <= 0); 354528#L21 assume ~q <= 0;#res := 0; 354523#partsFINAL assume true; 354518#partsEXIT >#65#return; 354517#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354516#partsFINAL assume true; 354510#partsEXIT >#63#return; 354501#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354506#partsENTRY ~p := #in~p;~q := #in~q; 354509#L20 assume !(~p <= 0); 354508#L21 assume ~q <= 0;#res := 0; 354507#partsFINAL assume true; 354499#partsEXIT >#65#return; 354479#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354478#partsFINAL assume true; 354471#partsEXIT >#63#return; 354445#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354448#partsENTRY ~p := #in~p;~q := #in~q; 354465#L20 assume !(~p <= 0); 354457#L21 assume ~q <= 0;#res := 0; 354449#partsFINAL assume true; 354444#partsEXIT >#65#return; 354447#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354470#partsFINAL assume true; 353285#partsEXIT >#65#return; 353281#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353280#partsFINAL assume true; 353273#partsEXIT >#67#return; 353271#L36-1 havoc main_#t~ret8; 353233#L35-2 main_#t~post7 := main_~q~0;main_~q~0 := 1 + main_#t~post7;havoc main_#t~post7; 353234#L35-3 assume !!(main_~q~0 <= main_~x~0); 353265#L36 call main_#t~ret8 := parts(main_~p~0, main_~q~0);< 353266#partsENTRY ~p := #in~p;~q := #in~q; 353710#L20 assume !(~p <= 0); 353709#L21 assume !(~q <= 0); 353707#L22 assume !(~q > ~p); 353697#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353704#partsENTRY ~p := #in~p;~q := #in~q; 353701#L20 assume !(~p <= 0); 353699#L21 assume !(~q <= 0); 353690#L22 assume !(~q > ~p); 353416#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353694#partsENTRY ~p := #in~p;~q := #in~q; 353692#L20 assume !(~p <= 0); 353689#L21 assume !(~q <= 0); 353688#L22 assume !(~q > ~p); 353419#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353420#partsENTRY ~p := #in~p;~q := #in~q; 353572#L20 assume ~p <= 0;#res := 1; 353571#partsFINAL assume true; 353418#partsEXIT >#63#return; 353403#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353412#partsENTRY ~p := #in~p;~q := #in~q; 353410#L20 assume !(~p <= 0); 353408#L21 assume !(~q <= 0); 353407#L22 assume !(~q > ~p); 353405#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353406#partsENTRY ~p := #in~p;~q := #in~q; 353423#L20 assume !(~p <= 0); 353421#L21 assume !(~q <= 0); 353417#L22 assume ~q > ~p; 353414#L22-1 call #t~ret0 := parts(~p, ~p);< 353415#partsENTRY ~p := #in~p;~q := #in~q; 353587#L20 assume !(~p <= 0); 353586#L21 assume !(~q <= 0); 353585#L22 assume !(~q > ~p); 353581#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353584#partsENTRY ~p := #in~p;~q := #in~q; 353591#L20 assume ~p <= 0;#res := 1; 353588#partsFINAL assume true; 353580#partsEXIT >#63#return; 353577#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353578#partsENTRY ~p := #in~p;~q := #in~q; 353601#L20 assume !(~p <= 0); 353595#L21 assume ~q <= 0;#res := 0; 353593#partsFINAL assume true; 353576#partsEXIT >#65#return; 353574#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353573#partsFINAL assume true; 353413#partsEXIT >#61#return; 353411#L22-2 #res := #t~ret0;havoc #t~ret0; 353409#partsFINAL assume true; 353404#partsEXIT >#63#return; 353392#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353402#partsENTRY ~p := #in~p;~q := #in~q; 353400#L20 assume !(~p <= 0); 353398#L21 assume !(~q <= 0); 353396#L22 assume !(~q > ~p); 353382#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353388#partsENTRY ~p := #in~p;~q := #in~q; 353386#L20 assume !(~p <= 0); 353385#L21 assume !(~q <= 0); 353384#L22 assume !(~q > ~p); 353376#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353378#partsENTRY ~p := #in~p;~q := #in~q; 353606#L20 assume !(~p <= 0); 353604#L21 assume !(~q <= 0); 353600#L22 assume !(~q > ~p); 353394#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353395#partsENTRY ~p := #in~p;~q := #in~q; 353579#L20 assume ~p <= 0;#res := 1; 353575#partsFINAL assume true; 353393#partsEXIT >#63#return; 353390#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 353391#partsENTRY ~p := #in~p;~q := #in~q; 353602#L20 assume !(~p <= 0); 353596#L21 assume ~q <= 0;#res := 0; 353594#partsFINAL assume true; 353389#partsEXIT >#65#return; 353387#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 353381#partsFINAL assume true; 353374#partsEXIT >#63#return; 353377#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354657#partsENTRY ~p := #in~p;~q := #in~q; 354660#L20 assume !(~p <= 0); 354659#L21 assume ~q <= 0;#res := 0; 354658#partsFINAL assume true; 354653#partsEXIT >#65#return; 354652#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354650#partsFINAL assume true; 354648#partsEXIT >#63#return; 354645#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354646#partsENTRY ~p := #in~p;~q := #in~q; 354651#L20 assume !(~p <= 0); 354649#L21 assume ~q <= 0;#res := 0; 354647#partsFINAL assume true; 354644#partsEXIT >#65#return; 354643#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354642#partsFINAL assume true; 354641#partsEXIT >#65#return; 354640#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354639#partsFINAL assume true; 354638#partsEXIT >#65#return; 354637#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret2;havoc #t~ret1; 354636#partsFINAL assume true; 354632#partsEXIT >#63#return; 354591#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 354600#partsENTRY ~p := #in~p;~q := #in~q; 354596#L20 assume !(~p <= 0); 354597#L21 assume !(~q <= 0); 354590#L22 assume !(~q > ~p); 353226#L23 call #t~ret1 := parts(~p - ~q, ~q);< 353225#partsENTRY ~p := #in~p;~q := #in~q; 353227#L20 assume !(~p <= 0); 353264#L21 assume !(~q <= 0); 354667#L22 assume !(~q > ~p); 353192#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354427#partsENTRY ~p := #in~p;~q := #in~q; 354426#L20 assume !(~p <= 0); 354425#L21 assume !(~q <= 0); 354424#L22 assume !(~q > ~p); 353194#L23 [2018-11-23 13:14:08,883 INFO L796 eck$LassoCheckResult]: Loop: 353194#L23 call #t~ret1 := parts(~p - ~q, ~q);< 354427#partsENTRY ~p := #in~p;~q := #in~q; 354426#L20 assume !(~p <= 0); 354425#L21 assume !(~q <= 0); 354424#L22 assume !(~q > ~p); 353194#L23 [2018-11-23 13:14:08,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:08,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1561287550, now seen corresponding path program 20 times [2018-11-23 13:14:08,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:08,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:08,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:08,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:08,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 53038 backedges. 3092 proven. 1135 refuted. 0 times theorem prover too weak. 48811 trivial. 0 not checked. [2018-11-23 13:14:09,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:14:09,328 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:14:09,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:14:09,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:14:09,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:14:09,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:10,023 INFO L134 CoverageAnalysis]: Checked inductivity of 53038 backedges. 15231 proven. 98 refuted. 0 times theorem prover too weak. 37709 trivial. 0 not checked. [2018-11-23 13:14:10,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:14:10,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2018-11-23 13:14:10,039 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 13:14:10,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:10,039 INFO L82 PathProgramCache]: Analyzing trace with hash 85891559, now seen corresponding path program 10 times [2018-11-23 13:14:10,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:14:10,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:14:10,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:10,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:14:10,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:14:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:14:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:14:10,086 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:14:10,086 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:14:10,086 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:14:10,086 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:14:10,086 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 13:14:10,086 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:14:10,086 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:14:10,086 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:14:10,086 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration34_Loop [2018-11-23 13:14:10,086 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:14:10,086 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:14:10,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:14:10,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:14:10,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:14:10,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:14:10,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:14:10,123 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:14:10,123 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 108 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 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:14:10,125 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:14:10,125 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:14:10,127 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:14:10,127 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 109 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 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:14:10,146 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:14:10,147 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:14:10,149 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 13:14:10,149 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 110 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 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:14:10,164 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 13:14:10,165 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a2bd94b-7f88-4b83-ad2a-64a8e70f5a15/bin-2019/uautomizer/z3 Starting monitored process 111 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 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:14:10,185 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 13:14:10,185 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 13:14:17,486 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 13:14:17,488 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 13:14:17,488 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 13:14:17,488 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 13:14:17,488 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 13:14:17,489 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 13:14:17,489 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 13:14:17,489 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 13:14:17,489 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 13:14:17,489 INFO L131 ssoRankerPreferences]: Filename of dumped script: Parts_true-termination_true-no-overflow.c_Iteration34_Loop [2018-11-23 13:14:17,489 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 13:14:17,489 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 13:14:17,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:14:17,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:14:17,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:14:17,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:14:17,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 13:14:17,529 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 13:14:17,529 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 13:14:17,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 13:14:17,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 13:14:17,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 13:14:17,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 13:14:17,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 13:14:17,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 13:14:17,530 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 13:14:17,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 13:14:17,531 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 13:14:17,532 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 13:14:17,533 INFO L444 ModelExtractionUtils]: 2 out of 6 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 13:14:17,533 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 13:14:17,533 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 13:14:17,533 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 13:14:17,533 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~p) = 1*parts_~p Supporting invariants [] [2018-11-23 13:14:17,533 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 13:14:17,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:18,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:18,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:18,221 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:14:18,221 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1536 states and 1618 transitions. cyclomatic complexity: 92 Second operand 7 states. [2018-11-23 13:14:18,265 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1536 states and 1618 transitions. cyclomatic complexity: 92. Second operand 7 states. Result 1541 states and 1623 transitions. Complement of second has 10 states. [2018-11-23 13:14:18,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:14:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:14:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-23 13:14:18,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 1031 letters. Loop has 5 letters. [2018-11-23 13:14:18,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:14:18,266 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:14:18,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:18,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:18,912 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:18,943 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:14:18,943 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1536 states and 1618 transitions. cyclomatic complexity: 92 Second operand 7 states. [2018-11-23 13:14:18,984 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1536 states and 1618 transitions. cyclomatic complexity: 92. Second operand 7 states. Result 1541 states and 1623 transitions. Complement of second has 10 states. [2018-11-23 13:14:18,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 13:14:18,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:14:18,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2018-11-23 13:14:18,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 23 transitions. Stem has 1031 letters. Loop has 5 letters. [2018-11-23 13:14:18,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:14:18,985 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 13:14:18,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:14:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:19,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:14:19,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:14:19,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:14:19,628 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-23 13:14:19,628 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1536 states and 1618 transitions. cyclomatic complexity: 92 Second operand 7 states. [2018-11-23 13:14:19,694 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1536 states and 1618 transitions. cyclomatic complexity: 92. Second operand 7 states. Result 2015 states and 2132 transitions. Complement of second has 40 states. [2018-11-23 13:14:19,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-23 13:14:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:14:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2018-11-23 13:14:19,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 1031 letters. Loop has 5 letters. [2018-11-23 13:14:19,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:14:19,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 1036 letters. Loop has 5 letters. [2018-11-23 13:14:19,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:14:19,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 1031 letters. Loop has 10 letters. [2018-11-23 13:14:19,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 13:14:19,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2015 states and 2132 transitions. [2018-11-23 13:14:19,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 29 [2018-11-23 13:14:19,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2015 states to 1538 states and 1621 transitions. [2018-11-23 13:14:19,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 282 [2018-11-23 13:14:19,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 316 [2018-11-23 13:14:19,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1538 states and 1621 transitions. [2018-11-23 13:14:19,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 13:14:19,704 INFO L705 BuchiCegarLoop]: Abstraction has 1538 states and 1621 transitions. [2018-11-23 13:14:19,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states and 1621 transitions. [2018-11-23 13:14:19,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1536. [2018-11-23 13:14:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1536 states. [2018-11-23 13:14:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 1618 transitions. [2018-11-23 13:14:19,714 INFO L728 BuchiCegarLoop]: Abstraction has 1536 states and 1618 transitions. [2018-11-23 13:14:19,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 13:14:19,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=829, Unknown=0, NotChecked=0, Total=930 [2018-11-23 13:14:19,715 INFO L87 Difference]: Start difference. First operand 1536 states and 1618 transitions. Second operand 31 states. [2018-11-23 13:14:20,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:14:20,869 INFO L93 Difference]: Finished difference Result 1306 states and 1346 transitions. [2018-11-23 13:14:20,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 13:14:20,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1306 states and 1346 transitions. [2018-11-23 13:14:20,872 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:14:20,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1306 states to 0 states and 0 transitions. [2018-11-23 13:14:20,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 13:14:20,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 13:14:20,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 13:14:20,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:14:20,872 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:14:20,872 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:14:20,872 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:14:20,873 INFO L442 BuchiCegarLoop]: ======== Iteration 35============ [2018-11-23 13:14:20,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:14:20,873 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 13:14:20,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 13:14:20,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:14:20 BoogieIcfgContainer [2018-11-23 13:14:20,878 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 13:14:20,878 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:14:20,878 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:14:20,878 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:14:20,879 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:12:09" (3/4) ... [2018-11-23 13:14:20,882 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:14:20,882 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:14:20,883 INFO L168 Benchmark]: Toolchain (without parser) took 132113.66 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.5 GB). Free memory was 958.2 MB in the beginning and 1.6 GB in the end (delta: -666.5 MB). Peak memory consumption was 840.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:14:20,883 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:14:20,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.18 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:14:20,885 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.86 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:14:20,885 INFO L168 Benchmark]: Boogie Preprocessor took 11.90 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:14:20,885 INFO L168 Benchmark]: RCFGBuilder took 181.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:14:20,886 INFO L168 Benchmark]: BuchiAutomizer took 131741.31 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -502.6 MB). Peak memory consumption was 868.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:14:20,886 INFO L168 Benchmark]: Witness Printer took 3.86 ms. Allocated memory is still 2.5 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:14:20,890 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.18 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.86 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.90 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 181.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 131741.31 ms. Allocated memory was 1.2 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -502.6 MB). Peak memory consumption was 868.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.86 ms. Allocated memory is still 2.5 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 53 terminating modules (32 trivial, 10 deterministic, 11 nondeterministic). One deterministic module has affine ranking function -1 * p and consists of 4 locations. One deterministic module has affine ranking function -2 * p + 1 and consists of 8 locations. One deterministic module has affine ranking function -2 * q + 1 and consists of 7 locations. One deterministic module has affine ranking function -1 * q + x and consists of 6 locations. One deterministic module has affine ranking function \old(p) and consists of 8 locations. One deterministic module has affine ranking function \old(p) and consists of 8 locations. One deterministic module has affine ranking function \old(q) and consists of 9 locations. One deterministic module has affine ranking function -2 * p + 1 and consists of 12 locations. One deterministic module has affine ranking function -2 * p + 3 and consists of 14 locations. One deterministic module has affine ranking function -2 * p + 5 and consists of 17 locations. One nondeterministic module has affine ranking function -1 * q + x and consists of 6 locations. One nondeterministic module has affine ranking function p and consists of 7 locations. One nondeterministic module has affine ranking function q and consists of 7 locations. One nondeterministic module has affine ranking function p and consists of 12 locations. One nondeterministic module has affine ranking function p and consists of 7 locations. One nondeterministic module has affine ranking function p and consists of 7 locations. One nondeterministic module has affine ranking function p and consists of 7 locations. One nondeterministic module has affine ranking function p and consists of 7 locations. One nondeterministic module has affine ranking function p and consists of 7 locations. One nondeterministic module has affine ranking function p and consists of 7 locations. One nondeterministic module has affine ranking function p and consists of 7 locations. 32 modules have a trivial ranking function, the largest among these consists of 32 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 131.7s and 35 iterations. TraceHistogramMax:143. Analysis of lassos took 99.2s. Construction of modules took 8.9s. Büchi inclusion checks took 20.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 50. Automata minimization 1.3s AutomataMinimizationTime, 52 MinimizatonAttempts, 11535 StatesRemovedByMinimization, 51 NontrivialMinimizations. Non-live state removal took 1.0s Buchi closure took 0.0s. Biggest automaton had 5021 states and ocurred in iteration 31. Nontrivial modules had stage [10, 0, 10, 1, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 6473/7667 HoareTripleCheckerStatistics: 2104 SDtfs, 4172 SDslu, 6996 SDs, 0 SdLazy, 19416 SolverSat, 3628 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time LassoAnalysisResults: nont0 unkn0 SFLI10 SFLT2 conc0 concLT7 SILN0 SILU0 SILI3 SILT12 lasso0 LassoPreprocessingBenchmarks: Lassos: inital24 mio100 ax100 hnf93 lsp87 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq163 hnf92 smp100 dnf100 smp100 tf107 neg100 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 40 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 18 LassoNonterminationAnalysisUnknown: 3 LassoNonterminationAnalysisTime: 81.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...