./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-numeric/Parts.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-numeric/Parts.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 663a2474dc11f7b5d0aa9a3ae9bbf5de1ab8d2ea5a060185a0446a8356edf6f1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 01:29:23,528 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 01:29:23,530 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 01:29:23,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 01:29:23,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 01:29:23,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 01:29:23,566 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 01:29:23,568 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 01:29:23,570 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 01:29:23,573 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 01:29:23,574 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 01:29:23,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 01:29:23,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 01:29:23,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 01:29:23,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 01:29:23,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 01:29:23,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 01:29:23,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 01:29:23,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 01:29:23,589 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 01:29:23,590 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 01:29:23,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 01:29:23,592 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 01:29:23,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 01:29:23,593 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 01:29:23,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 01:29:23,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 01:29:23,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 01:29:23,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 01:29:23,608 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 01:29:23,609 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 01:29:23,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 01:29:23,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 01:29:23,611 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 01:29:23,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 01:29:23,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 01:29:23,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 01:29:23,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 01:29:23,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 01:29:23,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 01:29:23,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 01:29:23,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 01:29:23,619 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-22 01:29:23,644 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 01:29:23,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 01:29:23,644 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 01:29:23,644 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 01:29:23,645 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 01:29:23,645 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 01:29:23,646 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 01:29:23,646 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 01:29:23,646 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 01:29:23,646 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 01:29:23,647 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 01:29:23,647 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 01:29:23,647 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 01:29:23,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 01:29:23,647 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 01:29:23,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 01:29:23,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 01:29:23,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 01:29:23,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 01:29:23,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 01:29:23,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 01:29:23,648 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 01:29:23,648 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 01:29:23,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 01:29:23,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 01:29:23,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 01:29:23,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 01:29:23,649 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 01:29:23,651 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 01:29:23,651 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 663a2474dc11f7b5d0aa9a3ae9bbf5de1ab8d2ea5a060185a0446a8356edf6f1 [2022-07-22 01:29:23,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 01:29:23,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 01:29:23,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 01:29:23,959 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 01:29:23,960 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 01:29:23,961 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Parts.c [2022-07-22 01:29:24,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e0c365de/f647dd46c1424e2fa6c63c6ed15c30f4/FLAG9e0778f4a [2022-07-22 01:29:24,342 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 01:29:24,343 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Parts.c [2022-07-22 01:29:24,346 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e0c365de/f647dd46c1424e2fa6c63c6ed15c30f4/FLAG9e0778f4a [2022-07-22 01:29:24,360 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e0c365de/f647dd46c1424e2fa6c63c6ed15c30f4 [2022-07-22 01:29:24,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 01:29:24,363 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 01:29:24,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 01:29:24,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 01:29:24,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 01:29:24,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:29:24" (1/1) ... [2022-07-22 01:29:24,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62aa516e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:29:24, skipping insertion in model container [2022-07-22 01:29:24,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:29:24" (1/1) ... [2022-07-22 01:29:24,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 01:29:24,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 01:29:24,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:29:24,493 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 01:29:24,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:29:24,520 INFO L208 MainTranslator]: Completed translation [2022-07-22 01:29:24,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:29:24 WrapperNode [2022-07-22 01:29:24,520 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 01:29:24,521 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 01:29:24,521 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 01:29:24,521 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 01:29:24,526 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:29:24" (1/1) ... [2022-07-22 01:29:24,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:29:24" (1/1) ... [2022-07-22 01:29:24,554 INFO L137 Inliner]: procedures = 5, calls = 6, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 32 [2022-07-22 01:29:24,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 01:29:24,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 01:29:24,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 01:29:24,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 01:29:24,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:29:24" (1/1) ... [2022-07-22 01:29:24,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:29:24" (1/1) ... [2022-07-22 01:29:24,562 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:29:24" (1/1) ... [2022-07-22 01:29:24,562 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:29:24" (1/1) ... [2022-07-22 01:29:24,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:29:24" (1/1) ... [2022-07-22 01:29:24,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:29:24" (1/1) ... [2022-07-22 01:29:24,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:29:24" (1/1) ... [2022-07-22 01:29:24,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 01:29:24,574 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 01:29:24,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 01:29:24,575 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 01:29:24,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:29:24" (1/1) ... [2022-07-22 01:29:24,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:24,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:24,629 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:24,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 01:29:24,662 INFO L130 BoogieDeclarations]: Found specification of procedure parts [2022-07-22 01:29:24,662 INFO L138 BoogieDeclarations]: Found implementation of procedure parts [2022-07-22 01:29:24,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 01:29:24,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 01:29:24,707 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 01:29:24,708 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 01:29:24,781 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 01:29:24,785 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 01:29:24,785 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-22 01:29:24,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:29:24 BoogieIcfgContainer [2022-07-22 01:29:24,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 01:29:24,787 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 01:29:24,787 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 01:29:24,789 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 01:29:24,789 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:29:24,790 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 01:29:24" (1/3) ... [2022-07-22 01:29:24,790 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b317b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:29:24, skipping insertion in model container [2022-07-22 01:29:24,790 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:29:24,790 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:29:24" (2/3) ... [2022-07-22 01:29:24,791 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b317b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:29:24, skipping insertion in model container [2022-07-22 01:29:24,791 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:29:24,791 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:29:24" (3/3) ... [2022-07-22 01:29:24,792 INFO L354 chiAutomizerObserver]: Analyzing ICFG Parts.c [2022-07-22 01:29:24,823 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 01:29:24,823 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 01:29:24,823 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 01:29:24,823 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 01:29:24,824 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 01:29:24,824 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 01:29:24,824 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 01:29:24,824 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 01:29:24,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-22 01:29:24,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-07-22 01:29:24,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:24,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:24,842 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 01:29:24,842 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:29:24,843 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 01:29:24,843 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-22 01:29:24,845 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-07-22 01:29:24,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:24,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:24,846 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 01:29:24,846 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:29:24,850 INFO L752 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 18#L28true assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 8#L31true assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 25#L34-3true [2022-07-22 01:29:24,852 INFO L754 eck$LassoCheckResult]: Loop: 25#L34-3true assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 13#L35-3true assume !true; 12#L34-2true main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 25#L34-3true [2022-07-22 01:29:24,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:24,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 1 times [2022-07-22 01:29:24,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:24,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152047817] [2022-07-22 01:29:24,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:24,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:24,934 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:24,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:24,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:24,948 INFO L85 PathProgramCache]: Analyzing trace with hash 68968, now seen corresponding path program 1 times [2022-07-22 01:29:24,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:24,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486213124] [2022-07-22 01:29:24,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:24,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:24,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:29:24,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486213124] [2022-07-22 01:29:24,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486213124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:29:24,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:29:24,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 01:29:24,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684537673] [2022-07-22 01:29:24,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:29:24,982 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:29:24,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:29:25,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 01:29:25,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 01:29:25,008 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:29:25,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:29:25,015 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2022-07-22 01:29:25,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 01:29:25,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 33 transitions. [2022-07-22 01:29:25,026 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-07-22 01:29:25,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 21 states and 28 transitions. [2022-07-22 01:29:25,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-22 01:29:25,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-22 01:29:25,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2022-07-22 01:29:25,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:29:25,035 INFO L369 hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-07-22 01:29:25,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2022-07-22 01:29:25,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-22 01:29:25,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 15 states have internal predecessors, (20), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-22 01:29:25,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 28 transitions. [2022-07-22 01:29:25,061 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-07-22 01:29:25,061 INFO L374 stractBuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2022-07-22 01:29:25,061 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 01:29:25,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 28 transitions. [2022-07-22 01:29:25,063 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-07-22 01:29:25,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:25,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:25,064 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 01:29:25,065 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 01:29:25,065 INFO L752 eck$LassoCheckResult]: Stem: 66#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 67#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 70#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 68#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 69#L34-3 [2022-07-22 01:29:25,065 INFO L754 eck$LassoCheckResult]: Loop: 69#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 72#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 71#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 69#L34-3 [2022-07-22 01:29:25,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:25,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 2 times [2022-07-22 01:29:25,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:25,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883850953] [2022-07-22 01:29:25,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:25,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:25,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:25,083 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:25,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:25,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:25,097 INFO L85 PathProgramCache]: Analyzing trace with hash 68720, now seen corresponding path program 1 times [2022-07-22 01:29:25,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:25,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773927406] [2022-07-22 01:29:25,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:25,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:25,110 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:25,117 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:25,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:25,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2051697257, now seen corresponding path program 1 times [2022-07-22 01:29:25,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:25,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563633891] [2022-07-22 01:29:25,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:25,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:25,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:25,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:29:25,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563633891] [2022-07-22 01:29:25,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563633891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:29:25,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:29:25,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 01:29:25,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921236878] [2022-07-22 01:29:25,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:29:25,229 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:25,230 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:25,230 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:25,230 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:25,230 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:29:25,230 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:25,230 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:25,230 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:25,231 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2022-07-22 01:29:25,231 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:25,231 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:25,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:25,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:25,292 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:25,292 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:29:25,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:25,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:25,302 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:25,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:25,306 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:25,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 01:29:25,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-22 01:29:25,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:25,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:25,346 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:25,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 01:29:25,360 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:29:25,360 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:25,518 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:29:25,522 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-22 01:29:25,522 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:25,522 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:25,522 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:25,522 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:25,523 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:29:25,523 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:25,523 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:25,523 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:25,523 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration2_Loop [2022-07-22 01:29:25,523 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:25,523 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:25,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:25,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:25,562 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:25,565 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:29:25,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:25,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:25,567 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:25,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:25,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 01:29:25,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:25,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:25,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:25,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:25,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:25,592 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:25,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:25,602 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:29:25,608 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2022-07-22 01:29:25,608 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-07-22 01:29:25,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:25,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:25,621 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:25,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 01:29:25,626 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:29:25,626 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 01:29:25,627 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:29:25,627 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -1*ULTIMATE.start_main_~p~0#1 Supporting invariants [] [2022-07-22 01:29:25,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:25,661 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 01:29:25,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:25,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-22 01:29:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:25,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:29:25,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:25,718 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:29:25,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:25,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:25,760 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 [2022-07-22 01:29:25,761 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:29:25,798 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 28 transitions. cyclomatic complexity: 9. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 39 transitions. Complement of second has 7 states. [2022-07-22 01:29:25,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-22 01:29:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:29:25,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2022-07-22 01:29:25,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 3 letters. [2022-07-22 01:29:25,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:25,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 7 letters. Loop has 3 letters. [2022-07-22 01:29:25,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:25,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 4 letters. Loop has 6 letters. [2022-07-22 01:29:25,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:25,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 39 transitions. [2022-07-22 01:29:25,803 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2022-07-22 01:29:25,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 37 transitions. [2022-07-22 01:29:25,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-07-22 01:29:25,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-22 01:29:25,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2022-07-22 01:29:25,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:25,806 INFO L369 hiAutomatonCegarLoop]: Abstraction has 27 states and 37 transitions. [2022-07-22 01:29:25,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2022-07-22 01:29:25,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-07-22 01:29:25,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-22 01:29:25,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2022-07-22 01:29:25,808 INFO L392 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-07-22 01:29:25,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:29:25,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 01:29:25,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 01:29:25,809 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:29:25,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:29:25,830 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-07-22 01:29:25,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 01:29:25,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 32 transitions. [2022-07-22 01:29:25,831 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-07-22 01:29:25,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 24 states and 31 transitions. [2022-07-22 01:29:25,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-07-22 01:29:25,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-22 01:29:25,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 31 transitions. [2022-07-22 01:29:25,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:29:25,833 INFO L369 hiAutomatonCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-07-22 01:29:25,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 31 transitions. [2022-07-22 01:29:25,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-07-22 01:29:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-22 01:29:25,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2022-07-22 01:29:25,838 INFO L392 hiAutomatonCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-07-22 01:29:25,838 INFO L374 stractBuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-07-22 01:29:25,838 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 01:29:25,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2022-07-22 01:29:25,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-07-22 01:29:25,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:25,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:25,839 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 01:29:25,840 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:25,840 INFO L752 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 219#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 222#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 220#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 221#L34-3 [2022-07-22 01:29:25,840 INFO L754 eck$LassoCheckResult]: Loop: 221#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 225#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 209#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 216#partsENTRY ~p := #in~p;~q := #in~q; 217#L20 assume ~p <= 0;#res := 1; 227#partsFINAL assume true; 208#partsEXIT >#68#return; 214#L36-1 havoc main_#t~ret8#1; 228#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 229#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 223#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 221#L34-3 [2022-07-22 01:29:25,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:25,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1510568, now seen corresponding path program 3 times [2022-07-22 01:29:25,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:25,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004924697] [2022-07-22 01:29:25,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:25,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:25,848 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:25,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:25,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:25,854 INFO L85 PathProgramCache]: Analyzing trace with hash 523036987, now seen corresponding path program 1 times [2022-07-22 01:29:25,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:25,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670225683] [2022-07-22 01:29:25,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:25,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:25,864 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:25,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:25,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:25,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:25,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1398357556, now seen corresponding path program 1 times [2022-07-22 01:29:25,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:25,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800847006] [2022-07-22 01:29:25,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:25,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:25,880 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:25,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:25,976 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:25,976 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:25,976 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:25,976 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:25,976 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:29:25,976 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:25,976 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:25,976 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:25,977 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration3_Loop [2022-07-22 01:29:25,977 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:25,977 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:25,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:25,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:25,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:25,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:26,015 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:26,015 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:29:26,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:26,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:26,032 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:26,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 01:29:26,036 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:26,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:26,052 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:26,052 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post6#1=0} Honda state: {ULTIMATE.start_main_#t~post6#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:26,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:26,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:26,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:26,072 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:26,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 01:29:26,077 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:26,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:26,086 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:26,087 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret8#1=0} Honda state: {ULTIMATE.start_main_#t~ret8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:26,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:26,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:26,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:26,106 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:26,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 01:29:26,108 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:26,108 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:26,129 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:26,129 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:26,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:26,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:26,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:26,147 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:26,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 01:29:26,149 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:26,149 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:26,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:26,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:26,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:26,208 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:26,242 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:29:26,242 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:26,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 01:29:26,403 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:29:26,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:26,412 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:26,412 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:26,412 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:26,412 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:26,412 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:29:26,412 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:26,412 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:26,412 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:26,412 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration3_Loop [2022-07-22 01:29:26,412 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:26,412 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:26,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:26,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:26,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:26,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:26,494 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:26,495 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:29:26,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:26,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:26,516 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:26,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:26,533 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:26,534 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:26,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:26,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:26,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:26,535 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:26,536 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:26,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 01:29:26,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:29:26,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:26,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:26,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:26,568 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:26,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 01:29:26,572 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:26,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:26,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:26,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:26,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:26,578 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:26,578 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:26,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:26,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:29:26,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:26,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:26,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:26,610 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:26,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 01:29:26,612 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:26,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:26,626 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:26,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:26,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:26,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:26,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:26,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:26,648 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:29:26,666 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-22 01:29:26,666 INFO L444 ModelExtractionUtils]: 1 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 01:29:26,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:26,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:26,679 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:26,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 01:29:26,681 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:29:26,681 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 01:29:26,681 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:29:26,682 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 1 Supporting invariants [] [2022-07-22 01:29:26,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:26,698 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 01:29:26,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:26,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:29:26,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:26,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:29:26,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:26,848 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 [2022-07-22 01:29:26,849 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 9 Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 01:29:26,989 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 9. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 143 states and 212 transitions. Complement of second has 28 states. [2022-07-22 01:29:26,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2022-07-22 01:29:26,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 01:29:26,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-07-22 01:29:26,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 59 transitions. Stem has 4 letters. Loop has 11 letters. [2022-07-22 01:29:26,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:26,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 59 transitions. Stem has 15 letters. Loop has 11 letters. [2022-07-22 01:29:26,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:26,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 59 transitions. Stem has 4 letters. Loop has 22 letters. [2022-07-22 01:29:26,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:26,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 212 transitions. [2022-07-22 01:29:26,996 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2022-07-22 01:29:26,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 142 states and 211 transitions. [2022-07-22 01:29:26,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 72 [2022-07-22 01:29:26,999 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2022-07-22 01:29:26,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 142 states and 211 transitions. [2022-07-22 01:29:26,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:27,000 INFO L369 hiAutomatonCegarLoop]: Abstraction has 142 states and 211 transitions. [2022-07-22 01:29:27,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states and 211 transitions. [2022-07-22 01:29:27,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 133. [2022-07-22 01:29:27,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 88 states have internal predecessors, (122), 28 states have call successors, (28), 8 states have call predecessors, (28), 12 states have return successors, (48), 36 states have call predecessors, (48), 28 states have call successors, (48) [2022-07-22 01:29:27,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 198 transitions. [2022-07-22 01:29:27,010 INFO L392 hiAutomatonCegarLoop]: Abstraction has 133 states and 198 transitions. [2022-07-22 01:29:27,010 INFO L374 stractBuchiCegarLoop]: Abstraction has 133 states and 198 transitions. [2022-07-22 01:29:27,010 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 01:29:27,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 133 states and 198 transitions. [2022-07-22 01:29:27,012 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2022-07-22 01:29:27,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:27,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:27,013 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 01:29:27,013 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:27,013 INFO L752 eck$LassoCheckResult]: Stem: 501#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 502#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 508#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 506#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 507#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 535#L35-3 [2022-07-22 01:29:27,013 INFO L754 eck$LassoCheckResult]: Loop: 535#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 537#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 542#partsENTRY ~p := #in~p;~q := #in~q; 555#L20 assume !(~p <= 0); 547#L21 assume ~q <= 0;#res := 0; 544#partsFINAL assume true; 541#partsEXIT >#68#return; 539#L36-1 havoc main_#t~ret8#1; 538#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 536#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 512#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 513#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 535#L35-3 [2022-07-22 01:29:27,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:27,014 INFO L85 PathProgramCache]: Analyzing trace with hash 46827647, now seen corresponding path program 1 times [2022-07-22 01:29:27,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:27,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506369694] [2022-07-22 01:29:27,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:27,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:27,017 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:27,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:27,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:27,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1489423173, now seen corresponding path program 1 times [2022-07-22 01:29:27,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:27,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374784148] [2022-07-22 01:29:27,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:27,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:27,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 01:29:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:27,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:27,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:29:27,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374784148] [2022-07-22 01:29:27,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374784148] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:29:27,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:29:27,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-22 01:29:27,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555719254] [2022-07-22 01:29:27,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:29:27,081 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:29:27,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:29:27,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 01:29:27,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-22 01:29:27,081 INFO L87 Difference]: Start difference. First operand 133 states and 198 transitions. cyclomatic complexity: 70 Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 9 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 01:29:27,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:27,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:29:27,292 INFO L93 Difference]: Finished difference Result 251 states and 420 transitions. [2022-07-22 01:29:27,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 01:29:27,293 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 251 states and 420 transitions. [2022-07-22 01:29:27,297 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 36 [2022-07-22 01:29:27,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 251 states to 245 states and 414 transitions. [2022-07-22 01:29:27,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 124 [2022-07-22 01:29:27,302 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-07-22 01:29:27,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 414 transitions. [2022-07-22 01:29:27,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:27,302 INFO L369 hiAutomatonCegarLoop]: Abstraction has 245 states and 414 transitions. [2022-07-22 01:29:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 414 transitions. [2022-07-22 01:29:27,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 214. [2022-07-22 01:29:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 144 states have (on average 1.2569444444444444) internal successors, (181), 144 states have internal predecessors, (181), 40 states have call successors, (40), 12 states have call predecessors, (40), 30 states have return successors, (146), 57 states have call predecessors, (146), 40 states have call successors, (146) [2022-07-22 01:29:27,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 367 transitions. [2022-07-22 01:29:27,318 INFO L392 hiAutomatonCegarLoop]: Abstraction has 214 states and 367 transitions. [2022-07-22 01:29:27,318 INFO L374 stractBuchiCegarLoop]: Abstraction has 214 states and 367 transitions. [2022-07-22 01:29:27,318 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 01:29:27,318 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 214 states and 367 transitions. [2022-07-22 01:29:27,320 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 26 [2022-07-22 01:29:27,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:27,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:27,321 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 01:29:27,321 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:27,321 INFO L752 eck$LassoCheckResult]: Stem: 897#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 898#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 904#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 902#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 903#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 940#L35-3 [2022-07-22 01:29:27,321 INFO L754 eck$LassoCheckResult]: Loop: 940#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 926#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 947#partsENTRY ~p := #in~p;~q := #in~q; 988#L20 assume !(~p <= 0); 984#L21 assume ~q <= 0;#res := 0; 985#partsFINAL assume true; 1088#partsEXIT >#68#return; 1011#L36-1 havoc main_#t~ret8#1; 1007#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 940#L35-3 [2022-07-22 01:29:27,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:27,322 INFO L85 PathProgramCache]: Analyzing trace with hash 46827647, now seen corresponding path program 2 times [2022-07-22 01:29:27,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:27,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097216473] [2022-07-22 01:29:27,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:27,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:27,325 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:27,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:27,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:27,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1678232514, now seen corresponding path program 1 times [2022-07-22 01:29:27,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:27,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067245428] [2022-07-22 01:29:27,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:27,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:27,331 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:27,334 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:27,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:27,335 INFO L85 PathProgramCache]: Analyzing trace with hash 616296708, now seen corresponding path program 1 times [2022-07-22 01:29:27,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:27,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587251510] [2022-07-22 01:29:27,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:27,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:27,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 01:29:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:27,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:27,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:29:27,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587251510] [2022-07-22 01:29:27,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587251510] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:29:27,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:29:27,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 01:29:27,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483810139] [2022-07-22 01:29:27,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:29:27,420 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:27,421 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:27,421 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:27,421 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:27,421 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:29:27,421 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:27,421 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:27,421 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:27,421 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2022-07-22 01:29:27,421 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:27,422 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:27,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:27,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:27,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:27,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:27,450 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:27,450 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:29:27,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:27,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:27,452 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:27,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 01:29:27,454 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:27,454 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:27,471 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:27,471 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~p~0#1=1} Honda state: {ULTIMATE.start_main_~p~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:27,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:27,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:27,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:27,488 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:27,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 01:29:27,490 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:27,490 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:27,497 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:27,497 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:27,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:27,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:27,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:27,515 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:27,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 01:29:27,516 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:27,516 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:27,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:27,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:27,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:27,543 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:27,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-22 01:29:27,545 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:29:27,545 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:27,577 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:29:27,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:27,580 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:27,580 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:27,580 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:27,580 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:27,580 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:29:27,580 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:27,581 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:27,581 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:27,581 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration5_Loop [2022-07-22 01:29:27,581 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:27,581 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:27,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:27,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:27,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:27,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:27,649 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:27,649 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:29:27,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:27,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:27,651 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:27,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-22 01:29:27,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:27,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:27,659 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:27,659 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:27,659 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:27,659 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:27,660 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:27,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:27,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:29:27,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:27,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:27,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:27,691 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:27,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-22 01:29:27,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:27,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:27,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:27,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:27,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:27,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:27,700 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:27,700 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:27,703 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:29:27,724 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 01:29:27,724 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 01:29:27,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:27,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:27,740 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:27,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-22 01:29:27,741 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:29:27,741 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 01:29:27,741 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:29:27,742 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0#1) = -2*ULTIMATE.start_main_~q~0#1 + 1 Supporting invariants [] [2022-07-22 01:29:27,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-07-22 01:29:27,758 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 01:29:27,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:27,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 01:29:27,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:27,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:29:27,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:27,854 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 [2022-07-22 01:29:27,854 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 214 states and 367 transitions. cyclomatic complexity: 158 Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 01:29:27,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:27,983 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 214 states and 367 transitions. cyclomatic complexity: 158. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 887 states and 1628 transitions. Complement of second has 25 states. [2022-07-22 01:29:27,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2022-07-22 01:29:27,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 01:29:27,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-07-22 01:29:27,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 5 letters. Loop has 9 letters. [2022-07-22 01:29:27,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:27,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 14 letters. Loop has 9 letters. [2022-07-22 01:29:27,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:27,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 39 transitions. Stem has 5 letters. Loop has 18 letters. [2022-07-22 01:29:27,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:27,986 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 887 states and 1628 transitions. [2022-07-22 01:29:27,996 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 58 [2022-07-22 01:29:28,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 887 states to 830 states and 1524 transitions. [2022-07-22 01:29:28,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2022-07-22 01:29:28,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 247 [2022-07-22 01:29:28,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 830 states and 1524 transitions. [2022-07-22 01:29:28,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:28,014 INFO L369 hiAutomatonCegarLoop]: Abstraction has 830 states and 1524 transitions. [2022-07-22 01:29:28,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states and 1524 transitions. [2022-07-22 01:29:28,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 758. [2022-07-22 01:29:28,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 490 states have (on average 1.2387755102040816) internal successors, (607), 491 states have internal predecessors, (607), 154 states have call successors, (154), 43 states have call predecessors, (154), 114 states have return successors, (650), 223 states have call predecessors, (650), 151 states have call successors, (650) [2022-07-22 01:29:28,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1411 transitions. [2022-07-22 01:29:28,066 INFO L392 hiAutomatonCegarLoop]: Abstraction has 758 states and 1411 transitions. [2022-07-22 01:29:28,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:29:28,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 01:29:28,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 01:29:28,066 INFO L87 Difference]: Start difference. First operand 758 states and 1411 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 01:29:28,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:29:28,121 INFO L93 Difference]: Finished difference Result 649 states and 994 transitions. [2022-07-22 01:29:28,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 01:29:28,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 649 states and 994 transitions. [2022-07-22 01:29:28,129 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 55 [2022-07-22 01:29:28,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 649 states to 312 states and 455 transitions. [2022-07-22 01:29:28,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 197 [2022-07-22 01:29:28,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 197 [2022-07-22 01:29:28,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 312 states and 455 transitions. [2022-07-22 01:29:28,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:28,135 INFO L369 hiAutomatonCegarLoop]: Abstraction has 312 states and 455 transitions. [2022-07-22 01:29:28,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states and 455 transitions. [2022-07-22 01:29:28,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 298. [2022-07-22 01:29:28,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 197 states have (on average 1.2385786802030456) internal successors, (244), 200 states have internal predecessors, (244), 69 states have call successors, (69), 27 states have call predecessors, (69), 32 states have return successors, (128), 70 states have call predecessors, (128), 61 states have call successors, (128) [2022-07-22 01:29:28,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 441 transitions. [2022-07-22 01:29:28,145 INFO L392 hiAutomatonCegarLoop]: Abstraction has 298 states and 441 transitions. [2022-07-22 01:29:28,145 INFO L374 stractBuchiCegarLoop]: Abstraction has 298 states and 441 transitions. [2022-07-22 01:29:28,145 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 01:29:28,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 298 states and 441 transitions. [2022-07-22 01:29:28,148 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 55 [2022-07-22 01:29:28,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:28,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:28,149 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:28,149 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:28,149 INFO L752 eck$LassoCheckResult]: Stem: 3504#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3505#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 3514#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 3511#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 3512#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 3550#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 3492#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 3513#partsENTRY ~p := #in~p;~q := #in~q; 3762#L20 assume ~p <= 0;#res := 1; 3763#partsFINAL assume true; 3491#partsEXIT >#68#return; 3493#L36-1 [2022-07-22 01:29:28,149 INFO L754 eck$LassoCheckResult]: Loop: 3493#L36-1 havoc main_#t~ret8#1; 3541#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 3528#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 3507#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 3756#partsENTRY ~p := #in~p;~q := #in~q; 3754#L20 assume ~p <= 0;#res := 1; 3755#partsFINAL assume true; 3788#partsEXIT >#68#return; 3493#L36-1 [2022-07-22 01:29:28,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:28,149 INFO L85 PathProgramCache]: Analyzing trace with hash 618653416, now seen corresponding path program 1 times [2022-07-22 01:29:28,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:28,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618429265] [2022-07-22 01:29:28,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:28,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:28,156 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:28,160 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:28,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:28,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1411370316, now seen corresponding path program 1 times [2022-07-22 01:29:28,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:28,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417205453] [2022-07-22 01:29:28,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:28,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:28,182 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:28,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:28,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:28,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:28,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1870257459, now seen corresponding path program 1 times [2022-07-22 01:29:28,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:28,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867258352] [2022-07-22 01:29:28,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:28,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:28,202 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:28,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:28,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:28,271 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:28,271 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:28,271 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:28,271 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:28,271 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:29:28,271 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:28,272 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:28,272 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:28,272 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2022-07-22 01:29:28,272 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:28,272 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:28,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:28,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:28,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:28,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:28,298 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:28,298 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:29:28,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:28,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:28,300 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:28,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-22 01:29:28,302 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:28,302 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:28,323 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:28,323 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret8#1=1} Honda state: {ULTIMATE.start_main_#t~ret8#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:28,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:28,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:28,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:28,349 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:28,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-22 01:29:28,350 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:28,350 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:28,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:28,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:28,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:28,391 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:28,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-22 01:29:28,421 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:29:28,421 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:28,661 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:29:28,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:28,668 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:28,668 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:28,668 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:28,668 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:28,668 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:29:28,668 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:28,668 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:28,669 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:28,669 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration6_Loop [2022-07-22 01:29:28,669 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:28,669 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:28,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:28,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:28,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:28,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:28,729 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:28,729 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:29:28,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:28,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:28,744 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:28,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-22 01:29:28,768 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:28,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:28,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:28,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:28,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:28,774 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:28,775 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:28,775 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:28,798 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:29:28,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:28,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:28,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:28,817 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:28,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-22 01:29:28,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:28,824 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:28,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:28,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:28,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:28,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:28,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:28,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:28,840 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:29:28,843 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 01:29:28,843 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 01:29:28,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:28,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:28,844 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:28,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-22 01:29:28,846 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:29:28,846 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 01:29:28,846 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:29:28,846 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0#1, ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~q~0#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2022-07-22 01:29:28,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:28,865 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 01:29:28,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:28,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:29:28,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:28,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:29:28,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:28,992 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 [2022-07-22 01:29:28,992 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 298 states and 441 transitions. cyclomatic complexity: 151 Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 01:29:29,059 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 298 states and 441 transitions. cyclomatic complexity: 151. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Result 441 states and 656 transitions. Complement of second has 13 states. [2022-07-22 01:29:29,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 01:29:29,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 01:29:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-07-22 01:29:29,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 11 letters. Loop has 8 letters. [2022-07-22 01:29:29,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:29,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 19 letters. Loop has 8 letters. [2022-07-22 01:29:29,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:29,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 48 transitions. Stem has 11 letters. Loop has 16 letters. [2022-07-22 01:29:29,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:29,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 441 states and 656 transitions. [2022-07-22 01:29:29,074 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 74 [2022-07-22 01:29:29,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 441 states to 356 states and 523 transitions. [2022-07-22 01:29:29,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 225 [2022-07-22 01:29:29,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 226 [2022-07-22 01:29:29,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 356 states and 523 transitions. [2022-07-22 01:29:29,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:29,081 INFO L369 hiAutomatonCegarLoop]: Abstraction has 356 states and 523 transitions. [2022-07-22 01:29:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states and 523 transitions. [2022-07-22 01:29:29,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2022-07-22 01:29:29,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 234 states have (on average 1.2179487179487178) internal successors, (285), 234 states have internal predecessors, (285), 81 states have call successors, (83), 34 states have call predecessors, (83), 39 states have return successors, (152), 85 states have call predecessors, (152), 71 states have call successors, (152) [2022-07-22 01:29:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 520 transitions. [2022-07-22 01:29:29,094 INFO L392 hiAutomatonCegarLoop]: Abstraction has 354 states and 520 transitions. [2022-07-22 01:29:29,094 INFO L374 stractBuchiCegarLoop]: Abstraction has 354 states and 520 transitions. [2022-07-22 01:29:29,094 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 01:29:29,094 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 354 states and 520 transitions. [2022-07-22 01:29:29,097 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 74 [2022-07-22 01:29:29,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:29,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:29,097 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:29,097 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 01:29:29,098 INFO L752 eck$LassoCheckResult]: Stem: 4340#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 4341#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 4348#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 4346#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 4347#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 4368#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 4342#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 4349#partsENTRY ~p := #in~p;~q := #in~q; 4562#L20 assume !(~p <= 0); 4563#L21 assume !(~q <= 0); 4610#L22 assume ~q > ~p; 4379#L22-1 call #t~ret0 := parts(~p, ~p);< 4619#partsENTRY [2022-07-22 01:29:29,098 INFO L754 eck$LassoCheckResult]: Loop: 4619#partsENTRY ~p := #in~p;~q := #in~q; 4627#L20 assume !(~p <= 0); 4624#L21 assume !(~q <= 0); 4622#L22 assume ~q > ~p; 4378#L22-1 call #t~ret0 := parts(~p, ~p);< 4619#partsENTRY [2022-07-22 01:29:29,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:29,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1998405187, now seen corresponding path program 1 times [2022-07-22 01:29:29,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:29,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156087741] [2022-07-22 01:29:29,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:29,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:29,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:29:29,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156087741] [2022-07-22 01:29:29,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156087741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:29:29,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:29:29,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 01:29:29,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091006410] [2022-07-22 01:29:29,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:29:29,143 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:29:29,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:29,144 INFO L85 PathProgramCache]: Analyzing trace with hash 28756405, now seen corresponding path program 1 times [2022-07-22 01:29:29,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:29,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635321765] [2022-07-22 01:29:29,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:29,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:29,155 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:29,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:29,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:29,198 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:29,199 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:29,199 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:29,199 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:29,199 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:29:29,199 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:29,199 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:29,199 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:29,199 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration7_Loop [2022-07-22 01:29:29,200 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:29,200 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:29,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:29,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:29,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:29,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:29,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:29,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:29,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:29,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:29,262 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:29,262 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:29:29,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:29,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:29,264 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:29,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-22 01:29:29,266 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:29,266 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:29,283 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:29,283 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:29,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:29,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:29,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:29,301 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:29,325 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:29,325 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:29,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-22 01:29:29,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:29,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:29,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:29,360 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:29,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-22 01:29:29,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:29:29,362 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:29,477 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:29:29,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:29,482 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:29,482 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:29,482 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:29,482 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:29,482 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:29:29,483 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:29,483 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:29,483 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:29,483 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration7_Loop [2022-07-22 01:29:29,483 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:29,483 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:29,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:29,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:29,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:29,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:29,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:29,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:29,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:29,528 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:29,528 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:29:29,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:29,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:29,529 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:29,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-22 01:29:29,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:29,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:29,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:29,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:29,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:29,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:29,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:29,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:29,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:29:29,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:29,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:29,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:29,578 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:29,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-22 01:29:29,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:29,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:29,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:29,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:29,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:29,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:29,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:29,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:29,602 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:29:29,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:29,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:29,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:29,624 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:29,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-22 01:29:29,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:29,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:29,633 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:29,633 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:29,633 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:29,633 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:29,634 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:29,634 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:29,643 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:29:29,644 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-07-22 01:29:29,644 INFO L444 ModelExtractionUtils]: 2 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 01:29:29,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:29,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:29,646 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:29,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-22 01:29:29,658 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:29:29,658 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 01:29:29,658 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:29:29,658 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~q) = 1*parts_#in~q Supporting invariants [] [2022-07-22 01:29:29,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:29,675 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 01:29:29,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:29,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:29:29,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:29,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:29:29,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:29,759 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 [2022-07-22 01:29:29,759 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 354 states and 520 transitions. cyclomatic complexity: 175 Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:29:29,826 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 354 states and 520 transitions. cyclomatic complexity: 175. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1097 states and 1995 transitions. Complement of second has 41 states. [2022-07-22 01:29:29,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2022-07-22 01:29:29,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:29:29,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 41 transitions. [2022-07-22 01:29:29,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 12 letters. Loop has 5 letters. [2022-07-22 01:29:29,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:29,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 17 letters. Loop has 5 letters. [2022-07-22 01:29:29,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:29,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 41 transitions. Stem has 12 letters. Loop has 10 letters. [2022-07-22 01:29:29,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:29,828 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1097 states and 1995 transitions. [2022-07-22 01:29:29,840 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 218 [2022-07-22 01:29:29,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1097 states to 1016 states and 1851 transitions. [2022-07-22 01:29:29,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 550 [2022-07-22 01:29:29,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 558 [2022-07-22 01:29:29,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1016 states and 1851 transitions. [2022-07-22 01:29:29,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:29,859 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1016 states and 1851 transitions. [2022-07-22 01:29:29,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states and 1851 transitions. [2022-07-22 01:29:29,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 911. [2022-07-22 01:29:29,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 589 states have (on average 1.2393887945670627) internal successors, (730), 621 states have internal predecessors, (730), 228 states have call successors, (230), 98 states have call predecessors, (230), 94 states have return successors, (613), 191 states have call predecessors, (613), 203 states have call successors, (613) [2022-07-22 01:29:29,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1573 transitions. [2022-07-22 01:29:29,891 INFO L392 hiAutomatonCegarLoop]: Abstraction has 911 states and 1573 transitions. [2022-07-22 01:29:29,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:29:29,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 01:29:29,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 01:29:29,892 INFO L87 Difference]: Start difference. First operand 911 states and 1573 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 01:29:29,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:29:29,956 INFO L93 Difference]: Finished difference Result 546 states and 873 transitions. [2022-07-22 01:29:29,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 01:29:29,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 546 states and 873 transitions. [2022-07-22 01:29:29,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:29,964 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 70 [2022-07-22 01:29:29,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 546 states to 529 states and 855 transitions. [2022-07-22 01:29:29,970 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 218 [2022-07-22 01:29:29,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 218 [2022-07-22 01:29:29,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 529 states and 855 transitions. [2022-07-22 01:29:29,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:29,971 INFO L369 hiAutomatonCegarLoop]: Abstraction has 529 states and 855 transitions. [2022-07-22 01:29:29,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states and 855 transitions. [2022-07-22 01:29:29,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 524. [2022-07-22 01:29:29,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 353 states have (on average 1.2492917847025495) internal successors, (441), 370 states have internal predecessors, (441), 114 states have call successors, (115), 52 states have call predecessors, (115), 57 states have return successors, (294), 101 states have call predecessors, (294), 112 states have call successors, (294) [2022-07-22 01:29:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 850 transitions. [2022-07-22 01:29:29,985 INFO L392 hiAutomatonCegarLoop]: Abstraction has 524 states and 850 transitions. [2022-07-22 01:29:29,985 INFO L374 stractBuchiCegarLoop]: Abstraction has 524 states and 850 transitions. [2022-07-22 01:29:29,985 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-22 01:29:29,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 524 states and 850 transitions. [2022-07-22 01:29:29,988 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 70 [2022-07-22 01:29:29,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:29,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:29,989 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:29,989 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:29,989 INFO L752 eck$LassoCheckResult]: Stem: 7367#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 7368#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 7376#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 7374#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 7375#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 7424#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 7832#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 7833#partsENTRY ~p := #in~p;~q := #in~q; 7844#L20 assume ~p <= 0;#res := 1; 7841#partsFINAL assume true; 7831#partsEXIT >#68#return; 7828#L36-1 havoc main_#t~ret8#1; 7800#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 7654#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 7606#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 7603#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 7434#L35-3 [2022-07-22 01:29:29,989 INFO L754 eck$LassoCheckResult]: Loop: 7434#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 7427#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 7545#partsENTRY ~p := #in~p;~q := #in~q; 7543#L20 assume !(~p <= 0); 7541#L21 assume ~q <= 0;#res := 0; 7542#partsFINAL assume true; 7617#partsEXIT >#68#return; 7615#L36-1 havoc main_#t~ret8#1; 7602#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 7434#L35-3 [2022-07-22 01:29:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:29,990 INFO L85 PathProgramCache]: Analyzing trace with hash 399411315, now seen corresponding path program 2 times [2022-07-22 01:29:29,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:29,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779278316] [2022-07-22 01:29:29,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:29,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:29,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:30,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 01:29:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:30,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:30,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:29:30,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779278316] [2022-07-22 01:29:30,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779278316] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:29:30,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058908670] [2022-07-22 01:29:30,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 01:29:30,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:29:30,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:30,022 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:29:30,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-07-22 01:29:30,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 01:29:30,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:29:30,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:29:30,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:30,099 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:30,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:29:30,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:30,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058908670] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:29:30,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:29:30,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-22 01:29:30,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29121478] [2022-07-22 01:29:30,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:29:30,122 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:29:30,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:30,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1678232514, now seen corresponding path program 2 times [2022-07-22 01:29:30,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:30,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122087449] [2022-07-22 01:29:30,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:30,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:30,125 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:30,127 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:30,196 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:30,196 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:30,196 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:30,196 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:30,196 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:29:30,196 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:30,196 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:30,196 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:30,196 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration8_Loop [2022-07-22 01:29:30,196 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:30,196 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:30,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:30,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:30,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:30,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:30,229 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:30,230 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:29:30,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:30,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:30,244 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:30,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-22 01:29:30,246 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:30,246 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:30,257 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:30,257 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~p~0#1=1} Honda state: {ULTIMATE.start_main_~p~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:30,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-07-22 01:29:30,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:30,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:30,274 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:30,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-22 01:29:30,276 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:30,276 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:30,282 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:30,282 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post7#1=0} Honda state: {ULTIMATE.start_main_#t~post7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:30,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:30,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:30,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:30,299 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:30,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-22 01:29:30,301 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:30,301 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:30,308 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:30,308 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret8#1=0} Honda state: {ULTIMATE.start_main_#t~ret8#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:30,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-22 01:29:30,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:30,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:30,324 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:30,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-22 01:29:30,326 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:30,326 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:30,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-22 01:29:30,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:30,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:30,365 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:30,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-22 01:29:30,367 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:29:30,367 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:30,394 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:29:30,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-07-22 01:29:30,397 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:30,397 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:30,397 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:30,397 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:30,397 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:29:30,397 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:30,397 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:30,397 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:30,397 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration8_Loop [2022-07-22 01:29:30,397 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:30,397 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:30,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:30,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:30,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:30,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:30,437 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:30,437 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:29:30,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:30,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:30,438 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:30,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:30,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:30,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:30,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:30,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:30,454 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:30,454 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:30,454 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:30,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-22 01:29:30,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:29:30,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-07-22 01:29:30,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:30,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:30,496 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:30,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-22 01:29:30,498 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:30,503 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:30,504 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:30,504 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:30,504 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:30,504 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:30,504 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:30,504 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:30,519 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:29:30,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:30,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:30,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:30,554 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:30,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-22 01:29:30,556 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:30,562 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:30,562 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:30,562 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:30,562 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:30,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:30,563 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:30,563 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:30,578 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:29:30,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:30,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:30,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:30,597 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:30,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-22 01:29:30,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:30,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:30,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:30,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:30,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:30,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:30,605 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:30,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:30,634 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:29:30,636 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 01:29:30,636 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 01:29:30,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:30,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:30,638 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:30,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-22 01:29:30,675 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:29:30,675 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 01:29:30,675 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:29:30,675 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~q~0#1) = -2*ULTIMATE.start_main_~q~0#1 + 1 Supporting invariants [] [2022-07-22 01:29:30,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-07-22 01:29:30,691 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 01:29:30,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:30,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:29:30,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:30,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:29:30,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:30,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:30,838 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 [2022-07-22 01:29:30,838 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 524 states and 850 transitions. cyclomatic complexity: 341 Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 01:29:30,855 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 524 states and 850 transitions. cyclomatic complexity: 341. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 549 states and 878 transitions. Complement of second has 9 states. [2022-07-22 01:29:30,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 01:29:30,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 01:29:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-07-22 01:29:30,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 16 letters. Loop has 9 letters. [2022-07-22 01:29:30,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:30,856 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 01:29:30,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:30,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:29:30,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:30,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:29:30,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:31,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:31,006 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 [2022-07-22 01:29:31,006 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 524 states and 850 transitions. cyclomatic complexity: 341 Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 01:29:31,027 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 524 states and 850 transitions. cyclomatic complexity: 341. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 549 states and 878 transitions. Complement of second has 9 states. [2022-07-22 01:29:31,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 01:29:31,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 01:29:31,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2022-07-22 01:29:31,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 16 letters. Loop has 9 letters. [2022-07-22 01:29:31,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:31,029 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 01:29:31,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:31,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 01:29:31,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:31,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:29:31,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:31,121 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 [2022-07-22 01:29:31,121 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 524 states and 850 transitions. cyclomatic complexity: 341 Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 01:29:31,232 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 524 states and 850 transitions. cyclomatic complexity: 341. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 1496 states and 2733 transitions. Complement of second has 24 states. [2022-07-22 01:29:31,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2022-07-22 01:29:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 01:29:31,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 63 transitions. [2022-07-22 01:29:31,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 16 letters. Loop has 9 letters. [2022-07-22 01:29:31,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:31,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 25 letters. Loop has 9 letters. [2022-07-22 01:29:31,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:31,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 63 transitions. Stem has 16 letters. Loop has 18 letters. [2022-07-22 01:29:31,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:31,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 2733 transitions. [2022-07-22 01:29:31,277 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 118 [2022-07-22 01:29:31,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1379 states and 2526 transitions. [2022-07-22 01:29:31,298 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 288 [2022-07-22 01:29:31,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 292 [2022-07-22 01:29:31,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1379 states and 2526 transitions. [2022-07-22 01:29:31,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:31,302 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1379 states and 2526 transitions. [2022-07-22 01:29:31,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states and 2526 transitions. [2022-07-22 01:29:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1298. [2022-07-22 01:29:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 831 states have (on average 1.2214199759326112) internal successors, (1015), 868 states have internal predecessors, (1015), 322 states have call successors, (323), 122 states have call predecessors, (323), 145 states have return successors, (1031), 307 states have call predecessors, (1031), 314 states have call successors, (1031) [2022-07-22 01:29:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 2369 transitions. [2022-07-22 01:29:31,347 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1298 states and 2369 transitions. [2022-07-22 01:29:31,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:29:31,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-22 01:29:31,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-22 01:29:31,348 INFO L87 Difference]: Start difference. First operand 1298 states and 2369 transitions. Second operand has 11 states, 10 states have (on average 2.1) internal successors, (21), 11 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 01:29:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:29:31,423 INFO L93 Difference]: Finished difference Result 1477 states and 2646 transitions. [2022-07-22 01:29:31,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 01:29:31,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1477 states and 2646 transitions. [2022-07-22 01:29:31,446 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 158 [2022-07-22 01:29:31,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1477 states to 1463 states and 2631 transitions. [2022-07-22 01:29:31,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 316 [2022-07-22 01:29:31,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 316 [2022-07-22 01:29:31,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1463 states and 2631 transitions. [2022-07-22 01:29:31,469 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:31,469 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1463 states and 2631 transitions. [2022-07-22 01:29:31,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states and 2631 transitions. [2022-07-22 01:29:31,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1303. [2022-07-22 01:29:31,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 832 states have (on average 1.2223557692307692) internal successors, (1017), 874 states have internal predecessors, (1017), 326 states have call successors, (327), 122 states have call predecessors, (327), 145 states have return successors, (1047), 306 states have call predecessors, (1047), 318 states have call successors, (1047) [2022-07-22 01:29:31,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 2391 transitions. [2022-07-22 01:29:31,528 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1303 states and 2391 transitions. [2022-07-22 01:29:31,529 INFO L374 stractBuchiCegarLoop]: Abstraction has 1303 states and 2391 transitions. [2022-07-22 01:29:31,529 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-22 01:29:31,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1303 states and 2391 transitions. [2022-07-22 01:29:31,536 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 112 [2022-07-22 01:29:31,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:31,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:31,538 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:31,538 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 8, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2022-07-22 01:29:31,538 INFO L752 eck$LassoCheckResult]: Stem: 13677#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 13678#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 13688#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 13682#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 13683#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 13738#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 14645#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 14646#partsENTRY ~p := #in~p;~q := #in~q; 14650#L20 assume ~p <= 0;#res := 1; 14648#partsFINAL assume true; 14644#partsEXIT >#68#return; 14642#L36-1 havoc main_#t~ret8#1; 14635#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 14631#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 14627#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 14628#partsENTRY ~p := #in~p;~q := #in~q; 14632#L20 assume ~p <= 0;#res := 1; 14630#partsFINAL assume true; 14626#partsEXIT >#68#return; 14621#L36-1 havoc main_#t~ret8#1; 13904#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 13901#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 13900#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 13898#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 13896#L35-3 [2022-07-22 01:29:31,539 INFO L754 eck$LassoCheckResult]: Loop: 13896#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 13670#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 13895#partsENTRY ~p := #in~p;~q := #in~q; 13893#L20 assume !(~p <= 0); 13892#L21 assume !(~q <= 0); 13889#L22 assume !(~q > ~p); 13779#L23 call #t~ret1 := parts(~p - ~q, ~q);< 13885#partsENTRY ~p := #in~p;~q := #in~q; 13890#L20 assume !(~p <= 0); 13891#L21 assume !(~q <= 0); 14185#L22 assume !(~q > ~p); 13760#L23 call #t~ret1 := parts(~p - ~q, ~q);< 13885#partsENTRY ~p := #in~p;~q := #in~q; 13890#L20 assume ~p <= 0;#res := 1; 13888#partsFINAL assume true; 13884#partsEXIT >#64#return; 13762#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 13881#partsENTRY ~p := #in~p;~q := #in~q; 14188#L20 assume !(~p <= 0); 13891#L21 assume ~q <= 0;#res := 0; 13709#partsFINAL assume true; 13869#partsEXIT >#66#return; 13875#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 14284#partsFINAL assume true; 14219#partsEXIT >#64#return; 13661#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 13657#partsENTRY ~p := #in~p;~q := #in~q; 13663#L20 assume !(~p <= 0); 13708#L21 assume ~q <= 0;#res := 0; 13709#partsFINAL assume true; 13869#partsEXIT >#66#return; 13877#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 13727#partsFINAL assume true; 13728#partsEXIT >#68#return; 13733#L36-1 havoc main_#t~ret8#1; 13720#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 13701#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 13668#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 13895#partsENTRY ~p := #in~p;~q := #in~q; 13893#L20 assume !(~p <= 0); 13892#L21 assume !(~q <= 0); 13889#L22 assume !(~q > ~p); 13779#L23 call #t~ret1 := parts(~p - ~q, ~q);< 13885#partsENTRY ~p := #in~p;~q := #in~q; 13890#L20 assume ~p <= 0;#res := 1; 13888#partsFINAL assume true; 13884#partsEXIT >#64#return; 13758#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 13881#partsENTRY ~p := #in~p;~q := #in~q; 14188#L20 assume !(~p <= 0); 13891#L21 assume ~q <= 0;#res := 0; 13709#partsFINAL assume true; 13869#partsEXIT >#66#return; 13871#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 13749#partsFINAL assume true; 13750#partsEXIT >#68#return; 13903#L36-1 havoc main_#t~ret8#1; 13902#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 13741#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 13742#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 13899#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 13896#L35-3 [2022-07-22 01:29:31,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:31,539 INFO L85 PathProgramCache]: Analyzing trace with hash -856045304, now seen corresponding path program 3 times [2022-07-22 01:29:31,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:31,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767718586] [2022-07-22 01:29:31,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:31,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:31,545 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:31,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:31,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:31,551 INFO L85 PathProgramCache]: Analyzing trace with hash 144582960, now seen corresponding path program 1 times [2022-07-22 01:29:31,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:31,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901391817] [2022-07-22 01:29:31,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:31,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:31,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 01:29:31,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:31,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:31,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:31,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:31,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:31,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:31,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 01:29:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:31,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-22 01:29:31,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:31,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:31,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:31,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:31,744 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 52 proven. 48 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-22 01:29:31,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:29:31,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901391817] [2022-07-22 01:29:31,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901391817] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:29:31,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1294405384] [2022-07-22 01:29:31,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:31,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:29:31,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:31,746 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:29:31,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-07-22 01:29:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:31,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 01:29:31,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:31,853 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 27 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-22 01:29:31,853 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:29:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 55 proven. 29 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-07-22 01:29:32,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1294405384] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:29:32,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:29:32,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 10] total 23 [2022-07-22 01:29:32,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241765379] [2022-07-22 01:29:32,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:29:32,015 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:29:32,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:29:32,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-22 01:29:32,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2022-07-22 01:29:32,016 INFO L87 Difference]: Start difference. First operand 1303 states and 2391 transitions. cyclomatic complexity: 1113 Second operand has 23 states, 21 states have (on average 3.0476190476190474) internal successors, (64), 21 states have internal predecessors, (64), 11 states have call successors, (17), 1 states have call predecessors, (17), 8 states have return successors, (18), 14 states have call predecessors, (18), 11 states have call successors, (18) [2022-07-22 01:29:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:29:32,627 INFO L93 Difference]: Finished difference Result 2270 states and 4654 transitions. [2022-07-22 01:29:32,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-22 01:29:32,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2270 states and 4654 transitions. [2022-07-22 01:29:32,665 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 165 [2022-07-22 01:29:32,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2270 states to 1211 states and 2330 transitions. [2022-07-22 01:29:32,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 524 [2022-07-22 01:29:32,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 528 [2022-07-22 01:29:32,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1211 states and 2330 transitions. [2022-07-22 01:29:32,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:32,677 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1211 states and 2330 transitions. [2022-07-22 01:29:32,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states and 2330 transitions. [2022-07-22 01:29:32,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1117. [2022-07-22 01:29:32,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 758 states have (on average 1.1794195250659631) internal successors, (894), 798 states have internal predecessors, (894), 220 states have call successors, (221), 105 states have call predecessors, (221), 139 states have return successors, (936), 213 states have call predecessors, (936), 220 states have call successors, (936) [2022-07-22 01:29:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 2051 transitions. [2022-07-22 01:29:32,707 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1117 states and 2051 transitions. [2022-07-22 01:29:32,707 INFO L374 stractBuchiCegarLoop]: Abstraction has 1117 states and 2051 transitions. [2022-07-22 01:29:32,707 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-22 01:29:32,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1117 states and 2051 transitions. [2022-07-22 01:29:32,712 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 157 [2022-07-22 01:29:32,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:32,712 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:32,714 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:32,714 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2022-07-22 01:29:32,714 INFO L752 eck$LassoCheckResult]: Stem: 17776#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 17777#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 17788#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 17782#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 17783#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 18367#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 18364#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 18366#partsENTRY ~p := #in~p;~q := #in~q; 18371#L20 assume ~p <= 0;#res := 1; 18370#partsFINAL assume true; 18363#partsEXIT >#68#return; 18361#L36-1 havoc main_#t~ret8#1; 18359#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 18358#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 18355#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 18356#partsENTRY ~p := #in~p;~q := #in~q; 18362#L20 assume ~p <= 0;#res := 1; 18360#partsFINAL assume true; 18354#partsEXIT >#68#return; 18352#L36-1 havoc main_#t~ret8#1; 18350#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 18348#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 17801#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 17802#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 18384#L35-3 [2022-07-22 01:29:32,715 INFO L754 eck$LassoCheckResult]: Loop: 18384#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 18533#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 18535#partsENTRY ~p := #in~p;~q := #in~q; 18539#L20 assume !(~p <= 0); 18540#L21 assume ~q <= 0;#res := 0; 18550#partsFINAL assume true; 18548#partsEXIT >#68#return; 18546#L36-1 havoc main_#t~ret8#1; 18544#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 18538#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 17764#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 18522#partsENTRY ~p := #in~p;~q := #in~q; 18529#L20 assume !(~p <= 0); 18530#L21 assume !(~q <= 0); 18578#L22 assume !(~q > ~p); 18430#L23 call #t~ret1 := parts(~p - ~q, ~q);< 18440#partsENTRY ~p := #in~p;~q := #in~q; 18607#L20 assume ~p <= 0;#res := 1; 18605#partsFINAL assume true; 18603#partsEXIT >#64#return; 18434#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 18636#partsENTRY ~p := #in~p;~q := #in~q; 18642#L20 assume !(~p <= 0); 18643#L21 assume !(~q <= 0); 18499#L22 assume !(~q > ~p); 18435#L23 call #t~ret1 := parts(~p - ~q, ~q);< 18440#partsENTRY ~p := #in~p;~q := #in~q; 18607#L20 assume ~p <= 0;#res := 1; 18605#partsFINAL assume true; 18603#partsEXIT >#64#return; 18432#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 18636#partsENTRY ~p := #in~p;~q := #in~q; 18642#L20 assume !(~p <= 0); 18643#L21 assume ~q <= 0;#res := 0; 18701#partsFINAL assume true; 18665#partsEXIT >#66#return; 18666#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 18693#partsFINAL assume true; 18688#partsEXIT >#66#return; 18691#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 18844#partsFINAL assume true; 18843#partsEXIT >#68#return; 18556#L36-1 havoc main_#t~ret8#1; 18549#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 18547#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 18545#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 18543#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 18384#L35-3 [2022-07-22 01:29:32,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:32,716 INFO L85 PathProgramCache]: Analyzing trace with hash -856045304, now seen corresponding path program 4 times [2022-07-22 01:29:32,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:32,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765554260] [2022-07-22 01:29:32,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:32,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:32,724 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:32,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:32,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:32,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:32,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1905350738, now seen corresponding path program 2 times [2022-07-22 01:29:32,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:32,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3167943] [2022-07-22 01:29:32,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:32,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:32,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 01:29:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:32,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 01:29:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:32,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:32,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:32,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:32,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:32,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-22 01:29:32,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:29:32,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3167943] [2022-07-22 01:29:32,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3167943] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:29:32,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906494049] [2022-07-22 01:29:32,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 01:29:32,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:29:32,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:32,829 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:29:32,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-07-22 01:29:32,860 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 01:29:32,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:29:32,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 01:29:32,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 28 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-22 01:29:32,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:29:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 22 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-07-22 01:29:33,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906494049] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:29:33,139 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:29:33,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 20 [2022-07-22 01:29:33,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469031411] [2022-07-22 01:29:33,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:29:33,139 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:29:33,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:29:33,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-22 01:29:33,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-07-22 01:29:33,140 INFO L87 Difference]: Start difference. First operand 1117 states and 2051 transitions. cyclomatic complexity: 967 Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 6 states have call successors, (11), 1 states have call predecessors, (11), 5 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-22 01:29:33,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:29:33,605 INFO L93 Difference]: Finished difference Result 1413 states and 2392 transitions. [2022-07-22 01:29:33,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-22 01:29:33,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1413 states and 2392 transitions. [2022-07-22 01:29:33,634 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 204 [2022-07-22 01:29:33,645 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1413 states to 1385 states and 2360 transitions. [2022-07-22 01:29:33,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 578 [2022-07-22 01:29:33,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 578 [2022-07-22 01:29:33,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1385 states and 2360 transitions. [2022-07-22 01:29:33,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:33,647 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1385 states and 2360 transitions. [2022-07-22 01:29:33,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states and 2360 transitions. [2022-07-22 01:29:33,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1143. [2022-07-22 01:29:33,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 782 states have (on average 1.1585677749360614) internal successors, (906), 822 states have internal predecessors, (906), 218 states have call successors, (219), 105 states have call predecessors, (219), 143 states have return successors, (821), 215 states have call predecessors, (821), 218 states have call successors, (821) [2022-07-22 01:29:33,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1946 transitions. [2022-07-22 01:29:33,677 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1143 states and 1946 transitions. [2022-07-22 01:29:33,677 INFO L374 stractBuchiCegarLoop]: Abstraction has 1143 states and 1946 transitions. [2022-07-22 01:29:33,677 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-22 01:29:33,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1143 states and 1946 transitions. [2022-07-22 01:29:33,682 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 153 [2022-07-22 01:29:33,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:33,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:33,683 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:33,683 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2022-07-22 01:29:33,683 INFO L752 eck$LassoCheckResult]: Stem: 20694#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 20695#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 20708#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 20702#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 20703#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 21312#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 21308#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 21309#partsENTRY ~p := #in~p;~q := #in~q; 21314#L20 assume ~p <= 0;#res := 1; 21311#partsFINAL assume true; 21307#partsEXIT >#68#return; 21305#L36-1 havoc main_#t~ret8#1; 21209#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 21208#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 21203#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 21204#partsENTRY ~p := #in~p;~q := #in~q; 21207#L20 assume ~p <= 0;#res := 1; 21206#partsFINAL assume true; 21202#partsEXIT >#68#return; 21199#L36-1 havoc main_#t~ret8#1; 21189#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 21084#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 21080#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 21081#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 21646#L35-3 [2022-07-22 01:29:33,683 INFO L754 eck$LassoCheckResult]: Loop: 21646#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 21647#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 21678#partsENTRY ~p := #in~p;~q := #in~q; 21685#L20 assume !(~p <= 0); 21682#L21 assume ~q <= 0;#res := 0; 21681#partsFINAL assume true; 21677#partsEXIT >#68#return; 21676#L36-1 havoc main_#t~ret8#1; 21675#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 21670#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 20689#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 21609#partsENTRY ~p := #in~p;~q := #in~q; 21589#L20 assume !(~p <= 0); 21587#L21 assume !(~q <= 0); 21530#L22 assume !(~q > ~p); 21416#L23 call #t~ret1 := parts(~p - ~q, ~q);< 21491#partsENTRY ~p := #in~p;~q := #in~q; 21496#L20 assume ~p <= 0;#res := 1; 21493#partsFINAL assume true; 21490#partsEXIT >#64#return; 21414#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 21429#partsENTRY ~p := #in~p;~q := #in~q; 21442#L20 assume !(~p <= 0); 21443#L21 assume ~q <= 0;#res := 0; 21645#partsFINAL assume true; 21642#partsEXIT >#66#return; 21641#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 21640#partsFINAL assume true; 21639#partsEXIT >#68#return; 21638#L36-1 havoc main_#t~ret8#1; 21636#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 21633#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 21428#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 21607#partsENTRY ~p := #in~p;~q := #in~q; 21608#L20 assume !(~p <= 0); 21587#L21 assume !(~q <= 0); 21530#L22 assume !(~q > ~p); 21416#L23 call #t~ret1 := parts(~p - ~q, ~q);< 21491#partsENTRY ~p := #in~p;~q := #in~q; 21496#L20 assume ~p <= 0;#res := 1; 21493#partsFINAL assume true; 21490#partsEXIT >#64#return; 21414#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 21429#partsENTRY ~p := #in~p;~q := #in~q; 21442#L20 assume !(~p <= 0); 21443#L21 assume !(~q <= 0); 21434#L22 assume !(~q > ~p); 21415#L23 call #t~ret1 := parts(~p - ~q, ~q);< 21491#partsENTRY ~p := #in~p;~q := #in~q; 21496#L20 assume ~p <= 0;#res := 1; 21493#partsFINAL assume true; 21490#partsEXIT >#64#return; 21425#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 21429#partsENTRY ~p := #in~p;~q := #in~q; 21442#L20 assume !(~p <= 0); 21443#L21 assume ~q <= 0;#res := 0; 21645#partsFINAL assume true; 21642#partsEXIT >#66#return; 21644#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 21680#partsFINAL assume true; 21655#partsEXIT >#66#return; 21654#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 21653#partsFINAL assume true; 21652#partsEXIT >#68#return; 21650#L36-1 havoc main_#t~ret8#1; 21637#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 21634#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 21635#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 21649#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 21646#L35-3 [2022-07-22 01:29:33,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:33,684 INFO L85 PathProgramCache]: Analyzing trace with hash -856045304, now seen corresponding path program 5 times [2022-07-22 01:29:33,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:33,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947612907] [2022-07-22 01:29:33,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:33,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:33,687 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:33,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:33,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:33,690 INFO L85 PathProgramCache]: Analyzing trace with hash -945713677, now seen corresponding path program 3 times [2022-07-22 01:29:33,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:33,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915890301] [2022-07-22 01:29:33,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:33,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:33,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-22 01:29:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:33,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-22 01:29:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:33,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:33,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:33,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-22 01:29:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:33,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:33,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:33,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:33,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:33,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:33,780 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 41 proven. 53 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-07-22 01:29:33,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:29:33,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915890301] [2022-07-22 01:29:33,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915890301] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:29:33,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547656658] [2022-07-22 01:29:33,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 01:29:33,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:29:33,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:33,808 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:29:33,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-07-22 01:29:33,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-22 01:29:33,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:29:33,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 01:29:33,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2022-07-22 01:29:33,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:29:33,995 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2022-07-22 01:29:33,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547656658] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:29:33,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:29:33,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2022-07-22 01:29:33,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440862196] [2022-07-22 01:29:33,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:29:33,996 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:29:33,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:29:33,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-22 01:29:33,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-07-22 01:29:33,997 INFO L87 Difference]: Start difference. First operand 1143 states and 1946 transitions. cyclomatic complexity: 836 Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 16 states have internal predecessors, (44), 6 states have call successors, (10), 1 states have call predecessors, (10), 4 states have return successors, (12), 8 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-22 01:29:34,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:29:34,281 INFO L93 Difference]: Finished difference Result 1324 states and 2026 transitions. [2022-07-22 01:29:34,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-22 01:29:34,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1324 states and 2026 transitions. [2022-07-22 01:29:34,288 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 143 [2022-07-22 01:29:34,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1324 states to 1266 states and 1902 transitions. [2022-07-22 01:29:34,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 576 [2022-07-22 01:29:34,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 576 [2022-07-22 01:29:34,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1266 states and 1902 transitions. [2022-07-22 01:29:34,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:34,298 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1266 states and 1902 transitions. [2022-07-22 01:29:34,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states and 1902 transitions. [2022-07-22 01:29:34,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1140. [2022-07-22 01:29:34,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1140 states, 795 states have (on average 1.1371069182389937) internal successors, (904), 839 states have internal predecessors, (904), 206 states have call successors, (207), 113 states have call predecessors, (207), 139 states have return successors, (567), 187 states have call predecessors, (567), 204 states have call successors, (567) [2022-07-22 01:29:34,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1140 states to 1140 states and 1678 transitions. [2022-07-22 01:29:34,319 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1140 states and 1678 transitions. [2022-07-22 01:29:34,319 INFO L374 stractBuchiCegarLoop]: Abstraction has 1140 states and 1678 transitions. [2022-07-22 01:29:34,319 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-22 01:29:34,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1140 states and 1678 transitions. [2022-07-22 01:29:34,323 INFO L131 ngComponentsAnalysis]: Automaton has 15 accepting balls. 127 [2022-07-22 01:29:34,324 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:34,324 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:34,324 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:34,324 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:34,325 INFO L752 eck$LassoCheckResult]: Stem: 23712#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 23713#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 23724#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 23720#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 23721#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 24277#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 24273#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 24274#partsENTRY ~p := #in~p;~q := #in~q; 24279#L20 assume ~p <= 0;#res := 1; 24276#partsFINAL assume true; 24272#partsEXIT >#68#return; 24270#L36-1 havoc main_#t~ret8#1; 24269#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 24267#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 24263#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 24264#partsENTRY ~p := #in~p;~q := #in~q; 24268#L20 assume ~p <= 0;#res := 1; 24266#partsFINAL assume true; 24262#partsEXIT >#68#return; 24261#L36-1 havoc main_#t~ret8#1; 24259#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 24257#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 24256#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 23933#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 23934#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 24491#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 24693#partsENTRY ~p := #in~p;~q := #in~q; 24742#L20 assume ~p <= 0;#res := 1; 24741#partsFINAL assume true; 24692#partsEXIT >#68#return; 24690#L36-1 havoc main_#t~ret8#1; 24678#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 24672#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 23698#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 24618#partsENTRY ~p := #in~p;~q := #in~q; 24619#L20 assume ~p <= 0;#res := 1; 24728#partsFINAL assume true; 24687#partsEXIT >#68#return; 24685#L36-1 [2022-07-22 01:29:34,325 INFO L754 eck$LassoCheckResult]: Loop: 24685#L36-1 havoc main_#t~ret8#1; 24683#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 24677#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 23696#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 24618#partsENTRY ~p := #in~p;~q := #in~q; 24619#L20 assume ~p <= 0;#res := 1; 24728#partsFINAL assume true; 24687#partsEXIT >#68#return; 24685#L36-1 [2022-07-22 01:29:34,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:34,325 INFO L85 PathProgramCache]: Analyzing trace with hash 744815100, now seen corresponding path program 6 times [2022-07-22 01:29:34,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:34,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986877222] [2022-07-22 01:29:34,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:34,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:34,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 01:29:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:34,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 01:29:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:34,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 01:29:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:34,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 01:29:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-22 01:29:34,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:29:34,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986877222] [2022-07-22 01:29:34,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986877222] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:29:34,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283795835] [2022-07-22 01:29:34,351 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 01:29:34,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:29:34,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:34,371 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:29:34,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-07-22 01:29:34,402 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-07-22 01:29:34,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:29:34,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 01:29:34,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-22 01:29:34,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 01:29:34,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283795835] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:29:34,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 01:29:34,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-07-22 01:29:34,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863562024] [2022-07-22 01:29:34,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:29:34,439 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:29:34,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:34,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1411370316, now seen corresponding path program 2 times [2022-07-22 01:29:34,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:34,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375243862] [2022-07-22 01:29:34,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:34,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:34,442 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:34,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:34,503 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:34,503 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:34,503 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:34,503 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:34,503 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:29:34,503 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:34,504 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:34,504 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:34,504 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration12_Loop [2022-07-22 01:29:34,504 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:34,504 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:34,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:34,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:34,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:34,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:34,534 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:34,534 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:29:34,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:34,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:34,607 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:34,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-22 01:29:34,608 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:34,609 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:34,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-22 01:29:34,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:34,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:34,655 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:34,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-22 01:29:34,657 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:29:34,657 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:34,926 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:29:34,930 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:34,930 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:34,930 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:34,930 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:34,930 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:34,930 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:29:34,930 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:34,930 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:34,930 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:34,930 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration12_Loop [2022-07-22 01:29:34,930 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:34,930 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:34,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:34,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:34,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:34,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:34,962 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:34,962 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:29:34,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:34,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:34,967 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:34,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-22 01:29:34,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:34,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:34,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:34,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:34,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:34,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:34,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:34,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:34,977 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:29:34,978 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 01:29:34,978 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 01:29:34,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:34,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:34,979 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:34,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-22 01:29:34,981 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:29:34,981 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 01:29:34,981 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:29:34,981 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1, ULTIMATE.start_main_~q~0#1) = 1*ULTIMATE.start_main_~x~0#1 - 1*ULTIMATE.start_main_~q~0#1 Supporting invariants [] [2022-07-22 01:29:34,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:34,998 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 01:29:35,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:35,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:35,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 01:29:35,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:35,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:35,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:29:35,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:35,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:35,230 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 [2022-07-22 01:29:35,230 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1140 states and 1678 transitions. cyclomatic complexity: 567 Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 01:29:35,256 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1140 states and 1678 transitions. cyclomatic complexity: 567. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1159 states and 1699 transitions. Complement of second has 10 states. [2022-07-22 01:29:35,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 01:29:35,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 01:29:35,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2022-07-22 01:29:35,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 38 letters. Loop has 8 letters. [2022-07-22 01:29:35,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:35,257 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 01:29:35,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:35,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 01:29:35,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:35,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:29:35,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:35,354 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 [2022-07-22 01:29:35,354 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1140 states and 1678 transitions. cyclomatic complexity: 567 Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 01:29:35,382 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1140 states and 1678 transitions. cyclomatic complexity: 567. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 1157 states and 1696 transitions. Complement of second has 12 states. [2022-07-22 01:29:35,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-22 01:29:35,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 01:29:35,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-07-22 01:29:35,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 21 transitions. Stem has 38 letters. Loop has 8 letters. [2022-07-22 01:29:35,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:35,384 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 01:29:35,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:35,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 01:29:35,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:35,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 01:29:35,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:35,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:35,492 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 [2022-07-22 01:29:35,492 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1140 states and 1678 transitions. cyclomatic complexity: 567 Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 01:29:35,552 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1140 states and 1678 transitions. cyclomatic complexity: 567. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 2246 states and 3329 transitions. Complement of second has 13 states. [2022-07-22 01:29:35,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-22 01:29:35,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 01:29:35,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-07-22 01:29:35,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 38 letters. Loop has 8 letters. [2022-07-22 01:29:35,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:35,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 46 letters. Loop has 8 letters. [2022-07-22 01:29:35,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:35,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 53 transitions. Stem has 38 letters. Loop has 16 letters. [2022-07-22 01:29:35,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:35,554 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2246 states and 3329 transitions. [2022-07-22 01:29:35,566 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 105 [2022-07-22 01:29:35,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2246 states to 1745 states and 2561 transitions. [2022-07-22 01:29:35,580 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 342 [2022-07-22 01:29:35,580 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 369 [2022-07-22 01:29:35,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1745 states and 2561 transitions. [2022-07-22 01:29:35,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:35,580 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1745 states and 2561 transitions. [2022-07-22 01:29:35,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states and 2561 transitions. [2022-07-22 01:29:35,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1631. [2022-07-22 01:29:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1139 states have (on average 1.1255487269534679) internal successors, (1282), 1201 states have internal predecessors, (1282), 307 states have call successors, (339), 186 states have call predecessors, (339), 185 states have return successors, (801), 243 states have call predecessors, (801), 290 states have call successors, (801) [2022-07-22 01:29:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 2422 transitions. [2022-07-22 01:29:35,607 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1631 states and 2422 transitions. [2022-07-22 01:29:35,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:29:35,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 01:29:35,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 01:29:35,607 INFO L87 Difference]: Start difference. First operand 1631 states and 2422 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-22 01:29:35,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:29:35,653 INFO L93 Difference]: Finished difference Result 864 states and 1214 transitions. [2022-07-22 01:29:35,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 01:29:35,653 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 864 states and 1214 transitions. [2022-07-22 01:29:35,658 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 95 [2022-07-22 01:29:35,662 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 864 states to 523 states and 769 transitions. [2022-07-22 01:29:35,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 208 [2022-07-22 01:29:35,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 217 [2022-07-22 01:29:35,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 523 states and 769 transitions. [2022-07-22 01:29:35,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:35,663 INFO L369 hiAutomatonCegarLoop]: Abstraction has 523 states and 769 transitions. [2022-07-22 01:29:35,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states and 769 transitions. [2022-07-22 01:29:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2022-07-22 01:29:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 372 states have (on average 1.10752688172043) internal successors, (412), 381 states have internal predecessors, (412), 97 states have call successors, (107), 65 states have call predecessors, (107), 54 states have return successors, (250), 76 states have call predecessors, (250), 92 states have call successors, (250) [2022-07-22 01:29:35,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 769 transitions. [2022-07-22 01:29:35,673 INFO L392 hiAutomatonCegarLoop]: Abstraction has 523 states and 769 transitions. [2022-07-22 01:29:35,673 INFO L374 stractBuchiCegarLoop]: Abstraction has 523 states and 769 transitions. [2022-07-22 01:29:35,673 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-22 01:29:35,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 523 states and 769 transitions. [2022-07-22 01:29:35,675 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 95 [2022-07-22 01:29:35,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:35,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:35,675 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:35,675 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 01:29:35,676 INFO L752 eck$LassoCheckResult]: Stem: 32524#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 32525#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 32541#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 32534#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 32535#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 32611#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 32606#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 32608#partsENTRY ~p := #in~p;~q := #in~q; 32612#L20 assume ~p <= 0;#res := 1; 32609#partsFINAL assume true; 32605#partsEXIT >#68#return; 32604#L36-1 havoc main_#t~ret8#1; 32603#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 32602#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 32597#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 32600#partsENTRY ~p := #in~p;~q := #in~q; 32596#L20 assume ~p <= 0;#res := 1; 32598#partsFINAL assume true; 32802#partsEXIT >#68#return; 32801#L36-1 havoc main_#t~ret8#1; 32800#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 32799#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 32798#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 32796#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 32794#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 32784#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 32792#partsENTRY ~p := #in~p;~q := #in~q; 32797#L20 assume !(~p <= 0); 32795#L21 assume ~q <= 0;#res := 0; 32793#partsFINAL assume true; 32791#partsEXIT >#68#return; 32789#L36-1 havoc main_#t~ret8#1; 32787#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 32783#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 32512#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 32705#partsENTRY ~p := #in~p;~q := #in~q; 32781#L20 assume !(~p <= 0); 32779#L21 assume !(~q <= 0); 32776#L22 assume !(~q > ~p); 32527#L23 call #t~ret1 := parts(~p - ~q, ~q);< 32668#partsENTRY [2022-07-22 01:29:35,676 INFO L754 eck$LassoCheckResult]: Loop: 32668#partsENTRY ~p := #in~p;~q := #in~q; 32680#L20 assume !(~p <= 0); 32655#L21 assume !(~q <= 0); 32656#L22 assume !(~q > ~p); 32528#L23 call #t~ret1 := parts(~p - ~q, ~q);< 32668#partsENTRY [2022-07-22 01:29:35,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:35,676 INFO L85 PathProgramCache]: Analyzing trace with hash 349844742, now seen corresponding path program 1 times [2022-07-22 01:29:35,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:35,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350314883] [2022-07-22 01:29:35,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:35,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:35,681 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:35,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:35,686 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:35,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:35,686 INFO L85 PathProgramCache]: Analyzing trace with hash 28756500, now seen corresponding path program 1 times [2022-07-22 01:29:35,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:35,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549805011] [2022-07-22 01:29:35,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:35,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:35,689 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:35,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:35,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:35,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1585311791, now seen corresponding path program 2 times [2022-07-22 01:29:35,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:35,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863716088] [2022-07-22 01:29:35,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:35,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:35,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 01:29:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:35,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 01:29:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:35,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 01:29:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:35,730 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-22 01:29:35,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:29:35,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863716088] [2022-07-22 01:29:35,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863716088] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:29:35,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736461517] [2022-07-22 01:29:35,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 01:29:35,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:29:35,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:35,732 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:29:35,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-07-22 01:29:35,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 01:29:35,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:29:35,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:29:35,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:35,810 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-22 01:29:35,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:29:35,854 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 19 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-07-22 01:29:35,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736461517] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:29:35,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:29:35,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 10 [2022-07-22 01:29:35,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638395195] [2022-07-22 01:29:35,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:29:35,897 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:35,898 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:35,898 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:35,898 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:35,898 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:29:35,898 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:35,898 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:35,898 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:35,898 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2022-07-22 01:29:35,898 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:35,899 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:35,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:35,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:35,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:35,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:35,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:35,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:35,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:35,938 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:35,938 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:29:35,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:35,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:35,940 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:35,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-22 01:29:35,959 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:35,959 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:35,968 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:35,968 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:35,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:35,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:35,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:35,985 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:35,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-22 01:29:35,989 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:35,989 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:36,010 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:36,010 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:36,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2022-07-22 01:29:36,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:36,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:36,030 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:36,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-22 01:29:36,033 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:36,033 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:36,054 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:36,054 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~q=0} Honda state: {parts_~q=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:36,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-07-22 01:29:36,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:36,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:36,079 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:36,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-22 01:29:36,080 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:36,080 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:36,088 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:36,089 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:36,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:36,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:36,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:36,119 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:36,144 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:36,144 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:36,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-22 01:29:36,160 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:36,160 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_~p=0} Honda state: {parts_~p=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:36,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-07-22 01:29:36,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:36,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:36,183 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:36,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-22 01:29:36,185 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:36,185 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:36,193 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:36,193 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:36,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-07-22 01:29:36,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:36,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:36,218 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:36,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-22 01:29:36,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:36,220 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:36,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-07-22 01:29:36,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:36,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:36,256 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:36,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-22 01:29:36,259 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:29:36,259 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:36,367 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:29:36,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-07-22 01:29:36,371 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:36,371 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:36,371 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:36,371 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:36,371 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:29:36,371 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:36,371 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:36,372 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:36,372 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration13_Loop [2022-07-22 01:29:36,372 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:36,372 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:36,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:36,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:36,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:36,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:36,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:36,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:36,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:36,431 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:36,431 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:29:36,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:36,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:36,437 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:36,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-07-22 01:29:36,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:36,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:36,447 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:36,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:36,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:36,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:36,448 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:36,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:36,450 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:29:36,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-07-22 01:29:36,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:36,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:36,473 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:36,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-22 01:29:36,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:36,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:36,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:36,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:36,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:36,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:36,481 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:36,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:36,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:29:36,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2022-07-22 01:29:36,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:36,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:36,500 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:36,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-22 01:29:36,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:36,507 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:36,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:36,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:36,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:36,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:36,507 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:36,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:36,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:29:36,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:36,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:36,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:36,524 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:36,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-22 01:29:36,527 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:36,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:36,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:36,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:36,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:36,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:36,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:36,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:36,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:29:36,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2022-07-22 01:29:36,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:36,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:36,551 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:36,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-22 01:29:36,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:36,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:36,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:36,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:36,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:36,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:36,558 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:36,558 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:36,573 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:29:36,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-07-22 01:29:36,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:36,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:36,589 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:36,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-22 01:29:36,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:36,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:36,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:36,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:36,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:36,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:36,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:36,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:36,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:29:36,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-22 01:29:36,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:36,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:36,630 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:36,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-22 01:29:36,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:36,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:36,638 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:36,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:36,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:36,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:36,639 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:36,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:36,654 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:29:36,656 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 01:29:36,656 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 01:29:36,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:36,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:36,658 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:36,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-22 01:29:36,659 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:29:36,660 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 01:29:36,660 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:29:36,660 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_#in~p) = 1*parts_#in~p Supporting invariants [] [2022-07-22 01:29:36,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2022-07-22 01:29:36,675 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 01:29:36,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:36,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 01:29:36,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:36,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:29:36,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:36,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:36,834 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 [2022-07-22 01:29:36,834 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 523 states and 769 transitions. cyclomatic complexity: 261 Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 01:29:36,892 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 523 states and 769 transitions. cyclomatic complexity: 261. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Result 695 states and 995 transitions. Complement of second has 20 states. [2022-07-22 01:29:36,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-22 01:29:36,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 01:29:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-07-22 01:29:36,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 40 letters. Loop has 5 letters. [2022-07-22 01:29:36,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:36,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 45 letters. Loop has 5 letters. [2022-07-22 01:29:36,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:36,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 40 letters. Loop has 10 letters. [2022-07-22 01:29:36,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:36,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 695 states and 995 transitions. [2022-07-22 01:29:36,897 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 95 [2022-07-22 01:29:36,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 695 states to 592 states and 863 transitions. [2022-07-22 01:29:36,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 233 [2022-07-22 01:29:36,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 242 [2022-07-22 01:29:36,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 592 states and 863 transitions. [2022-07-22 01:29:36,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:36,901 INFO L369 hiAutomatonCegarLoop]: Abstraction has 592 states and 863 transitions. [2022-07-22 01:29:36,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states and 863 transitions. [2022-07-22 01:29:36,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 567. [2022-07-22 01:29:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 404 states have (on average 1.113861386138614) internal successors, (450), 417 states have internal predecessors, (450), 103 states have call successors, (113), 73 states have call predecessors, (113), 60 states have return successors, (263), 76 states have call predecessors, (263), 97 states have call successors, (263) [2022-07-22 01:29:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 826 transitions. [2022-07-22 01:29:36,918 INFO L392 hiAutomatonCegarLoop]: Abstraction has 567 states and 826 transitions. [2022-07-22 01:29:36,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:29:36,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 01:29:36,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-22 01:29:36,918 INFO L87 Difference]: Start difference. First operand 567 states and 826 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 8 states have internal predecessors, (29), 5 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 01:29:37,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:29:37,015 INFO L93 Difference]: Finished difference Result 501 states and 620 transitions. [2022-07-22 01:29:37,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-22 01:29:37,016 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 501 states and 620 transitions. [2022-07-22 01:29:37,017 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 81 [2022-07-22 01:29:37,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 501 states to 436 states and 545 transitions. [2022-07-22 01:29:37,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2022-07-22 01:29:37,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2022-07-22 01:29:37,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 436 states and 545 transitions. [2022-07-22 01:29:37,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:37,020 INFO L369 hiAutomatonCegarLoop]: Abstraction has 436 states and 545 transitions. [2022-07-22 01:29:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states and 545 transitions. [2022-07-22 01:29:37,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 386. [2022-07-22 01:29:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 277 states have (on average 1.0722021660649819) internal successors, (297), 282 states have internal predecessors, (297), 65 states have call successors, (74), 47 states have call predecessors, (74), 44 states have return successors, (120), 56 states have call predecessors, (120), 59 states have call successors, (120) [2022-07-22 01:29:37,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 491 transitions. [2022-07-22 01:29:37,026 INFO L392 hiAutomatonCegarLoop]: Abstraction has 386 states and 491 transitions. [2022-07-22 01:29:37,026 INFO L374 stractBuchiCegarLoop]: Abstraction has 386 states and 491 transitions. [2022-07-22 01:29:37,026 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-22 01:29:37,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 386 states and 491 transitions. [2022-07-22 01:29:37,040 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 81 [2022-07-22 01:29:37,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:37,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:37,042 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:37,042 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:37,042 INFO L752 eck$LassoCheckResult]: Stem: 35279#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 35280#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 35291#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 35285#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 35286#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 35337#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 35289#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 35290#partsENTRY ~p := #in~p;~q := #in~q; 35597#L20 assume ~p <= 0;#res := 1; 35595#partsFINAL assume true; 35586#partsEXIT >#68#return; 35584#L36-1 havoc main_#t~ret8#1; 35582#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 35580#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 35576#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 35577#partsENTRY ~p := #in~p;~q := #in~q; 35605#L20 assume ~p <= 0;#res := 1; 35603#partsFINAL assume true; 35575#partsEXIT >#68#return; 35573#L36-1 havoc main_#t~ret8#1; 35572#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 35570#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 35567#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 35566#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 35565#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 35339#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 35509#partsENTRY ~p := #in~p;~q := #in~q; 35548#L20 assume !(~p <= 0); 35546#L21 assume ~q <= 0;#res := 0; 35545#partsFINAL assume true; 35508#partsEXIT >#68#return; 35507#L36-1 havoc main_#t~ret8#1; 35505#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 35338#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 35281#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 35287#partsENTRY ~p := #in~p;~q := #in~q; 35403#L20 assume !(~p <= 0); 35386#L21 assume !(~q <= 0); 35377#L22 assume !(~q > ~p); 35268#L23 [2022-07-22 01:29:37,042 INFO L754 eck$LassoCheckResult]: Loop: 35268#L23 call #t~ret1 := parts(~p - ~q, ~q);< 35267#partsENTRY ~p := #in~p;~q := #in~q; 35269#L20 assume ~p <= 0;#res := 1; 35617#partsFINAL assume true; 35273#partsEXIT >#64#return; 35274#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 35282#partsENTRY ~p := #in~p;~q := #in~q; 35646#L20 assume !(~p <= 0); 35645#L21 assume !(~q <= 0); 35644#L22 assume !(~q > ~p); 35268#L23 [2022-07-22 01:29:37,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:37,043 INFO L85 PathProgramCache]: Analyzing trace with hash 842569305, now seen corresponding path program 1 times [2022-07-22 01:29:37,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:37,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520286056] [2022-07-22 01:29:37,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:37,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:37,048 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:37,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:37,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:37,058 INFO L85 PathProgramCache]: Analyzing trace with hash 328559132, now seen corresponding path program 1 times [2022-07-22 01:29:37,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:37,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852930885] [2022-07-22 01:29:37,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:37,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:37,062 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:37,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:37,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:37,065 INFO L85 PathProgramCache]: Analyzing trace with hash 254276212, now seen corresponding path program 1 times [2022-07-22 01:29:37,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:37,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087735161] [2022-07-22 01:29:37,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:37,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:37,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:37,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 01:29:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:37,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 01:29:37,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:37,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 01:29:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:37,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-22 01:29:37,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:37,107 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-22 01:29:37,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:29:37,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087735161] [2022-07-22 01:29:37,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087735161] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:29:37,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298318154] [2022-07-22 01:29:37,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:37,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:29:37,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:37,121 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:29:37,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-07-22 01:29:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:37,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-22 01:29:37,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:37,172 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-22 01:29:37,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:29:37,199 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 34 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-07-22 01:29:37,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298318154] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:29:37,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:29:37,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2022-07-22 01:29:37,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069825216] [2022-07-22 01:29:37,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:29:37,315 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:37,315 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:37,315 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:37,316 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:37,316 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:29:37,316 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:37,316 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:37,316 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:37,316 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2022-07-22 01:29:37,316 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:37,316 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:37,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:37,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:37,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:37,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:37,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:37,362 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:37,362 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:29:37,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:37,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:37,364 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:37,371 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:37,371 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:37,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-07-22 01:29:37,387 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:37,387 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:37,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:37,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:37,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:37,421 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:37,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-07-22 01:29:37,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:37,423 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:37,443 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:37,443 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:37,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:37,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:37,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:37,472 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:37,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-07-22 01:29:37,474 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:37,474 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:37,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-07-22 01:29:37,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:37,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:37,520 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:37,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-07-22 01:29:37,522 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:29:37,522 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:39,475 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:29:39,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:39,480 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:39,481 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:39,481 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:39,481 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:39,481 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:29:39,481 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:39,481 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:39,481 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:39,481 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration14_Loop [2022-07-22 01:29:39,481 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:39,481 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:39,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:39,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:39,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:39,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:39,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:39,544 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:39,545 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:29:39,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:39,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:39,549 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:39,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-07-22 01:29:39,551 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:39,557 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:39,557 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:39,557 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:39,557 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:39,557 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:39,557 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:39,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:39,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:29:39,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:39,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:39,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:39,576 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:39,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-07-22 01:29:39,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:39,583 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:39,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:39,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:39,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:39,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:39,584 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:39,584 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:39,585 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:29:39,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:39,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:39,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:39,601 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:39,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-07-22 01:29:39,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:39,609 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:39,609 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:39,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:39,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:39,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:39,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:39,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:39,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:29:39,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:39,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:39,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:39,627 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:39,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-07-22 01:29:39,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:39,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:39,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:39,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:39,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:39,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:39,636 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:39,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:39,639 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:29:39,641 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 01:29:39,641 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 01:29:39,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:39,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:39,643 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:39,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-07-22 01:29:39,644 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:29:39,644 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 01:29:39,644 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:29:39,644 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2022-07-22 01:29:39,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2022-07-22 01:29:39,660 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 01:29:39,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:39,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 01:29:39,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:39,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:39,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 01:29:39,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:39,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:39,824 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 [2022-07-22 01:29:39,824 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 386 states and 491 transitions. cyclomatic complexity: 116 Second operand has 8 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 01:29:39,890 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 386 states and 491 transitions. cyclomatic complexity: 116. Second operand has 8 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Result 479 states and 586 transitions. Complement of second has 21 states. [2022-07-22 01:29:39,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-22 01:29:39,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 01:29:39,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 38 transitions. [2022-07-22 01:29:39,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 39 letters. Loop has 10 letters. [2022-07-22 01:29:39,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:39,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 49 letters. Loop has 10 letters. [2022-07-22 01:29:39,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:39,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 38 transitions. Stem has 39 letters. Loop has 20 letters. [2022-07-22 01:29:39,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:39,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 479 states and 586 transitions. [2022-07-22 01:29:39,893 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 81 [2022-07-22 01:29:39,895 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 479 states to 381 states and 484 transitions. [2022-07-22 01:29:39,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 179 [2022-07-22 01:29:39,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 179 [2022-07-22 01:29:39,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 381 states and 484 transitions. [2022-07-22 01:29:39,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:39,896 INFO L369 hiAutomatonCegarLoop]: Abstraction has 381 states and 484 transitions. [2022-07-22 01:29:39,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states and 484 transitions. [2022-07-22 01:29:39,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-07-22 01:29:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 273 states have (on average 1.0695970695970696) internal successors, (292), 278 states have internal predecessors, (292), 64 states have call successors, (72), 46 states have call predecessors, (72), 44 states have return successors, (120), 56 states have call predecessors, (120), 59 states have call successors, (120) [2022-07-22 01:29:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 484 transitions. [2022-07-22 01:29:39,901 INFO L392 hiAutomatonCegarLoop]: Abstraction has 381 states and 484 transitions. [2022-07-22 01:29:39,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:29:39,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 01:29:39,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-22 01:29:39,902 INFO L87 Difference]: Start difference. First operand 381 states and 484 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 6 states have internal predecessors, (28), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-22 01:29:39,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:40,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:29:40,005 INFO L93 Difference]: Finished difference Result 593 states and 727 transitions. [2022-07-22 01:29:40,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 01:29:40,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 593 states and 727 transitions. [2022-07-22 01:29:40,008 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 106 [2022-07-22 01:29:40,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 593 states to 536 states and 657 transitions. [2022-07-22 01:29:40,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 206 [2022-07-22 01:29:40,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 206 [2022-07-22 01:29:40,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 536 states and 657 transitions. [2022-07-22 01:29:40,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:40,011 INFO L369 hiAutomatonCegarLoop]: Abstraction has 536 states and 657 transitions. [2022-07-22 01:29:40,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states and 657 transitions. [2022-07-22 01:29:40,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 452. [2022-07-22 01:29:40,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 322 states have (on average 1.0745341614906831) internal successors, (346), 331 states have internal predecessors, (346), 78 states have call successors, (88), 55 states have call predecessors, (88), 52 states have return successors, (134), 65 states have call predecessors, (134), 70 states have call successors, (134) [2022-07-22 01:29:40,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 568 transitions. [2022-07-22 01:29:40,018 INFO L392 hiAutomatonCegarLoop]: Abstraction has 452 states and 568 transitions. [2022-07-22 01:29:40,018 INFO L374 stractBuchiCegarLoop]: Abstraction has 452 states and 568 transitions. [2022-07-22 01:29:40,019 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-22 01:29:40,019 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 452 states and 568 transitions. [2022-07-22 01:29:40,020 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 96 [2022-07-22 01:29:40,025 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:40,025 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:40,027 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 5, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:40,027 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:40,028 INFO L752 eck$LassoCheckResult]: Stem: 37630#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 37631#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 37640#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 37638#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 37639#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 37651#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 37628#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 37642#partsENTRY ~p := #in~p;~q := #in~q; 38070#L20 assume ~p <= 0;#res := 1; 38069#partsFINAL assume true; 37627#partsEXIT >#68#return; 37629#L36-1 havoc main_#t~ret8#1; 37694#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 37822#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 37620#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 37619#partsENTRY ~p := #in~p;~q := #in~q; 37621#L20 assume ~p <= 0;#res := 1; 38023#partsFINAL assume true; 37699#partsEXIT >#68#return; 37693#L36-1 havoc main_#t~ret8#1; 37680#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 37681#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 37647#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 37648#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 37649#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 37650#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 38066#partsENTRY ~p := #in~p;~q := #in~q; 38067#L20 assume !(~p <= 0); 37655#L21 assume ~q <= 0;#res := 0; 37656#partsFINAL assume true; 37692#partsEXIT >#68#return; 38061#L36-1 havoc main_#t~ret8#1; 37682#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 37683#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 37636#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 37641#partsENTRY ~p := #in~p;~q := #in~q; 38043#L20 assume !(~p <= 0); 38042#L21 assume !(~q <= 0); 37653#L22 assume !(~q > ~p); 37645#L23 call #t~ret1 := parts(~p - ~q, ~q);< 37646#partsENTRY ~p := #in~p;~q := #in~q; 38060#L20 assume ~p <= 0;#res := 1; 38058#partsFINAL assume true; 38057#partsEXIT >#64#return; 37635#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 37637#partsENTRY ~p := #in~p;~q := #in~q; 38065#L20 assume !(~p <= 0); 38064#L21 assume ~q <= 0;#res := 0; 38063#partsFINAL assume true; 38062#partsEXIT >#66#return; 37670#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 37671#partsFINAL assume true; 38059#partsEXIT >#68#return; 38006#L36-1 havoc main_#t~ret8#1; 37814#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 37815#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 37685#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 37973#partsENTRY ~p := #in~p;~q := #in~q; 37974#L20 assume !(~p <= 0); 37949#L21 assume !(~q <= 0); 37947#L22 assume !(~q > ~p); 37690#L23 [2022-07-22 01:29:40,028 INFO L754 eck$LassoCheckResult]: Loop: 37690#L23 call #t~ret1 := parts(~p - ~q, ~q);< 38025#partsENTRY ~p := #in~p;~q := #in~q; 37695#L20 assume ~p <= 0;#res := 1; 37689#partsFINAL assume true; 37691#partsEXIT >#64#return; 38024#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 38047#partsENTRY ~p := #in~p;~q := #in~q; 38046#L20 assume !(~p <= 0); 38045#L21 assume !(~q <= 0); 38044#L22 assume !(~q > ~p); 37690#L23 [2022-07-22 01:29:40,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:40,028 INFO L85 PathProgramCache]: Analyzing trace with hash -2104916166, now seen corresponding path program 1 times [2022-07-22 01:29:40,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:40,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31539884] [2022-07-22 01:29:40,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:40,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:40,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 01:29:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:40,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 01:29:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:40,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-22 01:29:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:40,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-22 01:29:40,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:40,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:40,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:40,121 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-22 01:29:40,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:29:40,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31539884] [2022-07-22 01:29:40,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31539884] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:29:40,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429059796] [2022-07-22 01:29:40,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:40,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:29:40,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:40,124 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:29:40,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2022-07-22 01:29:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:40,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:29:40,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-22 01:29:40,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:29:40,264 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-22 01:29:40,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429059796] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:29:40,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:29:40,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2022-07-22 01:29:40,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165535798] [2022-07-22 01:29:40,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:29:40,265 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:29:40,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:40,265 INFO L85 PathProgramCache]: Analyzing trace with hash 328559132, now seen corresponding path program 2 times [2022-07-22 01:29:40,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:40,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892628679] [2022-07-22 01:29:40,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:40,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:40,268 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:40,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:40,377 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:40,377 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:40,377 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:40,377 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:40,377 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:29:40,377 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:40,377 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:40,377 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:40,377 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2022-07-22 01:29:40,377 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:40,377 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:40,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:40,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:40,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:40,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:40,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:40,424 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:40,424 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:29:40,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:40,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:40,432 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:40,448 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:40,448 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:40,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-07-22 01:29:40,471 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:40,472 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:40,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:40,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:40,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:40,520 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:40,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-07-22 01:29:40,522 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:40,522 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:40,547 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:40,547 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:40,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:40,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:40,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:40,576 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:40,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-07-22 01:29:40,578 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:40,578 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:40,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:40,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:40,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:40,647 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:40,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-07-22 01:29:40,649 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:29:40,649 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:42,558 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:29:42,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2022-07-22 01:29:42,564 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:42,564 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:42,564 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:42,564 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:42,564 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:29:42,564 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:42,564 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:42,564 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:42,564 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration15_Loop [2022-07-22 01:29:42,564 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:42,565 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:42,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:42,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:42,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:42,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:42,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:42,630 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:42,630 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:29:42,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:42,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:42,652 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:42,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-07-22 01:29:42,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:42,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:42,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:42,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:42,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:42,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:42,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:42,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:42,688 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:29:42,690 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 01:29:42,690 INFO L444 ModelExtractionUtils]: 3 out of 6 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-22 01:29:42,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:42,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:42,691 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:42,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-07-22 01:29:42,693 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:29:42,693 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 01:29:42,693 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:29:42,693 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(parts_~q) = 1*parts_~q Supporting invariants [] [2022-07-22 01:29:42,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2022-07-22 01:29:42,709 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 01:29:42,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:42,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-22 01:29:42,739 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:42,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 01:29:42,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:42,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:42,999 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 [2022-07-22 01:29:42,999 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 452 states and 568 transitions. cyclomatic complexity: 129 Second operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-22 01:29:43,052 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 452 states and 568 transitions. cyclomatic complexity: 129. Second operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 465 states and 581 transitions. Complement of second has 12 states. [2022-07-22 01:29:43,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-22 01:29:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-22 01:29:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-07-22 01:29:43,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 61 letters. Loop has 10 letters. [2022-07-22 01:29:43,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:43,054 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 01:29:43,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:43,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-22 01:29:43,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:43,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 01:29:43,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:43,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:43,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 [2022-07-22 01:29:43,328 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 452 states and 568 transitions. cyclomatic complexity: 129 Second operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-22 01:29:43,392 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 452 states and 568 transitions. cyclomatic complexity: 129. Second operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 465 states and 581 transitions. Complement of second has 12 states. [2022-07-22 01:29:43,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-22 01:29:43,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-22 01:29:43,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-07-22 01:29:43,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 32 transitions. Stem has 61 letters. Loop has 10 letters. [2022-07-22 01:29:43,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:43,393 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 01:29:43,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:43,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-22 01:29:43,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:43,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 01:29:43,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:43,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:29:43,650 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 [2022-07-22 01:29:43,650 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 452 states and 568 transitions. cyclomatic complexity: 129 Second operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-22 01:29:43,762 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 452 states and 568 transitions. cyclomatic complexity: 129. Second operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Result 1437 states and 1746 transitions. Complement of second has 100 states. [2022-07-22 01:29:43,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-22 01:29:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-22 01:29:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-07-22 01:29:43,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 61 letters. Loop has 10 letters. [2022-07-22 01:29:43,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:43,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 71 letters. Loop has 10 letters. [2022-07-22 01:29:43,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:43,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 59 transitions. Stem has 61 letters. Loop has 20 letters. [2022-07-22 01:29:43,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:43,768 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1437 states and 1746 transitions. [2022-07-22 01:29:43,773 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 76 [2022-07-22 01:29:43,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1437 states to 682 states and 807 transitions. [2022-07-22 01:29:43,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 217 [2022-07-22 01:29:43,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 228 [2022-07-22 01:29:43,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 682 states and 807 transitions. [2022-07-22 01:29:43,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:43,777 INFO L369 hiAutomatonCegarLoop]: Abstraction has 682 states and 807 transitions. [2022-07-22 01:29:43,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states and 807 transitions. [2022-07-22 01:29:43,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 561. [2022-07-22 01:29:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 404 states have (on average 1.0717821782178218) internal successors, (433), 411 states have internal predecessors, (433), 88 states have call successors, (104), 74 states have call predecessors, (104), 69 states have return successors, (103), 75 states have call predecessors, (103), 81 states have call successors, (103) [2022-07-22 01:29:43,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 640 transitions. [2022-07-22 01:29:43,785 INFO L392 hiAutomatonCegarLoop]: Abstraction has 561 states and 640 transitions. [2022-07-22 01:29:43,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:29:43,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 01:29:43,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-22 01:29:43,786 INFO L87 Difference]: Start difference. First operand 561 states and 640 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 8 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2022-07-22 01:29:43,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:29:43,848 INFO L93 Difference]: Finished difference Result 644 states and 761 transitions. [2022-07-22 01:29:43,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 01:29:43,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 644 states and 761 transitions. [2022-07-22 01:29:43,851 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 104 [2022-07-22 01:29:43,853 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 644 states to 626 states and 739 transitions. [2022-07-22 01:29:43,853 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2022-07-22 01:29:43,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2022-07-22 01:29:43,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 626 states and 739 transitions. [2022-07-22 01:29:43,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:43,854 INFO L369 hiAutomatonCegarLoop]: Abstraction has 626 states and 739 transitions. [2022-07-22 01:29:43,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states and 739 transitions. [2022-07-22 01:29:43,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 565. [2022-07-22 01:29:43,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 407 states have (on average 1.0712530712530712) internal successors, (436), 414 states have internal predecessors, (436), 89 states have call successors, (105), 74 states have call predecessors, (105), 69 states have return successors, (104), 76 states have call predecessors, (104), 82 states have call successors, (104) [2022-07-22 01:29:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 645 transitions. [2022-07-22 01:29:43,861 INFO L392 hiAutomatonCegarLoop]: Abstraction has 565 states and 645 transitions. [2022-07-22 01:29:43,861 INFO L374 stractBuchiCegarLoop]: Abstraction has 565 states and 645 transitions. [2022-07-22 01:29:43,861 INFO L287 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-22 01:29:43,861 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 565 states and 645 transitions. [2022-07-22 01:29:43,862 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 72 [2022-07-22 01:29:43,862 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:43,862 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:43,863 INFO L179 hiAutomatonCegarLoop]: 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, 1] [2022-07-22 01:29:43,863 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 01:29:43,864 INFO L752 eck$LassoCheckResult]: Stem: 42888#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 42889#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 42900#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 42898#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 42899#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 42943#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 43379#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 43380#partsENTRY ~p := #in~p;~q := #in~q; 43382#L20 assume ~p <= 0;#res := 1; 43381#partsFINAL assume true; 43378#partsEXIT >#68#return; 43377#L36-1 havoc main_#t~ret8#1; 43376#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 42909#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 42910#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 43171#partsENTRY ~p := #in~p;~q := #in~q; 43398#L20 assume ~p <= 0;#res := 1; 43397#partsFINAL assume true; 43396#partsEXIT >#68#return; 43348#L36-1 havoc main_#t~ret8#1; 43346#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 43345#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 42937#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 43170#partsENTRY ~p := #in~p;~q := #in~q; 43172#L20 assume ~p <= 0;#res := 1; 42936#partsFINAL assume true; 42938#partsEXIT >#68#return; 43169#L36-1 havoc main_#t~ret8#1; 42928#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 42929#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 42906#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 42907#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 42908#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 42877#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 42876#partsENTRY ~p := #in~p;~q := #in~q; 42878#L20 assume !(~p <= 0); 42916#L21 assume ~q <= 0;#res := 0; 42917#partsFINAL assume true; 42886#partsEXIT >#68#return; 42887#L36-1 havoc main_#t~ret8#1; 42930#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 42931#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 42896#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 42901#partsENTRY ~p := #in~p;~q := #in~q; 43391#L20 assume !(~p <= 0); 43394#L21 assume !(~q <= 0); 43393#L22 assume !(~q > ~p); 42904#L23 call #t~ret1 := parts(~p - ~q, ~q);< 42905#partsENTRY ~p := #in~p;~q := #in~q; 43436#L20 assume ~p <= 0;#res := 1; 43433#partsFINAL assume true; 43430#partsEXIT >#64#return; 42895#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 42897#partsENTRY ~p := #in~p;~q := #in~q; 42941#L20 assume !(~p <= 0); 42942#L21 assume ~q <= 0;#res := 0; 43434#partsFINAL assume true; 43431#partsEXIT >#66#return; 42920#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 42921#partsFINAL assume true; 43437#partsEXIT >#68#return; 43405#L36-1 havoc main_#t~ret8#1; 43180#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 43174#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 42926#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 43147#partsENTRY ~p := #in~p;~q := #in~q; 43168#L20 assume !(~p <= 0); 43167#L21 assume !(~q <= 0); 42949#L22 assume ~q > ~p; 42874#L22-1 call #t~ret0 := parts(~p, ~p);< 42873#partsENTRY ~p := #in~p;~q := #in~q; 42875#L20 assume !(~p <= 0); 42915#L21 assume !(~q <= 0); 42911#L22 assume !(~q > ~p); 42902#L23 call #t~ret1 := parts(~p - ~q, ~q);< 42903#partsENTRY ~p := #in~p;~q := #in~q; 43115#L20 assume ~p <= 0;#res := 1; 43110#partsFINAL assume true; 43107#partsEXIT >#64#return; 42952#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 42959#partsENTRY ~p := #in~p;~q := #in~q; 43099#L20 assume !(~p <= 0); 43086#L21 assume ~q <= 0;#res := 0; 43087#partsFINAL assume true; 42951#partsEXIT >#66#return; 42950#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 42948#partsFINAL assume true; 42946#partsEXIT >#62#return; 42947#L22-2 #res := #t~ret0;havoc #t~ret0; 43155#partsFINAL assume true; 43144#partsEXIT >#68#return; 43143#L36-1 [2022-07-22 01:29:43,864 INFO L754 eck$LassoCheckResult]: Loop: 43143#L36-1 havoc main_#t~ret8#1; 43142#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 43141#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 43140#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 43138#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 43136#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 43133#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 43134#partsENTRY ~p := #in~p;~q := #in~q; 43139#L20 assume !(~p <= 0); 43137#L21 assume ~q <= 0;#res := 0; 43135#partsFINAL assume true; 43132#partsEXIT >#68#return; 43131#L36-1 havoc main_#t~ret8#1; 43130#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 43128#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 43077#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 43101#partsENTRY ~p := #in~p;~q := #in~q; 43369#L20 assume !(~p <= 0); 43368#L21 assume !(~q <= 0); 43367#L22 assume !(~q > ~p); 43362#L23 call #t~ret1 := parts(~p - ~q, ~q);< 43364#partsENTRY ~p := #in~p;~q := #in~q; 43370#L20 assume ~p <= 0;#res := 1; 43366#partsFINAL assume true; 43361#partsEXIT >#64#return; 43357#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 43358#partsENTRY ~p := #in~p;~q := #in~q; 43365#L20 assume !(~p <= 0); 43360#L21 assume ~q <= 0;#res := 0; 43359#partsFINAL assume true; 43356#partsEXIT >#66#return; 43355#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 43352#partsFINAL assume true; 43349#partsEXIT >#68#return; 43347#L36-1 havoc main_#t~ret8#1; 43344#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 43173#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 42883#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 43083#partsENTRY ~p := #in~p;~q := #in~q; 43051#L20 assume !(~p <= 0); 43047#L21 assume !(~q <= 0); 43021#L22 assume ~q > ~p; 42960#L22-1 call #t~ret0 := parts(~p, ~p);< 43116#partsENTRY ~p := #in~p;~q := #in~q; 43103#L20 assume !(~p <= 0); 43052#L21 assume !(~q <= 0); 43048#L22 assume !(~q > ~p); 42969#L23 call #t~ret1 := parts(~p - ~q, ~q);< 43108#partsENTRY ~p := #in~p;~q := #in~q; 43114#L20 assume ~p <= 0;#res := 1; 43109#partsFINAL assume true; 43106#partsEXIT >#64#return; 43080#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 43153#partsENTRY ~p := #in~p;~q := #in~q; 43094#L20 assume !(~p <= 0); 43095#L21 assume ~q <= 0;#res := 0; 43079#partsFINAL assume true; 43081#partsEXIT >#66#return; 43152#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 43151#partsFINAL assume true; 43150#partsEXIT >#62#return; 43149#L22-2 #res := #t~ret0;havoc #t~ret0; 43148#partsFINAL assume true; 43145#partsEXIT >#68#return; 43143#L36-1 [2022-07-22 01:29:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:43,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1579902911, now seen corresponding path program 1 times [2022-07-22 01:29:43,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:43,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503850717] [2022-07-22 01:29:43,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:43,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:43,885 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:43,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:43,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:43,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:43,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1566345406, now seen corresponding path program 1 times [2022-07-22 01:29:43,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:43,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653789797] [2022-07-22 01:29:43,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:43,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:43,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:43,902 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:43,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:43,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:43,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:43,909 INFO L85 PathProgramCache]: Analyzing trace with hash -432935168, now seen corresponding path program 2 times [2022-07-22 01:29:43,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:43,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661112423] [2022-07-22 01:29:43,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:43,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:43,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 01:29:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:43,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 01:29:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:43,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 01:29:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:43,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 01:29:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:43,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 01:29:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:43,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:43,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:43,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 01:29:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:43,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:43,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:43,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:43,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:43,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 01:29:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:43,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-22 01:29:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:44,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:44,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:44,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:44,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:44,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-22 01:29:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:44,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:44,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:44,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:44,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:44,030 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 169 proven. 82 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2022-07-22 01:29:44,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:29:44,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661112423] [2022-07-22 01:29:44,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661112423] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:29:44,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476499788] [2022-07-22 01:29:44,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 01:29:44,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:29:44,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:44,033 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:29:44,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2022-07-22 01:29:44,091 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 01:29:44,091 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:29:44,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 01:29:44,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:44,197 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 495 proven. 10 refuted. 0 times theorem prover too weak. 431 trivial. 0 not checked. [2022-07-22 01:29:44,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:29:44,371 INFO L134 CoverageAnalysis]: Checked inductivity of 936 backedges. 169 proven. 82 refuted. 0 times theorem prover too weak. 685 trivial. 0 not checked. [2022-07-22 01:29:44,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476499788] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:29:44,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:29:44,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 18 [2022-07-22 01:29:44,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207047077] [2022-07-22 01:29:44,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:29:44,915 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:44,915 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:44,915 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:44,915 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:44,915 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:29:44,915 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:44,915 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:44,915 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:44,915 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration16_Loop [2022-07-22 01:29:44,915 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:44,915 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:44,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:44,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:44,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:44,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:44,953 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:44,953 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:29:44,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:44,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:44,954 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:44,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-07-22 01:29:44,956 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:44,956 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:44,977 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:44,977 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret8#1=1} Honda state: {ULTIMATE.start_main_#t~ret8#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:44,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:44,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:44,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:44,996 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:44,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-07-22 01:29:44,998 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:44,998 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:45,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:45,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:45,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:45,021 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:45,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-07-22 01:29:45,023 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:29:45,023 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:45,189 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:29:45,193 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2022-07-22 01:29:45,193 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:45,193 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:45,193 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:45,193 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:45,193 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:29:45,193 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:45,193 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:45,193 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:45,193 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration16_Loop [2022-07-22 01:29:45,193 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:45,193 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:45,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:45,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:45,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:45,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:45,232 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:45,232 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:29:45,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:45,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:45,237 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:45,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-07-22 01:29:45,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:45,244 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:45,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:45,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:45,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:45,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:45,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:45,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:45,246 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 01:29:45,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:45,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:45,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:45,262 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:45,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-07-22 01:29:45,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:45,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:45,269 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:45,269 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:45,269 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:45,269 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:45,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:45,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:45,286 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:29:45,288 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 01:29:45,288 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 01:29:45,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:45,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:45,289 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:45,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-07-22 01:29:45,291 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:29:45,291 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 01:29:45,291 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:29:45,291 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 1 Supporting invariants [] [2022-07-22 01:29:45,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:45,306 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 01:29:45,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:45,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-22 01:29:45,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:45,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:45,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:45,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-22 01:29:45,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:45,972 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 16 proven. 48 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-22 01:29:45,972 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 [2022-07-22 01:29:45,973 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 565 states and 645 transitions. cyclomatic complexity: 91 Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2022-07-22 01:29:46,224 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 565 states and 645 transitions. cyclomatic complexity: 91. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) Result 1532 states and 1771 transitions. Complement of second has 53 states. [2022-07-22 01:29:46,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2022-07-22 01:29:46,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 12 states have internal predecessors, (51), 8 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2022-07-22 01:29:46,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2022-07-22 01:29:46,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 69 transitions. Stem has 91 letters. Loop has 64 letters. [2022-07-22 01:29:46,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:46,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 69 transitions. Stem has 155 letters. Loop has 64 letters. [2022-07-22 01:29:46,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:46,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 69 transitions. Stem has 91 letters. Loop has 128 letters. [2022-07-22 01:29:46,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:46,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1532 states and 1771 transitions. [2022-07-22 01:29:46,232 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 80 [2022-07-22 01:29:46,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1532 states to 1048 states and 1184 transitions. [2022-07-22 01:29:46,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 227 [2022-07-22 01:29:46,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 227 [2022-07-22 01:29:46,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1048 states and 1184 transitions. [2022-07-22 01:29:46,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:46,237 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1048 states and 1184 transitions. [2022-07-22 01:29:46,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states and 1184 transitions. [2022-07-22 01:29:46,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 870. [2022-07-22 01:29:46,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 627 states have (on average 1.062200956937799) internal successors, (666), 639 states have internal predecessors, (666), 135 states have call successors, (156), 111 states have call predecessors, (156), 108 states have return successors, (157), 119 states have call predecessors, (157), 127 states have call successors, (157) [2022-07-22 01:29:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 979 transitions. [2022-07-22 01:29:46,249 INFO L392 hiAutomatonCegarLoop]: Abstraction has 870 states and 979 transitions. [2022-07-22 01:29:46,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:29:46,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 01:29:46,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2022-07-22 01:29:46,250 INFO L87 Difference]: Start difference. First operand 870 states and 979 transitions. Second operand has 18 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 13 states have call successors, (19), 2 states have call predecessors, (19), 4 states have return successors, (19), 8 states have call predecessors, (19), 13 states have call successors, (19) [2022-07-22 01:29:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:29:46,386 INFO L93 Difference]: Finished difference Result 882 states and 998 transitions. [2022-07-22 01:29:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-22 01:29:46,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 882 states and 998 transitions. [2022-07-22 01:29:46,390 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 79 [2022-07-22 01:29:46,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 882 states to 687 states and 792 transitions. [2022-07-22 01:29:46,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 190 [2022-07-22 01:29:46,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 190 [2022-07-22 01:29:46,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 687 states and 792 transitions. [2022-07-22 01:29:46,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:46,393 INFO L369 hiAutomatonCegarLoop]: Abstraction has 687 states and 792 transitions. [2022-07-22 01:29:46,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states and 792 transitions. [2022-07-22 01:29:46,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 640. [2022-07-22 01:29:46,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 458 states have (on average 1.0655021834061136) internal successors, (488), 470 states have internal predecessors, (488), 103 states have call successors, (120), 82 states have call predecessors, (120), 79 states have return successors, (117), 87 states have call predecessors, (117), 95 states have call successors, (117) [2022-07-22 01:29:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 725 transitions. [2022-07-22 01:29:46,402 INFO L392 hiAutomatonCegarLoop]: Abstraction has 640 states and 725 transitions. [2022-07-22 01:29:46,402 INFO L374 stractBuchiCegarLoop]: Abstraction has 640 states and 725 transitions. [2022-07-22 01:29:46,402 INFO L287 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-07-22 01:29:46,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 640 states and 725 transitions. [2022-07-22 01:29:46,403 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 71 [2022-07-22 01:29:46,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:46,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:46,404 INFO L179 hiAutomatonCegarLoop]: 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, 1] [2022-07-22 01:29:46,404 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:46,405 INFO L752 eck$LassoCheckResult]: Stem: 48418#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 48419#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 48431#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 48425#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 48426#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 48504#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 48501#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 48502#partsENTRY ~p := #in~p;~q := #in~q; 48505#L20 assume ~p <= 0;#res := 1; 48503#partsFINAL assume true; 48500#partsEXIT >#68#return; 48498#L36-1 havoc main_#t~ret8#1; 48497#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 48495#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 48493#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 48486#partsENTRY ~p := #in~p;~q := #in~q; 48496#L20 assume ~p <= 0;#res := 1; 48494#partsFINAL assume true; 48492#partsEXIT >#68#return; 48491#L36-1 havoc main_#t~ret8#1; 48490#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 48488#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 48484#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 48485#partsENTRY ~p := #in~p;~q := #in~q; 48489#L20 assume ~p <= 0;#res := 1; 48487#partsFINAL assume true; 48483#partsEXIT >#68#return; 48482#L36-1 havoc main_#t~ret8#1; 48481#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 48480#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 48436#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 48437#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 48479#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 48840#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 48841#partsENTRY ~p := #in~p;~q := #in~q; 48878#L20 assume !(~p <= 0); 48876#L21 assume ~q <= 0;#res := 0; 48874#partsFINAL assume true; 48839#partsEXIT >#68#return; 48837#L36-1 havoc main_#t~ret8#1; 48469#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 48444#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 48445#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 48835#partsENTRY ~p := #in~p;~q := #in~q; 48907#L20 assume !(~p <= 0); 48904#L21 assume !(~q <= 0); 48901#L22 assume !(~q > ~p); 48896#L23 call #t~ret1 := parts(~p - ~q, ~q);< 48897#partsENTRY ~p := #in~p;~q := #in~q; 48910#L20 assume ~p <= 0;#res := 1; 48909#partsFINAL assume true; 48895#partsEXIT >#64#return; 48867#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 48868#partsENTRY ~p := #in~p;~q := #in~q; 48877#L20 assume !(~p <= 0); 48875#L21 assume ~q <= 0;#res := 0; 48873#partsFINAL assume true; 48866#partsEXIT >#66#return; 48862#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 48858#partsFINAL assume true; 48834#partsEXIT >#68#return; 48705#L36-1 havoc main_#t~ret8#1; 48703#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 48701#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 48511#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 48513#partsENTRY ~p := #in~p;~q := #in~q; 48704#L20 assume !(~p <= 0); 48702#L21 assume !(~q <= 0); 48517#L22 assume ~q > ~p; 48515#L22-1 call #t~ret0 := parts(~p, ~p);< 48632#partsENTRY ~p := #in~p;~q := #in~q; 48629#L20 assume !(~p <= 0); 48623#L21 assume !(~q <= 0); 48621#L22 assume !(~q > ~p); 48612#L23 call #t~ret1 := parts(~p - ~q, ~q);< 48615#partsENTRY ~p := #in~p;~q := #in~q; 48619#L20 assume ~p <= 0;#res := 1; 48617#partsFINAL assume true; 48611#partsEXIT >#64#return; 48520#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 48525#partsENTRY ~p := #in~p;~q := #in~q; 48814#L20 assume !(~p <= 0); 48627#L21 assume ~q <= 0;#res := 0; 48607#partsFINAL assume true; 48519#partsEXIT >#66#return; 48518#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 48514#partsFINAL assume true; 48516#partsEXIT >#62#return; 48707#L22-2 #res := #t~ret0;havoc #t~ret0; 48706#partsFINAL assume true; 48697#partsEXIT >#68#return; 48471#L36-1 [2022-07-22 01:29:46,405 INFO L754 eck$LassoCheckResult]: Loop: 48471#L36-1 havoc main_#t~ret8#1; 48468#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 48443#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 48434#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 48435#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 48662#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 48658#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 48659#partsENTRY ~p := #in~p;~q := #in~q; 48666#L20 assume !(~p <= 0); 48664#L21 assume ~q <= 0;#res := 0; 48661#partsFINAL assume true; 48657#partsEXIT >#68#return; 48653#L36-1 havoc main_#t~ret8#1; 48651#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 48649#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 48429#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 48430#partsENTRY ~p := #in~p;~q := #in~q; 49042#L20 assume !(~p <= 0); 48448#L21 assume ~q <= 0;#res := 0; 48449#partsFINAL assume true; 49035#partsEXIT >#68#return; 48976#L36-1 havoc main_#t~ret8#1; 48747#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 48745#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 48463#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 48743#partsENTRY ~p := #in~p;~q := #in~q; 48807#L20 assume !(~p <= 0); 48802#L21 assume !(~q <= 0); 48797#L22 assume !(~q > ~p); 48782#L23 call #t~ret1 := parts(~p - ~q, ~q);< 48763#partsENTRY ~p := #in~p;~q := #in~q; 48795#L20 assume ~p <= 0;#res := 1; 48794#partsFINAL assume true; 48781#partsEXIT >#64#return; 48770#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 48773#partsENTRY ~p := #in~p;~q := #in~q; 48793#L20 assume !(~p <= 0); 48792#L21 assume ~q <= 0;#res := 0; 48780#partsFINAL assume true; 48769#partsEXIT >#66#return; 48772#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 48779#partsFINAL assume true; 48741#partsEXIT >#68#return; 48719#L36-1 havoc main_#t~ret8#1; 48712#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 48709#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 48464#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 48698#partsENTRY ~p := #in~p;~q := #in~q; 48625#L20 assume !(~p <= 0); 48626#L21 assume !(~q <= 0); 48605#L22 assume ~q > ~p; 48507#L22-1 call #t~ret0 := parts(~p, ~p);< 48509#partsENTRY ~p := #in~p;~q := #in~q; 48631#L20 assume !(~p <= 0); 48628#L21 assume !(~q <= 0); 48608#L22 assume !(~q > ~p); 48531#L23 call #t~ret1 := parts(~p - ~q, ~q);< 48616#partsENTRY ~p := #in~p;~q := #in~q; 48620#L20 assume ~p <= 0;#res := 1; 48618#partsFINAL assume true; 48613#partsEXIT >#64#return; 48614#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 48722#partsENTRY ~p := #in~p;~q := #in~q; 48733#L20 assume !(~p <= 0); 48731#L21 assume ~q <= 0;#res := 0; 48729#partsFINAL assume true; 48721#partsEXIT >#66#return; 48720#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 48714#partsFINAL assume true; 48506#partsEXIT >#62#return; 48462#L22-2 #res := #t~ret0;havoc #t~ret0; 48465#partsFINAL assume true; 48510#partsEXIT >#68#return; 48471#L36-1 [2022-07-22 01:29:46,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:46,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1579902911, now seen corresponding path program 3 times [2022-07-22 01:29:46,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:46,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485441421] [2022-07-22 01:29:46,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:46,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:46,414 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:46,422 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:46,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:46,422 INFO L85 PathProgramCache]: Analyzing trace with hash -197259277, now seen corresponding path program 2 times [2022-07-22 01:29:46,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:46,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242983519] [2022-07-22 01:29:46,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:46,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 01:29:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 01:29:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-22 01:29:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-22 01:29:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,459 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 28 proven. 26 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-22 01:29:46,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:29:46,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242983519] [2022-07-22 01:29:46,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242983519] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:29:46,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342279887] [2022-07-22 01:29:46,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-22 01:29:46,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:29:46,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:46,476 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:29:46,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2022-07-22 01:29:46,531 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-22 01:29:46,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:29:46,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 01:29:46,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:46,544 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-22 01:29:46,545 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 01:29:46,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342279887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:29:46,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-22 01:29:46,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2022-07-22 01:29:46,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387703159] [2022-07-22 01:29:46,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:29:46,545 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:29:46,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:29:46,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 01:29:46,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-22 01:29:46,546 INFO L87 Difference]: Start difference. First operand 640 states and 725 transitions. cyclomatic complexity: 97 Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-22 01:29:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:29:46,591 INFO L93 Difference]: Finished difference Result 559 states and 620 transitions. [2022-07-22 01:29:46,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 01:29:46,591 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 559 states and 620 transitions. [2022-07-22 01:29:46,593 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 47 [2022-07-22 01:29:46,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 559 states to 483 states and 539 transitions. [2022-07-22 01:29:46,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2022-07-22 01:29:46,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 156 [2022-07-22 01:29:46,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 483 states and 539 transitions. [2022-07-22 01:29:46,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:46,595 INFO L369 hiAutomatonCegarLoop]: Abstraction has 483 states and 539 transitions. [2022-07-22 01:29:46,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states and 539 transitions. [2022-07-22 01:29:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 457. [2022-07-22 01:29:46,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 323 states have (on average 1.0588235294117647) internal successors, (342), 332 states have internal predecessors, (342), 77 states have call successors, (86), 60 states have call predecessors, (86), 57 states have return successors, (81), 64 states have call predecessors, (81), 70 states have call successors, (81) [2022-07-22 01:29:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 509 transitions. [2022-07-22 01:29:46,601 INFO L392 hiAutomatonCegarLoop]: Abstraction has 457 states and 509 transitions. [2022-07-22 01:29:46,601 INFO L374 stractBuchiCegarLoop]: Abstraction has 457 states and 509 transitions. [2022-07-22 01:29:46,601 INFO L287 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-07-22 01:29:46,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 457 states and 509 transitions. [2022-07-22 01:29:46,602 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 47 [2022-07-22 01:29:46,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:46,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:46,603 INFO L179 hiAutomatonCegarLoop]: 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, 1] [2022-07-22 01:29:46,603 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [22, 22, 17, 10, 8, 8, 8, 8, 8, 8, 7, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1] [2022-07-22 01:29:46,603 INFO L752 eck$LassoCheckResult]: Stem: 49932#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 49933#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 49943#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 49941#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 49942#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 50011#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 50008#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 50009#partsENTRY ~p := #in~p;~q := #in~q; 50012#L20 assume ~p <= 0;#res := 1; 50010#partsFINAL assume true; 50007#partsEXIT >#68#return; 50006#L36-1 havoc main_#t~ret8#1; 50005#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 50003#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 50001#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 49994#partsENTRY ~p := #in~p;~q := #in~q; 50004#L20 assume ~p <= 0;#res := 1; 50002#partsFINAL assume true; 50000#partsEXIT >#68#return; 49999#L36-1 havoc main_#t~ret8#1; 49998#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 49996#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 49992#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 49993#partsENTRY ~p := #in~p;~q := #in~q; 49997#L20 assume ~p <= 0;#res := 1; 49995#partsFINAL assume true; 49991#partsEXIT >#68#return; 49990#L36-1 havoc main_#t~ret8#1; 49989#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 49988#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 49953#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 49954#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 49987#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 49945#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 49946#partsENTRY ~p := #in~p;~q := #in~q; 50312#L20 assume !(~p <= 0); 50310#L21 assume ~q <= 0;#res := 0; 50308#partsFINAL assume true; 50307#partsEXIT >#68#return; 49984#L36-1 havoc main_#t~ret8#1; 49976#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 49956#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 49957#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 50126#partsENTRY ~p := #in~p;~q := #in~q; 50140#L20 assume !(~p <= 0); 50139#L21 assume !(~q <= 0); 50138#L22 assume !(~q > ~p); 50135#L23 call #t~ret1 := parts(~p - ~q, ~q);< 50136#partsENTRY ~p := #in~p;~q := #in~q; 50142#L20 assume ~p <= 0;#res := 1; 50141#partsFINAL assume true; 50134#partsEXIT >#64#return; 50131#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 50132#partsENTRY ~p := #in~p;~q := #in~q; 50146#L20 assume !(~p <= 0); 50144#L21 assume ~q <= 0;#res := 0; 50143#partsFINAL assume true; 50130#partsEXIT >#66#return; 50128#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 50127#partsFINAL assume true; 50125#partsEXIT >#68#return; 50124#L36-1 havoc main_#t~ret8#1; 50122#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 50120#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 49973#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 50099#partsENTRY ~p := #in~p;~q := #in~q; 50098#L20 assume !(~p <= 0); 50096#L21 assume !(~q <= 0); 50094#L22 assume ~q > ~p; 50021#L22-1 call #t~ret0 := parts(~p, ~p);< 50076#partsENTRY ~p := #in~p;~q := #in~q; 50075#L20 assume !(~p <= 0); 50074#L21 assume !(~q <= 0); 50071#L22 assume !(~q > ~p); 50035#L23 call #t~ret1 := parts(~p - ~q, ~q);< 50036#partsENTRY ~p := #in~p;~q := #in~q; 50057#L20 assume ~p <= 0;#res := 1; 50056#partsFINAL assume true; 50034#partsEXIT >#64#return; 50025#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 50030#partsENTRY ~p := #in~p;~q := #in~q; 50041#L20 assume !(~p <= 0); 50039#L21 assume ~q <= 0;#res := 0; 50032#partsFINAL assume true; 50024#partsEXIT >#66#return; 50023#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 50020#partsFINAL assume true; 50022#partsEXIT >#62#return; 49977#L22-2 #res := #t~ret0;havoc #t~ret0; 49978#partsFINAL assume true; 50371#partsEXIT >#68#return; 49982#L36-1 [2022-07-22 01:29:46,603 INFO L754 eck$LassoCheckResult]: Loop: 49982#L36-1 havoc main_#t~ret8#1; 49983#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 50013#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 49951#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 49952#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 49986#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 49927#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 49944#partsENTRY ~p := #in~p;~q := #in~q; 50376#L20 assume !(~p <= 0); 50375#L21 assume ~q <= 0;#res := 0; 49980#partsFINAL assume true; 49926#partsEXIT >#68#return; 49928#L36-1 havoc main_#t~ret8#1; 49975#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 49955#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 49921#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 50176#partsENTRY ~p := #in~p;~q := #in~q; 50329#L20 assume !(~p <= 0); 50322#L21 assume !(~q <= 0); 50318#L22 assume !(~q > ~p); 49924#L23 call #t~ret1 := parts(~p - ~q, ~q);< 49923#partsENTRY ~p := #in~p;~q := #in~q; 49925#L20 assume !(~p <= 0); 49985#L21 assume !(~q <= 0); 50349#L22 assume !(~q > ~p); 49964#L23 call #t~ret1 := parts(~p - ~q, ~q);< 50333#partsENTRY ~p := #in~p;~q := #in~q; 50344#L20 assume ~p <= 0;#res := 1; 50343#partsFINAL assume true; 50332#partsEXIT >#64#return; 50325#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 50328#partsENTRY ~p := #in~p;~q := #in~q; 50342#L20 assume !(~p <= 0); 50335#L21 assume ~q <= 0;#res := 0; 50331#partsFINAL assume true; 50324#partsEXIT >#66#return; 50321#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 50317#partsFINAL assume true; 50315#partsEXIT >#64#return; 50196#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 50197#partsENTRY ~p := #in~p;~q := #in~q; 50205#L20 assume !(~p <= 0); 50203#L21 assume ~q <= 0;#res := 0; 50201#partsFINAL assume true; 50195#partsEXIT >#66#return; 50193#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 50181#partsFINAL assume true; 50175#partsEXIT >#68#return; 50171#L36-1 havoc main_#t~ret8#1; 50169#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 50167#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 50016#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 50165#partsENTRY ~p := #in~p;~q := #in~q; 50216#L20 assume !(~p <= 0); 50212#L21 assume !(~q <= 0); 50211#L22 assume ~q > ~p; 50183#L22-1 call #t~ret0 := parts(~p, ~p);< 50184#partsENTRY ~p := #in~p;~q := #in~q; 50206#L20 assume !(~p <= 0); 50204#L21 assume !(~q <= 0); 50202#L22 assume !(~q > ~p); 50199#L23 call #t~ret1 := parts(~p - ~q, ~q);< 50200#partsENTRY ~p := #in~p;~q := #in~q; 50214#L20 assume ~p <= 0;#res := 1; 50207#partsFINAL assume true; 50198#partsEXIT >#64#return; 50189#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 50191#partsENTRY ~p := #in~p;~q := #in~q; 50243#L20 assume !(~p <= 0); 50241#L21 assume !(~q <= 0); 50239#L22 assume !(~q > ~p); 50232#L23 call #t~ret1 := parts(~p - ~q, ~q);< 50234#partsENTRY ~p := #in~p;~q := #in~q; 50280#L20 assume !(~p <= 0); 50278#L21 assume !(~q <= 0); 50276#L22 assume !(~q > ~p); 50272#L23 call #t~ret1 := parts(~p - ~q, ~q);< 50274#partsENTRY ~p := #in~p;~q := #in~q; 50283#L20 assume ~p <= 0;#res := 1; 50281#partsFINAL assume true; 50271#partsEXIT >#64#return; 50265#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 50267#partsENTRY ~p := #in~p;~q := #in~q; 50290#L20 assume !(~p <= 0); 50288#L21 assume ~q <= 0;#res := 0; 50287#partsFINAL assume true; 50263#partsEXIT >#66#return; 50259#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 50247#partsFINAL assume true; 50231#partsEXIT >#64#return; 50227#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 50229#partsENTRY ~p := #in~p;~q := #in~q; 50299#L20 assume !(~p <= 0); 50295#L21 assume ~q <= 0;#res := 0; 50293#partsFINAL assume true; 50226#partsEXIT >#66#return; 50217#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 50213#partsFINAL assume true; 50187#partsEXIT >#66#return; 50190#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 50194#partsFINAL assume true; 50182#partsEXIT >#62#return; 50178#L22-2 #res := #t~ret0;havoc #t~ret0; 50177#partsFINAL assume true; 50172#partsEXIT >#68#return; 50170#L36-1 havoc main_#t~ret8#1; 50168#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 50166#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 50017#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 50162#partsENTRY ~p := #in~p;~q := #in~q; 50160#L20 assume !(~p <= 0); 50157#L21 assume !(~q <= 0); 50018#L22 assume ~q > ~p; 49961#L22-1 call #t~ret0 := parts(~p, ~p);< 49972#partsENTRY ~p := #in~p;~q := #in~q; 50374#L20 assume !(~p <= 0); 50373#L21 assume !(~q <= 0); 49958#L22 assume !(~q > ~p); 49960#L23 call #t~ret1 := parts(~p - ~q, ~q);< 50038#partsENTRY ~p := #in~p;~q := #in~q; 50080#L20 assume ~p <= 0;#res := 1; 50079#partsFINAL assume true; 50037#partsEXIT >#64#return; 50027#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 50031#partsENTRY ~p := #in~p;~q := #in~q; 50108#L20 assume !(~p <= 0); 50106#L21 assume !(~q <= 0); 50105#L22 assume !(~q > ~p); 50103#L23 call #t~ret1 := parts(~p - ~q, ~q);< 50104#partsENTRY ~p := #in~p;~q := #in~q; 50123#L20 assume !(~p <= 0); 50121#L21 assume !(~q <= 0); 50118#L22 assume !(~q > ~p); 49935#L23 call #t~ret1 := parts(~p - ~q, ~q);< 50117#partsENTRY ~p := #in~p;~q := #in~q; 50304#L20 assume ~p <= 0;#res := 1; 49969#partsFINAL assume true; 50115#partsEXIT >#64#return; 50111#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 49938#partsENTRY ~p := #in~p;~q := #in~q; 50137#L20 assume !(~p <= 0); 50133#L21 assume ~q <= 0;#res := 0; 50129#partsFINAL assume true; 50110#partsEXIT >#66#return; 50109#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 50107#partsFINAL assume true; 50102#partsEXIT >#64#return; 50043#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 50050#partsENTRY ~p := #in~p;~q := #in~q; 50091#L20 assume !(~p <= 0); 50089#L21 assume ~q <= 0;#res := 0; 50088#partsFINAL assume true; 50042#partsEXIT >#66#return; 50040#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 50033#partsFINAL assume true; 50026#partsEXIT >#66#return; 50029#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 50369#partsFINAL assume true; 50014#partsEXIT >#62#return; 50015#L22-2 #res := #t~ret0;havoc #t~ret0; 50372#partsFINAL assume true; 50370#partsEXIT >#68#return; 49982#L36-1 [2022-07-22 01:29:46,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:46,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1579902911, now seen corresponding path program 4 times [2022-07-22 01:29:46,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:46,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230808574] [2022-07-22 01:29:46,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:46,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:46,611 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:46,618 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:46,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:46,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1395630766, now seen corresponding path program 3 times [2022-07-22 01:29:46,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:46,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112675326] [2022-07-22 01:29:46,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:46,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 01:29:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-22 01:29:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:46,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 01:29:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-22 01:29:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 01:29:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-22 01:29:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 01:29:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:46,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1219 backedges. 75 proven. 242 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2022-07-22 01:29:46,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:29:46,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112675326] [2022-07-22 01:29:46,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112675326] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:29:46,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983029895] [2022-07-22 01:29:46,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 01:29:46,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:29:46,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:46,802 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:29:46,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-07-22 01:29:46,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-22 01:29:46,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:29:46,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 01:29:46,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 1219 backedges. 654 proven. 121 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2022-07-22 01:29:46,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:29:47,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1219 backedges. 69 proven. 243 refuted. 0 times theorem prover too weak. 907 trivial. 0 not checked. [2022-07-22 01:29:47,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983029895] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:29:47,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:29:47,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 24 [2022-07-22 01:29:47,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608757568] [2022-07-22 01:29:47,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:29:47,262 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 01:29:47,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:29:47,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-22 01:29:47,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=459, Unknown=0, NotChecked=0, Total=552 [2022-07-22 01:29:47,262 INFO L87 Difference]: Start difference. First operand 457 states and 509 transitions. cyclomatic complexity: 61 Second operand has 24 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 23 states have internal predecessors, (80), 14 states have call successors, (23), 2 states have call predecessors, (23), 6 states have return successors, (24), 10 states have call predecessors, (24), 14 states have call successors, (24) [2022-07-22 01:29:47,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:29:47,545 INFO L93 Difference]: Finished difference Result 518 states and 579 transitions. [2022-07-22 01:29:47,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-22 01:29:47,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 518 states and 579 transitions. [2022-07-22 01:29:47,547 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 51 [2022-07-22 01:29:47,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 518 states to 518 states and 579 transitions. [2022-07-22 01:29:47,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 147 [2022-07-22 01:29:47,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 147 [2022-07-22 01:29:47,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 518 states and 579 transitions. [2022-07-22 01:29:47,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:47,549 INFO L369 hiAutomatonCegarLoop]: Abstraction has 518 states and 579 transitions. [2022-07-22 01:29:47,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states and 579 transitions. [2022-07-22 01:29:47,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 459. [2022-07-22 01:29:47,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 325 states have (on average 1.0584615384615386) internal successors, (344), 333 states have internal predecessors, (344), 77 states have call successors, (86), 61 states have call predecessors, (86), 57 states have return successors, (79), 64 states have call predecessors, (79), 70 states have call successors, (79) [2022-07-22 01:29:47,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 509 transitions. [2022-07-22 01:29:47,555 INFO L392 hiAutomatonCegarLoop]: Abstraction has 459 states and 509 transitions. [2022-07-22 01:29:47,555 INFO L374 stractBuchiCegarLoop]: Abstraction has 459 states and 509 transitions. [2022-07-22 01:29:47,555 INFO L287 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-07-22 01:29:47,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 459 states and 509 transitions. [2022-07-22 01:29:47,556 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 47 [2022-07-22 01:29:47,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:47,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:47,557 INFO L179 hiAutomatonCegarLoop]: 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, 1] [2022-07-22 01:29:47,557 INFO L180 hiAutomatonCegarLoop]: 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] [2022-07-22 01:29:47,557 INFO L752 eck$LassoCheckResult]: Stem: 52332#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 52333#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 52338#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 52336#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 52337#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 52387#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 52419#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 52420#partsENTRY ~p := #in~p;~q := #in~q; 52422#L20 assume ~p <= 0;#res := 1; 52421#partsFINAL assume true; 52418#partsEXIT >#68#return; 52417#L36-1 havoc main_#t~ret8#1; 52416#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 52415#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 52414#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 52403#partsENTRY ~p := #in~p;~q := #in~q; 52432#L20 assume ~p <= 0;#res := 1; 52431#partsFINAL assume true; 52413#partsEXIT >#68#return; 52409#L36-1 havoc main_#t~ret8#1; 52407#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 52405#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 52401#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 52402#partsENTRY ~p := #in~p;~q := #in~q; 52406#L20 assume ~p <= 0;#res := 1; 52404#partsFINAL assume true; 52400#partsEXIT >#68#return; 52399#L36-1 havoc main_#t~ret8#1; 52393#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 52391#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 52350#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 52351#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 52388#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 52561#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 52562#partsENTRY ~p := #in~p;~q := #in~q; 52565#L20 assume !(~p <= 0); 52564#L21 assume ~q <= 0;#res := 0; 52563#partsFINAL assume true; 52560#partsEXIT >#68#return; 52559#L36-1 havoc main_#t~ret8#1; 52374#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 52354#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 52342#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 52343#partsENTRY ~p := #in~p;~q := #in~q; 52593#L20 assume !(~p <= 0); 52588#L21 assume !(~q <= 0); 52584#L22 assume !(~q > ~p); 52581#L23 call #t~ret1 := parts(~p - ~q, ~q);< 52582#partsENTRY ~p := #in~p;~q := #in~q; 52602#L20 assume ~p <= 0;#res := 1; 52601#partsFINAL assume true; 52580#partsEXIT >#64#return; 52577#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 52578#partsENTRY ~p := #in~p;~q := #in~q; 52608#L20 assume !(~p <= 0); 52606#L21 assume ~q <= 0;#res := 0; 52604#partsFINAL assume true; 52576#partsEXIT >#66#return; 52572#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 52570#partsFINAL assume true; 52568#partsEXIT >#68#return; 52558#L36-1 havoc main_#t~ret8#1; 52477#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 52408#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 52376#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 52472#partsENTRY ~p := #in~p;~q := #in~q; 52471#L20 assume !(~p <= 0); 52469#L21 assume !(~q <= 0); 52467#L22 assume ~q > ~p; 52427#L22-1 call #t~ret0 := parts(~p, ~p);< 52428#partsENTRY ~p := #in~p;~q := #in~q; 52478#L20 assume !(~p <= 0); 52474#L21 assume !(~q <= 0); 52466#L22 assume !(~q > ~p); 52464#L23 call #t~ret1 := parts(~p - ~q, ~q);< 52465#partsENTRY ~p := #in~p;~q := #in~q; 52492#L20 assume ~p <= 0;#res := 1; 52481#partsFINAL assume true; 52463#partsEXIT >#64#return; 52443#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 52448#partsENTRY ~p := #in~p;~q := #in~q; 52457#L20 assume !(~p <= 0); 52454#L21 assume ~q <= 0;#res := 0; 52450#partsFINAL assume true; 52442#partsEXIT >#66#return; 52444#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 52437#partsFINAL assume true; 52438#partsEXIT >#62#return; 52375#L22-2 #res := #t~ret0;havoc #t~ret0; 52377#partsFINAL assume true; 52410#partsEXIT >#68#return; 52392#L36-1 [2022-07-22 01:29:47,558 INFO L754 eck$LassoCheckResult]: Loop: 52392#L36-1 havoc main_#t~ret8#1; 52390#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 52389#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 52348#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 52349#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 52352#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 52353#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 52430#partsENTRY ~p := #in~p;~q := #in~q; 52435#L20 assume !(~p <= 0); 52434#L21 assume ~q <= 0;#res := 0; 52433#partsFINAL assume true; 52429#partsEXIT >#68#return; 52382#L36-1 havoc main_#t~ret8#1; 52372#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 52373#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 52339#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 52341#partsENTRY ~p := #in~p;~q := #in~q; 52710#L20 assume !(~p <= 0); 52709#L21 assume !(~q <= 0); 52708#L22 assume !(~q > ~p); 52706#L23 call #t~ret1 := parts(~p - ~q, ~q);< 52707#partsENTRY ~p := #in~p;~q := #in~q; 52739#L20 assume !(~p <= 0); 52738#L21 assume !(~q <= 0); 52737#L22 assume !(~q > ~p); 52735#L23 call #t~ret1 := parts(~p - ~q, ~q);< 52736#partsENTRY ~p := #in~p;~q := #in~q; 52762#L20 assume ~p <= 0;#res := 1; 52763#partsFINAL assume true; 52733#partsEXIT >#64#return; 52729#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 52732#partsENTRY ~p := #in~p;~q := #in~q; 52766#L20 assume !(~p <= 0); 52759#L21 assume ~q <= 0;#res := 0; 52758#partsFINAL assume true; 52728#partsEXIT >#66#return; 52727#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 52726#partsFINAL assume true; 52705#partsEXIT >#64#return; 52689#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 52690#partsENTRY ~p := #in~p;~q := #in~q; 52698#L20 assume !(~p <= 0); 52697#L21 assume ~q <= 0;#res := 0; 52695#partsFINAL assume true; 52688#partsEXIT >#66#return; 52685#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 52683#partsFINAL assume true; 52681#partsEXIT >#68#return; 52383#L36-1 havoc main_#t~ret8#1; 52384#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 52555#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 52396#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 52554#partsENTRY ~p := #in~p;~q := #in~q; 52645#L20 assume !(~p <= 0); 52644#L21 assume !(~q <= 0); 52641#L22 assume !(~q > ~p); 52370#L23 call #t~ret1 := parts(~p - ~q, ~q);< 52639#partsENTRY ~p := #in~p;~q := #in~q; 52642#L20 assume ~p <= 0;#res := 1; 52640#partsFINAL assume true; 52638#partsEXIT >#64#return; 52618#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 52621#partsENTRY ~p := #in~p;~q := #in~q; 52679#L20 assume !(~p <= 0); 52678#L21 assume !(~q <= 0); 52677#L22 assume !(~q > ~p); 52331#L23 call #t~ret1 := parts(~p - ~q, ~q);< 52328#partsENTRY ~p := #in~p;~q := #in~q; 52330#L20 assume !(~p <= 0); 52767#L21 assume !(~q <= 0); 52356#L22 assume !(~q > ~p); 52320#L23 call #t~ret1 := parts(~p - ~q, ~q);< 52347#partsENTRY ~p := #in~p;~q := #in~q; 52771#L20 assume ~p <= 0;#res := 1; 52365#partsFINAL assume true; 52319#partsEXIT >#64#return; 52323#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 52335#partsENTRY ~p := #in~p;~q := #in~q; 52386#L20 assume !(~p <= 0); 52360#L21 assume ~q <= 0;#res := 0; 52361#partsFINAL assume true; 52770#partsEXIT >#66#return; 52769#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 52768#partsFINAL assume true; 52675#partsEXIT >#64#return; 52632#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 52635#partsENTRY ~p := #in~p;~q := #in~q; 52712#L20 assume !(~p <= 0); 52711#L21 assume ~q <= 0;#res := 0; 52671#partsFINAL assume true; 52631#partsEXIT >#66#return; 52629#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 52625#partsFINAL assume true; 52617#partsEXIT >#66#return; 52615#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 52613#partsFINAL assume true; 52611#partsEXIT >#68#return; 52609#L36-1 havoc main_#t~ret8#1; 52411#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 52412#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 52395#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 52397#partsENTRY ~p := #in~p;~q := #in~q; 52537#L20 assume !(~p <= 0); 52535#L21 assume !(~q <= 0); 52533#L22 assume ~q > ~p; 52424#L22-1 call #t~ret0 := parts(~p, ~p);< 52461#partsENTRY ~p := #in~p;~q := #in~q; 52460#L20 assume !(~p <= 0); 52459#L21 assume !(~q <= 0); 52456#L22 assume !(~q > ~p); 52452#L23 call #t~ret1 := parts(~p - ~q, ~q);< 52453#partsENTRY ~p := #in~p;~q := #in~q; 52458#L20 assume ~p <= 0;#res := 1; 52455#partsFINAL assume true; 52451#partsEXIT >#64#return; 52446#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 52449#partsENTRY ~p := #in~p;~q := #in~q; 52504#L20 assume !(~p <= 0); 52501#L21 assume !(~q <= 0); 52498#L22 assume !(~q > ~p); 52327#L23 call #t~ret1 := parts(~p - ~q, ~q);< 52324#partsENTRY ~p := #in~p;~q := #in~q; 52326#L20 assume !(~p <= 0); 52724#L21 assume !(~q <= 0); 52719#L22 assume !(~q > ~p); 52314#L23 call #t~ret1 := parts(~p - ~q, ~q);< 52714#partsENTRY ~p := #in~p;~q := #in~q; 52718#L20 assume ~p <= 0;#res := 1; 52363#partsFINAL assume true; 52313#partsEXIT >#64#return; 52317#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 52334#partsENTRY ~p := #in~p;~q := #in~q; 52725#L20 assume !(~p <= 0); 52723#L21 assume ~q <= 0;#res := 0; 52720#partsFINAL assume true; 52676#partsEXIT >#66#return; 52610#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 52566#partsFINAL assume true; 52493#partsEXIT >#64#return; 52483#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 52490#partsENTRY ~p := #in~p;~q := #in~q; 52549#L20 assume !(~p <= 0); 52548#L21 assume ~q <= 0;#res := 0; 52547#partsFINAL assume true; 52482#partsEXIT >#66#return; 52480#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 52462#partsFINAL assume true; 52445#partsEXIT >#66#return; 52440#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 52441#partsFINAL assume true; 52423#partsEXIT >#62#return; 52426#L22-2 #res := #t~ret0;havoc #t~ret0; 52479#partsFINAL assume true; 52394#partsEXIT >#68#return; 52392#L36-1 [2022-07-22 01:29:47,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:47,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1579902911, now seen corresponding path program 5 times [2022-07-22 01:29:47,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:47,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7719255] [2022-07-22 01:29:47,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:47,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:47,577 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:47,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:47,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:47,584 INFO L85 PathProgramCache]: Analyzing trace with hash -917288381, now seen corresponding path program 4 times [2022-07-22 01:29:47,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:47,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591202822] [2022-07-22 01:29:47,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:47,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:47,597 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:47,626 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:47,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash 8683649, now seen corresponding path program 6 times [2022-07-22 01:29:47,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:47,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745337409] [2022-07-22 01:29:47,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:47,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-22 01:29:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-22 01:29:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-22 01:29:47,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-22 01:29:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-22 01:29:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-22 01:29:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:47,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-22 01:29:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-22 01:29:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 01:29:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-22 01:29:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:47,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 01:29:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-22 01:29:47,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-22 01:29:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-22 01:29:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-22 01:29:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 26 proven. 144 refuted. 0 times theorem prover too weak. 2435 trivial. 0 not checked. [2022-07-22 01:29:47,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:29:47,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745337409] [2022-07-22 01:29:47,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745337409] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:29:47,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404720590] [2022-07-22 01:29:47,756 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-22 01:29:47,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:29:47,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:47,757 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:29:47,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2022-07-22 01:29:47,841 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-07-22 01:29:47,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:29:47,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-22 01:29:47,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:48,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 1149 proven. 151 refuted. 0 times theorem prover too weak. 1305 trivial. 0 not checked. [2022-07-22 01:29:48,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:29:48,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2605 backedges. 186 proven. 220 refuted. 0 times theorem prover too weak. 2199 trivial. 0 not checked. [2022-07-22 01:29:48,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404720590] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:29:48,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:29:48,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 34 [2022-07-22 01:29:48,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729618256] [2022-07-22 01:29:48,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:29:49,685 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:49,685 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:49,685 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:49,685 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:49,685 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:29:49,685 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:49,685 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:49,685 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:49,685 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration19_Loop [2022-07-22 01:29:49,685 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:49,685 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:49,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:49,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:49,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:49,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:49,733 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:49,734 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:29:49,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:49,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:49,735 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:49,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-07-22 01:29:49,739 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:49,739 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:49,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2022-07-22 01:29:49,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:49,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:49,761 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:49,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2022-07-22 01:29:49,763 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:29:49,763 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:49,918 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 01:29:49,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:49,923 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:49,923 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:49,924 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:49,924 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:49,924 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:29:49,924 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:49,924 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:49,924 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:49,924 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration19_Loop [2022-07-22 01:29:49,924 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:49,924 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:49,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:49,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:49,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:49,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:49,984 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:49,985 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:29:49,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:49,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:49,986 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:49,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-07-22 01:29:49,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:29:49,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:29:49,994 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 01:29:49,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:29:49,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 01:29:49,995 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:29:49,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 01:29:49,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 01:29:49,998 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:29:50,000 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 01:29:50,000 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 01:29:50,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:50,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:50,002 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:50,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-07-22 01:29:50,003 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:29:50,003 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 01:29:50,003 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:29:50,003 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~p~0#1) = -2*ULTIMATE.start_main_~p~0#1 + 3 Supporting invariants [] [2022-07-22 01:29:50,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:50,026 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 01:29:50,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:50,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-22 01:29:50,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:29:50,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-22 01:29:50,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:29:50,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1108 backedges. 27 proven. 247 refuted. 0 times theorem prover too weak. 834 trivial. 0 not checked. [2022-07-22 01:29:50,939 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 [2022-07-22 01:29:50,940 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 459 states and 509 transitions. cyclomatic complexity: 60 Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 9 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2022-07-22 01:29:51,227 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 459 states and 509 transitions. cyclomatic complexity: 60. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 9 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) Result 1346 states and 1565 transitions. Complement of second has 83 states. [2022-07-22 01:29:51,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 11 non-accepting loop states 1 accepting loop states [2022-07-22 01:29:51,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 13 states have internal predecessors, (53), 9 states have call successors, (13), 2 states have call predecessors, (13), 5 states have return successors, (16), 8 states have call predecessors, (16), 9 states have call successors, (16) [2022-07-22 01:29:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2022-07-22 01:29:51,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 85 transitions. Stem has 91 letters. Loop has 154 letters. [2022-07-22 01:29:51,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:51,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 85 transitions. Stem has 245 letters. Loop has 154 letters. [2022-07-22 01:29:51,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:51,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 85 transitions. Stem has 91 letters. Loop has 308 letters. [2022-07-22 01:29:51,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:29:51,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1346 states and 1565 transitions. [2022-07-22 01:29:51,234 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 58 [2022-07-22 01:29:51,238 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1346 states to 1179 states and 1353 transitions. [2022-07-22 01:29:51,238 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 192 [2022-07-22 01:29:51,238 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 192 [2022-07-22 01:29:51,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1179 states and 1353 transitions. [2022-07-22 01:29:51,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:51,238 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1179 states and 1353 transitions. [2022-07-22 01:29:51,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states and 1353 transitions. [2022-07-22 01:29:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 852. [2022-07-22 01:29:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 594 states have (on average 1.0555555555555556) internal successors, (627), 610 states have internal predecessors, (627), 148 states have call successors, (159), 109 states have call predecessors, (159), 110 states have return successors, (159), 132 states have call predecessors, (159), 140 states have call successors, (159) [2022-07-22 01:29:51,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 945 transitions. [2022-07-22 01:29:51,249 INFO L392 hiAutomatonCegarLoop]: Abstraction has 852 states and 945 transitions. [2022-07-22 01:29:51,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:29:51,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-22 01:29:51,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2022-07-22 01:29:51,250 INFO L87 Difference]: Start difference. First operand 852 states and 945 transitions. Second operand has 34 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 34 states have internal predecessors, (115), 22 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (30), 21 states have call predecessors, (30), 22 states have call successors, (30) [2022-07-22 01:29:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:29:51,836 INFO L93 Difference]: Finished difference Result 1074 states and 1248 transitions. [2022-07-22 01:29:51,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-22 01:29:51,837 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1074 states and 1248 transitions. [2022-07-22 01:29:51,840 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 65 [2022-07-22 01:29:51,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1074 states to 1036 states and 1202 transitions. [2022-07-22 01:29:51,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 165 [2022-07-22 01:29:51,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 178 [2022-07-22 01:29:51,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1036 states and 1202 transitions. [2022-07-22 01:29:51,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:29:51,843 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1036 states and 1202 transitions. [2022-07-22 01:29:51,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states and 1202 transitions. [2022-07-22 01:29:51,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 906. [2022-07-22 01:29:51,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 636 states have (on average 1.0534591194968554) internal successors, (670), 655 states have internal predecessors, (670), 160 states have call successors, (175), 109 states have call predecessors, (175), 110 states have return successors, (173), 141 states have call predecessors, (173), 151 states have call successors, (173) [2022-07-22 01:29:51,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1018 transitions. [2022-07-22 01:29:51,879 INFO L392 hiAutomatonCegarLoop]: Abstraction has 906 states and 1018 transitions. [2022-07-22 01:29:51,879 INFO L374 stractBuchiCegarLoop]: Abstraction has 906 states and 1018 transitions. [2022-07-22 01:29:51,879 INFO L287 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2022-07-22 01:29:51,880 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 906 states and 1018 transitions. [2022-07-22 01:29:51,881 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 47 [2022-07-22 01:29:51,882 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:29:51,882 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:29:51,882 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [13, 12, 8, 8, 8, 7, 7, 7, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:29:51,882 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-22 01:29:51,883 INFO L752 eck$LassoCheckResult]: Stem: 58890#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 58891#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~ret8#1, main_#t~post7#1, main_~q~0#1, main_#t~post6#1, main_~p~0#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;main_~x~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1; 58899#L28 assume !(main_~x~0#1 < 0);main_~y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; 58897#L31 assume !(main_~y~0#1 < 0);main_~z~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;main_~p~0#1 := 0; 58898#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 59161#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 59158#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 59159#partsENTRY ~p := #in~p;~q := #in~q; 59162#L20 assume ~p <= 0;#res := 1; 59160#partsFINAL assume true; 59157#partsEXIT >#68#return; 59156#L36-1 havoc main_#t~ret8#1; 59154#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 59152#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 59149#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 59079#partsENTRY ~p := #in~p;~q := #in~q; 59155#L20 assume ~p <= 0;#res := 1; 59153#partsFINAL assume true; 59148#partsEXIT >#68#return; 59146#L36-1 havoc main_#t~ret8#1; 59144#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 59082#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 59076#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 59078#partsENTRY ~p := #in~p;~q := #in~q; 59141#L20 assume ~p <= 0;#res := 1; 59136#partsFINAL assume true; 59074#partsEXIT >#68#return; 59073#L36-1 havoc main_#t~ret8#1; 59072#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 59067#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 59065#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 59064#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 59063#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 59053#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 59056#partsENTRY ~p := #in~p;~q := #in~q; 59140#L20 assume !(~p <= 0); 59139#L21 assume ~q <= 0;#res := 0; 59138#partsFINAL assume true; 59052#partsEXIT >#68#return; 59055#L36-1 havoc main_#t~ret8#1; 59044#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 59040#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 59034#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 59036#partsENTRY ~p := #in~p;~q := #in~q; 59059#L20 assume !(~p <= 0); 59058#L21 assume !(~q <= 0); 59057#L22 assume !(~q > ~p); 59050#L23 call #t~ret1 := parts(~p - ~q, ~q);< 59051#partsENTRY ~p := #in~p;~q := #in~q; 59089#L20 assume ~p <= 0;#res := 1; 59088#partsFINAL assume true; 59049#partsEXIT >#64#return; 59046#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 59047#partsENTRY ~p := #in~p;~q := #in~q; 59062#L20 assume !(~p <= 0); 59061#L21 assume ~q <= 0;#res := 0; 59060#partsFINAL assume true; 59045#partsEXIT >#66#return; 59042#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 59038#partsFINAL assume true; 59032#partsEXIT >#68#return; 59029#L36-1 havoc main_#t~ret8#1; 59026#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 59025#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 58881#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 59021#partsENTRY ~p := #in~p;~q := #in~q; 59017#L20 assume !(~p <= 0); 59012#L21 assume !(~q <= 0); 59011#L22 assume ~q > ~p; 58964#L22-1 call #t~ret0 := parts(~p, ~p);< 58965#partsENTRY ~p := #in~p;~q := #in~q; 59084#L20 assume !(~p <= 0); 59083#L21 assume !(~q <= 0); 59005#L22 assume !(~q > ~p); 58982#L23 call #t~ret1 := parts(~p - ~q, ~q);< 58983#partsENTRY ~p := #in~p;~q := #in~q; 59101#L20 assume ~p <= 0;#res := 1; 59004#partsFINAL assume true; 58981#partsEXIT >#64#return; 58973#L23-1 call #t~ret2 := parts(~p, ~q - 1);< 58977#partsENTRY ~p := #in~p;~q := #in~q; 58989#L20 assume !(~p <= 0); 58987#L21 assume ~q <= 0;#res := 0; 58979#partsFINAL assume true; 58972#partsEXIT >#66#return; 58970#L23-2 #res := #t~ret1 + #t~ret2;havoc #t~ret1;havoc #t~ret2; 58966#partsFINAL assume true; 58967#partsEXIT >#62#return; 58942#L22-2 #res := #t~ret0;havoc #t~ret0; 58943#partsFINAL assume true; 58880#partsEXIT >#68#return; 58884#L36-1 havoc main_#t~ret8#1; 58952#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 59178#L35-3 assume !(main_~q~0#1 <= main_~x~0#1); 58909#L34-2 main_#t~post6#1 := main_~p~0#1;main_~p~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; 58910#L34-3 assume !!(main_~p~0#1 <= main_~x~0#1);main_~q~0#1 := 0; 58913#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 58875#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 58873#partsENTRY ~p := #in~p;~q := #in~q; 58876#L20 assume !(~p <= 0); 58922#L21 assume ~q <= 0;#res := 0; 58923#partsFINAL assume true; 59345#partsEXIT >#68#return; 59217#L36-1 havoc main_#t~ret8#1; 58939#L35-2 main_#t~post7#1 := main_~q~0#1;main_~q~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; 58940#L35-3 assume !!(main_~q~0#1 <= main_~x~0#1); 58904#L36 call main_#t~ret8#1 := parts(main_~p~0#1, main_~q~0#1);< 59037#partsENTRY ~p := #in~p;~q := #in~q; 59031#L20 assume !(~p <= 0); 59027#L21 assume !(~q <= 0); 58971#L22 assume !(~q > ~p); 58902#L23 [2022-07-22 01:29:51,883 INFO L754 eck$LassoCheckResult]: Loop: 58902#L23 call #t~ret1 := parts(~p - ~q, ~q);< 58905#partsENTRY ~p := #in~p;~q := #in~q; 58953#L20 assume !(~p <= 0); 58954#L21 assume !(~q <= 0); 59013#L22 assume !(~q > ~p); 58902#L23 [2022-07-22 01:29:51,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:51,883 INFO L85 PathProgramCache]: Analyzing trace with hash 912745189, now seen corresponding path program 7 times [2022-07-22 01:29:51,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:51,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329068693] [2022-07-22 01:29:51,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:51,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:51,896 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:51,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:51,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:51,907 INFO L85 PathProgramCache]: Analyzing trace with hash 86815080, now seen corresponding path program 2 times [2022-07-22 01:29:51,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:51,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134781241] [2022-07-22 01:29:51,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:51,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:51,910 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:51,911 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:51,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:29:51,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1998814468, now seen corresponding path program 8 times [2022-07-22 01:29:51,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:29:51,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896932748] [2022-07-22 01:29:51,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:29:51,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:29:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:51,923 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:29:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:29:51,936 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:29:52,010 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:29:52,010 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:29:52,010 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:29:52,010 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:29:52,011 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 01:29:52,011 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:52,011 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:29:52,011 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:29:52,011 INFO L133 ssoRankerPreferences]: Filename of dumped script: Parts.c_Iteration20_Loop [2022-07-22 01:29:52,011 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:29:52,011 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:29:52,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:52,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:52,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:52,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:52,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:29:52,063 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:29:52,064 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 01:29:52,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:52,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:52,080 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:52,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2022-07-22 01:29:52,083 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:52,083 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:52,103 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:52,103 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret0=0} Honda state: {parts_#t~ret0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:52,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:52,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:52,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:52,161 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:52,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2022-07-22 01:29:52,163 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:52,163 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:52,183 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:52,183 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#res=0} Honda state: {parts_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:52,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:52,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:52,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:52,218 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:52,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2022-07-22 01:29:52,220 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:52,220 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:52,247 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:52,247 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret2=0} Honda state: {parts_#t~ret2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:52,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2022-07-22 01:29:52,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:52,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:52,266 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:52,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-07-22 01:29:52,268 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:52,268 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:52,274 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 01:29:52,275 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {parts_#t~ret1=0} Honda state: {parts_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 01:29:52,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2022-07-22 01:29:52,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:52,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:52,291 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:52,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-07-22 01:29:52,293 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 01:29:52,293 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 01:29:52,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2022-07-22 01:29:52,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:29:52,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:29:52,323 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:29:52,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-07-22 01:29:52,325 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 01:29:52,325 INFO L160 nArgumentSynthesizer]: Using integer mode.