./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Ex08.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 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-restricted-15/Ex08.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 e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 14:51:37,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 14:51:37,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 14:51:37,314 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 14:51:37,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 14:51:37,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 14:51:37,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 14:51:37,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 14:51:37,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 14:51:37,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 14:51:37,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 14:51:37,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 14:51:37,321 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 14:51:37,321 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 14:51:37,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 14:51:37,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 14:51:37,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 14:51:37,324 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 14:51:37,325 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 14:51:37,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 14:51:37,328 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 14:51:37,329 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 14:51:37,329 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 14:51:37,330 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 14:51:37,331 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 14:51:37,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 14:51:37,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 14:51:37,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 14:51:37,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 14:51:37,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 14:51:37,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 14:51:37,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 14:51:37,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 14:51:37,336 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 14:51:37,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 14:51:37,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 14:51:37,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 14:51:37,338 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 14:51:37,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 14:51:37,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 14:51:37,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 14:51:37,340 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 14:51:37,341 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 14:51:37,367 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 14:51:37,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 14:51:37,374 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 14:51:37,374 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 14:51:37,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 14:51:37,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 14:51:37,376 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 14:51:37,376 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 14:51:37,376 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 14:51:37,377 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 14:51:37,377 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 14:51:37,377 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 14:51:37,377 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 14:51:37,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 14:51:37,377 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 14:51:37,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 14:51:37,378 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 14:51:37,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 14:51:37,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 14:51:37,379 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 14:51:37,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 14:51:37,383 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 14:51:37,383 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 14:51:37,383 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 14:51:37,383 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 14:51:37,383 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 14:51:37,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 14:51:37,384 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 14:51:37,384 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 14:51:37,385 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 -> e9f5cf3ddf7f2bce97ea02caa876a19793443837e6b09c62b997f759c9b40cc6 [2022-07-14 14:51:37,532 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 14:51:37,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 14:51:37,545 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 14:51:37,546 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 14:51:37,547 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 14:51:37,547 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Ex08.c [2022-07-14 14:51:37,582 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b43f9448/91d9dfa69ea1494c81682c35a00c20de/FLAG283ddd00e [2022-07-14 14:51:37,920 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 14:51:37,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c [2022-07-14 14:51:37,925 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b43f9448/91d9dfa69ea1494c81682c35a00c20de/FLAG283ddd00e [2022-07-14 14:51:37,934 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b43f9448/91d9dfa69ea1494c81682c35a00c20de [2022-07-14 14:51:37,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 14:51:37,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 14:51:37,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 14:51:37,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 14:51:37,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 14:51:37,940 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:51:37" (1/1) ... [2022-07-14 14:51:37,941 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a40328a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:51:37, skipping insertion in model container [2022-07-14 14:51:37,941 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:51:37" (1/1) ... [2022-07-14 14:51:37,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 14:51:37,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 14:51:38,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:51:38,102 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 14:51:38,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:51:38,119 INFO L208 MainTranslator]: Completed translation [2022-07-14 14:51:38,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:51:38 WrapperNode [2022-07-14 14:51:38,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 14:51:38,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 14:51:38,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 14:51:38,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 14:51:38,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:51:38" (1/1) ... [2022-07-14 14:51:38,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:51:38" (1/1) ... [2022-07-14 14:51:38,140 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2022-07-14 14:51:38,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 14:51:38,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 14:51:38,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 14:51:38,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 14:51:38,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:51:38" (1/1) ... [2022-07-14 14:51:38,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:51:38" (1/1) ... [2022-07-14 14:51:38,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:51:38" (1/1) ... [2022-07-14 14:51:38,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:51:38" (1/1) ... [2022-07-14 14:51:38,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:51:38" (1/1) ... [2022-07-14 14:51:38,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:51:38" (1/1) ... [2022-07-14 14:51:38,153 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:51:38" (1/1) ... [2022-07-14 14:51:38,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 14:51:38,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 14:51:38,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 14:51:38,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 14:51:38,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:51:38" (1/1) ... [2022-07-14 14:51:38,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:38,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:38,178 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-14 14:51:38,184 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-14 14:51:38,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 14:51:38,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 14:51:38,241 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 14:51:38,243 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 14:51:38,321 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 14:51:38,326 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 14:51:38,327 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 14:51:38,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:51:38 BoogieIcfgContainer [2022-07-14 14:51:38,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 14:51:38,329 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 14:51:38,330 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 14:51:38,332 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 14:51:38,332 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:51:38,332 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 02:51:37" (1/3) ... [2022-07-14 14:51:38,333 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37f1cd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:51:38, skipping insertion in model container [2022-07-14 14:51:38,334 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:51:38,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:51:38" (2/3) ... [2022-07-14 14:51:38,334 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37f1cd2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:51:38, skipping insertion in model container [2022-07-14 14:51:38,334 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:51:38,334 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:51:38" (3/3) ... [2022-07-14 14:51:38,336 INFO L354 chiAutomizerObserver]: Analyzing ICFG Ex08.c [2022-07-14 14:51:38,378 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 14:51:38,379 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 14:51:38,379 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 14:51:38,379 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 14:51:38,379 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 14:51:38,379 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 14:51:38,379 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 14:51:38,380 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 14:51:38,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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-14 14:51:38,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-14 14:51:38,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:51:38,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:51:38,397 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:51:38,397 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 14:51:38,397 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 14:51:38,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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-14 14:51:38,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-14 14:51:38,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:51:38,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:51:38,399 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:51:38,399 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 14:51:38,403 INFO L752 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 5#L18-1true [2022-07-14 14:51:38,403 INFO L754 eck$LassoCheckResult]: Loop: 5#L18-1true assume !!(main_~i~0#1 > 0); 10#L12true assume !(1 == main_~i~0#1); 2#L12-2true assume 10 == main_~i~0#1;main_~up~0#1 := 0; 7#L15-1true assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5#L18-1true [2022-07-14 14:51:38,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:38,409 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-07-14 14:51:38,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:38,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852080629] [2022-07-14 14:51:38,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:38,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:38,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:38,465 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:38,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:38,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:38,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2022-07-14 14:51:38,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:38,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163615027] [2022-07-14 14:51:38,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:38,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:38,558 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-14 14:51:38,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:51:38,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163615027] [2022-07-14 14:51:38,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163615027] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:51:38,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:51:38,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:51:38,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627511561] [2022-07-14 14:51:38,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:51:38,564 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:51:38,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:51:38,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:51:38,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:51:38,586 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-14 14:51:38,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:51:38,623 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2022-07-14 14:51:38,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:51:38,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2022-07-14 14:51:38,628 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 14:51:38,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 10 states and 15 transitions. [2022-07-14 14:51:38,631 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2022-07-14 14:51:38,631 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2022-07-14 14:51:38,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2022-07-14 14:51:38,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:51:38,631 INFO L369 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2022-07-14 14:51:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2022-07-14 14:51:38,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-07-14 14:51:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.5) internal successors, (15), 9 states have internal predecessors, (15), 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-14 14:51:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2022-07-14 14:51:38,656 INFO L392 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2022-07-14 14:51:38,656 INFO L374 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2022-07-14 14:51:38,656 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 14:51:38,656 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2022-07-14 14:51:38,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2022-07-14 14:51:38,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:51:38,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:51:38,657 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:51:38,657 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 14:51:38,658 INFO L752 eck$LassoCheckResult]: Stem: 40#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 41#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 44#L18-1 [2022-07-14 14:51:38,658 INFO L754 eck$LassoCheckResult]: Loop: 44#L18-1 assume !!(main_~i~0#1 > 0); 46#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 37#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 38#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44#L18-1 [2022-07-14 14:51:38,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:38,658 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-07-14 14:51:38,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:38,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631276017] [2022-07-14 14:51:38,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:38,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:38,662 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:38,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:38,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:38,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1265324, now seen corresponding path program 1 times [2022-07-14 14:51:38,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:38,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672968713] [2022-07-14 14:51:38,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:38,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:38,675 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-14 14:51:38,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:51:38,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672968713] [2022-07-14 14:51:38,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672968713] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:51:38,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:51:38,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 14:51:38,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796026351] [2022-07-14 14:51:38,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:51:38,677 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:51:38,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:51:38,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:51:38,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:51:38,678 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-14 14:51:38,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:51:38,692 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2022-07-14 14:51:38,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:51:38,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 21 transitions. [2022-07-14 14:51:38,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-07-14 14:51:38,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 21 transitions. [2022-07-14 14:51:38,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2022-07-14 14:51:38,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-07-14 14:51:38,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2022-07-14 14:51:38,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:51:38,695 INFO L369 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2022-07-14 14:51:38,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2022-07-14 14:51:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-14 14:51:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.5) internal successors, (21), 13 states have internal predecessors, (21), 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-14 14:51:38,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2022-07-14 14:51:38,697 INFO L392 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2022-07-14 14:51:38,697 INFO L374 stractBuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2022-07-14 14:51:38,698 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 14:51:38,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2022-07-14 14:51:38,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-07-14 14:51:38,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:51:38,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:51:38,699 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-07-14 14:51:38,699 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 14:51:38,699 INFO L752 eck$LassoCheckResult]: Stem: 69#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 70#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 74#L18-1 [2022-07-14 14:51:38,700 INFO L754 eck$LassoCheckResult]: Loop: 74#L18-1 assume !!(main_~i~0#1 > 0); 80#L12 assume !(1 == main_~i~0#1); 79#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 73#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 74#L18-1 [2022-07-14 14:51:38,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:38,701 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-07-14 14:51:38,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:38,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394374884] [2022-07-14 14:51:38,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:38,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:38,708 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:38,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:38,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:38,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:38,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1267246, now seen corresponding path program 1 times [2022-07-14 14:51:38,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:38,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828303697] [2022-07-14 14:51:38,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:38,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:38,721 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:38,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:38,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:38,725 INFO L85 PathProgramCache]: Analyzing trace with hash 889694448, now seen corresponding path program 1 times [2022-07-14 14:51:38,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:38,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522466531] [2022-07-14 14:51:38,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:38,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:38,729 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:38,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:38,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:38,786 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:51:38,786 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:51:38,787 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:51:38,787 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:51:38,787 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 14:51:38,788 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:38,788 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:51:38,788 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:51:38,788 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2022-07-14 14:51:38,788 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:51:38,788 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:51:38,801 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-14 14:51:38,808 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-14 14:51:38,812 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-14 14:51:38,818 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-14 14:51:38,883 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:51:38,884 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 14:51:38,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:38,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:38,899 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-14 14:51:38,903 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-14 14:51:38,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:38,903 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:38,918 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:51:38,918 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:51:38,932 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-14 14:51:38,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:38,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:38,943 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-14 14:51:38,947 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:38,947 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:38,957 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-14 14:51:38,979 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:51:38,979 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:51:38,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-14 14:51:39,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:39,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:39,001 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-14 14:51:39,002 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-14 14:51:39,003 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:39,003 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:39,036 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-14 14:51:39,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:39,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:39,038 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-14 14:51:39,039 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-14 14:51:39,040 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 14:51:39,040 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:39,075 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 14:51:39,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 14:51:39,093 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:51:39,093 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:51:39,093 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:51:39,093 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:51:39,093 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:51:39,093 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:39,093 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:51:39,093 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:51:39,093 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2022-07-14 14:51:39,093 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:51:39,093 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:51:39,094 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-14 14:51:39,101 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-14 14:51:39,108 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-14 14:51:39,110 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-14 14:51:39,149 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:51:39,152 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:51:39,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:39,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:39,154 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-14 14:51:39,154 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-14 14:51:39,155 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-14 14:51:39,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:39,161 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:51:39,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:39,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:51:39,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:39,163 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:51:39,163 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:51:39,170 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:51:39,184 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-14 14:51:39,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:39,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:39,186 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-14 14:51:39,186 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-14 14:51:39,187 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-14 14:51:39,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:39,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:39,193 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:51:39,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:39,196 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:51:39,196 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:51:39,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:51:39,222 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-14 14:51:39,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:39,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:39,223 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-14 14:51:39,224 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-14 14:51:39,226 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-14 14:51:39,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:39,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:39,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:51:39,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:39,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:51:39,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:51:39,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:51:39,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-14 14:51:39,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:39,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:39,258 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-14 14:51:39,259 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-14 14:51:39,260 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-14 14:51:39,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:39,265 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:51:39,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:39,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:51:39,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:39,266 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:51:39,266 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:51:39,279 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:51:39,282 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 14:51:39,283 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-14 14:51:39,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:39,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:39,285 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-14 14:51:39,285 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-14 14:51:39,324 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:51:39,324 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 14:51:39,324 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:51:39,324 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-14 14:51:39,341 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-14 14:51:39,343 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 14:51:39,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:39,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:51:39,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:39,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 14:51:39,381 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:39,393 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-14 14:51:39,395 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 14:51:39,396 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-14 14:51:39,429 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 21 transitions. cyclomatic complexity: 8. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 35 states and 51 transitions. Complement of second has 7 states. [2022-07-14 14:51:39,430 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-14 14:51:39,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-14 14:51:39,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2022-07-14 14:51:39,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2022-07-14 14:51:39,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:39,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2022-07-14 14:51:39,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:39,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2022-07-14 14:51:39,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:39,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 51 transitions. [2022-07-14 14:51:39,434 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2022-07-14 14:51:39,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 44 transitions. [2022-07-14 14:51:39,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2022-07-14 14:51:39,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2022-07-14 14:51:39,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2022-07-14 14:51:39,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:51:39,438 INFO L369 hiAutomatonCegarLoop]: Abstraction has 30 states and 44 transitions. [2022-07-14 14:51:39,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2022-07-14 14:51:39,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-07-14 14:51:39,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 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-14 14:51:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2022-07-14 14:51:39,445 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 36 transitions. [2022-07-14 14:51:39,445 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2022-07-14 14:51:39,445 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 14:51:39,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2022-07-14 14:51:39,446 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2022-07-14 14:51:39,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:51:39,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:51:39,446 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-14 14:51:39,446 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 14:51:39,446 INFO L752 eck$LassoCheckResult]: Stem: 167#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 168#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 170#L18-1 assume !!(main_~i~0#1 > 0); 164#L12 [2022-07-14 14:51:39,446 INFO L754 eck$LassoCheckResult]: Loop: 164#L12 assume !(1 == main_~i~0#1); 180#L12-2 assume !(10 == main_~i~0#1); 169#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 163#L18-1 assume !!(main_~i~0#1 > 0); 164#L12 [2022-07-14 14:51:39,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:39,446 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2022-07-14 14:51:39,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:39,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964457816] [2022-07-14 14:51:39,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:39,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:39,450 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:39,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:39,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:39,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1422198, now seen corresponding path program 1 times [2022-07-14 14:51:39,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:39,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539366337] [2022-07-14 14:51:39,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:39,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:39,458 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:39,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:39,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:39,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1810726045, now seen corresponding path program 1 times [2022-07-14 14:51:39,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:39,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299004597] [2022-07-14 14:51:39,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:39,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:39,466 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:39,468 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:39,499 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:51:39,499 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:51:39,499 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:51:39,499 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:51:39,500 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 14:51:39,500 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:39,500 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:51:39,500 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:51:39,500 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2022-07-14 14:51:39,500 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:51:39,500 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:51:39,502 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-14 14:51:39,504 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-14 14:51:39,510 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-14 14:51:39,512 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-14 14:51:39,567 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-14 14:51:39,585 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:51:39,586 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 14:51:39,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:39,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:39,587 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-14 14:51:39,590 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-14 14:51:39,591 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:39,591 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:39,603 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:51:39,604 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:51:39,620 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-14 14:51:39,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:39,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:39,621 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-14 14:51:39,622 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-14 14:51:39,623 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:39,623 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:39,657 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-14 14:51:39,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:39,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:39,658 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-14 14:51:39,659 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-14 14:51:39,660 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 14:51:39,660 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:39,713 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 14:51:39,716 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-14 14:51:39,716 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:51:39,716 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:51:39,716 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:51:39,716 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:51:39,716 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:51:39,716 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:39,716 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:51:39,716 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:51:39,716 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2022-07-14 14:51:39,716 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:51:39,716 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:51:39,717 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-14 14:51:39,719 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-14 14:51:39,734 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-14 14:51:39,737 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-14 14:51:39,791 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:51:39,791 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:51:39,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:39,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:39,793 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-14 14:51:39,794 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-14 14:51:39,795 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-14 14:51:39,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:39,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:39,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:51:39,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:39,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:51:39,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:51:39,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:51:39,826 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-14 14:51:39,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:39,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:39,827 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-14 14:51:39,827 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-14 14:51:39,829 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-14 14:51:39,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:39,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:51:39,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:39,835 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 14:51:39,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:39,836 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 14:51:39,836 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:51:39,852 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:51:39,854 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 14:51:39,854 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-14 14:51:39,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:39,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:39,856 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-14 14:51:39,857 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-14 14:51:39,857 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:51:39,857 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 14:51:39,857 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:51:39,858 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-14 14:51:39,880 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-14 14:51:39,881 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 14:51:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:39,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:51:39,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:39,899 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 14:51:39,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:39,934 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-14 14:51:39,935 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 14:51:39,936 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14 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-14 14:51:39,958 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 36 transitions. cyclomatic complexity: 14. 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 41 states and 59 transitions. Complement of second has 7 states. [2022-07-14 14:51:39,959 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-14 14:51:39,960 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-14 14:51:39,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2022-07-14 14:51:39,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2022-07-14 14:51:39,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:39,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2022-07-14 14:51:39,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:39,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 8 letters. [2022-07-14 14:51:39,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:39,964 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2022-07-14 14:51:39,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-07-14 14:51:39,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 32 states and 49 transitions. [2022-07-14 14:51:39,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2022-07-14 14:51:39,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2022-07-14 14:51:39,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 49 transitions. [2022-07-14 14:51:39,969 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:51:39,970 INFO L369 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2022-07-14 14:51:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 49 transitions. [2022-07-14 14:51:39,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-07-14 14:51:39,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.53125) internal successors, (49), 31 states have internal predecessors, (49), 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-14 14:51:39,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2022-07-14 14:51:39,977 INFO L392 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2022-07-14 14:51:39,977 INFO L374 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2022-07-14 14:51:39,977 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 14:51:39,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2022-07-14 14:51:39,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-07-14 14:51:39,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:51:39,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:51:39,978 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-14 14:51:39,978 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 14:51:39,978 INFO L752 eck$LassoCheckResult]: Stem: 277#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 278#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 281#L18-1 assume !!(main_~i~0#1 > 0); 284#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 286#L12-2 assume !(10 == main_~i~0#1); 291#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 292#L18-1 [2022-07-14 14:51:39,978 INFO L754 eck$LassoCheckResult]: Loop: 292#L18-1 assume !!(main_~i~0#1 > 0); 299#L12 assume !(1 == main_~i~0#1); 293#L12-2 assume !(10 == main_~i~0#1); 294#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 292#L18-1 [2022-07-14 14:51:39,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:39,978 INFO L85 PathProgramCache]: Analyzing trace with hash 889692586, now seen corresponding path program 1 times [2022-07-14 14:51:39,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:39,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384542895] [2022-07-14 14:51:39,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:39,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:39,982 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:39,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:39,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:39,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1267306, now seen corresponding path program 1 times [2022-07-14 14:51:39,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:39,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382224165] [2022-07-14 14:51:39,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:39,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:39,987 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:39,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:39,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:39,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1068497811, now seen corresponding path program 1 times [2022-07-14 14:51:39,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:39,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115026826] [2022-07-14 14:51:39,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:39,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:40,005 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:40,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:40,033 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:51:40,034 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:51:40,034 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:51:40,034 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:51:40,034 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 14:51:40,034 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:40,034 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:51:40,034 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:51:40,034 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2022-07-14 14:51:40,034 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:51:40,034 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:51:40,034 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-14 14:51:40,036 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-14 14:51:40,038 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-14 14:51:40,043 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-14 14:51:40,110 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:51:40,111 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 14:51:40,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:40,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:40,112 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-14 14:51:40,113 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-14 14:51:40,114 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:40,114 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:40,144 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:51:40,144 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:51:40,161 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-14 14:51:40,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:40,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:40,162 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-14 14:51:40,163 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-14 14:51:40,164 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:40,164 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:40,170 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:51:40,170 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:51:40,186 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-14 14:51:40,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:40,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:40,188 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-14 14:51:40,188 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-14 14:51:40,189 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:40,189 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:40,220 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-14 14:51:40,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:40,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:40,222 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-14 14:51:40,225 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-14 14:51:40,229 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 14:51:40,229 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:40,247 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:51:40,247 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0#1=11} Honda state: {ULTIMATE.start_main_~i~0#1=11} Generalized eigenvectors: [{ULTIMATE.start_main_~i~0#1=0}, {ULTIMATE.start_main_~i~0#1=0}, {ULTIMATE.start_main_~i~0#1=1}] Lambdas: [0, 0, 1] Nus: [0, 0] [2022-07-14 14:51:40,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-14 14:51:40,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:40,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:40,266 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-14 14:51:40,267 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-14 14:51:40,268 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:40,268 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:40,289 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:51:40,289 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:51:40,306 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-14 14:51:40,325 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:51:40,325 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:51:40,325 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:51:40,325 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:51:40,325 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 14:51:40,325 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:40,325 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:51:40,325 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:51:40,325 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2022-07-14 14:51:40,325 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:51:40,325 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:51:40,326 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-14 14:51:40,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-14 14:51:40,333 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-14 14:51:40,335 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-14 14:51:40,336 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-14 14:51:40,339 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-14 14:51:40,421 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:51:40,421 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 14:51:40,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:40,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:40,423 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-14 14:51:40,424 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-14 14:51:40,426 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:40,426 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:40,439 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:51:40,439 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res#1=0} Honda state: {ULTIMATE.start_main_#res#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:51:40,454 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-14 14:51:40,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:40,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:40,455 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-14 14:51:40,456 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-14 14:51:40,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:40,457 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:40,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-14 14:51:40,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:40,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:40,490 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-14 14:51:40,490 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-14 14:51:40,491 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 14:51:40,491 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:40,516 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 14:51:40,519 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-14 14:51:40,519 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:51:40,519 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:51:40,519 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:51:40,519 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:51:40,519 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:51:40,519 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:40,519 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:51:40,519 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:51:40,519 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2022-07-14 14:51:40,519 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:51:40,519 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:51:40,520 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-14 14:51:40,523 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-14 14:51:40,536 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-14 14:51:40,538 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-14 14:51:40,540 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-14 14:51:40,541 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-14 14:51:40,576 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-14 14:51:40,642 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:51:40,642 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:51:40,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:40,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:40,643 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-14 14:51:40,644 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-14 14:51:40,645 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-14 14:51:40,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:40,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:51:40,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:40,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:51:40,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:40,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:51:40,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:51:40,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:51:40,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-14 14:51:40,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:40,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:40,683 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-14 14:51:40,684 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-14 14:51:40,685 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-14 14:51:40,690 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:40,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:40,690 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 14:51:40,690 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:40,696 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-14 14:51:40,696 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-14 14:51:40,712 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:51:40,727 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2022-07-14 14:51:40,727 INFO L444 ModelExtractionUtils]: 0 out of 11 variables were initially zero. Simplification set additionally 6 variables to zero. [2022-07-14 14:51:40,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:40,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:40,728 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-14 14:51:40,729 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-14 14:51:40,730 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:51:40,738 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2022-07-14 14:51:40,738 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:51:40,738 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 21 Supporting invariants [-1*ULTIMATE.start_main_~i~0#1 + 10 >= 0] [2022-07-14 14:51:40,753 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-14 14:51:40,757 INFO L293 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2022-07-14 14:51:40,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:40,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 14:51:40,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:40,814 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 14:51:40,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:40,846 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-14 14:51:40,848 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2022-07-14 14:51:40,848 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 21 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-14 14:51:40,903 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 49 transitions. cyclomatic complexity: 21. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 46 states and 68 transitions. Complement of second has 8 states. [2022-07-14 14:51:40,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-14 14:51:40,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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-14 14:51:40,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2022-07-14 14:51:40,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2022-07-14 14:51:40,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:40,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2022-07-14 14:51:40,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:40,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2022-07-14 14:51:40,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:40,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 68 transitions. [2022-07-14 14:51:40,911 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-07-14 14:51:40,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 67 transitions. [2022-07-14 14:51:40,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2022-07-14 14:51:40,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-07-14 14:51:40,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 67 transitions. [2022-07-14 14:51:40,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:51:40,913 INFO L369 hiAutomatonCegarLoop]: Abstraction has 45 states and 67 transitions. [2022-07-14 14:51:40,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 67 transitions. [2022-07-14 14:51:40,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-07-14 14:51:40,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.5238095238095237) internal successors, (64), 41 states have internal predecessors, (64), 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-14 14:51:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 64 transitions. [2022-07-14 14:51:40,919 INFO L392 hiAutomatonCegarLoop]: Abstraction has 42 states and 64 transitions. [2022-07-14 14:51:40,919 INFO L374 stractBuchiCegarLoop]: Abstraction has 42 states and 64 transitions. [2022-07-14 14:51:40,919 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 14:51:40,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 64 transitions. [2022-07-14 14:51:40,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2022-07-14 14:51:40,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:51:40,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:51:40,920 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:51:40,920 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 14:51:40,920 INFO L752 eck$LassoCheckResult]: Stem: 421#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 422#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 426#L18-1 assume !!(main_~i~0#1 > 0); 435#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 432#L12-2 assume !(10 == main_~i~0#1); 431#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 430#L18-1 assume !!(main_~i~0#1 > 0); 427#L12 assume !(1 == main_~i~0#1); 428#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 452#L15-1 [2022-07-14 14:51:40,920 INFO L754 eck$LassoCheckResult]: Loop: 452#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 417#L18-1 assume !!(main_~i~0#1 > 0); 418#L12 assume !(1 == main_~i~0#1); 451#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 452#L15-1 [2022-07-14 14:51:40,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:40,921 INFO L85 PathProgramCache]: Analyzing trace with hash 588656997, now seen corresponding path program 1 times [2022-07-14 14:51:40,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:40,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437030221] [2022-07-14 14:51:40,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:40,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:40,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:51:40,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:51:40,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437030221] [2022-07-14 14:51:40,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437030221] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:51:40,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289082493] [2022-07-14 14:51:40,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:40,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:51:40,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:40,936 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:51:40,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-14 14:51:40,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:40,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 14:51:40,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:51:40,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:51:40,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:51:40,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289082493] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:51:40,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:51:40,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-07-14 14:51:40,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183064626] [2022-07-14 14:51:40,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:51:40,974 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:51:40,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:40,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1768756, now seen corresponding path program 2 times [2022-07-14 14:51:40,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:40,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016592033] [2022-07-14 14:51:40,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:40,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:40,977 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:40,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:40,978 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:40,993 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:51:40,993 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:51:40,993 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:51:40,993 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:51:40,994 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 14:51:40,994 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:40,994 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:51:40,994 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:51:40,994 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2022-07-14 14:51:40,994 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:51:40,994 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:51:40,994 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-14 14:51:40,997 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-14 14:51:41,000 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-14 14:51:41,002 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-14 14:51:41,033 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:51:41,033 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 14:51:41,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:41,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:41,035 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-14 14:51:41,036 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-14 14:51:41,037 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:41,037 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:41,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-14 14:51:41,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:41,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:41,073 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-14 14:51:41,073 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-14 14:51:41,075 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 14:51:41,075 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:41,147 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 14:51:41,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-14 14:51:41,150 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:51:41,150 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:51:41,150 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:51:41,150 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:51:41,150 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:51:41,150 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:41,150 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:51:41,150 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:51:41,150 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2022-07-14 14:51:41,150 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:51:41,151 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:51:41,151 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-14 14:51:41,163 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-14 14:51:41,166 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-14 14:51:41,168 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-14 14:51:41,204 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:51:41,204 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:51:41,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:41,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:41,206 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-14 14:51:41,207 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-14 14:51:41,208 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-14 14:51:41,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:41,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:51:41,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:41,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:51:41,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:41,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:51:41,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:51:41,227 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:51:41,244 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 14:51:41,244 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-14 14:51:41,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:41,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:41,246 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-14 14:51:41,246 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-14 14:51:41,247 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:51:41,247 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 14:51:41,247 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:51:41,247 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-14 14:51:41,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-14 14:51:41,263 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 14:51:41,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:41,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:51:41,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:41,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 14:51:41,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:41,308 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-14 14:51:41,309 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 14:51:41,309 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 64 transitions. cyclomatic complexity: 27 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 14:51:41,332 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 64 transitions. cyclomatic complexity: 27. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 105 states and 160 transitions. Complement of second has 7 states. [2022-07-14 14:51:41,332 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-14 14:51:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 14:51:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-07-14 14:51:41,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2022-07-14 14:51:41,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:41,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 13 letters. Loop has 4 letters. [2022-07-14 14:51:41,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:41,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2022-07-14 14:51:41,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:41,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 160 transitions. [2022-07-14 14:51:41,334 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-07-14 14:51:41,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 87 states and 133 transitions. [2022-07-14 14:51:41,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2022-07-14 14:51:41,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2022-07-14 14:51:41,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 133 transitions. [2022-07-14 14:51:41,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:51:41,335 INFO L369 hiAutomatonCegarLoop]: Abstraction has 87 states and 133 transitions. [2022-07-14 14:51:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 133 transitions. [2022-07-14 14:51:41,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2022-07-14 14:51:41,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.548780487804878) internal successors, (127), 81 states have internal predecessors, (127), 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-14 14:51:41,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2022-07-14 14:51:41,340 INFO L392 hiAutomatonCegarLoop]: Abstraction has 82 states and 127 transitions. [2022-07-14 14:51:41,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:51:41,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 14:51:41,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-14 14:51:41,341 INFO L87 Difference]: Start difference. First operand 82 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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-14 14:51:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:51:41,370 INFO L93 Difference]: Finished difference Result 160 states and 239 transitions. [2022-07-14 14:51:41,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 14:51:41,370 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 239 transitions. [2022-07-14 14:51:41,372 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2022-07-14 14:51:41,373 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 160 states and 239 transitions. [2022-07-14 14:51:41,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2022-07-14 14:51:41,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2022-07-14 14:51:41,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 239 transitions. [2022-07-14 14:51:41,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:51:41,373 INFO L369 hiAutomatonCegarLoop]: Abstraction has 160 states and 239 transitions. [2022-07-14 14:51:41,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 239 transitions. [2022-07-14 14:51:41,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2022-07-14 14:51:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 136 states have (on average 1.5220588235294117) internal successors, (207), 135 states have internal predecessors, (207), 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-14 14:51:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 207 transitions. [2022-07-14 14:51:41,378 INFO L392 hiAutomatonCegarLoop]: Abstraction has 136 states and 207 transitions. [2022-07-14 14:51:41,378 INFO L374 stractBuchiCegarLoop]: Abstraction has 136 states and 207 transitions. [2022-07-14 14:51:41,378 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 14:51:41,378 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 207 transitions. [2022-07-14 14:51:41,379 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2022-07-14 14:51:41,379 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:51:41,379 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:51:41,379 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2022-07-14 14:51:41,380 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 14:51:41,380 INFO L752 eck$LassoCheckResult]: Stem: 924#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 925#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 928#L18-1 assume !!(main_~i~0#1 > 0); 942#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 938#L12-2 assume !(10 == main_~i~0#1); 933#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 934#L18-1 assume !!(main_~i~0#1 > 0); 1009#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 972#L12-2 assume !(10 == main_~i~0#1); 1014#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 990#L18-1 [2022-07-14 14:51:41,380 INFO L754 eck$LassoCheckResult]: Loop: 990#L18-1 assume !!(main_~i~0#1 > 0); 1000#L12 assume !(1 == main_~i~0#1); 983#L12-2 assume !(10 == main_~i~0#1); 995#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 990#L18-1 [2022-07-14 14:51:41,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:41,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1068495891, now seen corresponding path program 1 times [2022-07-14 14:51:41,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:41,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581129916] [2022-07-14 14:51:41,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:41,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:41,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:51:41,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:51:41,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581129916] [2022-07-14 14:51:41,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581129916] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:51:41,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:51:41,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 14:51:41,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581966341] [2022-07-14 14:51:41,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:51:41,393 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:51:41,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:41,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 2 times [2022-07-14 14:51:41,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:41,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897811748] [2022-07-14 14:51:41,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:41,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:41,417 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:41,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:41,432 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-14 14:51:41,449 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-14 14:51:41,451 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:51:41,451 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:51:41,451 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:51:41,451 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:51:41,451 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 14:51:41,451 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:41,451 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:51:41,452 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:51:41,452 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2022-07-14 14:51:41,452 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:51:41,452 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:51:41,452 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-14 14:51:41,457 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-14 14:51:41,459 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-14 14:51:41,461 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-14 14:51:41,515 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:51:41,516 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 14:51:41,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:41,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:41,517 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-14 14:51:41,517 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-14 14:51:41,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:41,519 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:41,539 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-14 14:51:41,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:41,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:41,540 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-14 14:51:41,541 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-14 14:51:41,542 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 14:51:41,542 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:41,571 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 14:51:41,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-14 14:51:41,574 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:51:41,574 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:51:41,574 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:51:41,574 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:51:41,574 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:51:41,574 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:41,574 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:51:41,574 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:51:41,574 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2022-07-14 14:51:41,574 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:51:41,574 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:51:41,575 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-14 14:51:41,580 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-14 14:51:41,585 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-14 14:51:41,587 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-14 14:51:41,641 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:51:41,641 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:51:41,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:41,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:41,642 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 14:51:41,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-14 14:51:41,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 14:51:41,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:41,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:51:41,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:41,650 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 14:51:41,650 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:41,651 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 14:51:41,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:51:41,663 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:51:41,665 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 14:51:41,665 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-14 14:51:41,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:41,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:41,666 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-14 14:51:41,666 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-14 14:51:41,667 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:51:41,667 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 14:51:41,667 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:51:41,667 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-14 14:51:41,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-07-14 14:51:41,682 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 14:51:41,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:41,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:51:41,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:41,713 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 14:51:41,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:41,728 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-14 14:51:41,728 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 14:51:41,728 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 136 states and 207 transitions. cyclomatic complexity: 82 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-14 14:51:41,741 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 136 states and 207 transitions. cyclomatic complexity: 82. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 248 states and 381 transitions. Complement of second has 5 states. [2022-07-14 14:51:41,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-14 14:51:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-14 14:51:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-07-14 14:51:41,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2022-07-14 14:51:41,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:41,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2022-07-14 14:51:41,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:41,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 8 letters. [2022-07-14 14:51:41,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:41,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 381 transitions. [2022-07-14 14:51:41,745 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2022-07-14 14:51:41,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 224 states and 333 transitions. [2022-07-14 14:51:41,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2022-07-14 14:51:41,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2022-07-14 14:51:41,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 333 transitions. [2022-07-14 14:51:41,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:51:41,747 INFO L369 hiAutomatonCegarLoop]: Abstraction has 224 states and 333 transitions. [2022-07-14 14:51:41,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 333 transitions. [2022-07-14 14:51:41,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 202. [2022-07-14 14:51:41,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 202 states have (on average 1.504950495049505) internal successors, (304), 201 states have internal predecessors, (304), 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-14 14:51:41,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 304 transitions. [2022-07-14 14:51:41,752 INFO L392 hiAutomatonCegarLoop]: Abstraction has 202 states and 304 transitions. [2022-07-14 14:51:41,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:51:41,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 14:51:41,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 14:51:41,753 INFO L87 Difference]: Start difference. First operand 202 states and 304 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-14 14:51:41,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:51:41,765 INFO L93 Difference]: Finished difference Result 230 states and 313 transitions. [2022-07-14 14:51:41,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 14:51:41,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 313 transitions. [2022-07-14 14:51:41,767 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2022-07-14 14:51:41,768 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 230 states and 313 transitions. [2022-07-14 14:51:41,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2022-07-14 14:51:41,768 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2022-07-14 14:51:41,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 313 transitions. [2022-07-14 14:51:41,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:51:41,768 INFO L369 hiAutomatonCegarLoop]: Abstraction has 230 states and 313 transitions. [2022-07-14 14:51:41,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 313 transitions. [2022-07-14 14:51:41,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 201. [2022-07-14 14:51:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 201 states have (on average 1.3830845771144278) internal successors, (278), 200 states have internal predecessors, (278), 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-14 14:51:41,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 278 transitions. [2022-07-14 14:51:41,772 INFO L392 hiAutomatonCegarLoop]: Abstraction has 201 states and 278 transitions. [2022-07-14 14:51:41,773 INFO L374 stractBuchiCegarLoop]: Abstraction has 201 states and 278 transitions. [2022-07-14 14:51:41,773 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 14:51:41,773 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 278 transitions. [2022-07-14 14:51:41,773 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2022-07-14 14:51:41,773 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:51:41,773 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:51:41,774 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1, 1] [2022-07-14 14:51:41,774 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 14:51:41,774 INFO L752 eck$LassoCheckResult]: Stem: 1798#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 1799#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 1808#L18-1 assume !!(main_~i~0#1 > 0); 1828#L12 assume !(1 == main_~i~0#1); 1829#L12-2 assume !(10 == main_~i~0#1); 1845#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1846#L18-1 assume !!(main_~i~0#1 > 0); 1902#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 1835#L12-2 assume !(10 == main_~i~0#1); 1836#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1893#L18-1 assume !!(main_~i~0#1 > 0); 1894#L12 assume !(1 == main_~i~0#1); 1949#L12-2 assume !(10 == main_~i~0#1); 1948#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1929#L18-1 [2022-07-14 14:51:41,774 INFO L754 eck$LassoCheckResult]: Loop: 1929#L18-1 assume !!(main_~i~0#1 > 0); 1944#L12 assume !(1 == main_~i~0#1); 1945#L12-2 assume !(10 == main_~i~0#1); 1947#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1929#L18-1 [2022-07-14 14:51:41,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:41,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1847785984, now seen corresponding path program 1 times [2022-07-14 14:51:41,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:41,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577327772] [2022-07-14 14:51:41,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:41,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 14:51:41,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:51:41,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577327772] [2022-07-14 14:51:41,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577327772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:51:41,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:51:41,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 14:51:41,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883860619] [2022-07-14 14:51:41,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:51:41,785 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:51:41,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:41,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 3 times [2022-07-14 14:51:41,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:41,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492205947] [2022-07-14 14:51:41,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:41,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:41,787 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:41,789 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:41,804 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:51:41,804 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:51:41,804 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:51:41,804 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:51:41,804 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 14:51:41,804 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:41,804 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:51:41,804 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:51:41,804 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2022-07-14 14:51:41,804 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:51:41,804 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:51:41,804 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-14 14:51:41,806 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-14 14:51:41,807 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-14 14:51:41,809 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-14 14:51:41,859 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:51:41,859 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 14:51:41,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:41,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:41,860 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-14 14:51:41,862 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-14 14:51:41,862 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:41,862 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:41,873 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:51:41,873 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_12=1} Honda state: {v_rep~unnamed0~0~true_12=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:51:41,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-14 14:51:41,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:41,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:41,889 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-14 14:51:41,889 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-14 14:51:41,890 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:41,890 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:41,900 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:51:41,901 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=4} Honda state: {ULTIMATE.start_main_~up~0#1=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:51:41,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-14 14:51:41,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:41,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:41,917 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-14 14:51:41,917 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-14 14:51:41,918 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:41,918 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:41,928 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:51:41,929 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_12=0} Honda state: {v_rep~unnamed0~0~false_12=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:51:41,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-14 14:51:41,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:41,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:41,944 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-14 14:51:41,947 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:41,947 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:41,949 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-14 14:51:41,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-14 14:51:41,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:41,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:41,969 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-14 14:51:41,969 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-14 14:51:41,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 14:51:41,971 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:42,000 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 14:51:42,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-14 14:51:42,005 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:51:42,005 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:51:42,005 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:51:42,005 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:51:42,005 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:51:42,006 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:42,006 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:51:42,006 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:51:42,006 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2022-07-14 14:51:42,006 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:51:42,006 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:51:42,006 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-14 14:51:42,009 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-14 14:51:42,010 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-14 14:51:42,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-14 14:51:42,073 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:51:42,073 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:51:42,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:42,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:42,074 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-14 14:51:42,087 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-14 14:51:42,091 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-14 14:51:42,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:42,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:42,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:51:42,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:42,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:51:42,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:51:42,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:51:42,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-07-14 14:51:42,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:42,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:42,114 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-14 14:51:42,115 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-14 14:51:42,116 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-14 14:51:42,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:42,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:51:42,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:42,122 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 14:51:42,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:42,122 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 14:51:42,122 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:51:42,123 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:51:42,140 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-14 14:51:42,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:42,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:42,141 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-14 14:51:42,142 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-14 14:51:42,143 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-14 14:51:42,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:42,149 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:42,149 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:51:42,149 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:42,150 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:51:42,150 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:51:42,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:51:42,166 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-14 14:51:42,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:42,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:42,167 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-14 14:51:42,168 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-14 14:51:42,169 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-14 14:51:42,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:42,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:51:42,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:42,174 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 14:51:42,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:42,175 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 14:51:42,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:51:42,177 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:51:42,178 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-07-14 14:51:42,179 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-14 14:51:42,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:42,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:42,180 INFO L229 MonitoredProcess]: Starting monitored process 46 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-14 14:51:42,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-14 14:51:42,183 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:51:42,183 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 14:51:42,183 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:51:42,183 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2022-07-14 14:51:42,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-14 14:51:42,198 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 14:51:42,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:42,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:51:42,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:42,237 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 14:51:42,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:42,251 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-14 14:51:42,252 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 14:51:42,252 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-14 14:51:42,265 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 280 states and 401 transitions. Complement of second has 5 states. [2022-07-14 14:51:42,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-14 14:51:42,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-14 14:51:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-07-14 14:51:42,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2022-07-14 14:51:42,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:42,266 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:51:42,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:42,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:42,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:51:42,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:42,297 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 14:51:42,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:42,310 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-14 14:51:42,311 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 14:51:42,311 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-14 14:51:42,321 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 280 states and 401 transitions. Complement of second has 5 states. [2022-07-14 14:51:42,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-14 14:51:42,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-14 14:51:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2022-07-14 14:51:42,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2022-07-14 14:51:42,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:42,322 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:51:42,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:42,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:42,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:51:42,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:42,347 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 14:51:42,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:42,358 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-14 14:51:42,359 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-14 14:51:42,359 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-14 14:51:42,392 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 201 states and 278 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 334 states and 496 transitions. Complement of second has 4 states. [2022-07-14 14:51:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-14 14:51:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-14 14:51:42,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2022-07-14 14:51:42,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2022-07-14 14:51:42,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:42,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 18 letters. Loop has 4 letters. [2022-07-14 14:51:42,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:42,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 8 letters. [2022-07-14 14:51:42,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:42,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 334 states and 496 transitions. [2022-07-14 14:51:42,397 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2022-07-14 14:51:42,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 334 states to 268 states and 378 transitions. [2022-07-14 14:51:42,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2022-07-14 14:51:42,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2022-07-14 14:51:42,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 378 transitions. [2022-07-14 14:51:42,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:51:42,398 INFO L369 hiAutomatonCegarLoop]: Abstraction has 268 states and 378 transitions. [2022-07-14 14:51:42,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states and 378 transitions. [2022-07-14 14:51:42,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 167. [2022-07-14 14:51:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 167 states have (on average 1.401197604790419) internal successors, (234), 166 states have internal predecessors, (234), 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-14 14:51:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 234 transitions. [2022-07-14 14:51:42,401 INFO L392 hiAutomatonCegarLoop]: Abstraction has 167 states and 234 transitions. [2022-07-14 14:51:42,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:51:42,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 14:51:42,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 14:51:42,401 INFO L87 Difference]: Start difference. First operand 167 states and 234 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-14 14:51:42,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:51:42,406 INFO L93 Difference]: Finished difference Result 101 states and 118 transitions. [2022-07-14 14:51:42,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 14:51:42,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 118 transitions. [2022-07-14 14:51:42,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2022-07-14 14:51:42,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 81 states and 94 transitions. [2022-07-14 14:51:42,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2022-07-14 14:51:42,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2022-07-14 14:51:42,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 94 transitions. [2022-07-14 14:51:42,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:51:42,408 INFO L369 hiAutomatonCegarLoop]: Abstraction has 81 states and 94 transitions. [2022-07-14 14:51:42,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 94 transitions. [2022-07-14 14:51:42,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2022-07-14 14:51:42,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.1625) internal successors, (93), 79 states have internal predecessors, (93), 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-14 14:51:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 93 transitions. [2022-07-14 14:51:42,410 INFO L392 hiAutomatonCegarLoop]: Abstraction has 80 states and 93 transitions. [2022-07-14 14:51:42,410 INFO L374 stractBuchiCegarLoop]: Abstraction has 80 states and 93 transitions. [2022-07-14 14:51:42,410 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-14 14:51:42,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 93 transitions. [2022-07-14 14:51:42,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 24 [2022-07-14 14:51:42,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:51:42,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:51:42,411 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 4, 4, 1, 1, 1, 1, 1] [2022-07-14 14:51:42,411 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 4, 4, 1, 1, 1] [2022-07-14 14:51:42,411 INFO L752 eck$LassoCheckResult]: Stem: 3358#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3359#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 3363#L18-1 assume !!(main_~i~0#1 > 0); 3389#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3385#L12-2 assume !(10 == main_~i~0#1); 3384#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3383#L18-1 assume !!(main_~i~0#1 > 0); 3382#L12 assume !(1 == main_~i~0#1); 3381#L12-2 assume !(10 == main_~i~0#1); 3380#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3379#L18-1 assume !!(main_~i~0#1 > 0); 3378#L12 assume !(1 == main_~i~0#1); 3377#L12-2 assume !(10 == main_~i~0#1); 3376#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3375#L18-1 assume !!(main_~i~0#1 > 0); 3372#L12 assume !(1 == main_~i~0#1); 3374#L12-2 assume !(10 == main_~i~0#1); 3373#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3371#L18-1 assume !!(main_~i~0#1 > 0); 3370#L12 assume !(1 == main_~i~0#1); 3369#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3360#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3361#L18-1 assume !!(main_~i~0#1 > 0); 3422#L12 [2022-07-14 14:51:42,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-14 14:51:42,413 INFO L754 eck$LassoCheckResult]: Loop: 3422#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3350#L12-2 assume !(10 == main_~i~0#1); 3351#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3354#L18-1 assume !!(main_~i~0#1 > 0); 3355#L12 assume !(1 == main_~i~0#1); 3421#L12-2 assume !(10 == main_~i~0#1); 3420#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3419#L18-1 assume !!(main_~i~0#1 > 0); 3418#L12 assume !(1 == main_~i~0#1); 3417#L12-2 assume !(10 == main_~i~0#1); 3416#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3415#L18-1 assume !!(main_~i~0#1 > 0); 3414#L12 assume !(1 == main_~i~0#1); 3413#L12-2 assume !(10 == main_~i~0#1); 3398#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3394#L18-1 assume !!(main_~i~0#1 > 0); 3387#L12 assume !(1 == main_~i~0#1); 3388#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3366#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3367#L18-1 assume !!(main_~i~0#1 > 0); 3422#L12 [2022-07-14 14:51:42,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:42,414 INFO L85 PathProgramCache]: Analyzing trace with hash 123757625, now seen corresponding path program 1 times [2022-07-14 14:51:42,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:42,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672826002] [2022-07-14 14:51:42,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:42,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:42,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-07-14 14:51:42,454 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:51:42,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:51:42,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672826002] [2022-07-14 14:51:42,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672826002] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:51:42,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897758968] [2022-07-14 14:51:42,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:42,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:51:42,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:42,456 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-14 14:51:42,456 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-14 14:51:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:42,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 14:51:42,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:42,506 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:51:42,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:51:42,546 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 17 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:51:42,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897758968] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:51:42,547 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:51:42,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-14 14:51:42,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132256346] [2022-07-14 14:51:42,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:51:42,547 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:51:42,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:42,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2141599470, now seen corresponding path program 1 times [2022-07-14 14:51:42,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:42,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495205029] [2022-07-14 14:51:42,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:42,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:42,573 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:51:42,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:51:42,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495205029] [2022-07-14 14:51:42,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495205029] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:51:42,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013792253] [2022-07-14 14:51:42,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:42,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:51:42,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:42,574 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-14 14:51:42,575 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-14 14:51:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:42,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 14:51:42,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:42,608 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:51:42,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:51:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 14:51:42,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013792253] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:51:42,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:51:42,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-07-14 14:51:42,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373580594] [2022-07-14 14:51:42,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:51:42,649 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:51:42,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:51:42,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 14:51:42,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-07-14 14:51:42,649 INFO L87 Difference]: Start difference. First operand 80 states and 93 transitions. cyclomatic complexity: 19 Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 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-14 14:51:42,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:51:42,684 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2022-07-14 14:51:42,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 14:51:42,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 180 transitions. [2022-07-14 14:51:42,686 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2022-07-14 14:51:42,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 147 states and 160 transitions. [2022-07-14 14:51:42,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2022-07-14 14:51:42,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2022-07-14 14:51:42,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 160 transitions. [2022-07-14 14:51:42,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:51:42,687 INFO L369 hiAutomatonCegarLoop]: Abstraction has 147 states and 160 transitions. [2022-07-14 14:51:42,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states and 160 transitions. [2022-07-14 14:51:42,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 140. [2022-07-14 14:51:42,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 140 states have (on average 1.0928571428571427) internal successors, (153), 139 states have internal predecessors, (153), 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-14 14:51:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2022-07-14 14:51:42,689 INFO L392 hiAutomatonCegarLoop]: Abstraction has 140 states and 153 transitions. [2022-07-14 14:51:42,689 INFO L374 stractBuchiCegarLoop]: Abstraction has 140 states and 153 transitions. [2022-07-14 14:51:42,689 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-14 14:51:42,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 140 states and 153 transitions. [2022-07-14 14:51:42,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 44 [2022-07-14 14:51:42,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:51:42,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:51:42,691 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 9, 9, 9, 1, 1, 1, 1, 1] [2022-07-14 14:51:42,691 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 9, 9, 1, 1, 1] [2022-07-14 14:51:42,691 INFO L752 eck$LassoCheckResult]: Stem: 3875#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 3876#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 3879#L18-1 assume !!(main_~i~0#1 > 0); 3950#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3866#L12-2 assume !(10 == main_~i~0#1); 3867#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3882#L18-1 assume !!(main_~i~0#1 > 0); 3973#L12 assume !(1 == main_~i~0#1); 3972#L12-2 assume !(10 == main_~i~0#1); 3971#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3970#L18-1 assume !!(main_~i~0#1 > 0); 3969#L12 assume !(1 == main_~i~0#1); 3968#L12-2 assume !(10 == main_~i~0#1); 3967#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3966#L18-1 assume !!(main_~i~0#1 > 0); 3965#L12 assume !(1 == main_~i~0#1); 3964#L12-2 assume !(10 == main_~i~0#1); 3963#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3962#L18-1 assume !!(main_~i~0#1 > 0); 3961#L12 assume !(1 == main_~i~0#1); 3960#L12-2 assume !(10 == main_~i~0#1); 3959#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3958#L18-1 assume !!(main_~i~0#1 > 0); 3957#L12 assume !(1 == main_~i~0#1); 3956#L12-2 assume !(10 == main_~i~0#1); 3955#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3954#L18-1 assume !!(main_~i~0#1 > 0); 3953#L12 assume !(1 == main_~i~0#1); 3952#L12-2 assume !(10 == main_~i~0#1); 3951#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3948#L18-1 assume !!(main_~i~0#1 > 0); 3947#L12 assume !(1 == main_~i~0#1); 3944#L12-2 assume !(10 == main_~i~0#1); 3942#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3938#L18-1 assume !!(main_~i~0#1 > 0); 3889#L12 assume !(1 == main_~i~0#1); 3893#L12-2 assume !(10 == main_~i~0#1); 3890#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3888#L18-1 assume !!(main_~i~0#1 > 0); 3887#L12 assume !(1 == main_~i~0#1); 3886#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3877#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3878#L18-1 assume !!(main_~i~0#1 > 0); 3933#L12 [2022-07-14 14:51:42,695 INFO L754 eck$LassoCheckResult]: Loop: 3933#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3932#L12-2 assume !(10 == main_~i~0#1); 3931#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3930#L18-1 assume !!(main_~i~0#1 > 0); 3929#L12 assume !(1 == main_~i~0#1); 3928#L12-2 assume !(10 == main_~i~0#1); 3927#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3926#L18-1 assume !!(main_~i~0#1 > 0); 3925#L12 assume !(1 == main_~i~0#1); 3924#L12-2 assume !(10 == main_~i~0#1); 3923#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3922#L18-1 assume !!(main_~i~0#1 > 0); 3921#L12 assume !(1 == main_~i~0#1); 3920#L12-2 assume !(10 == main_~i~0#1); 3919#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3918#L18-1 assume !!(main_~i~0#1 > 0); 3917#L12 assume !(1 == main_~i~0#1); 3916#L12-2 assume !(10 == main_~i~0#1); 3915#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3914#L18-1 assume !!(main_~i~0#1 > 0); 3913#L12 assume !(1 == main_~i~0#1); 3912#L12-2 assume !(10 == main_~i~0#1); 3911#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3910#L18-1 assume !!(main_~i~0#1 > 0); 3909#L12 assume !(1 == main_~i~0#1); 3908#L12-2 assume !(10 == main_~i~0#1); 3907#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3906#L18-1 assume !!(main_~i~0#1 > 0); 3905#L12 assume !(1 == main_~i~0#1); 3904#L12-2 assume !(10 == main_~i~0#1); 3903#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3902#L18-1 assume !!(main_~i~0#1 > 0); 3901#L12 assume !(1 == main_~i~0#1); 3900#L12-2 assume !(10 == main_~i~0#1); 3898#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3894#L18-1 assume !!(main_~i~0#1 > 0); 3891#L12 assume !(1 == main_~i~0#1); 3892#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3883#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3884#L18-1 assume !!(main_~i~0#1 > 0); 3933#L12 [2022-07-14 14:51:42,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:42,695 INFO L85 PathProgramCache]: Analyzing trace with hash -273593524, now seen corresponding path program 2 times [2022-07-14 14:51:42,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:42,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682958804] [2022-07-14 14:51:42,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:42,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:42,715 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:42,721 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:42,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:42,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1615279707, now seen corresponding path program 2 times [2022-07-14 14:51:42,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:42,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422016590] [2022-07-14 14:51:42,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:42,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:42,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:42,727 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:42,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:42,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:42,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1777315312, now seen corresponding path program 3 times [2022-07-14 14:51:42,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:42,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991783784] [2022-07-14 14:51:42,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:42,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:42,772 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 438 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2022-07-14 14:51:42,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:51:42,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991783784] [2022-07-14 14:51:42,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991783784] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:51:42,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:51:42,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 14:51:42,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641754667] [2022-07-14 14:51:42,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:51:42,876 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:51:42,876 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:51:42,876 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:51:42,876 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:51:42,877 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 14:51:42,877 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:42,877 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:51:42,877 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:51:42,877 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration10_Loop [2022-07-14 14:51:42,877 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:51:42,877 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:51:42,877 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-14 14:51:42,880 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-14 14:51:42,882 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-14 14:51:42,883 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-14 14:51:42,908 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:51:42,908 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 14:51:42,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:42,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:42,909 INFO L229 MonitoredProcess]: Starting monitored process 49 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-14 14:51:42,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-14 14:51:42,912 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:42,912 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:42,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-07-14 14:51:42,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:42,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:42,936 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-14 14:51:42,937 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-14 14:51:42,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 14:51:42,938 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:42,944 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 14:51:42,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-07-14 14:51:42,959 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:51:42,959 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:51:42,959 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:51:42,959 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:51:42,959 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:51:42,959 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:42,959 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:51:42,959 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:51:42,959 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration10_Loop [2022-07-14 14:51:42,959 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:51:42,959 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:51:42,959 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-14 14:51:42,961 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-14 14:51:42,969 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-14 14:51:42,970 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-14 14:51:42,996 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:51:42,996 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:51:42,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:42,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:42,997 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-14 14:51:42,998 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-14 14:51:42,999 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-14 14:51:43,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:43,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:43,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:51:43,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:43,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:51:43,006 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:51:43,022 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:51:43,036 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-14 14:51:43,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:43,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:43,038 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-14 14:51:43,038 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-14 14:51:43,039 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-14 14:51:43,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:43,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:51:43,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:43,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:51:43,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:43,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:51:43,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:51:43,059 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:51:43,060 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 14:51:43,060 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-14 14:51:43,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:43,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:43,062 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-14 14:51:43,062 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-14 14:51:43,063 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:51:43,063 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 14:51:43,063 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:51:43,063 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 5 Supporting invariants [] [2022-07-14 14:51:43,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-14 14:51:43,078 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 14:51:43,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:43,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-14 14:51:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:43,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:51:43,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:43,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:43,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 14:51:43,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:43,216 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-14 14:51:43,217 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-14 14:51:43,217 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 153 transitions. cyclomatic complexity: 19 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-14 14:51:43,235 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 153 transitions. cyclomatic complexity: 19. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 226 states and 242 transitions. Complement of second has 7 states. [2022-07-14 14:51:43,236 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-14 14:51:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-14 14:51:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-07-14 14:51:43,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 43 letters. Loop has 40 letters. [2022-07-14 14:51:43,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:43,236 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:51:43,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:43,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:51:43,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:43,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 14:51:43,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-14 14:51:43,352 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2022-07-14 14:51:43,352 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 140 states and 153 transitions. cyclomatic complexity: 19 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-14 14:51:43,388 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 140 states and 153 transitions. cyclomatic complexity: 19. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 313 states and 335 transitions. Complement of second has 11 states. [2022-07-14 14:51:43,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-14 14:51:43,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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-14 14:51:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2022-07-14 14:51:43,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 43 letters. Loop has 40 letters. [2022-07-14 14:51:43,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:43,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 83 letters. Loop has 40 letters. [2022-07-14 14:51:43,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:43,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 43 letters. Loop has 80 letters. [2022-07-14 14:51:43,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:43,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 335 transitions. [2022-07-14 14:51:43,393 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 48 [2022-07-14 14:51:43,394 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 265 states and 285 transitions. [2022-07-14 14:51:43,394 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2022-07-14 14:51:43,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2022-07-14 14:51:43,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 265 states and 285 transitions. [2022-07-14 14:51:43,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:51:43,395 INFO L369 hiAutomatonCegarLoop]: Abstraction has 265 states and 285 transitions. [2022-07-14 14:51:43,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states and 285 transitions. [2022-07-14 14:51:43,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 221. [2022-07-14 14:51:43,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 221 states have (on average 1.0769230769230769) internal successors, (238), 220 states have internal predecessors, (238), 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-14 14:51:43,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 238 transitions. [2022-07-14 14:51:43,397 INFO L392 hiAutomatonCegarLoop]: Abstraction has 221 states and 238 transitions. [2022-07-14 14:51:43,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:51:43,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 14:51:43,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 14:51:43,398 INFO L87 Difference]: Start difference. First operand 221 states and 238 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-14 14:51:43,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:51:43,413 INFO L93 Difference]: Finished difference Result 192 states and 207 transitions. [2022-07-14 14:51:43,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 14:51:43,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 207 transitions. [2022-07-14 14:51:43,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2022-07-14 14:51:43,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 189 states and 203 transitions. [2022-07-14 14:51:43,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 58 [2022-07-14 14:51:43,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2022-07-14 14:51:43,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 203 transitions. [2022-07-14 14:51:43,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:51:43,416 INFO L369 hiAutomatonCegarLoop]: Abstraction has 189 states and 203 transitions. [2022-07-14 14:51:43,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 203 transitions. [2022-07-14 14:51:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 179. [2022-07-14 14:51:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 179 states have (on average 1.0670391061452513) internal successors, (191), 178 states have internal predecessors, (191), 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-14 14:51:43,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 191 transitions. [2022-07-14 14:51:43,417 INFO L392 hiAutomatonCegarLoop]: Abstraction has 179 states and 191 transitions. [2022-07-14 14:51:43,417 INFO L374 stractBuchiCegarLoop]: Abstraction has 179 states and 191 transitions. [2022-07-14 14:51:43,418 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-14 14:51:43,418 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 179 states and 191 transitions. [2022-07-14 14:51:43,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2022-07-14 14:51:43,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:51:43,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:51:43,419 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 10, 9, 2, 1, 1, 1, 1] [2022-07-14 14:51:43,419 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2022-07-14 14:51:43,419 INFO L752 eck$LassoCheckResult]: Stem: 5511#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 5512#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 5515#L18-1 assume !!(main_~i~0#1 > 0); 5565#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 5505#L12-2 assume !(10 == main_~i~0#1); 5506#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5509#L18-1 assume !!(main_~i~0#1 > 0); 5510#L12 assume !(1 == main_~i~0#1); 5518#L12-2 assume !(10 == main_~i~0#1); 5681#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5680#L18-1 assume !!(main_~i~0#1 > 0); 5679#L12 assume !(1 == main_~i~0#1); 5678#L12-2 assume !(10 == main_~i~0#1); 5677#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5676#L18-1 assume !!(main_~i~0#1 > 0); 5675#L12 assume !(1 == main_~i~0#1); 5674#L12-2 assume !(10 == main_~i~0#1); 5673#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5672#L18-1 assume !!(main_~i~0#1 > 0); 5671#L12 assume !(1 == main_~i~0#1); 5670#L12-2 assume !(10 == main_~i~0#1); 5669#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5668#L18-1 assume !!(main_~i~0#1 > 0); 5667#L12 assume !(1 == main_~i~0#1); 5666#L12-2 assume !(10 == main_~i~0#1); 5665#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5664#L18-1 assume !!(main_~i~0#1 > 0); 5663#L12 assume !(1 == main_~i~0#1); 5662#L12-2 assume !(10 == main_~i~0#1); 5661#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5660#L18-1 assume !!(main_~i~0#1 > 0); 5659#L12 assume !(1 == main_~i~0#1); 5658#L12-2 assume !(10 == main_~i~0#1); 5657#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5656#L18-1 assume !!(main_~i~0#1 > 0); 5653#L12 assume !(1 == main_~i~0#1); 5655#L12-2 assume !(10 == main_~i~0#1); 5654#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5652#L18-1 assume !!(main_~i~0#1 > 0); 5651#L12 assume !(1 == main_~i~0#1); 5650#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 5648#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5514#L18-1 assume !!(main_~i~0#1 > 0); 5508#L12 assume !(1 == main_~i~0#1); 5647#L12-2 assume !(10 == main_~i~0#1); 5641#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5639#L18-1 assume !!(main_~i~0#1 > 0); 5636#L12 [2022-07-14 14:51:43,419 INFO L754 eck$LassoCheckResult]: Loop: 5636#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 5503#L12-2 assume !(10 == main_~i~0#1); 5504#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5630#L18-1 assume !!(main_~i~0#1 > 0); 5628#L12 assume !(1 == main_~i~0#1); 5626#L12-2 assume !(10 == main_~i~0#1); 5624#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5622#L18-1 assume !!(main_~i~0#1 > 0); 5620#L12 assume !(1 == main_~i~0#1); 5618#L12-2 assume !(10 == main_~i~0#1); 5616#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5614#L18-1 assume !!(main_~i~0#1 > 0); 5612#L12 assume !(1 == main_~i~0#1); 5610#L12-2 assume !(10 == main_~i~0#1); 5608#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5606#L18-1 assume !!(main_~i~0#1 > 0); 5604#L12 assume !(1 == main_~i~0#1); 5602#L12-2 assume !(10 == main_~i~0#1); 5600#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5598#L18-1 assume !!(main_~i~0#1 > 0); 5596#L12 assume !(1 == main_~i~0#1); 5594#L12-2 assume !(10 == main_~i~0#1); 5592#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5590#L18-1 assume !!(main_~i~0#1 > 0); 5588#L12 assume !(1 == main_~i~0#1); 5586#L12-2 assume !(10 == main_~i~0#1); 5584#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5582#L18-1 assume !!(main_~i~0#1 > 0); 5581#L12 assume !(1 == main_~i~0#1); 5580#L12-2 assume !(10 == main_~i~0#1); 5579#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5578#L18-1 assume !!(main_~i~0#1 > 0); 5577#L12 assume !(1 == main_~i~0#1); 5575#L12-2 assume !(10 == main_~i~0#1); 5573#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 5569#L18-1 assume !!(main_~i~0#1 > 0); 5567#L12 assume !(1 == main_~i~0#1); 5568#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 5521#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5507#L18-1 assume !!(main_~i~0#1 > 0); 5508#L12 assume !(1 == main_~i~0#1); 5647#L12-2 assume !(10 == main_~i~0#1); 5641#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 5639#L18-1 assume !!(main_~i~0#1 > 0); 5636#L12 [2022-07-14 14:51:43,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:43,419 INFO L85 PathProgramCache]: Analyzing trace with hash -733322943, now seen corresponding path program 4 times [2022-07-14 14:51:43,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:43,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224459583] [2022-07-14 14:51:43,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:43,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:43,426 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:43,432 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:43,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:43,432 INFO L85 PathProgramCache]: Analyzing trace with hash 491326234, now seen corresponding path program 3 times [2022-07-14 14:51:43,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:43,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398039986] [2022-07-14 14:51:43,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:43,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:43,437 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:43,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:43,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:43,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1133081510, now seen corresponding path program 5 times [2022-07-14 14:51:43,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:43,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497502764] [2022-07-14 14:51:43,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:43,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:43,478 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2022-07-14 14:51:43,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:51:43,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497502764] [2022-07-14 14:51:43,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497502764] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:51:43,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666734556] [2022-07-14 14:51:43,479 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 14:51:43,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:51:43,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:43,480 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-14 14:51:43,481 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-14 14:51:43,504 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-07-14 14:51:43,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:51:43,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 14:51:43,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2022-07-14 14:51:43,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:51:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2022-07-14 14:51:43,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666734556] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:51:43,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:51:43,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-07-14 14:51:43,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043031220] [2022-07-14 14:51:43,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:51:43,654 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:51:43,654 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:51:43,654 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:51:43,654 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:51:43,654 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 14:51:43,654 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:43,654 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:51:43,655 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:51:43,655 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2022-07-14 14:51:43,655 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:51:43,655 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:51:43,655 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-14 14:51:43,657 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-14 14:51:43,658 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-14 14:51:43,663 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-14 14:51:43,695 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:51:43,695 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 14:51:43,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:43,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:43,697 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-14 14:51:43,697 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-14 14:51:43,698 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:43,698 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:43,708 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:51:43,708 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_16=1} Honda state: {v_rep~unnamed0~0~true_16=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:51:43,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2022-07-14 14:51:43,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:43,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:43,724 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-14 14:51:43,724 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-14 14:51:43,725 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:43,725 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:43,731 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:51:43,731 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:51:43,745 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-14 14:51:43,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:43,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:43,746 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-14 14:51:43,747 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-14 14:51:43,748 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:43,748 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:43,768 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-14 14:51:43,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:43,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:43,770 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-14 14:51:43,770 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-14 14:51:43,771 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 14:51:43,771 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:43,826 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 14:51:43,832 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-14 14:51:43,832 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:51:43,832 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:51:43,832 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:51:43,832 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:51:43,832 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:51:43,832 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:43,833 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:51:43,833 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:51:43,833 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2022-07-14 14:51:43,833 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:51:43,833 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:51:43,833 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-14 14:51:43,836 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-14 14:51:43,838 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-14 14:51:43,840 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-14 14:51:43,867 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:51:43,867 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:51:43,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:43,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:43,868 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-14 14:51:43,871 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-14 14:51:43,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:43,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:43,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:51:43,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:43,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:51:43,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:51:43,882 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-14 14:51:43,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:51:43,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-07-14 14:51:43,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:43,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:43,906 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-14 14:51:43,907 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-14 14:51:43,908 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-14 14:51:43,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:43,913 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:51:43,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:43,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:51:43,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:43,913 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:51:43,913 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:51:43,930 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:51:43,945 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-14 14:51:43,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:43,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:43,946 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-14 14:51:43,946 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-14 14:51:43,947 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-14 14:51:43,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:43,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:43,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:51:43,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:43,953 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 14:51:43,953 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-14 14:51:43,955 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:51:43,969 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-14 14:51:43,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:43,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:43,970 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-14 14:51:43,971 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-14 14:51:43,972 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-14 14:51:43,976 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:43,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:51:43,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:43,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:51:43,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:43,977 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:51:43,977 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:51:43,989 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:51:43,990 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 14:51:43,990 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-14 14:51:43,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:43,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:43,992 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-14 14:51:43,993 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-14 14:51:43,993 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:51:43,994 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 14:51:43,994 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:51:43,994 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 9 Supporting invariants [] [2022-07-14 14:51:44,008 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-14 14:51:44,009 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 14:51:44,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:44,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:51:44,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:44,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 14:51:44,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:44,149 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-14 14:51:44,150 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-14 14:51:44,150 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-14 14:51:44,171 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 228 states and 242 transitions. Complement of second has 7 states. [2022-07-14 14:51:44,172 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-14 14:51:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-14 14:51:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-07-14 14:51:44,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 47 letters. Loop has 44 letters. [2022-07-14 14:51:44,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:44,173 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:51:44,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:44,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:51:44,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:44,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 14:51:44,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-14 14:51:44,317 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2022-07-14 14:51:44,317 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-14 14:51:44,356 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 238 states and 253 transitions. Complement of second has 11 states. [2022-07-14 14:51:44,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-14 14:51:44,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-14 14:51:44,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2022-07-14 14:51:44,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 47 letters. Loop has 44 letters. [2022-07-14 14:51:44,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:44,357 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:51:44,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:44,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:44,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:51:44,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:44,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:44,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 14:51:44,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-14 14:51:44,501 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-07-14 14:51:44,501 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-14 14:51:44,537 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 342 states and 359 transitions. Complement of second has 9 states. [2022-07-14 14:51:44,543 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-14 14:51:44,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2022-07-14 14:51:44,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-14 14:51:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-07-14 14:51:44,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 47 letters. Loop has 44 letters. [2022-07-14 14:51:44,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:44,545 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:51:44,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:44,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:51:44,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:44,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 14:51:44,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:44,686 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-14 14:51:44,686 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2022-07-14 14:51:44,686 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-14 14:51:44,730 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 191 transitions. cyclomatic complexity: 19. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 490 states and 514 transitions. Complement of second has 19 states. [2022-07-14 14:51:44,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-14 14:51:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-14 14:51:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-07-14 14:51:44,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 47 letters. Loop has 44 letters. [2022-07-14 14:51:44,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:44,732 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:51:44,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:44,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:51:44,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:44,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 14:51:44,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:44,870 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-14 14:51:44,871 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2022-07-14 14:51:44,871 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 179 states and 191 transitions. cyclomatic complexity: 19 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-14 14:51:45,001 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 179 states and 191 transitions. cyclomatic complexity: 19 Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 2294 states and 2963 transitions. Complement of second has 166 states 20 powerset states146 rank states. The highest rank that occured is 5 [2022-07-14 14:51:45,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2022-07-14 14:51:45,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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-14 14:51:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2022-07-14 14:51:45,002 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 44 letters. [2022-07-14 14:51:45,004 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:45,004 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 91 letters. Loop has 44 letters. [2022-07-14 14:51:45,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:45,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 88 letters. [2022-07-14 14:51:45,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:45,021 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2294 states and 2963 transitions. [2022-07-14 14:51:45,031 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 96 [2022-07-14 14:51:45,035 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2294 states to 1175 states and 1510 transitions. [2022-07-14 14:51:45,035 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2022-07-14 14:51:45,035 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 223 [2022-07-14 14:51:45,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1175 states and 1510 transitions. [2022-07-14 14:51:45,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:51:45,036 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1175 states and 1510 transitions. [2022-07-14 14:51:45,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states and 1510 transitions. [2022-07-14 14:51:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 674. [2022-07-14 14:51:45,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 674 states have (on average 1.3902077151335313) internal successors, (937), 673 states have internal predecessors, (937), 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-14 14:51:45,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 937 transitions. [2022-07-14 14:51:45,044 INFO L392 hiAutomatonCegarLoop]: Abstraction has 674 states and 937 transitions. [2022-07-14 14:51:45,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:51:45,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 14:51:45,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-14 14:51:45,044 INFO L87 Difference]: Start difference. First operand 674 states and 937 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 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-14 14:51:45,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:51:45,071 INFO L93 Difference]: Finished difference Result 802 states and 1128 transitions. [2022-07-14 14:51:45,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 14:51:45,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 802 states and 1128 transitions. [2022-07-14 14:51:45,075 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 98 [2022-07-14 14:51:45,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 802 states to 785 states and 1104 transitions. [2022-07-14 14:51:45,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2022-07-14 14:51:45,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2022-07-14 14:51:45,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 785 states and 1104 transitions. [2022-07-14 14:51:45,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:51:45,078 INFO L369 hiAutomatonCegarLoop]: Abstraction has 785 states and 1104 transitions. [2022-07-14 14:51:45,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states and 1104 transitions. [2022-07-14 14:51:45,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 744. [2022-07-14 14:51:45,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 744 states, 744 states have (on average 1.4045698924731183) internal successors, (1045), 743 states have internal predecessors, (1045), 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-14 14:51:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1045 transitions. [2022-07-14 14:51:45,085 INFO L392 hiAutomatonCegarLoop]: Abstraction has 744 states and 1045 transitions. [2022-07-14 14:51:45,085 INFO L374 stractBuchiCegarLoop]: Abstraction has 744 states and 1045 transitions. [2022-07-14 14:51:45,085 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-14 14:51:45,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 744 states and 1045 transitions. [2022-07-14 14:51:45,087 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 90 [2022-07-14 14:51:45,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:51:45,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:51:45,088 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 14, 14, 9, 6, 1, 1, 1, 1] [2022-07-14 14:51:45,088 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 14, 14, 9, 6, 1, 1] [2022-07-14 14:51:45,088 INFO L752 eck$LassoCheckResult]: Stem: 12934#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 12935#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 12939#L18-1 assume !!(main_~i~0#1 > 0); 13270#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 13120#L12-2 assume !(10 == main_~i~0#1); 13258#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13256#L18-1 assume !!(main_~i~0#1 > 0); 13254#L12 assume !(1 == main_~i~0#1); 13252#L12-2 assume !(10 == main_~i~0#1); 13250#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13248#L18-1 assume !!(main_~i~0#1 > 0); 13246#L12 assume !(1 == main_~i~0#1); 13244#L12-2 assume !(10 == main_~i~0#1); 13242#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13240#L18-1 assume !!(main_~i~0#1 > 0); 13238#L12 assume !(1 == main_~i~0#1); 13236#L12-2 assume !(10 == main_~i~0#1); 13234#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13232#L18-1 assume !!(main_~i~0#1 > 0); 13230#L12 assume !(1 == main_~i~0#1); 13228#L12-2 assume !(10 == main_~i~0#1); 13226#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13224#L18-1 assume !!(main_~i~0#1 > 0); 13222#L12 assume !(1 == main_~i~0#1); 13220#L12-2 assume !(10 == main_~i~0#1); 13218#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13216#L18-1 assume !!(main_~i~0#1 > 0); 13214#L12 assume !(1 == main_~i~0#1); 13212#L12-2 assume !(10 == main_~i~0#1); 13210#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13208#L18-1 assume !!(main_~i~0#1 > 0); 13206#L12 assume !(1 == main_~i~0#1); 13204#L12-2 assume !(10 == main_~i~0#1); 13203#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13202#L18-1 assume !!(main_~i~0#1 > 0); 13190#L12 assume !(1 == main_~i~0#1); 13198#L12-2 assume !(10 == main_~i~0#1); 13194#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13189#L18-1 assume !!(main_~i~0#1 > 0); 13188#L12 assume !(1 == main_~i~0#1); 13187#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 13146#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13185#L18-1 assume !!(main_~i~0#1 > 0); 13184#L12 assume !(1 == main_~i~0#1); 13183#L12-2 assume !(10 == main_~i~0#1); 13181#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13180#L18-1 assume !!(main_~i~0#1 > 0); 13179#L12 assume !(1 == main_~i~0#1); 13178#L12-2 assume !(10 == main_~i~0#1); 13176#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13175#L18-1 assume !!(main_~i~0#1 > 0); 13174#L12 assume !(1 == main_~i~0#1); 13173#L12-2 assume !(10 == main_~i~0#1); 13171#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13170#L18-1 assume !!(main_~i~0#1 > 0); 13169#L12 assume !(1 == main_~i~0#1); 13168#L12-2 assume !(10 == main_~i~0#1); 13166#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13165#L18-1 assume !!(main_~i~0#1 > 0); 13118#L12 assume !(1 == main_~i~0#1); 13145#L12-2 assume !(10 == main_~i~0#1); 13121#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13122#L18-1 assume !!(main_~i~0#1 > 0); 13266#L12 [2022-07-14 14:51:45,088 INFO L754 eck$LassoCheckResult]: Loop: 13266#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 13265#L12-2 assume !(10 == main_~i~0#1); 12946#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 12930#L18-1 assume !!(main_~i~0#1 > 0); 12931#L12 assume !(1 == main_~i~0#1); 12941#L12-2 assume !(10 == main_~i~0#1); 13665#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13663#L18-1 assume !!(main_~i~0#1 > 0); 13661#L12 assume !(1 == main_~i~0#1); 13659#L12-2 assume !(10 == main_~i~0#1); 13657#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13655#L18-1 assume !!(main_~i~0#1 > 0); 13653#L12 assume !(1 == main_~i~0#1); 13651#L12-2 assume !(10 == main_~i~0#1); 13649#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13647#L18-1 assume !!(main_~i~0#1 > 0); 13645#L12 assume !(1 == main_~i~0#1); 13643#L12-2 assume !(10 == main_~i~0#1); 13641#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13639#L18-1 assume !!(main_~i~0#1 > 0); 13637#L12 assume !(1 == main_~i~0#1); 13635#L12-2 assume !(10 == main_~i~0#1); 13633#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13631#L18-1 assume !!(main_~i~0#1 > 0); 13629#L12 assume !(1 == main_~i~0#1); 13627#L12-2 assume !(10 == main_~i~0#1); 13625#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13623#L18-1 assume !!(main_~i~0#1 > 0); 13621#L12 assume !(1 == main_~i~0#1); 13619#L12-2 assume !(10 == main_~i~0#1); 13617#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13615#L18-1 assume !!(main_~i~0#1 > 0); 13614#L12 assume !(1 == main_~i~0#1); 13613#L12-2 assume !(10 == main_~i~0#1); 13609#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 13610#L18-1 assume !!(main_~i~0#1 > 0); 13586#L12 assume !(1 == main_~i~0#1); 13587#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 13429#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13510#L18-1 assume !!(main_~i~0#1 > 0); 13506#L12 assume !(1 == main_~i~0#1); 13503#L12-2 assume !(10 == main_~i~0#1); 13496#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13493#L18-1 assume !!(main_~i~0#1 > 0); 13491#L12 assume !(1 == main_~i~0#1); 13490#L12-2 assume !(10 == main_~i~0#1); 13489#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13488#L18-1 assume !!(main_~i~0#1 > 0); 13486#L12 assume !(1 == main_~i~0#1); 13445#L12-2 assume !(10 == main_~i~0#1); 13446#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13487#L18-1 assume !!(main_~i~0#1 > 0); 13484#L12 assume !(1 == main_~i~0#1); 13450#L12-2 assume !(10 == main_~i~0#1); 13448#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13449#L18-1 assume !!(main_~i~0#1 > 0); 13434#L12 assume !(1 == main_~i~0#1); 13430#L12-2 assume !(10 == main_~i~0#1); 13272#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 13273#L18-1 assume !!(main_~i~0#1 > 0); 13266#L12 [2022-07-14 14:51:45,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:45,088 INFO L85 PathProgramCache]: Analyzing trace with hash 912728085, now seen corresponding path program 6 times [2022-07-14 14:51:45,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:45,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643656577] [2022-07-14 14:51:45,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:45,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:45,094 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:45,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:45,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:45,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1190197230, now seen corresponding path program 4 times [2022-07-14 14:51:45,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:45,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161364849] [2022-07-14 14:51:45,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:45,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:45,104 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:45,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:45,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:45,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1444454914, now seen corresponding path program 7 times [2022-07-14 14:51:45,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:45,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211353733] [2022-07-14 14:51:45,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:45,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:45,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2022-07-14 14:51:45,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:51:45,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211353733] [2022-07-14 14:51:45,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211353733] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:51:45,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187633948] [2022-07-14 14:51:45,159 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-14 14:51:45,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:51:45,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:45,160 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 14:51:45,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-07-14 14:51:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:45,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 14:51:45,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:45,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2022-07-14 14:51:45,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:51:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2022-07-14 14:51:45,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187633948] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:51:45,258 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:51:45,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2022-07-14 14:51:45,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412869676] [2022-07-14 14:51:45,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:51:45,427 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:51:45,427 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:51:45,427 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:51:45,427 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:51:45,427 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 14:51:45,428 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:45,428 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:51:45,428 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:51:45,428 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2022-07-14 14:51:45,428 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:51:45,428 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:51:45,428 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-14 14:51:45,430 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-14 14:51:45,433 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-14 14:51:45,435 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-14 14:51:45,459 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:51:45,459 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 14:51:45,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:45,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:45,461 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-14 14:51:45,461 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-14 14:51:45,462 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:45,463 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:45,473 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:51:45,473 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_18=1} Honda state: {v_rep~unnamed0~0~true_18=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:51:45,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-07-14 14:51:45,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:45,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:45,489 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-14 14:51:45,489 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-14 14:51:45,490 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:51:45,490 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:45,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-07-14 14:51:45,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:45,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:45,511 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-14 14:51:45,512 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-14 14:51:45,513 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 14:51:45,513 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:51:45,519 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 14:51:45,534 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-07-14 14:51:45,534 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:51:45,534 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:51:45,534 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:51:45,534 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:51:45,534 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:51:45,534 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:45,534 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:51:45,534 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:51:45,534 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2022-07-14 14:51:45,534 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:51:45,534 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:51:45,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-14 14:51:45,554 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-14 14:51:45,556 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-14 14:51:45,558 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-14 14:51:45,584 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:51:45,584 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:51:45,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:45,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:45,586 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-14 14:51:45,588 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-14 14:51:45,589 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-14 14:51:45,595 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:51:45,595 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:51:45,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:51:45,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:51:45,595 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:51:45,596 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:51:45,596 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:51:45,615 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:51:45,617 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 14:51:45,617 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-14 14:51:45,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:51:45,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:51:45,618 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-14 14:51:45,619 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-14 14:51:45,620 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:51:45,620 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 14:51:45,620 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:51:45,620 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 5 Supporting invariants [] [2022-07-14 14:51:45,635 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2022-07-14 14:51:45,636 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 14:51:45,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:45,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-07-14 14:51:45,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:45,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:51:45,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:45,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 14:51:45,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-14 14:51:45,880 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2022-07-14 14:51:45,880 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-14 14:51:45,906 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 1013 states and 1361 transitions. Complement of second has 7 states. [2022-07-14 14:51:45,907 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-14 14:51:45,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-14 14:51:45,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2022-07-14 14:51:45,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 63 letters. Loop has 60 letters. [2022-07-14 14:51:45,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:45,907 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:51:45,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:45,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:51:45,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:45,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 14:51:45,989 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:46,149 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-14 14:51:46,150 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2022-07-14 14:51:46,150 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-14 14:51:46,192 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 1057 states and 1423 transitions. Complement of second has 11 states. [2022-07-14 14:51:46,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-14 14:51:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-14 14:51:46,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2022-07-14 14:51:46,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 63 letters. Loop has 60 letters. [2022-07-14 14:51:46,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:46,192 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:51:46,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:46,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:51:46,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:46,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:46,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 14:51:46,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:46,429 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-14 14:51:46,429 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2022-07-14 14:51:46,429 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-14 14:51:46,455 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 1553 states and 2121 transitions. Complement of second has 9 states. [2022-07-14 14:51:46,456 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-14 14:51:46,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-14 14:51:46,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2022-07-14 14:51:46,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 63 letters. Loop has 60 letters. [2022-07-14 14:51:46,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:46,457 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:51:46,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:46,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:51:46,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:46,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:46,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 14:51:46,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-14 14:51:46,683 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2022-07-14 14:51:46,683 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-14 14:51:46,732 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 744 states and 1045 transitions. cyclomatic complexity: 322. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 2220 states and 3011 transitions. Complement of second has 19 states. [2022-07-14 14:51:46,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2022-07-14 14:51:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-14 14:51:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-07-14 14:51:46,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 63 letters. Loop has 60 letters. [2022-07-14 14:51:46,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:46,734 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:51:46,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:46,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 14:51:46,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:51:46,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 14:51:46,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:51:46,963 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-14 14:51:46,963 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemin loopwithout honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2022-07-14 14:51:46,963 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 744 states and 1045 transitions. cyclomatic complexity: 322 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-14 14:51:47,333 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 744 states and 1045 transitions. cyclomatic complexity: 322 Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 12508 states and 21932 transitions. Complement of second has 282 states 36 powerset states246 rank states. The highest rank that occured is 5 [2022-07-14 14:51:47,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2022-07-14 14:51:47,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-14 14:51:47,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2022-07-14 14:51:47,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 60 letters. [2022-07-14 14:51:47,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:47,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 123 letters. Loop has 60 letters. [2022-07-14 14:51:47,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:47,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 120 letters. [2022-07-14 14:51:47,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:51:47,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12508 states and 21932 transitions. [2022-07-14 14:51:47,402 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 248 [2022-07-14 14:51:47,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12508 states to 5535 states and 9788 transitions. [2022-07-14 14:51:47,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 330 [2022-07-14 14:51:47,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 575 [2022-07-14 14:51:47,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5535 states and 9788 transitions. [2022-07-14 14:51:47,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:51:47,425 INFO L369 hiAutomatonCegarLoop]: Abstraction has 5535 states and 9788 transitions. [2022-07-14 14:51:47,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states and 9788 transitions. [2022-07-14 14:51:47,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 3406. [2022-07-14 14:51:47,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3406 states, 3406 states have (on average 1.8094539048737521) internal successors, (6163), 3405 states have internal predecessors, (6163), 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-14 14:51:47,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3406 states to 3406 states and 6163 transitions. [2022-07-14 14:51:47,472 INFO L392 hiAutomatonCegarLoop]: Abstraction has 3406 states and 6163 transitions. [2022-07-14 14:51:47,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:51:47,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 14:51:47,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2022-07-14 14:51:47,472 INFO L87 Difference]: Start difference. First operand 3406 states and 6163 transitions. Second operand has 11 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 11 states have internal predecessors, (47), 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-14 14:51:47,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:51:47,515 INFO L93 Difference]: Finished difference Result 3793 states and 7008 transitions. [2022-07-14 14:51:47,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 14:51:47,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3793 states and 7008 transitions. [2022-07-14 14:51:47,537 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 168 [2022-07-14 14:51:47,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3793 states to 3761 states and 6917 transitions. [2022-07-14 14:51:47,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2022-07-14 14:51:47,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2022-07-14 14:51:47,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3761 states and 6917 transitions. [2022-07-14 14:51:47,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:51:47,562 INFO L369 hiAutomatonCegarLoop]: Abstraction has 3761 states and 6917 transitions. [2022-07-14 14:51:47,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3761 states and 6917 transitions. [2022-07-14 14:51:47,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3761 to 3614. [2022-07-14 14:51:47,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3614 states, 3614 states have (on average 1.832595462091865) internal successors, (6623), 3613 states have internal predecessors, (6623), 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-14 14:51:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 6623 transitions. [2022-07-14 14:51:47,603 INFO L392 hiAutomatonCegarLoop]: Abstraction has 3614 states and 6623 transitions. [2022-07-14 14:51:47,603 INFO L374 stractBuchiCegarLoop]: Abstraction has 3614 states and 6623 transitions. [2022-07-14 14:51:47,603 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-14 14:51:47,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3614 states and 6623 transitions. [2022-07-14 14:51:47,612 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 152 [2022-07-14 14:51:47,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:51:47,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:51:47,615 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 17, 17, 9, 9, 1, 1, 1, 1] [2022-07-14 14:51:47,615 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2022-07-14 14:51:47,615 INFO L752 eck$LassoCheckResult]: Stem: 42219#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 42220#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 42223#L18-1 assume !!(main_~i~0#1 > 0); 42475#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 43049#L12-2 assume !(10 == main_~i~0#1); 44280#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44278#L18-1 assume !!(main_~i~0#1 > 0); 44276#L12 assume !(1 == main_~i~0#1); 44274#L12-2 assume !(10 == main_~i~0#1); 44272#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44270#L18-1 assume !!(main_~i~0#1 > 0); 44268#L12 assume !(1 == main_~i~0#1); 44266#L12-2 assume !(10 == main_~i~0#1); 44264#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44262#L18-1 assume !!(main_~i~0#1 > 0); 44260#L12 assume !(1 == main_~i~0#1); 44258#L12-2 assume !(10 == main_~i~0#1); 44256#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44254#L18-1 assume !!(main_~i~0#1 > 0); 44252#L12 assume !(1 == main_~i~0#1); 44250#L12-2 assume !(10 == main_~i~0#1); 44248#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44246#L18-1 assume !!(main_~i~0#1 > 0); 44244#L12 assume !(1 == main_~i~0#1); 44242#L12-2 assume !(10 == main_~i~0#1); 44240#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44238#L18-1 assume !!(main_~i~0#1 > 0); 44236#L12 assume !(1 == main_~i~0#1); 44234#L12-2 assume !(10 == main_~i~0#1); 44232#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44230#L18-1 assume !!(main_~i~0#1 > 0); 44228#L12 assume !(1 == main_~i~0#1); 44226#L12-2 assume !(10 == main_~i~0#1); 44224#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44222#L18-1 assume !!(main_~i~0#1 > 0); 44219#L12 assume !(1 == main_~i~0#1); 44220#L12-2 assume !(10 == main_~i~0#1); 44213#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 44214#L18-1 assume !!(main_~i~0#1 > 0); 43809#L12 assume !(1 == main_~i~0#1); 43810#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 43752#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 43805#L18-1 assume !!(main_~i~0#1 > 0); 43806#L12 assume !(1 == main_~i~0#1); 43801#L12-2 assume !(10 == main_~i~0#1); 43802#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 43796#L18-1 assume !!(main_~i~0#1 > 0); 43797#L12 assume !(1 == main_~i~0#1); 44090#L12-2 assume !(10 == main_~i~0#1); 44088#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44087#L18-1 assume !!(main_~i~0#1 > 0); 44086#L12 assume !(1 == main_~i~0#1); 43783#L12-2 assume !(10 == main_~i~0#1); 43784#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44081#L18-1 assume !!(main_~i~0#1 > 0); 45435#L12 assume !(1 == main_~i~0#1); 45431#L12-2 assume !(10 == main_~i~0#1); 45426#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44073#L18-1 assume !!(main_~i~0#1 > 0); 45389#L12 assume !(1 == main_~i~0#1); 45390#L12-2 assume !(10 == main_~i~0#1); 45485#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44067#L18-1 assume !!(main_~i~0#1 > 0); 45499#L12 assume !(1 == main_~i~0#1); 45498#L12-2 assume !(10 == main_~i~0#1); 45488#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45496#L18-1 assume !!(main_~i~0#1 > 0); 45493#L12 assume !(1 == main_~i~0#1); 45491#L12-2 assume !(10 == main_~i~0#1); 45490#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44195#L18-1 assume !!(main_~i~0#1 > 0); 42948#L12 assume !(1 == main_~i~0#1); 44297#L12-2 assume !(10 == main_~i~0#1); 45482#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 42947#L18-1 assume !!(main_~i~0#1 > 0); 42946#L12 [2022-07-14 14:51:47,615 INFO L754 eck$LassoCheckResult]: Loop: 42946#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 42945#L12-2 assume !(10 == main_~i~0#1); 43888#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 42216#L18-1 assume !!(main_~i~0#1 > 0); 42217#L12 assume !(1 == main_~i~0#1); 42225#L12-2 assume !(10 == main_~i~0#1); 45821#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45819#L18-1 assume !!(main_~i~0#1 > 0); 45817#L12 assume !(1 == main_~i~0#1); 45815#L12-2 assume !(10 == main_~i~0#1); 45813#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45811#L18-1 assume !!(main_~i~0#1 > 0); 45809#L12 assume !(1 == main_~i~0#1); 45807#L12-2 assume !(10 == main_~i~0#1); 45805#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45803#L18-1 assume !!(main_~i~0#1 > 0); 45801#L12 assume !(1 == main_~i~0#1); 45799#L12-2 assume !(10 == main_~i~0#1); 45797#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45795#L18-1 assume !!(main_~i~0#1 > 0); 45793#L12 assume !(1 == main_~i~0#1); 45791#L12-2 assume !(10 == main_~i~0#1); 45789#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45787#L18-1 assume !!(main_~i~0#1 > 0); 45785#L12 assume !(1 == main_~i~0#1); 45783#L12-2 assume !(10 == main_~i~0#1); 45781#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45779#L18-1 assume !!(main_~i~0#1 > 0); 45777#L12 assume !(1 == main_~i~0#1); 45775#L12-2 assume !(10 == main_~i~0#1); 45773#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45771#L18-1 assume !!(main_~i~0#1 > 0); 45769#L12 assume !(1 == main_~i~0#1); 45763#L12-2 assume !(10 == main_~i~0#1); 45762#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 45761#L18-1 assume !!(main_~i~0#1 > 0); 45725#L12 assume !(1 == main_~i~0#1); 45726#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 44284#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45516#L18-1 assume !!(main_~i~0#1 > 0); 45479#L12 assume !(1 == main_~i~0#1); 45478#L12-2 assume !(10 == main_~i~0#1); 45476#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45472#L18-1 assume !!(main_~i~0#1 > 0); 45468#L12 assume !(1 == main_~i~0#1); 45465#L12-2 assume !(10 == main_~i~0#1); 45463#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45458#L18-1 assume !!(main_~i~0#1 > 0); 45459#L12 assume !(1 == main_~i~0#1); 45505#L12-2 assume !(10 == main_~i~0#1); 45449#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45450#L18-1 assume !!(main_~i~0#1 > 0); 45495#L12 assume !(1 == main_~i~0#1); 45440#L12-2 assume !(10 == main_~i~0#1); 45428#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45427#L18-1 assume !!(main_~i~0#1 > 0); 45396#L12 assume !(1 == main_~i~0#1); 45354#L12-2 assume !(10 == main_~i~0#1); 45348#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45344#L18-1 assume !!(main_~i~0#1 > 0); 45345#L12 assume !(1 == main_~i~0#1); 45341#L12-2 assume !(10 == main_~i~0#1); 45339#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 45336#L18-1 assume !!(main_~i~0#1 > 0); 44368#L12 assume !(1 == main_~i~0#1); 44307#L12-2 assume !(10 == main_~i~0#1); 44308#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 44323#L18-1 assume !!(main_~i~0#1 > 0); 43934#L12 assume !(1 == main_~i~0#1); 44288#L12-2 assume !(10 == main_~i~0#1); 43293#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 43294#L18-1 assume !!(main_~i~0#1 > 0); 42946#L12 [2022-07-14 14:51:47,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:47,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1568126196, now seen corresponding path program 8 times [2022-07-14 14:51:47,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:47,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158786709] [2022-07-14 14:51:47,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:47,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:47,628 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:47,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:47,639 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:47,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:47,639 INFO L85 PathProgramCache]: Analyzing trace with hash 537366349, now seen corresponding path program 5 times [2022-07-14 14:51:47,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:47,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756151747] [2022-07-14 14:51:47,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:47,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:47,653 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:47,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:47,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:51:47,660 INFO L85 PathProgramCache]: Analyzing trace with hash 758614336, now seen corresponding path program 9 times [2022-07-14 14:51:47,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:51:47,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251959437] [2022-07-14 14:51:47,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:51:47,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:51:47,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:47,673 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:51:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:51:47,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:51:48,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 02:51:48 BoogieIcfgContainer [2022-07-14 14:51:48,152 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 14:51:48,153 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 14:51:48,153 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 14:51:48,153 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 14:51:48,153 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:51:38" (3/4) ... [2022-07-14 14:51:48,155 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-07-14 14:51:48,195 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 14:51:48,195 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 14:51:48,196 INFO L158 Benchmark]: Toolchain (without parser) took 10258.90ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 91.1MB in the beginning and 156.6MB in the end (delta: -65.5MB). Peak memory consumption was 122.7MB. Max. memory is 16.1GB. [2022-07-14 14:51:48,196 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory was 56.9MB in the beginning and 56.9MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:51:48,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.79ms. Allocated memory is still 113.2MB. Free memory was 90.9MB in the beginning and 85.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-14 14:51:48,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.18ms. Allocated memory is still 113.2MB. Free memory was 85.6MB in the beginning and 84.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 14:51:48,197 INFO L158 Benchmark]: Boogie Preprocessor took 13.21ms. Allocated memory is still 113.2MB. Free memory was 84.3MB in the beginning and 83.4MB in the end (delta: 890.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:51:48,197 INFO L158 Benchmark]: RCFGBuilder took 173.33ms. Allocated memory is still 113.2MB. Free memory was 83.2MB in the beginning and 75.3MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 14:51:48,197 INFO L158 Benchmark]: BuchiAutomizer took 9822.87ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 75.3MB in the beginning and 54.6MB in the end (delta: 20.7MB). Peak memory consumption was 105.0MB. Max. memory is 16.1GB. [2022-07-14 14:51:48,197 INFO L158 Benchmark]: Witness Printer took 42.80ms. Allocated memory is still 197.1MB. Free memory was 54.6MB in the beginning and 156.6MB in the end (delta: -102.1MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2022-07-14 14:51:48,199 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory was 56.9MB in the beginning and 56.9MB in the end (delta: 37.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 182.79ms. Allocated memory is still 113.2MB. Free memory was 90.9MB in the beginning and 85.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.18ms. Allocated memory is still 113.2MB. Free memory was 85.6MB in the beginning and 84.3MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.21ms. Allocated memory is still 113.2MB. Free memory was 84.3MB in the beginning and 83.4MB in the end (delta: 890.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 173.33ms. Allocated memory is still 113.2MB. Free memory was 83.2MB in the beginning and 75.3MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 9822.87ms. Allocated memory was 113.2MB in the beginning and 197.1MB in the end (delta: 83.9MB). Free memory was 75.3MB in the beginning and 54.6MB in the end (delta: 20.7MB). Peak memory consumption was 105.0MB. Max. memory is 16.1GB. * Witness Printer took 42.80ms. Allocated memory is still 197.1MB. Free memory was 54.6MB in the beginning and 156.6MB in the end (delta: -102.1MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 18 terminating modules (9 trivial, 6 deterministic, 3 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 21 and consists of 5 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function -1 * i + 5 and consists of 6 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function -2 * i + 9 and consists of 9 locations. One nondeterministic module has affine ranking function -2 * i + 5 and consists of 13 locations. 9 modules have a trivial ranking function, the largest among these consists of 11 locations. The remainder module has 3614 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.7s and 13 iterations. TraceHistogramMax:19. Analysis of lassos took 5.4s. Construction of modules took 0.4s. Büchi inclusion checks took 3.4s. Highest rank in rank-based complementation 5. Minimization of det autom 2. Minimization of nondet autom 16. Automata minimization 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 3069 StatesRemovedByMinimization, 15 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 1, 1, 0, 2]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 741/820 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 426 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 391 mSDsluCounter, 237 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 155 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 775 IncrementalHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 155 mSolverCounterUnsat, 207 mSDtfsCounter, 775 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT3 SILN0 SILU0 SILI1 SILT3 lasso1 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax168 hnf100 lsp46 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq190 hnf93 smp92 dnf133 smp95 tf107 neg95 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 55ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {i=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2eb582d=0, up=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 12]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 [L11] COND TRUE i > 0 [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 Loop: [L12] COND TRUE i == 1 [L13] up = 1 [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND TRUE up == 1 [L19] i = i+1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND TRUE i == 10 [L16] up = 0 [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 [L12] COND FALSE !(i == 1) [L15] COND FALSE !(i == 10) [L18] COND FALSE !(up == 1) [L21] i = i-1 [L11] COND TRUE i > 0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-07-14 14:51:48,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-07-14 14:51:48,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-07-14 14:51:48,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-07-14 14:51:48,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-07-14 14:51:49,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-07-14 14:51:49,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)