./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 b5317dae 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-?-b5317da-m [2023-02-16 04:32:44,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 04:32:44,952 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 04:32:44,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 04:32:44,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 04:32:44,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 04:32:44,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 04:32:44,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 04:32:44,977 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 04:32:44,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 04:32:44,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 04:32:44,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 04:32:44,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 04:32:44,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 04:32:44,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 04:32:44,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 04:32:44,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 04:32:44,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 04:32:44,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 04:32:44,985 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 04:32:44,986 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 04:32:44,987 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 04:32:44,988 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 04:32:44,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 04:32:44,991 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 04:32:45,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 04:32:45,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 04:32:45,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 04:32:45,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 04:32:45,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 04:32:45,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 04:32:45,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 04:32:45,006 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 04:32:45,007 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 04:32:45,007 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 04:32:45,007 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 04:32:45,008 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 04:32:45,008 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 04:32:45,008 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 04:32:45,009 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 04:32:45,009 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 04:32:45,010 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-16 04:32:45,030 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 04:32:45,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 04:32:45,030 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 04:32:45,031 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 04:32:45,031 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 04:32:45,031 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 04:32:45,032 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 04:32:45,032 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-16 04:32:45,032 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-16 04:32:45,032 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-16 04:32:45,032 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-16 04:32:45,032 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-16 04:32:45,032 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-16 04:32:45,033 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 04:32:45,037 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 04:32:45,037 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 04:32:45,037 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 04:32:45,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-16 04:32:45,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-16 04:32:45,038 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-16 04:32:45,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 04:32:45,038 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-16 04:32:45,038 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 04:32:45,039 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-16 04:32:45,039 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 04:32:45,039 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 04:32:45,040 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 04:32:45,040 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 04:32:45,045 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-16 04:32:45,045 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 [2023-02-16 04:32:45,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 04:32:45,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 04:32:45,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 04:32:45,284 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 04:32:45,284 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 04:32:45,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Ex08.c [2023-02-16 04:32:46,314 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 04:32:46,466 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 04:32:46,466 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Ex08.c [2023-02-16 04:32:46,470 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f8e4c732/880270463cee44e99d0057fbba5f5931/FLAG26ea3d4de [2023-02-16 04:32:46,484 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f8e4c732/880270463cee44e99d0057fbba5f5931 [2023-02-16 04:32:46,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 04:32:46,489 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 04:32:46,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 04:32:46,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 04:32:46,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 04:32:46,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:32:46" (1/1) ... [2023-02-16 04:32:46,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@798e823c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:32:46, skipping insertion in model container [2023-02-16 04:32:46,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 04:32:46" (1/1) ... [2023-02-16 04:32:46,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 04:32:46,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 04:32:46,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:32:46,627 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 04:32:46,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 04:32:46,644 INFO L208 MainTranslator]: Completed translation [2023-02-16 04:32:46,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:32:46 WrapperNode [2023-02-16 04:32:46,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 04:32:46,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 04:32:46,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 04:32:46,647 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 04:32:46,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:32:46" (1/1) ... [2023-02-16 04:32:46,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:32:46" (1/1) ... [2023-02-16 04:32:46,667 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2023-02-16 04:32:46,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 04:32:46,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 04:32:46,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 04:32:46,669 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 04:32:46,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:32:46" (1/1) ... [2023-02-16 04:32:46,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:32:46" (1/1) ... [2023-02-16 04:32:46,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:32:46" (1/1) ... [2023-02-16 04:32:46,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:32:46" (1/1) ... [2023-02-16 04:32:46,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:32:46" (1/1) ... [2023-02-16 04:32:46,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:32:46" (1/1) ... [2023-02-16 04:32:46,680 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:32:46" (1/1) ... [2023-02-16 04:32:46,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:32:46" (1/1) ... [2023-02-16 04:32:46,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 04:32:46,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 04:32:46,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 04:32:46,683 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 04:32:46,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:32:46" (1/1) ... [2023-02-16 04:32:46,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:46,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:46,706 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) [2023-02-16 04:32:46,712 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 [2023-02-16 04:32:46,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 04:32:46,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 04:32:46,780 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 04:32:46,782 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 04:32:46,846 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 04:32:46,849 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 04:32:46,850 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-16 04:32:46,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:32:46 BoogieIcfgContainer [2023-02-16 04:32:46,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 04:32:46,864 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-16 04:32:46,864 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-16 04:32:46,867 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-16 04:32:46,867 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-16 04:32:46,867 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.02 04:32:46" (1/3) ... [2023-02-16 04:32:46,868 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cee6cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.02 04:32:46, skipping insertion in model container [2023-02-16 04:32:46,869 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-16 04:32:46,869 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 04:32:46" (2/3) ... [2023-02-16 04:32:46,869 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3cee6cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.02 04:32:46, skipping insertion in model container [2023-02-16 04:32:46,869 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-16 04:32:46,872 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:32:46" (3/3) ... [2023-02-16 04:32:46,873 INFO L332 chiAutomizerObserver]: Analyzing ICFG Ex08.c [2023-02-16 04:32:46,918 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-16 04:32:46,919 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-16 04:32:46,919 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-16 04:32:46,919 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-16 04:32:46,919 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-16 04:32:46,919 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-16 04:32:46,919 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-16 04:32:46,919 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-16 04:32:46,924 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) [2023-02-16 04:32:46,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-16 04:32:46,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:32:46,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:32:46,939 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-16 04:32:46,939 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-16 04:32:46,939 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-16 04:32:46,940 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) [2023-02-16 04:32:46,941 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-16 04:32:46,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:32:46,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:32:46,942 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-16 04:32:46,942 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-16 04:32:46,948 INFO L748 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true 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; 4#L18-1true [2023-02-16 04:32:46,949 INFO L750 eck$LassoCheckResult]: Loop: 4#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; 4#L18-1true [2023-02-16 04:32:46,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:46,958 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-02-16 04:32:46,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:46,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680850339] [2023-02-16 04:32:46,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:46,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:47,024 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:47,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:47,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:47,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2023-02-16 04:32:47,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:47,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605613164] [2023-02-16 04:32:47,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:47,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:32:47,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:32:47,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605613164] [2023-02-16 04:32:47,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605613164] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:32:47,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:32:47,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:32:47,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704922795] [2023-02-16 04:32:47,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:32:47,123 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-16 04:32:47,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:32:47,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:32:47,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:32:47,151 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) [2023-02-16 04:32:47,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:32:47,178 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2023-02-16 04:32:47,179 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2023-02-16 04:32:47,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-16 04:32:47,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 10 states and 15 transitions. [2023-02-16 04:32:47,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2023-02-16 04:32:47,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2023-02-16 04:32:47,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 15 transitions. [2023-02-16 04:32:47,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-16 04:32:47,183 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2023-02-16 04:32:47,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 15 transitions. [2023-02-16 04:32:47,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-02-16 04:32:47,205 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) [2023-02-16 04:32:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2023-02-16 04:32:47,213 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 15 transitions. [2023-02-16 04:32:47,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:32:47,217 INFO L428 stractBuchiCegarLoop]: Abstraction has 10 states and 15 transitions. [2023-02-16 04:32:47,217 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-16 04:32:47,218 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 15 transitions. [2023-02-16 04:32:47,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-16 04:32:47,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:32:47,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:32:47,219 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-16 04:32:47,219 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-16 04:32:47,219 INFO L748 eck$LassoCheckResult]: Stem: 42#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 43#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 [2023-02-16 04:32:47,219 INFO L750 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 [2023-02-16 04:32:47,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:47,220 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2023-02-16 04:32:47,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:47,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689985772] [2023-02-16 04:32:47,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:47,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:47,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:47,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:47,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:47,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1265324, now seen corresponding path program 1 times [2023-02-16 04:32:47,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:47,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921612091] [2023-02-16 04:32:47,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:47,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:47,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:32:47,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:32:47,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921612091] [2023-02-16 04:32:47,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921612091] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:32:47,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:32:47,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 04:32:47,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795427660] [2023-02-16 04:32:47,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:32:47,268 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-16 04:32:47,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:32:47,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:32:47,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:32:47,269 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) [2023-02-16 04:32:47,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:32:47,291 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2023-02-16 04:32:47,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 21 transitions. [2023-02-16 04:32:47,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-16 04:32:47,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 21 transitions. [2023-02-16 04:32:47,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2023-02-16 04:32:47,293 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2023-02-16 04:32:47,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 21 transitions. [2023-02-16 04:32:47,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-02-16 04:32:47,294 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2023-02-16 04:32:47,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 21 transitions. [2023-02-16 04:32:47,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-02-16 04:32:47,295 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) [2023-02-16 04:32:47,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 21 transitions. [2023-02-16 04:32:47,295 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 21 transitions. [2023-02-16 04:32:47,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:32:47,296 INFO L428 stractBuchiCegarLoop]: Abstraction has 14 states and 21 transitions. [2023-02-16 04:32:47,296 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-16 04:32:47,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 21 transitions. [2023-02-16 04:32:47,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-16 04:32:47,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:32:47,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:32:47,297 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-16 04:32:47,297 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-16 04:32:47,298 INFO L748 eck$LassoCheckResult]: Stem: 71#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 72#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 [2023-02-16 04:32:47,298 INFO L750 eck$LassoCheckResult]: Loop: 74#L18-1 assume !!(main_~i~0#1 > 0); 79#L12 assume !(1 == main_~i~0#1); 78#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 [2023-02-16 04:32:47,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:47,298 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2023-02-16 04:32:47,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:47,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672737784] [2023-02-16 04:32:47,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:47,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:47,309 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:47,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:47,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:47,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1267246, now seen corresponding path program 1 times [2023-02-16 04:32:47,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:47,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377215345] [2023-02-16 04:32:47,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:47,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:47,319 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:47,322 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:47,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:47,323 INFO L85 PathProgramCache]: Analyzing trace with hash 889694448, now seen corresponding path program 1 times [2023-02-16 04:32:47,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:47,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601854923] [2023-02-16 04:32:47,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:47,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:47,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:47,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:47,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:47,380 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:32:47,381 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:32:47,381 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:32:47,381 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:32:47,382 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:32:47,382 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:47,382 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:32:47,382 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:32:47,382 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2023-02-16 04:32:47,382 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:32:47,382 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:32:47,395 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:47,406 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:47,410 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:47,417 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:47,473 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:32:47,474 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:32:47,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:47,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:47,476 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) [2023-02-16 04:32:47,477 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 [2023-02-16 04:32:47,480 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:47,485 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:47,504 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:32:47,504 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: [] [2023-02-16 04:32:47,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2023-02-16 04:32:47,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:47,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:47,514 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) [2023-02-16 04:32:47,515 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 [2023-02-16 04:32:47,517 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:47,517 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:47,528 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:32:47,528 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: [] [2023-02-16 04:32:47,533 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 [2023-02-16 04:32:47,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:47,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:47,534 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) [2023-02-16 04:32:47,554 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 [2023-02-16 04:32:47,555 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:47,555 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:47,579 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 [2023-02-16 04:32:47,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:47,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:47,581 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) [2023-02-16 04:32:47,584 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 [2023-02-16 04:32:47,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:32:47,586 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:47,609 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:32:47,611 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 [2023-02-16 04:32:47,612 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:32:47,612 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:32:47,612 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:32:47,612 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:32:47,612 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:32:47,612 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:47,612 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:32:47,612 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:32:47,612 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration3_Loop [2023-02-16 04:32:47,612 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:32:47,612 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:32:47,614 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:47,617 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:47,619 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:47,623 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:47,670 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:32:47,673 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:32:47,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:47,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:47,675 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) [2023-02-16 04:32:47,677 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 [2023-02-16 04:32:47,679 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 [2023-02-16 04:32:47,685 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:32:47,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:32:47,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:32:47,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:32:47,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:32:47,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:32:47,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:32:47,709 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:32:47,728 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 [2023-02-16 04:32:47,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:47,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:47,729 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) [2023-02-16 04:32:47,732 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 [2023-02-16 04:32:47,734 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 [2023-02-16 04:32:47,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:32:47,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:32:47,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:32:47,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:32:47,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-16 04:32:47,744 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-16 04:32:47,764 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:32:47,767 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 [2023-02-16 04:32:47,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:47,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:47,770 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) [2023-02-16 04:32:47,771 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 [2023-02-16 04:32:47,773 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 [2023-02-16 04:32:47,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:32:47,779 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:32:47,779 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:32:47,779 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:32:47,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-16 04:32:47,782 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-16 04:32:47,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:32:47,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2023-02-16 04:32:47,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:47,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:47,805 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) [2023-02-16 04:32:47,805 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 [2023-02-16 04:32:47,808 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 [2023-02-16 04:32:47,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:32:47,814 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:32:47,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:32:47,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:32:47,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:32:47,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:32:47,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:32:47,823 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:32:47,826 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-02-16 04:32:47,826 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-16 04:32:47,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:47,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:47,828 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) [2023-02-16 04:32:47,829 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 [2023-02-16 04:32:47,831 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:32:47,832 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-16 04:32:47,832 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:32:47,832 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 [] [2023-02-16 04:32:47,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2023-02-16 04:32:47,839 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-16 04:32:47,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:47,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:32:47,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:47,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:32:47,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:47,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:32:47,888 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-16 04:32:47,889 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) [2023-02-16 04:32:47,923 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. [2023-02-16 04:32:47,924 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 [2023-02-16 04:32:47,925 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) [2023-02-16 04:32:47,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 10 transitions. [2023-02-16 04:32:47,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 4 letters. [2023-02-16 04:32:47,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:47,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 6 letters. Loop has 4 letters. [2023-02-16 04:32:47,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:47,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 10 transitions. Stem has 2 letters. Loop has 8 letters. [2023-02-16 04:32:47,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:47,927 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 51 transitions. [2023-02-16 04:32:47,928 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2023-02-16 04:32:47,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 30 states and 44 transitions. [2023-02-16 04:32:47,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2023-02-16 04:32:47,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2023-02-16 04:32:47,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 44 transitions. [2023-02-16 04:32:47,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:32:47,929 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 44 transitions. [2023-02-16 04:32:47,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 44 transitions. [2023-02-16 04:32:47,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2023-02-16 04:32:47,931 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) [2023-02-16 04:32:47,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2023-02-16 04:32:47,931 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 36 transitions. [2023-02-16 04:32:47,931 INFO L428 stractBuchiCegarLoop]: Abstraction has 25 states and 36 transitions. [2023-02-16 04:32:47,931 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-16 04:32:47,931 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 36 transitions. [2023-02-16 04:32:47,932 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2023-02-16 04:32:47,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:32:47,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:32:47,932 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-02-16 04:32:47,932 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-16 04:32:47,932 INFO L748 eck$LassoCheckResult]: Stem: 166#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 167#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; 169#L18-1 assume !!(main_~i~0#1 > 0); 163#L12 [2023-02-16 04:32:47,932 INFO L750 eck$LassoCheckResult]: Loop: 163#L12 assume !(1 == main_~i~0#1); 179#L12-2 assume !(10 == main_~i~0#1); 168#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 162#L18-1 assume !!(main_~i~0#1 > 0); 163#L12 [2023-02-16 04:32:47,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:47,933 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2023-02-16 04:32:47,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:47,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519755431] [2023-02-16 04:32:47,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:47,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:47,936 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:47,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:47,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:47,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1422198, now seen corresponding path program 1 times [2023-02-16 04:32:47,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:47,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756164507] [2023-02-16 04:32:47,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:47,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:47,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:47,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:47,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:47,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1810726045, now seen corresponding path program 1 times [2023-02-16 04:32:47,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:47,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861839822] [2023-02-16 04:32:47,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:47,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:47,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:47,947 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:47,950 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:47,969 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:32:47,970 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:32:47,970 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:32:47,970 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:32:47,970 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:32:47,970 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:47,970 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:32:47,970 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:32:47,970 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2023-02-16 04:32:47,970 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:32:47,970 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:32:47,971 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:47,973 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:47,978 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:47,980 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,034 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:32:48,034 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:32:48,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:48,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:48,036 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) [2023-02-16 04:32:48,043 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 [2023-02-16 04:32:48,043 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:48,044 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:48,054 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:32:48,054 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: [] [2023-02-16 04:32:48,059 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 [2023-02-16 04:32:48,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:48,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:48,060 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) [2023-02-16 04:32:48,062 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 [2023-02-16 04:32:48,063 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:48,064 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:48,083 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 [2023-02-16 04:32:48,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:48,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:48,085 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) [2023-02-16 04:32:48,086 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 [2023-02-16 04:32:48,088 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:32:48,088 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:48,118 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:32:48,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2023-02-16 04:32:48,132 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:32:48,133 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:32:48,133 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:32:48,133 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:32:48,133 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:32:48,133 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:48,133 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:32:48,133 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:32:48,133 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration4_Loop [2023-02-16 04:32:48,133 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:32:48,133 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:32:48,134 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,139 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,146 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,149 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,212 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:32:48,212 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:32:48,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:48,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:48,214 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) [2023-02-16 04:32:48,216 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 [2023-02-16 04:32:48,217 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 [2023-02-16 04:32:48,223 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:32:48,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:32:48,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:32:48,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:32:48,231 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-16 04:32:48,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-16 04:32:48,253 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 [2023-02-16 04:32:48,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:32:48,277 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 [2023-02-16 04:32:48,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:48,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:48,278 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) [2023-02-16 04:32:48,280 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 [2023-02-16 04:32:48,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-16 04:32:48,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:32:48,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:32:48,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:32:48,288 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-16 04:32:48,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:32:48,289 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-16 04:32:48,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:32:48,301 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:32:48,304 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-16 04:32:48,304 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-16 04:32:48,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:48,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:48,305 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) [2023-02-16 04:32:48,307 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 [2023-02-16 04:32:48,309 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:32:48,309 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-16 04:32:48,309 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:32:48,309 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 [] [2023-02-16 04:32:48,319 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 [2023-02-16 04:32:48,321 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-16 04:32:48,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:48,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:48,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:32:48,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:48,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:48,347 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:32:48,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:32:48,376 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-16 04:32:48,377 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) [2023-02-16 04:32:48,406 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. [2023-02-16 04:32:48,406 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 [2023-02-16 04:32:48,408 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) [2023-02-16 04:32:48,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2023-02-16 04:32:48,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 4 letters. [2023-02-16 04:32:48,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:48,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 7 letters. Loop has 4 letters. [2023-02-16 04:32:48,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:48,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 3 letters. Loop has 8 letters. [2023-02-16 04:32:48,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:48,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. [2023-02-16 04:32:48,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-16 04:32:48,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 32 states and 49 transitions. [2023-02-16 04:32:48,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2023-02-16 04:32:48,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2023-02-16 04:32:48,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 49 transitions. [2023-02-16 04:32:48,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:32:48,421 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-02-16 04:32:48,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 49 transitions. [2023-02-16 04:32:48,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-16 04:32:48,426 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) [2023-02-16 04:32:48,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 49 transitions. [2023-02-16 04:32:48,445 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-02-16 04:32:48,445 INFO L428 stractBuchiCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-02-16 04:32:48,445 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-16 04:32:48,445 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 49 transitions. [2023-02-16 04:32:48,446 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-16 04:32:48,446 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:32:48,446 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:32:48,446 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-02-16 04:32:48,446 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-16 04:32:48,446 INFO L748 eck$LassoCheckResult]: Stem: 275#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 276#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; 279#L18-1 assume !!(main_~i~0#1 > 0); 282#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 284#L12-2 assume !(10 == main_~i~0#1); 289#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 290#L18-1 [2023-02-16 04:32:48,446 INFO L750 eck$LassoCheckResult]: Loop: 290#L18-1 assume !!(main_~i~0#1 > 0); 297#L12 assume !(1 == main_~i~0#1); 291#L12-2 assume !(10 == main_~i~0#1); 292#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 290#L18-1 [2023-02-16 04:32:48,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:48,447 INFO L85 PathProgramCache]: Analyzing trace with hash 889692586, now seen corresponding path program 1 times [2023-02-16 04:32:48,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:48,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625530783] [2023-02-16 04:32:48,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:48,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:48,458 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:48,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:48,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:48,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1267306, now seen corresponding path program 1 times [2023-02-16 04:32:48,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:48,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815459091] [2023-02-16 04:32:48,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:48,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:48,476 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:48,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:48,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:48,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:48,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1068497811, now seen corresponding path program 1 times [2023-02-16 04:32:48,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:48,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767353513] [2023-02-16 04:32:48,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:48,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:48,487 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:48,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:48,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:48,509 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:32:48,509 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:32:48,509 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:32:48,509 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:32:48,509 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:32:48,509 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:48,509 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:32:48,510 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:32:48,510 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Loop [2023-02-16 04:32:48,510 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:32:48,510 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:32:48,510 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,514 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,516 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,522 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,581 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:32:48,581 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:32:48,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:48,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:48,583 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) [2023-02-16 04:32:48,585 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 [2023-02-16 04:32:48,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:48,586 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:48,607 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:32:48,608 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: [] [2023-02-16 04:32:48,611 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 [2023-02-16 04:32:48,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:48,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:48,612 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) [2023-02-16 04:32:48,614 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 [2023-02-16 04:32:48,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:48,616 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:48,641 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:32:48,641 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: [] [2023-02-16 04:32:48,644 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 [2023-02-16 04:32:48,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:48,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:48,645 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) [2023-02-16 04:32:48,647 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 [2023-02-16 04:32:48,648 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:48,648 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:48,681 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 [2023-02-16 04:32:48,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:48,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:48,683 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) [2023-02-16 04:32:48,695 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:32:48,695 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:48,714 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:32:48,714 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~i~0#1=15} Honda state: {ULTIMATE.start_main_~i~0#1=15} Generalized eigenvectors: [{ULTIMATE.start_main_~i~0#1=0}, {ULTIMATE.start_main_~i~0#1=1}, {ULTIMATE.start_main_~i~0#1=0}] Lambdas: [1, 1, 16] Nus: [0, 0] [2023-02-16 04:32:48,714 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 [2023-02-16 04:32:48,719 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 [2023-02-16 04:32:48,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:48,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:48,720 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) [2023-02-16 04:32:48,725 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:48,725 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:48,725 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 [2023-02-16 04:32:48,741 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:32:48,741 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: [] [2023-02-16 04:32:48,746 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 [2023-02-16 04:32:48,770 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:32:48,770 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:32:48,770 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:32:48,770 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:32:48,770 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:32:48,771 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:48,771 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:32:48,771 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:32:48,771 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2023-02-16 04:32:48,771 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:32:48,771 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:32:48,772 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,782 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,789 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,792 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,794 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,797 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,874 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:32:48,874 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:32:48,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:48,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:48,877 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) [2023-02-16 04:32:48,879 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 [2023-02-16 04:32:48,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:48,881 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:48,887 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:32:48,888 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: [] [2023-02-16 04:32:48,892 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 [2023-02-16 04:32:48,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:48,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:48,893 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) [2023-02-16 04:32:48,894 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 [2023-02-16 04:32:48,896 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:48,896 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:48,905 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 [2023-02-16 04:32:48,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:48,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:48,906 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) [2023-02-16 04:32:48,907 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 [2023-02-16 04:32:48,909 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:32:48,909 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:48,936 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:32:48,943 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 [2023-02-16 04:32:48,943 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:32:48,943 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:32:48,943 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:32:48,943 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:32:48,943 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:32:48,943 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:48,943 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:32:48,943 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:32:48,943 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration5_Lasso [2023-02-16 04:32:48,943 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:32:48,944 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:32:48,944 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,946 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,954 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,956 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,958 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:48,961 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:49,030 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:32:49,031 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:32:49,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:49,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:49,033 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) [2023-02-16 04:32:49,035 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 [2023-02-16 04:32:49,037 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 [2023-02-16 04:32:49,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:32:49,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:32:49,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:32:49,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:32:49,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:32:49,044 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:32:49,044 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:32:49,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:32:49,060 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 [2023-02-16 04:32:49,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:49,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:49,061 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) [2023-02-16 04:32:49,061 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 [2023-02-16 04:32:49,069 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 [2023-02-16 04:32:49,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:32:49,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:32:49,076 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-16 04:32:49,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:32:49,081 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2023-02-16 04:32:49,081 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2023-02-16 04:32:49,095 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:32:49,107 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2023-02-16 04:32:49,107 INFO L444 ModelExtractionUtils]: 2 out of 11 variables were initially zero. Simplification set additionally 4 variables to zero. [2023-02-16 04:32:49,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:49,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:49,119 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) [2023-02-16 04:32:49,120 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 [2023-02-16 04:32:49,121 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:32:49,143 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2023-02-16 04:32:49,143 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:32:49,143 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] [2023-02-16 04:32:49,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2023-02-16 04:32:49,151 INFO L156 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2023-02-16 04:32:49,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:49,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:49,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:32:49,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:49,192 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 04:32:49,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:49,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:32:49,223 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2023-02-16 04:32:49,223 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) [2023-02-16 04:32:49,266 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. [2023-02-16 04:32:49,266 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 [2023-02-16 04:32:49,267 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) [2023-02-16 04:32:49,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2023-02-16 04:32:49,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 4 letters. [2023-02-16 04:32:49,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:49,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 10 letters. Loop has 4 letters. [2023-02-16 04:32:49,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:49,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 6 letters. Loop has 8 letters. [2023-02-16 04:32:49,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:49,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 68 transitions. [2023-02-16 04:32:49,269 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-16 04:32:49,269 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 67 transitions. [2023-02-16 04:32:49,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2023-02-16 04:32:49,269 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2023-02-16 04:32:49,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 67 transitions. [2023-02-16 04:32:49,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:32:49,270 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 67 transitions. [2023-02-16 04:32:49,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 67 transitions. [2023-02-16 04:32:49,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2023-02-16 04:32:49,271 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) [2023-02-16 04:32:49,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 64 transitions. [2023-02-16 04:32:49,272 INFO L240 hiAutomatonCegarLoop]: Abstraction has 42 states and 64 transitions. [2023-02-16 04:32:49,272 INFO L428 stractBuchiCegarLoop]: Abstraction has 42 states and 64 transitions. [2023-02-16 04:32:49,272 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-16 04:32:49,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 64 transitions. [2023-02-16 04:32:49,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2023-02-16 04:32:49,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:32:49,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:32:49,273 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 04:32:49,273 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-16 04:32:49,273 INFO L748 eck$LassoCheckResult]: Stem: 418#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 419#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; 423#L18-1 assume !!(main_~i~0#1 > 0); 432#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 429#L12-2 assume !(10 == main_~i~0#1); 428#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 427#L18-1 assume !!(main_~i~0#1 > 0); 424#L12 assume !(1 == main_~i~0#1); 425#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 449#L15-1 [2023-02-16 04:32:49,273 INFO L750 eck$LassoCheckResult]: Loop: 449#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 414#L18-1 assume !!(main_~i~0#1 > 0); 415#L12 assume !(1 == main_~i~0#1); 448#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 449#L15-1 [2023-02-16 04:32:49,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:49,273 INFO L85 PathProgramCache]: Analyzing trace with hash 588656997, now seen corresponding path program 1 times [2023-02-16 04:32:49,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:49,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229821562] [2023-02-16 04:32:49,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:49,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:49,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:49,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:32:49,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:32:49,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229821562] [2023-02-16 04:32:49,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229821562] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:32:49,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024589849] [2023-02-16 04:32:49,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:49,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:32:49,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:49,300 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) [2023-02-16 04:32:49,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-02-16 04:32:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:49,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 04:32:49,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:49,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:32:49,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:32:49,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:32:49,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024589849] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:32:49,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:32:49,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-02-16 04:32:49,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984874478] [2023-02-16 04:32:49,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:32:49,345 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-16 04:32:49,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:49,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1768756, now seen corresponding path program 2 times [2023-02-16 04:32:49,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:49,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353511124] [2023-02-16 04:32:49,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:49,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:49,349 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:49,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:49,371 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:32:49,371 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:32:49,371 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:32:49,371 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:32:49,372 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:32:49,372 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:49,372 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:32:49,372 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:32:49,372 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2023-02-16 04:32:49,372 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:32:49,372 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:32:49,372 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:49,376 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:49,379 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:49,381 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:49,414 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:32:49,414 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:32:49,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:49,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:49,417 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) [2023-02-16 04:32:49,417 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 [2023-02-16 04:32:49,419 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:49,419 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:49,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-02-16 04:32:49,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:49,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:49,432 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) [2023-02-16 04:32:49,436 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 [2023-02-16 04:32:49,436 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:32:49,436 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:49,509 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:32:49,512 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 [2023-02-16 04:32:49,512 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:32:49,512 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:32:49,512 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:32:49,513 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:32:49,513 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:32:49,513 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:49,513 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:32:49,513 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:32:49,513 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration6_Loop [2023-02-16 04:32:49,513 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:32:49,513 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:32:49,514 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:49,520 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:49,524 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:49,526 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:49,569 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 [2023-02-16 04:32:49,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-02-16 04:32:49,578 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:32:49,578 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:32:49,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:49,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:49,579 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) [2023-02-16 04:32:49,579 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 [2023-02-16 04:32:49,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2023-02-16 04:32:49,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:32:49,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:32:49,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:32:49,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:32:49,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:32:49,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:32:49,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:32:49,609 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:32:49,611 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-16 04:32:49,612 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-16 04:32:49,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:49,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:49,613 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) [2023-02-16 04:32:49,615 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 [2023-02-16 04:32:49,616 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:32:49,616 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-16 04:32:49,616 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:32:49,617 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 [] [2023-02-16 04:32:49,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-02-16 04:32:49,620 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-16 04:32:49,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:49,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:49,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:32:49,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:49,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:49,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:32:49,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:49,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:32:49,666 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-16 04:32:49,666 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) [2023-02-16 04:32:49,692 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. [2023-02-16 04:32:49,693 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 [2023-02-16 04:32:49,694 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) [2023-02-16 04:32:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-16 04:32:49,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2023-02-16 04:32:49,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:49,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 13 letters. Loop has 4 letters. [2023-02-16 04:32:49,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:49,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 8 letters. [2023-02-16 04:32:49,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:49,705 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 160 transitions. [2023-02-16 04:32:49,708 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2023-02-16 04:32:49,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 87 states and 133 transitions. [2023-02-16 04:32:49,712 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-02-16 04:32:49,712 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2023-02-16 04:32:49,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 133 transitions. [2023-02-16 04:32:49,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:32:49,713 INFO L218 hiAutomatonCegarLoop]: Abstraction has 87 states and 133 transitions. [2023-02-16 04:32:49,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 133 transitions. [2023-02-16 04:32:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 82. [2023-02-16 04:32:49,720 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) [2023-02-16 04:32:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 127 transitions. [2023-02-16 04:32:49,722 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 127 transitions. [2023-02-16 04:32:49,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:32:49,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 04:32:49,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-16 04:32:49,723 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) [2023-02-16 04:32:49,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:32:49,761 INFO L93 Difference]: Finished difference Result 160 states and 239 transitions. [2023-02-16 04:32:49,761 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 239 transitions. [2023-02-16 04:32:49,764 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2023-02-16 04:32:49,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 160 states and 239 transitions. [2023-02-16 04:32:49,768 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 94 [2023-02-16 04:32:49,769 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2023-02-16 04:32:49,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 160 states and 239 transitions. [2023-02-16 04:32:49,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:32:49,769 INFO L218 hiAutomatonCegarLoop]: Abstraction has 160 states and 239 transitions. [2023-02-16 04:32:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 239 transitions. [2023-02-16 04:32:49,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 136. [2023-02-16 04:32:49,780 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) [2023-02-16 04:32:49,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 207 transitions. [2023-02-16 04:32:49,783 INFO L240 hiAutomatonCegarLoop]: Abstraction has 136 states and 207 transitions. [2023-02-16 04:32:49,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 04:32:49,785 INFO L428 stractBuchiCegarLoop]: Abstraction has 136 states and 207 transitions. [2023-02-16 04:32:49,786 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-16 04:32:49,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 136 states and 207 transitions. [2023-02-16 04:32:49,786 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2023-02-16 04:32:49,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:32:49,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:32:49,787 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2023-02-16 04:32:49,787 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-16 04:32:49,787 INFO L748 eck$LassoCheckResult]: Stem: 920#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 921#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; 926#L18-1 assume !!(main_~i~0#1 > 0); 985#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 945#L12-2 assume !(10 == main_~i~0#1); 946#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 994#L18-1 assume !!(main_~i~0#1 > 0); 991#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 944#L12-2 assume !(10 == main_~i~0#1); 983#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 964#L18-1 [2023-02-16 04:32:49,787 INFO L750 eck$LassoCheckResult]: Loop: 964#L18-1 assume !!(main_~i~0#1 > 0); 978#L12 assume !(1 == main_~i~0#1); 957#L12-2 assume !(10 == main_~i~0#1); 969#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 964#L18-1 [2023-02-16 04:32:49,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:49,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1068495891, now seen corresponding path program 1 times [2023-02-16 04:32:49,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:49,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714973750] [2023-02-16 04:32:49,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:49,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:49,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:32:49,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:32:49,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714973750] [2023-02-16 04:32:49,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714973750] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:32:49,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:32:49,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:32:49,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009416737] [2023-02-16 04:32:49,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:32:49,820 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-16 04:32:49,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:49,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 2 times [2023-02-16 04:32:49,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:49,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759269046] [2023-02-16 04:32:49,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:49,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:49,823 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:49,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:49,845 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:32:49,845 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:32:49,845 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:32:49,845 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:32:49,845 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:32:49,845 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:49,845 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:32:49,845 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:32:49,846 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2023-02-16 04:32:49,846 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:32:49,846 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:32:49,846 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:49,851 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:49,852 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:49,854 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:49,903 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:32:49,903 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:32:49,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:49,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:49,904 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) [2023-02-16 04:32:49,906 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 [2023-02-16 04:32:49,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:49,908 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:49,934 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 [2023-02-16 04:32:49,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:49,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:49,935 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) [2023-02-16 04:32:49,937 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 [2023-02-16 04:32:49,938 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:32:49,939 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:49,960 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:32:49,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-02-16 04:32:49,965 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:32:49,966 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:32:49,966 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:32:49,966 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:32:49,966 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:32:49,966 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:49,966 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:32:49,966 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:32:49,966 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration7_Loop [2023-02-16 04:32:49,966 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:32:49,966 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:32:49,967 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:49,972 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:49,974 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:49,976 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:50,026 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:32:50,026 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:32:50,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:50,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:50,027 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) [2023-02-16 04:32:50,029 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 [2023-02-16 04:32:50,031 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 [2023-02-16 04:32:50,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:32:50,036 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:32:50,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:32:50,036 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-16 04:32:50,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:32:50,038 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-16 04:32:50,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:32:50,053 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:32:50,055 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-16 04:32:50,055 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-16 04:32:50,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:50,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:50,057 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) [2023-02-16 04:32:50,059 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 [2023-02-16 04:32:50,060 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:32:50,060 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-16 04:32:50,060 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:32:50,060 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 [] [2023-02-16 04:32:50,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-02-16 04:32:50,063 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-16 04:32:50,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:50,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:32:50,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:50,094 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:32:50,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:50,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:32:50,110 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-16 04:32:50,111 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) [2023-02-16 04:32:50,127 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. [2023-02-16 04:32:50,128 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 [2023-02-16 04:32:50,128 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) [2023-02-16 04:32:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2023-02-16 04:32:50,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 4 letters. [2023-02-16 04:32:50,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:50,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2023-02-16 04:32:50,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:50,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 10 letters. Loop has 8 letters. [2023-02-16 04:32:50,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:50,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 248 states and 381 transitions. [2023-02-16 04:32:50,131 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2023-02-16 04:32:50,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 248 states to 224 states and 333 transitions. [2023-02-16 04:32:50,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 101 [2023-02-16 04:32:50,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 112 [2023-02-16 04:32:50,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 224 states and 333 transitions. [2023-02-16 04:32:50,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:32:50,133 INFO L218 hiAutomatonCegarLoop]: Abstraction has 224 states and 333 transitions. [2023-02-16 04:32:50,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states and 333 transitions. [2023-02-16 04:32:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 202. [2023-02-16 04:32:50,138 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) [2023-02-16 04:32:50,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 304 transitions. [2023-02-16 04:32:50,139 INFO L240 hiAutomatonCegarLoop]: Abstraction has 202 states and 304 transitions. [2023-02-16 04:32:50,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:32:50,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:32:50,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:32:50,140 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) [2023-02-16 04:32:50,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:32:50,151 INFO L93 Difference]: Finished difference Result 230 states and 313 transitions. [2023-02-16 04:32:50,151 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 230 states and 313 transitions. [2023-02-16 04:32:50,153 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 58 [2023-02-16 04:32:50,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 230 states to 230 states and 313 transitions. [2023-02-16 04:32:50,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2023-02-16 04:32:50,154 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2023-02-16 04:32:50,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 230 states and 313 transitions. [2023-02-16 04:32:50,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:32:50,154 INFO L218 hiAutomatonCegarLoop]: Abstraction has 230 states and 313 transitions. [2023-02-16 04:32:50,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states and 313 transitions. [2023-02-16 04:32:50,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 201. [2023-02-16 04:32:50,159 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) [2023-02-16 04:32:50,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 278 transitions. [2023-02-16 04:32:50,160 INFO L240 hiAutomatonCegarLoop]: Abstraction has 201 states and 278 transitions. [2023-02-16 04:32:50,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:32:50,160 INFO L428 stractBuchiCegarLoop]: Abstraction has 201 states and 278 transitions. [2023-02-16 04:32:50,161 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-16 04:32:50,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 201 states and 278 transitions. [2023-02-16 04:32:50,162 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 52 [2023-02-16 04:32:50,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:32:50,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:32:50,162 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2023-02-16 04:32:50,162 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-16 04:32:50,162 INFO L748 eck$LassoCheckResult]: Stem: 1798#$Ultimate##0 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; 1802#L18-1 assume !!(main_~i~0#1 > 0); 1817#L12 assume !(1 == main_~i~0#1); 1820#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 1819#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1815#L18-1 assume !!(main_~i~0#1 > 0); 1816#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 1949#L12-2 assume !(10 == main_~i~0#1); 1825#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 1805#L18-1 assume !!(main_~i~0#1 > 0); 1806#L12 assume !(1 == main_~i~0#1); 1988#L12-2 assume !(10 == main_~i~0#1); 1809#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1793#L18-1 [2023-02-16 04:32:50,163 INFO L750 eck$LassoCheckResult]: Loop: 1793#L18-1 assume !!(main_~i~0#1 > 0); 1794#L12 assume !(1 == main_~i~0#1); 1803#L12-2 assume !(10 == main_~i~0#1); 1810#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 1793#L18-1 [2023-02-16 04:32:50,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:50,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1454758974, now seen corresponding path program 1 times [2023-02-16 04:32:50,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:50,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541493484] [2023-02-16 04:32:50,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:50,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:50,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 04:32:50,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:32:50,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541493484] [2023-02-16 04:32:50,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541493484] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:32:50,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:32:50,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 04:32:50,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847502476] [2023-02-16 04:32:50,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:32:50,191 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-16 04:32:50,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:50,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1267308, now seen corresponding path program 3 times [2023-02-16 04:32:50,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:50,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375567371] [2023-02-16 04:32:50,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:50,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:50,194 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:50,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:50,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:50,209 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:32:50,209 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:32:50,209 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:32:50,209 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:32:50,209 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:32:50,209 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:50,209 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:32:50,209 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:32:50,209 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2023-02-16 04:32:50,209 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:32:50,209 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:32:50,210 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:50,216 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:50,218 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:50,220 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:50,275 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:32:50,275 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:32:50,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:50,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:50,277 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) [2023-02-16 04:32:50,279 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 [2023-02-16 04:32:50,280 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:50,280 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:50,297 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:32:50,297 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: [] [2023-02-16 04:32:50,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2023-02-16 04:32:50,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:50,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:50,303 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) [2023-02-16 04:32:50,304 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 [2023-02-16 04:32:50,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:50,306 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:50,316 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:32:50,316 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: [] [2023-02-16 04:32:50,321 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 [2023-02-16 04:32:50,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:50,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:50,322 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) [2023-02-16 04:32:50,323 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 [2023-02-16 04:32:50,326 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:50,326 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:50,336 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:32:50,336 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: [] [2023-02-16 04:32:50,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2023-02-16 04:32:50,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:50,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:50,339 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) [2023-02-16 04:32:50,342 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 [2023-02-16 04:32:50,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:50,344 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:50,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2023-02-16 04:32:50,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:50,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:50,354 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) [2023-02-16 04:32:50,354 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 [2023-02-16 04:32:50,359 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:32:50,359 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:50,374 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:32:50,376 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 [2023-02-16 04:32:50,376 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:32:50,376 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:32:50,376 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:32:50,376 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:32:50,377 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:32:50,377 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:50,377 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:32:50,377 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:32:50,377 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration8_Loop [2023-02-16 04:32:50,377 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:32:50,377 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:32:50,377 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:50,380 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:50,382 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:50,383 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:50,447 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:32:50,447 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:32:50,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:50,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:50,449 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) [2023-02-16 04:32:50,451 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 [2023-02-16 04:32:50,452 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 [2023-02-16 04:32:50,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:32:50,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:32:50,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:32:50,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:32:50,460 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-16 04:32:50,460 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-16 04:32:50,478 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:32:50,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-02-16 04:32:50,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:50,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:50,485 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) [2023-02-16 04:32:50,487 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 [2023-02-16 04:32:50,488 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 [2023-02-16 04:32:50,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:32:50,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:32:50,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:32:50,495 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-16 04:32:50,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:32:50,496 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-16 04:32:50,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:32:50,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:32:50,506 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 [2023-02-16 04:32:50,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:50,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:50,507 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) [2023-02-16 04:32:50,508 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 [2023-02-16 04:32:50,510 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 [2023-02-16 04:32:50,516 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:32:50,517 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:32:50,517 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:32:50,517 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:32:50,518 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-16 04:32:50,518 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-16 04:32:50,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:32:50,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-02-16 04:32:50,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:50,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:50,527 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) [2023-02-16 04:32:50,528 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 [2023-02-16 04:32:50,530 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 [2023-02-16 04:32:50,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:32:50,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:32:50,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:32:50,537 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2023-02-16 04:32:50,537 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:32:50,538 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2023-02-16 04:32:50,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:32:50,547 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:32:50,549 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-02-16 04:32:50,549 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-16 04:32:50,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:50,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:50,550 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) [2023-02-16 04:32:50,551 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 [2023-02-16 04:32:50,553 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:32:50,553 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-16 04:32:50,553 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:32:50,553 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 [] [2023-02-16 04:32:50,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2023-02-16 04:32:50,557 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-16 04:32:50,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:50,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:32:50,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:50,604 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:32:50,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:32:50,618 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-16 04:32:50,618 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.666666666666667) internal successors, (14), 3 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) [2023-02-16 04:32:50,630 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.666666666666667) internal successors, (14), 3 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) Result 280 states and 401 transitions. Complement of second has 5 states. [2023-02-16 04:32:50,630 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 [2023-02-16 04:32:50,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2023-02-16 04:32:50,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2023-02-16 04:32:50,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2023-02-16 04:32:50,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:50,631 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-16 04:32:50,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:50,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:32:50,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:50,663 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 [2023-02-16 04:32:50,669 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 [2023-02-16 04:32:50,672 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 [2023-02-16 04:32:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:50,676 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:32:50,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:32:50,688 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-16 04:32:50,688 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.666666666666667) internal successors, (14), 3 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) [2023-02-16 04:32:50,705 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.666666666666667) internal successors, (14), 3 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) Result 280 states and 401 transitions. Complement of second has 5 states. [2023-02-16 04:32:50,706 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 [2023-02-16 04:32:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2023-02-16 04:32:50,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2023-02-16 04:32:50,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 4 letters. [2023-02-16 04:32:50,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:50,707 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-16 04:32:50,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:50,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:32:50,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:50,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:50,730 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:32:50,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:50,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:32:50,745 INFO L141 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 [2023-02-16 04:32:50,746 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.666666666666667) internal successors, (14), 3 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) [2023-02-16 04:32:50,761 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.666666666666667) internal successors, (14), 3 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) Result 334 states and 496 transitions. Complement of second has 4 states. [2023-02-16 04:32:50,764 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 [2023-02-16 04:32:50,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2023-02-16 04:32:50,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2023-02-16 04:32:50,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2023-02-16 04:32:50,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:50,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 18 letters. Loop has 4 letters. [2023-02-16 04:32:50,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:50,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 14 letters. Loop has 8 letters. [2023-02-16 04:32:50,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:50,765 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 334 states and 496 transitions. [2023-02-16 04:32:50,772 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 87 [2023-02-16 04:32:50,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 334 states to 268 states and 378 transitions. [2023-02-16 04:32:50,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 111 [2023-02-16 04:32:50,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2023-02-16 04:32:50,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 268 states and 378 transitions. [2023-02-16 04:32:50,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:32:50,774 INFO L218 hiAutomatonCegarLoop]: Abstraction has 268 states and 378 transitions. [2023-02-16 04:32:50,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states and 378 transitions. [2023-02-16 04:32:50,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 167. [2023-02-16 04:32:50,777 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) [2023-02-16 04:32:50,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 234 transitions. [2023-02-16 04:32:50,777 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 234 transitions. [2023-02-16 04:32:50,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:32:50,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 04:32:50,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-16 04:32:50,778 INFO L87 Difference]: Start difference. First operand 167 states and 234 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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) [2023-02-16 04:32:50,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:32:50,791 INFO L93 Difference]: Finished difference Result 179 states and 246 transitions. [2023-02-16 04:32:50,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 246 transitions. [2023-02-16 04:32:50,792 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 92 [2023-02-16 04:32:50,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 177 states and 243 transitions. [2023-02-16 04:32:50,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 93 [2023-02-16 04:32:50,793 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2023-02-16 04:32:50,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 243 transitions. [2023-02-16 04:32:50,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:32:50,793 INFO L218 hiAutomatonCegarLoop]: Abstraction has 177 states and 243 transitions. [2023-02-16 04:32:50,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 243 transitions. [2023-02-16 04:32:50,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2023-02-16 04:32:50,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 170 states have (on average 1.3764705882352941) internal successors, (234), 169 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) [2023-02-16 04:32:50,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 234 transitions. [2023-02-16 04:32:50,796 INFO L240 hiAutomatonCegarLoop]: Abstraction has 170 states and 234 transitions. [2023-02-16 04:32:50,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 04:32:50,797 INFO L428 stractBuchiCegarLoop]: Abstraction has 170 states and 234 transitions. [2023-02-16 04:32:50,797 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-16 04:32:50,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 170 states and 234 transitions. [2023-02-16 04:32:50,798 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 90 [2023-02-16 04:32:50,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:32:50,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:32:50,799 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-02-16 04:32:50,799 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2023-02-16 04:32:50,799 INFO L748 eck$LassoCheckResult]: Stem: 3429#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3430#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; 3434#L18-1 assume !!(main_~i~0#1 > 0); 3555#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3533#L12-2 assume !(10 == main_~i~0#1); 3437#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3438#L18-1 assume !!(main_~i~0#1 > 0); 3560#L12 assume !(1 == main_~i~0#1); 3558#L12-2 assume !(10 == main_~i~0#1); 3556#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3442#L18-1 [2023-02-16 04:32:50,799 INFO L750 eck$LassoCheckResult]: Loop: 3442#L18-1 assume !!(main_~i~0#1 > 0); 3536#L12 assume !(1 == main_~i~0#1); 3475#L12-2 assume !(10 == main_~i~0#1); 3525#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3523#L18-1 assume !!(main_~i~0#1 > 0); 3520#L12 assume !(1 == main_~i~0#1); 3516#L12-2 assume !(10 == main_~i~0#1); 3440#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3442#L18-1 [2023-02-16 04:32:50,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:50,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1068497813, now seen corresponding path program 1 times [2023-02-16 04:32:50,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:50,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546173323] [2023-02-16 04:32:50,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:50,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 04:32:50,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:32:50,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546173323] [2023-02-16 04:32:50,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546173323] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:32:50,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:32:50,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:32:50,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58385081] [2023-02-16 04:32:50,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:32:50,828 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-16 04:32:50,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:50,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2142023595, now seen corresponding path program 1 times [2023-02-16 04:32:50,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:50,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730004287] [2023-02-16 04:32:50,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:50,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:50,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 04:32:50,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:32:50,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730004287] [2023-02-16 04:32:50,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730004287] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 04:32:50,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 04:32:50,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 04:32:50,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420878984] [2023-02-16 04:32:50,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 04:32:50,839 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-16 04:32:50,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:32:50,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 04:32:50,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 04:32:50,840 INFO L87 Difference]: Start difference. First operand 170 states and 234 transitions. cyclomatic complexity: 73 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) [2023-02-16 04:32:50,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:32:50,844 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2023-02-16 04:32:50,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 104 states and 118 transitions. [2023-02-16 04:32:50,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2023-02-16 04:32:50,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 104 states to 84 states and 95 transitions. [2023-02-16 04:32:50,846 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2023-02-16 04:32:50,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2023-02-16 04:32:50,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 95 transitions. [2023-02-16 04:32:50,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:32:50,846 INFO L218 hiAutomatonCegarLoop]: Abstraction has 84 states and 95 transitions. [2023-02-16 04:32:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 95 transitions. [2023-02-16 04:32:50,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2023-02-16 04:32:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 81 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) [2023-02-16 04:32:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2023-02-16 04:32:50,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 82 states and 93 transitions. [2023-02-16 04:32:50,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 04:32:50,848 INFO L428 stractBuchiCegarLoop]: Abstraction has 82 states and 93 transitions. [2023-02-16 04:32:50,848 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-16 04:32:50,848 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 93 transitions. [2023-02-16 04:32:50,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2023-02-16 04:32:50,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:32:50,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:32:50,849 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 1, 1, 1, 1] [2023-02-16 04:32:50,850 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 5, 4, 2, 1, 1] [2023-02-16 04:32:50,850 INFO L748 eck$LassoCheckResult]: Stem: 3711#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3712#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; 3714#L18-1 assume !!(main_~i~0#1 > 0); 3739#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3735#L12-2 assume !(10 == main_~i~0#1); 3734#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3733#L18-1 assume !!(main_~i~0#1 > 0); 3732#L12 assume !(1 == main_~i~0#1); 3731#L12-2 assume !(10 == main_~i~0#1); 3730#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3729#L18-1 assume !!(main_~i~0#1 > 0); 3728#L12 assume !(1 == main_~i~0#1); 3727#L12-2 assume !(10 == main_~i~0#1); 3726#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3725#L18-1 assume !!(main_~i~0#1 > 0); 3722#L12 assume !(1 == main_~i~0#1); 3724#L12-2 assume !(10 == main_~i~0#1); 3723#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3721#L18-1 assume !!(main_~i~0#1 > 0); 3720#L12 assume !(1 == main_~i~0#1); 3719#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3713#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3709#L18-1 assume !!(main_~i~0#1 > 0); 3710#L12 assume !(1 == main_~i~0#1); 3704#L12-2 assume !(10 == main_~i~0#1); 3706#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3783#L18-1 assume !!(main_~i~0#1 > 0); 3782#L12 [2023-02-16 04:32:50,850 INFO L750 eck$LassoCheckResult]: Loop: 3782#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 3702#L12-2 assume !(10 == main_~i~0#1); 3703#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3707#L18-1 assume !!(main_~i~0#1 > 0); 3708#L12 assume !(1 == main_~i~0#1); 3715#L12-2 assume !(10 == main_~i~0#1); 3781#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3780#L18-1 assume !!(main_~i~0#1 > 0); 3779#L12 assume !(1 == main_~i~0#1); 3778#L12-2 assume !(10 == main_~i~0#1); 3777#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3776#L18-1 assume !!(main_~i~0#1 > 0); 3775#L12 assume !(1 == main_~i~0#1); 3774#L12-2 assume !(10 == main_~i~0#1); 3749#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 3745#L18-1 assume !!(main_~i~0#1 > 0); 3737#L12 assume !(1 == main_~i~0#1); 3738#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 3716#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3717#L18-1 assume !!(main_~i~0#1 > 0); 3710#L12 assume !(1 == main_~i~0#1); 3704#L12-2 assume !(10 == main_~i~0#1); 3706#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 3783#L18-1 assume !!(main_~i~0#1 > 0); 3782#L12 [2023-02-16 04:32:50,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:50,851 INFO L85 PathProgramCache]: Analyzing trace with hash -608617554, now seen corresponding path program 2 times [2023-02-16 04:32:50,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:50,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015840316] [2023-02-16 04:32:50,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:50,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 04:32:50,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:32:50,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015840316] [2023-02-16 04:32:50,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015840316] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:32:50,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553710792] [2023-02-16 04:32:50,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 04:32:50,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:32:50,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:50,922 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) [2023-02-16 04:32:50,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2023-02-16 04:32:50,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 04:32:50,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:32:50,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 04:32:50,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:50,968 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 04:32:50,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:32:51,009 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 04:32:51,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553710792] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:32:51,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:32:51,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-02-16 04:32:51,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559536008] [2023-02-16 04:32:51,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:32:51,010 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-16 04:32:51,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:51,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1118663673, now seen corresponding path program 1 times [2023-02-16 04:32:51,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:51,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576370284] [2023-02-16 04:32:51,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:51,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:51,054 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 04:32:51,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:32:51,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576370284] [2023-02-16 04:32:51,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576370284] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:32:51,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107430858] [2023-02-16 04:32:51,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:51,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:32:51,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:51,056 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) [2023-02-16 04:32:51,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2023-02-16 04:32:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:51,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 04:32:51,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 04:32:51,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:32:51,158 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 04:32:51,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107430858] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:32:51,158 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:32:51,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-02-16 04:32:51,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055601690] [2023-02-16 04:32:51,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:32:51,159 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-16 04:32:51,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:32:51,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 04:32:51,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2023-02-16 04:32:51,159 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. cyclomatic complexity: 17 Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 10 states have internal predecessors, (40), 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) [2023-02-16 04:32:51,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:32:51,205 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2023-02-16 04:32:51,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 180 transitions. [2023-02-16 04:32:51,206 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 47 [2023-02-16 04:32:51,207 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 149 states and 160 transitions. [2023-02-16 04:32:51,207 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 59 [2023-02-16 04:32:51,207 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 59 [2023-02-16 04:32:51,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 160 transitions. [2023-02-16 04:32:51,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:32:51,207 INFO L218 hiAutomatonCegarLoop]: Abstraction has 149 states and 160 transitions. [2023-02-16 04:32:51,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 160 transitions. [2023-02-16 04:32:51,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 142. [2023-02-16 04:32:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 142 states have (on average 1.0774647887323943) internal successors, (153), 141 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) [2023-02-16 04:32:51,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2023-02-16 04:32:51,209 INFO L240 hiAutomatonCegarLoop]: Abstraction has 142 states and 153 transitions. [2023-02-16 04:32:51,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 04:32:51,210 INFO L428 stractBuchiCegarLoop]: Abstraction has 142 states and 153 transitions. [2023-02-16 04:32:51,210 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-16 04:32:51,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 142 states and 153 transitions. [2023-02-16 04:32:51,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2023-02-16 04:32:51,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:32:51,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:32:51,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 10, 9, 2, 1, 1, 1, 1] [2023-02-16 04:32:51,212 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [11, 10, 10, 9, 2, 1, 1] [2023-02-16 04:32:51,212 INFO L748 eck$LassoCheckResult]: Stem: 4278#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4279#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; 4282#L18-1 assume !!(main_~i~0#1 > 0); 4384#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 4270#L12-2 assume !(10 == main_~i~0#1); 4271#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4370#L18-1 assume !!(main_~i~0#1 > 0); 4369#L12 assume !(1 == main_~i~0#1); 4368#L12-2 assume !(10 == main_~i~0#1); 4367#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4366#L18-1 assume !!(main_~i~0#1 > 0); 4365#L12 assume !(1 == main_~i~0#1); 4364#L12-2 assume !(10 == main_~i~0#1); 4363#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4362#L18-1 assume !!(main_~i~0#1 > 0); 4361#L12 assume !(1 == main_~i~0#1); 4360#L12-2 assume !(10 == main_~i~0#1); 4359#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4358#L18-1 assume !!(main_~i~0#1 > 0); 4357#L12 assume !(1 == main_~i~0#1); 4356#L12-2 assume !(10 == main_~i~0#1); 4355#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4354#L18-1 assume !!(main_~i~0#1 > 0); 4353#L12 assume !(1 == main_~i~0#1); 4352#L12-2 assume !(10 == main_~i~0#1); 4351#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4350#L18-1 assume !!(main_~i~0#1 > 0); 4349#L12 assume !(1 == main_~i~0#1); 4348#L12-2 assume !(10 == main_~i~0#1); 4347#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4346#L18-1 assume !!(main_~i~0#1 > 0); 4345#L12 assume !(1 == main_~i~0#1); 4344#L12-2 assume !(10 == main_~i~0#1); 4343#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4342#L18-1 assume !!(main_~i~0#1 > 0); 4292#L12 assume !(1 == main_~i~0#1); 4296#L12-2 assume !(10 == main_~i~0#1); 4293#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4291#L18-1 assume !!(main_~i~0#1 > 0); 4290#L12 assume !(1 == main_~i~0#1); 4289#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 4280#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4281#L18-1 assume !!(main_~i~0#1 > 0); 4338#L12 assume !(1 == main_~i~0#1); 4340#L12-2 assume !(10 == main_~i~0#1); 4339#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4337#L18-1 assume !!(main_~i~0#1 > 0); 4336#L12 [2023-02-16 04:32:51,212 INFO L750 eck$LassoCheckResult]: Loop: 4336#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 4335#L12-2 assume !(10 == main_~i~0#1); 4334#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4333#L18-1 assume !!(main_~i~0#1 > 0); 4332#L12 assume !(1 == main_~i~0#1); 4331#L12-2 assume !(10 == main_~i~0#1); 4330#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4329#L18-1 assume !!(main_~i~0#1 > 0); 4328#L12 assume !(1 == main_~i~0#1); 4327#L12-2 assume !(10 == main_~i~0#1); 4326#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4325#L18-1 assume !!(main_~i~0#1 > 0); 4324#L12 assume !(1 == main_~i~0#1); 4323#L12-2 assume !(10 == main_~i~0#1); 4322#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4321#L18-1 assume !!(main_~i~0#1 > 0); 4320#L12 assume !(1 == main_~i~0#1); 4319#L12-2 assume !(10 == main_~i~0#1); 4318#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4317#L18-1 assume !!(main_~i~0#1 > 0); 4316#L12 assume !(1 == main_~i~0#1); 4315#L12-2 assume !(10 == main_~i~0#1); 4314#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4313#L18-1 assume !!(main_~i~0#1 > 0); 4312#L12 assume !(1 == main_~i~0#1); 4311#L12-2 assume !(10 == main_~i~0#1); 4310#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4309#L18-1 assume !!(main_~i~0#1 > 0); 4308#L12 assume !(1 == main_~i~0#1); 4307#L12-2 assume !(10 == main_~i~0#1); 4306#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4305#L18-1 assume !!(main_~i~0#1 > 0); 4304#L12 assume !(1 == main_~i~0#1); 4303#L12-2 assume !(10 == main_~i~0#1); 4301#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 4297#L18-1 assume !!(main_~i~0#1 > 0); 4294#L12 assume !(1 == main_~i~0#1); 4295#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 4286#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4287#L18-1 assume !!(main_~i~0#1 > 0); 4338#L12 assume !(1 == main_~i~0#1); 4340#L12-2 assume !(10 == main_~i~0#1); 4339#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 4337#L18-1 assume !!(main_~i~0#1 > 0); 4336#L12 [2023-02-16 04:32:51,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:51,213 INFO L85 PathProgramCache]: Analyzing trace with hash -733322943, now seen corresponding path program 3 times [2023-02-16 04:32:51,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:51,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40134397] [2023-02-16 04:32:51,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:51,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:51,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:51,223 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:51,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:51,224 INFO L85 PathProgramCache]: Analyzing trace with hash 491326234, now seen corresponding path program 2 times [2023-02-16 04:32:51,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:51,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902364087] [2023-02-16 04:32:51,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:51,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:51,236 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:51,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:51,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:51,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1133081510, now seen corresponding path program 4 times [2023-02-16 04:32:51,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:51,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827362849] [2023-02-16 04:32:51,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:51,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:51,292 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2023-02-16 04:32:51,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:32:51,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827362849] [2023-02-16 04:32:51,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827362849] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:32:51,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932507484] [2023-02-16 04:32:51,294 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-16 04:32:51,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:32:51,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:51,295 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:32:51,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2023-02-16 04:32:51,329 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-16 04:32:51,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:32:51,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 04:32:51,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:51,345 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2023-02-16 04:32:51,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:32:51,363 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 562 proven. 3 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2023-02-16 04:32:51,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932507484] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:32:51,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:32:51,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-02-16 04:32:51,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981691810] [2023-02-16 04:32:51,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:32:51,477 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:32:51,477 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:32:51,477 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:32:51,477 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:32:51,477 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:32:51,477 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:51,477 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:32:51,477 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:32:51,477 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2023-02-16 04:32:51,477 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:32:51,477 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:32:51,478 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:51,487 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:51,489 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:51,493 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:51,529 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:32:51,529 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:32:51,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:51,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:51,531 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) [2023-02-16 04:32:51,533 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 [2023-02-16 04:32:51,535 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:51,535 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:51,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2023-02-16 04:32:51,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:51,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:51,565 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) [2023-02-16 04:32:51,567 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 [2023-02-16 04:32:51,568 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:32:51,568 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:51,589 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:32:51,593 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 [2023-02-16 04:32:51,594 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:32:51,594 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:32:51,594 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:32:51,594 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:32:51,594 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:32:51,594 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:51,594 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:32:51,594 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:32:51,594 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration11_Loop [2023-02-16 04:32:51,594 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:32:51,594 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:32:51,595 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:51,597 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:51,600 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:51,601 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:51,629 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:32:51,629 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:32:51,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:51,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:51,630 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) [2023-02-16 04:32:51,631 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 [2023-02-16 04:32:51,634 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 [2023-02-16 04:32:51,640 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:32:51,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:32:51,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:32:51,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:32:51,641 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-16 04:32:51,641 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-16 04:32:51,656 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:32:51,659 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 [2023-02-16 04:32:51,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:51,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:51,660 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) [2023-02-16 04:32:51,662 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 [2023-02-16 04:32:51,663 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 [2023-02-16 04:32:51,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:32:51,670 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:32:51,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:32:51,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:32:51,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:32:51,670 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:32:51,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:32:51,672 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:32:51,673 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-16 04:32:51,673 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-16 04:32:51,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:51,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:51,675 INFO L229 MonitoredProcess]: Starting monitored process 54 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) [2023-02-16 04:32:51,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2023-02-16 04:32:51,677 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:32:51,678 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-16 04:32:51,678 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:32:51,678 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 [] [2023-02-16 04:32:51,680 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2023-02-16 04:32:51,681 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-16 04:32:51,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:51,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:32:51,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:51,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 04:32:51,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:51,849 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-16 04:32:51,850 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2023-02-16 04:32:51,850 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17 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) [2023-02-16 04:32:51,874 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17. 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. [2023-02-16 04:32:51,874 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 [2023-02-16 04:32:51,875 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) [2023-02-16 04:32:51,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2023-02-16 04:32:51,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 47 letters. Loop has 44 letters. [2023-02-16 04:32:51,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:51,875 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-16 04:32:51,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:51,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:32:51,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:51,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 04:32:51,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:52,014 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-16 04:32:52,014 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 5 loop predicates [2023-02-16 04:32:52,015 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17 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) [2023-02-16 04:32:52,060 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17. 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. [2023-02-16 04:32:52,060 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 [2023-02-16 04:32:52,060 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) [2023-02-16 04:32:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2023-02-16 04:32:52,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 47 letters. Loop has 44 letters. [2023-02-16 04:32:52,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:52,061 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-16 04:32:52,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:52,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:32:52,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:52,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 04:32:52,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:52,187 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-16 04:32:52,188 INFO L141 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 [2023-02-16 04:32:52,188 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17 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) [2023-02-16 04:32:52,209 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17. 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 268 states and 284 transitions. Complement of second has 9 states. [2023-02-16 04:32:52,210 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 [2023-02-16 04:32:52,210 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) [2023-02-16 04:32:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2023-02-16 04:32:52,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 47 letters. Loop has 44 letters. [2023-02-16 04:32:52,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:52,211 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-16 04:32:52,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:52,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:32:52,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:52,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 04:32:52,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-16 04:32:52,336 INFO L141 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 [2023-02-16 04:32:52,336 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17 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) [2023-02-16 04:32:52,375 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 142 states and 153 transitions. cyclomatic complexity: 17. 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 380 states and 401 transitions. Complement of second has 19 states. [2023-02-16 04:32:52,376 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 [2023-02-16 04:32:52,376 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) [2023-02-16 04:32:52,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2023-02-16 04:32:52,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 47 letters. Loop has 44 letters. [2023-02-16 04:32:52,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:52,377 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-16 04:32:52,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:52,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:52,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:32:52,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:52,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 04:32:52,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:52,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2023-02-16 04:32:52,522 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 11 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-16 04:32:52,523 INFO L141 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 [2023-02-16 04:32:52,524 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 142 states and 153 transitions. cyclomatic complexity: 17 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) [2023-02-16 04:32:52,671 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 142 states and 153 transitions. cyclomatic complexity: 17 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 1899 states and 2480 transitions. Complement of second has 166 states 20 powerset states146 rank states. The highest rank that occured is 5 [2023-02-16 04:32:52,672 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 [2023-02-16 04:32:52,672 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) [2023-02-16 04:32:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 70 transitions. [2023-02-16 04:32:52,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 44 letters. [2023-02-16 04:32:52,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:52,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 91 letters. Loop has 44 letters. [2023-02-16 04:32:52,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:52,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 70 transitions. Stem has 47 letters. Loop has 88 letters. [2023-02-16 04:32:52,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:52,682 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1899 states and 2480 transitions. [2023-02-16 04:32:52,691 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 96 [2023-02-16 04:32:52,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1899 states to 956 states and 1245 transitions. [2023-02-16 04:32:52,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 100 [2023-02-16 04:32:52,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 224 [2023-02-16 04:32:52,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 956 states and 1245 transitions. [2023-02-16 04:32:52,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:32:52,695 INFO L218 hiAutomatonCegarLoop]: Abstraction has 956 states and 1245 transitions. [2023-02-16 04:32:52,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states and 1245 transitions. [2023-02-16 04:32:52,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 564. [2023-02-16 04:32:52,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 564 states have (on average 1.3953900709219857) internal successors, (787), 563 states have internal predecessors, (787), 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) [2023-02-16 04:32:52,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 787 transitions. [2023-02-16 04:32:52,702 INFO L240 hiAutomatonCegarLoop]: Abstraction has 564 states and 787 transitions. [2023-02-16 04:32:52,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:32:52,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 04:32:52,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-02-16 04:32:52,703 INFO L87 Difference]: Start difference. First operand 564 states and 787 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) [2023-02-16 04:32:52,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:32:52,730 INFO L93 Difference]: Finished difference Result 692 states and 978 transitions. [2023-02-16 04:32:52,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 692 states and 978 transitions. [2023-02-16 04:32:52,733 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 98 [2023-02-16 04:32:52,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 692 states to 675 states and 954 transitions. [2023-02-16 04:32:52,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 104 [2023-02-16 04:32:52,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 104 [2023-02-16 04:32:52,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 675 states and 954 transitions. [2023-02-16 04:32:52,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:32:52,736 INFO L218 hiAutomatonCegarLoop]: Abstraction has 675 states and 954 transitions. [2023-02-16 04:32:52,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states and 954 transitions. [2023-02-16 04:32:52,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 634. [2023-02-16 04:32:52,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 634 states have (on average 1.411671924290221) internal successors, (895), 633 states have internal predecessors, (895), 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) [2023-02-16 04:32:52,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 895 transitions. [2023-02-16 04:32:52,742 INFO L240 hiAutomatonCegarLoop]: Abstraction has 634 states and 895 transitions. [2023-02-16 04:32:52,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 04:32:52,743 INFO L428 stractBuchiCegarLoop]: Abstraction has 634 states and 895 transitions. [2023-02-16 04:32:52,743 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-16 04:32:52,743 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 634 states and 895 transitions. [2023-02-16 04:32:52,745 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 90 [2023-02-16 04:32:52,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:32:52,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:32:52,746 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [16, 14, 14, 9, 6, 1, 1, 1, 1] [2023-02-16 04:32:52,746 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [15, 14, 14, 9, 6, 1, 1] [2023-02-16 04:32:52,747 INFO L748 eck$LassoCheckResult]: Stem: 10860#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 10861#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; 10865#L18-1 assume !!(main_~i~0#1 > 0); 11067#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 11202#L12-2 assume !(10 == main_~i~0#1); 11203#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11353#L18-1 assume !!(main_~i~0#1 > 0); 11352#L12 assume !(1 == main_~i~0#1); 11351#L12-2 assume !(10 == main_~i~0#1); 11350#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11349#L18-1 assume !!(main_~i~0#1 > 0); 11348#L12 assume !(1 == main_~i~0#1); 11347#L12-2 assume !(10 == main_~i~0#1); 11346#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11345#L18-1 assume !!(main_~i~0#1 > 0); 11344#L12 assume !(1 == main_~i~0#1); 11343#L12-2 assume !(10 == main_~i~0#1); 11342#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11341#L18-1 assume !!(main_~i~0#1 > 0); 11340#L12 assume !(1 == main_~i~0#1); 11339#L12-2 assume !(10 == main_~i~0#1); 11338#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11337#L18-1 assume !!(main_~i~0#1 > 0); 11336#L12 assume !(1 == main_~i~0#1); 11335#L12-2 assume !(10 == main_~i~0#1); 11334#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11333#L18-1 assume !!(main_~i~0#1 > 0); 11332#L12 assume !(1 == main_~i~0#1); 11331#L12-2 assume !(10 == main_~i~0#1); 11330#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11329#L18-1 assume !!(main_~i~0#1 > 0); 11328#L12 assume !(1 == main_~i~0#1); 11327#L12-2 assume !(10 == main_~i~0#1); 11326#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11325#L18-1 assume !!(main_~i~0#1 > 0); 11319#L12 assume !(1 == main_~i~0#1); 11324#L12-2 assume !(10 == main_~i~0#1); 11322#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11318#L18-1 assume !!(main_~i~0#1 > 0); 11320#L12 assume !(1 == main_~i~0#1); 11419#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 11294#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11418#L18-1 assume !!(main_~i~0#1 > 0); 11417#L12 assume !(1 == main_~i~0#1); 11416#L12-2 assume !(10 == main_~i~0#1); 11415#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11414#L18-1 assume !!(main_~i~0#1 > 0); 11413#L12 assume !(1 == main_~i~0#1); 11412#L12-2 assume !(10 == main_~i~0#1); 11411#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11410#L18-1 assume !!(main_~i~0#1 > 0); 11409#L12 assume !(1 == main_~i~0#1); 11369#L12-2 assume !(10 == main_~i~0#1); 11368#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11366#L18-1 assume !!(main_~i~0#1 > 0); 11363#L12 assume !(1 == main_~i~0#1); 11364#L12-2 assume !(10 == main_~i~0#1); 11371#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11372#L18-1 assume !!(main_~i~0#1 > 0); 11422#L12 assume !(1 == main_~i~0#1); 11355#L12-2 assume !(10 == main_~i~0#1); 11316#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11317#L18-1 assume !!(main_~i~0#1 > 0); 11193#L12 [2023-02-16 04:32:52,747 INFO L750 eck$LassoCheckResult]: Loop: 11193#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 11296#L12-2 assume !(10 == main_~i~0#1); 11321#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 10871#L18-1 assume !!(main_~i~0#1 > 0); 10866#L12 assume !(1 == main_~i~0#1); 10867#L12-2 assume !(10 == main_~i~0#1); 11483#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11481#L18-1 assume !!(main_~i~0#1 > 0); 11479#L12 assume !(1 == main_~i~0#1); 11477#L12-2 assume !(10 == main_~i~0#1); 11475#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11473#L18-1 assume !!(main_~i~0#1 > 0); 11471#L12 assume !(1 == main_~i~0#1); 11469#L12-2 assume !(10 == main_~i~0#1); 11467#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11465#L18-1 assume !!(main_~i~0#1 > 0); 11463#L12 assume !(1 == main_~i~0#1); 11461#L12-2 assume !(10 == main_~i~0#1); 11459#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11457#L18-1 assume !!(main_~i~0#1 > 0); 11455#L12 assume !(1 == main_~i~0#1); 11453#L12-2 assume !(10 == main_~i~0#1); 11451#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11449#L18-1 assume !!(main_~i~0#1 > 0); 11447#L12 assume !(1 == main_~i~0#1); 11445#L12-2 assume !(10 == main_~i~0#1); 11443#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11441#L18-1 assume !!(main_~i~0#1 > 0); 11439#L12 assume !(1 == main_~i~0#1); 11437#L12-2 assume !(10 == main_~i~0#1); 11435#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11433#L18-1 assume !!(main_~i~0#1 > 0); 11432#L12 assume !(1 == main_~i~0#1); 11431#L12-2 assume !(10 == main_~i~0#1); 11427#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 11428#L18-1 assume !!(main_~i~0#1 > 0); 11420#L12 assume !(1 == main_~i~0#1); 11421#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 11294#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11418#L18-1 assume !!(main_~i~0#1 > 0); 11417#L12 assume !(1 == main_~i~0#1); 11416#L12-2 assume !(10 == main_~i~0#1); 11415#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11414#L18-1 assume !!(main_~i~0#1 > 0); 11413#L12 assume !(1 == main_~i~0#1); 11412#L12-2 assume !(10 == main_~i~0#1); 11411#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11410#L18-1 assume !!(main_~i~0#1 > 0); 11409#L12 assume !(1 == main_~i~0#1); 11369#L12-2 assume !(10 == main_~i~0#1); 11368#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11366#L18-1 assume !!(main_~i~0#1 > 0); 11363#L12 assume !(1 == main_~i~0#1); 11364#L12-2 assume !(10 == main_~i~0#1); 11371#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11372#L18-1 assume !!(main_~i~0#1 > 0); 11358#L12 assume !(1 == main_~i~0#1); 11354#L12-2 assume !(10 == main_~i~0#1); 11316#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 11317#L18-1 assume !!(main_~i~0#1 > 0); 11193#L12 [2023-02-16 04:32:52,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:52,747 INFO L85 PathProgramCache]: Analyzing trace with hash 912728085, now seen corresponding path program 5 times [2023-02-16 04:32:52,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:52,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170353709] [2023-02-16 04:32:52,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:52,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:52,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:52,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:52,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:52,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1190197230, now seen corresponding path program 3 times [2023-02-16 04:32:52,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:52,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485724441] [2023-02-16 04:32:52,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:52,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:52,764 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:52,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:52,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:52,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1444454914, now seen corresponding path program 6 times [2023-02-16 04:32:52,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:52,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149125064] [2023-02-16 04:32:52,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:52,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2023-02-16 04:32:52,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 04:32:52,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149125064] [2023-02-16 04:32:52,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149125064] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 04:32:52,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501379927] [2023-02-16 04:32:52,931 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-16 04:32:52,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 04:32:52,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:52,932 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 04:32:52,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2023-02-16 04:32:52,971 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2023-02-16 04:32:52,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 04:32:52,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 04:32:52,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:53,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2023-02-16 04:32:53,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 04:32:53,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 1138 proven. 55 refuted. 0 times theorem prover too weak. 577 trivial. 0 not checked. [2023-02-16 04:32:53,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501379927] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 04:32:53,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 04:32:53,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 11 [2023-02-16 04:32:53,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672849724] [2023-02-16 04:32:53,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 04:32:53,216 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:32:53,217 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:32:53,217 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:32:53,217 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:32:53,217 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-16 04:32:53,217 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:53,217 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:32:53,217 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:32:53,217 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2023-02-16 04:32:53,217 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:32:53,217 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:32:53,218 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:53,222 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:53,225 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:53,228 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:53,253 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:32:53,254 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-16 04:32:53,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:53,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:53,255 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) [2023-02-16 04:32:53,257 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 [2023-02-16 04:32:53,259 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:53,259 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:53,280 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-16 04:32:53,280 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: [] [2023-02-16 04:32:53,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2023-02-16 04:32:53,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:53,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:53,284 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) [2023-02-16 04:32:53,286 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 [2023-02-16 04:32:53,288 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-16 04:32:53,288 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:53,312 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 [2023-02-16 04:32:53,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:53,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:53,313 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) [2023-02-16 04:32:53,313 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 [2023-02-16 04:32:53,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-16 04:32:53,316 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-16 04:32:53,323 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-16 04:32:53,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2023-02-16 04:32:53,326 INFO L210 LassoAnalysis]: Preferences: [2023-02-16 04:32:53,326 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-16 04:32:53,326 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-16 04:32:53,326 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-16 04:32:53,326 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-16 04:32:53,326 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:53,326 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-16 04:32:53,326 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-16 04:32:53,326 INFO L133 ssoRankerPreferences]: Filename of dumped script: Ex08.c_Iteration12_Loop [2023-02-16 04:32:53,326 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-16 04:32:53,327 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-16 04:32:53,327 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:53,332 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:53,342 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:53,344 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-16 04:32:53,367 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-16 04:32:53,367 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-16 04:32:53,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:53,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:53,368 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) [2023-02-16 04:32:53,369 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 [2023-02-16 04:32:53,371 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 [2023-02-16 04:32:53,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:32:53,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:32:53,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:32:53,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:32:53,378 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-16 04:32:53,378 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-16 04:32:53,380 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-16 04:32:53,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2023-02-16 04:32:53,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:53,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:53,384 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) [2023-02-16 04:32:53,384 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 [2023-02-16 04:32:53,386 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 [2023-02-16 04:32:53,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-16 04:32:53,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-16 04:32:53,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-16 04:32:53,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-16 04:32:53,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-16 04:32:53,393 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-16 04:32:53,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-16 04:32:53,394 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-16 04:32:53,395 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-16 04:32:53,395 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-16 04:32:53,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-16 04:32:53,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 04:32:53,397 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) [2023-02-16 04:32:53,399 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 [2023-02-16 04:32:53,400 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-16 04:32:53,400 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-16 04:32:53,400 INFO L513 LassoAnalysis]: Proved termination. [2023-02-16 04:32:53,400 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 [] [2023-02-16 04:32:53,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2023-02-16 04:32:53,403 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-16 04:32:53,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:53,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:32:53,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:53,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 04:32:53,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:53,635 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-16 04:32:53,636 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2023-02-16 04:32:53,636 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279 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) [2023-02-16 04:32:53,660 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279. 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 1120 states and 1472 transitions. Complement of second has 7 states. [2023-02-16 04:32:53,661 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 [2023-02-16 04:32:53,661 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) [2023-02-16 04:32:53,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2023-02-16 04:32:53,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 63 letters. Loop has 60 letters. [2023-02-16 04:32:53,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:53,662 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-16 04:32:53,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:53,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:32:53,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:53,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 04:32:53,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:53,886 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-16 04:32:53,887 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 9 loop predicates [2023-02-16 04:32:53,887 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279 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) [2023-02-16 04:32:53,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2023-02-16 04:32:53,958 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279. 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 1179 states and 1565 transitions. Complement of second has 11 states. [2023-02-16 04:32:53,959 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 [2023-02-16 04:32:53,959 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) [2023-02-16 04:32:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2023-02-16 04:32:53,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 63 letters. Loop has 60 letters. [2023-02-16 04:32:53,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:53,959 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-16 04:32:53,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:53,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:32:53,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:54,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:54,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 04:32:54,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-16 04:32:54,171 INFO L141 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 [2023-02-16 04:32:54,171 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279 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) [2023-02-16 04:32:54,198 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279. 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 1301 states and 1787 transitions. Complement of second has 9 states. [2023-02-16 04:32:54,198 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 [2023-02-16 04:32:54,198 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) [2023-02-16 04:32:54,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2023-02-16 04:32:54,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 63 letters. Loop has 60 letters. [2023-02-16 04:32:54,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:54,199 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-16 04:32:54,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:54,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:32:54,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:54,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 04:32:54,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:54,401 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-16 04:32:54,402 INFO L141 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 [2023-02-16 04:32:54,402 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279 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) [2023-02-16 04:32:54,453 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 634 states and 895 transitions. cyclomatic complexity: 279. 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 1866 states and 2535 transitions. Complement of second has 19 states. [2023-02-16 04:32:54,453 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 [2023-02-16 04:32:54,453 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) [2023-02-16 04:32:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2023-02-16 04:32:54,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 63 letters. Loop has 60 letters. [2023-02-16 04:32:54,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:54,454 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-16 04:32:54,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:54,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-16 04:32:54,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 04:32:54,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 04:32:54,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 04:32:54,668 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 59 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-02-16 04:32:54,669 INFO L141 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 [2023-02-16 04:32:54,669 INFO L104 BuchiDifferenceFKV]: Start buchiDifferenceFKV. First operand 634 states and 895 transitions. cyclomatic complexity: 279 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) [2023-02-16 04:32:55,043 INFO L108 BuchiDifferenceFKV]: Finished buchiDifferenceFKV. First operand 634 states and 895 transitions. cyclomatic complexity: 279 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 11129 states and 19734 transitions. Complement of second has 282 states 36 powerset states246 rank states. The highest rank that occured is 5 [2023-02-16 04:32:55,044 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 [2023-02-16 04:32:55,044 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) [2023-02-16 04:32:55,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 110 transitions. [2023-02-16 04:32:55,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 60 letters. [2023-02-16 04:32:55,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:55,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 123 letters. Loop has 60 letters. [2023-02-16 04:32:55,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:55,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 110 transitions. Stem has 63 letters. Loop has 120 letters. [2023-02-16 04:32:55,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-16 04:32:55,056 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11129 states and 19734 transitions. [2023-02-16 04:32:55,141 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 248 [2023-02-16 04:32:55,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11129 states to 4882 states and 8741 transitions. [2023-02-16 04:32:55,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 330 [2023-02-16 04:32:55,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 575 [2023-02-16 04:32:55,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4882 states and 8741 transitions. [2023-02-16 04:32:55,168 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:32:55,168 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4882 states and 8741 transitions. [2023-02-16 04:32:55,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4882 states and 8741 transitions. [2023-02-16 04:32:55,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4882 to 3014. [2023-02-16 04:32:55,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3014 states, 3014 states have (on average 1.813868613138686) internal successors, (5467), 3013 states have internal predecessors, (5467), 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) [2023-02-16 04:32:55,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3014 states to 3014 states and 5467 transitions. [2023-02-16 04:32:55,221 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3014 states and 5467 transitions. [2023-02-16 04:32:55,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 04:32:55,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 04:32:55,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2023-02-16 04:32:55,223 INFO L87 Difference]: Start difference. First operand 3014 states and 5467 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) [2023-02-16 04:32:55,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 04:32:55,267 INFO L93 Difference]: Finished difference Result 3401 states and 6312 transitions. [2023-02-16 04:32:55,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3401 states and 6312 transitions. [2023-02-16 04:32:55,290 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 168 [2023-02-16 04:32:55,310 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3401 states to 3369 states and 6221 transitions. [2023-02-16 04:32:55,310 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 238 [2023-02-16 04:32:55,311 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 238 [2023-02-16 04:32:55,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3369 states and 6221 transitions. [2023-02-16 04:32:55,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-16 04:32:55,311 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3369 states and 6221 transitions. [2023-02-16 04:32:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states and 6221 transitions. [2023-02-16 04:32:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 3222. [2023-02-16 04:32:55,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3222 states, 3222 states have (on average 1.8395406579764122) internal successors, (5927), 3221 states have internal predecessors, (5927), 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) [2023-02-16 04:32:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 5927 transitions. [2023-02-16 04:32:55,356 INFO L240 hiAutomatonCegarLoop]: Abstraction has 3222 states and 5927 transitions. [2023-02-16 04:32:55,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 04:32:55,356 INFO L428 stractBuchiCegarLoop]: Abstraction has 3222 states and 5927 transitions. [2023-02-16 04:32:55,356 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2023-02-16 04:32:55,356 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3222 states and 5927 transitions. [2023-02-16 04:32:55,366 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 152 [2023-02-16 04:32:55,367 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-16 04:32:55,367 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-16 04:32:55,370 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [19, 17, 17, 9, 9, 1, 1, 1, 1] [2023-02-16 04:32:55,370 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [18, 17, 17, 9, 9, 1, 1] [2023-02-16 04:32:55,371 INFO L748 eck$LassoCheckResult]: Stem: 37491#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 37492#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; 37496#L18-1 assume !!(main_~i~0#1 > 0); 37760#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 37738#L12-2 assume !(10 == main_~i~0#1); 37736#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37734#L18-1 assume !!(main_~i~0#1 > 0); 37732#L12 assume !(1 == main_~i~0#1); 37730#L12-2 assume !(10 == main_~i~0#1); 37728#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37726#L18-1 assume !!(main_~i~0#1 > 0); 37724#L12 assume !(1 == main_~i~0#1); 37722#L12-2 assume !(10 == main_~i~0#1); 37720#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37718#L18-1 assume !!(main_~i~0#1 > 0); 37716#L12 assume !(1 == main_~i~0#1); 37714#L12-2 assume !(10 == main_~i~0#1); 37712#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37710#L18-1 assume !!(main_~i~0#1 > 0); 37708#L12 assume !(1 == main_~i~0#1); 37706#L12-2 assume !(10 == main_~i~0#1); 37704#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37702#L18-1 assume !!(main_~i~0#1 > 0); 37700#L12 assume !(1 == main_~i~0#1); 37698#L12-2 assume !(10 == main_~i~0#1); 37696#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37694#L18-1 assume !!(main_~i~0#1 > 0); 37692#L12 assume !(1 == main_~i~0#1); 37690#L12-2 assume !(10 == main_~i~0#1); 37688#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37686#L18-1 assume !!(main_~i~0#1 > 0); 37684#L12 assume !(1 == main_~i~0#1); 37682#L12-2 assume !(10 == main_~i~0#1); 37680#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37678#L18-1 assume !!(main_~i~0#1 > 0); 37666#L12 assume !(1 == main_~i~0#1); 37673#L12-2 assume !(10 == main_~i~0#1); 37669#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 37665#L18-1 assume !!(main_~i~0#1 > 0); 37661#L12 assume !(1 == main_~i~0#1); 37660#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 37606#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37656#L18-1 assume !!(main_~i~0#1 > 0); 37655#L12 assume !(1 == main_~i~0#1); 37654#L12-2 assume !(10 == main_~i~0#1); 37650#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37649#L18-1 assume !!(main_~i~0#1 > 0); 37648#L12 assume !(1 == main_~i~0#1); 37647#L12-2 assume !(10 == main_~i~0#1); 37643#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37642#L18-1 assume !!(main_~i~0#1 > 0); 37641#L12 assume !(1 == main_~i~0#1); 37640#L12-2 assume !(10 == main_~i~0#1); 37636#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37635#L18-1 assume !!(main_~i~0#1 > 0); 37634#L12 assume !(1 == main_~i~0#1); 37633#L12-2 assume !(10 == main_~i~0#1); 37629#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37632#L18-1 assume !!(main_~i~0#1 > 0); 38664#L12 assume !(1 == main_~i~0#1); 38661#L12-2 assume !(10 == main_~i~0#1); 38580#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37624#L18-1 assume !!(main_~i~0#1 > 0); 38569#L12 assume !(1 == main_~i~0#1); 38570#L12-2 assume !(10 == main_~i~0#1); 38561#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37616#L18-1 assume !!(main_~i~0#1 > 0); 38556#L12 assume !(1 == main_~i~0#1); 38557#L12-2 assume !(10 == main_~i~0#1); 38541#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37610#L18-1 assume !!(main_~i~0#1 > 0); 38548#L12 assume !(1 == main_~i~0#1); 38657#L12-2 assume !(10 == main_~i~0#1); 38300#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37604#L18-1 assume !!(main_~i~0#1 > 0); 37504#L12 [2023-02-16 04:32:55,371 INFO L750 eck$LassoCheckResult]: Loop: 37504#L12 assume 1 == main_~i~0#1;main_~up~0#1 := 1; 37482#L12-2 assume !(10 == main_~i~0#1); 37483#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40653#L18-1 assume !!(main_~i~0#1 > 0); 37497#L12 assume !(1 == main_~i~0#1); 37498#L12-2 assume !(10 == main_~i~0#1); 40698#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40696#L18-1 assume !!(main_~i~0#1 > 0); 40694#L12 assume !(1 == main_~i~0#1); 40692#L12-2 assume !(10 == main_~i~0#1); 40690#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40688#L18-1 assume !!(main_~i~0#1 > 0); 40686#L12 assume !(1 == main_~i~0#1); 40684#L12-2 assume !(10 == main_~i~0#1); 40682#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40680#L18-1 assume !!(main_~i~0#1 > 0); 40678#L12 assume !(1 == main_~i~0#1); 40676#L12-2 assume !(10 == main_~i~0#1); 40674#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40672#L18-1 assume !!(main_~i~0#1 > 0); 40670#L12 assume !(1 == main_~i~0#1); 40668#L12-2 assume !(10 == main_~i~0#1); 40666#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40664#L18-1 assume !!(main_~i~0#1 > 0); 40662#L12 assume !(1 == main_~i~0#1); 40660#L12-2 assume !(10 == main_~i~0#1); 40659#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40657#L18-1 assume !!(main_~i~0#1 > 0); 40656#L12 assume !(1 == main_~i~0#1); 40655#L12-2 assume !(10 == main_~i~0#1); 40654#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40652#L18-1 assume !!(main_~i~0#1 > 0); 40651#L12 assume !(1 == main_~i~0#1); 40648#L12-2 assume !(10 == main_~i~0#1); 40647#L15-1 assume 1 == main_~up~0#1;main_~i~0#1 := 1 + main_~i~0#1; 40642#L18-1 assume !!(main_~i~0#1 > 0); 40643#L12 assume !(1 == main_~i~0#1); 40646#L12-2 assume 10 == main_~i~0#1;main_~up~0#1 := 0; 39526#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40460#L18-1 assume !!(main_~i~0#1 > 0); 40459#L12 assume !(1 == main_~i~0#1); 40458#L12-2 assume !(10 == main_~i~0#1); 40457#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40456#L18-1 assume !!(main_~i~0#1 > 0); 40455#L12 assume !(1 == main_~i~0#1); 40454#L12-2 assume !(10 == main_~i~0#1); 40453#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40452#L18-1 assume !!(main_~i~0#1 > 0); 40451#L12 assume !(1 == main_~i~0#1); 40410#L12-2 assume !(10 == main_~i~0#1); 40411#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40402#L18-1 assume !!(main_~i~0#1 > 0); 40403#L12 assume !(1 == main_~i~0#1); 40389#L12-2 assume !(10 == main_~i~0#1); 40386#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40383#L18-1 assume !!(main_~i~0#1 > 0); 40384#L12 assume !(1 == main_~i~0#1); 40373#L12-2 assume !(10 == main_~i~0#1); 40369#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40367#L18-1 assume !!(main_~i~0#1 > 0); 40363#L12 assume !(1 == main_~i~0#1); 40359#L12-2 assume !(10 == main_~i~0#1); 40356#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40357#L18-1 assume !!(main_~i~0#1 > 0); 40348#L12 assume !(1 == main_~i~0#1); 40345#L12-2 assume !(10 == main_~i~0#1); 40346#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 40342#L18-1 assume !!(main_~i~0#1 > 0); 37506#L12 assume !(1 == main_~i~0#1); 39528#L12-2 assume !(10 == main_~i~0#1); 39529#L15-1 assume !(1 == main_~up~0#1);main_~i~0#1 := main_~i~0#1 - 1; 37505#L18-1 assume !!(main_~i~0#1 > 0); 37504#L12 [2023-02-16 04:32:55,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:55,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1568126196, now seen corresponding path program 7 times [2023-02-16 04:32:55,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:55,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057015406] [2023-02-16 04:32:55,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:55,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:55,379 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:55,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:55,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:55,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:55,387 INFO L85 PathProgramCache]: Analyzing trace with hash 537366349, now seen corresponding path program 4 times [2023-02-16 04:32:55,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:55,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847876219] [2023-02-16 04:32:55,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:55,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:55,392 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:55,397 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:55,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 04:32:55,398 INFO L85 PathProgramCache]: Analyzing trace with hash 758614336, now seen corresponding path program 8 times [2023-02-16 04:32:55,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 04:32:55,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455316675] [2023-02-16 04:32:55,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 04:32:55,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 04:32:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:55,409 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:55,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 04:32:55,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:55,940 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 04:32:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 04:32:55,984 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.02 04:32:55 BoogieIcfgContainer [2023-02-16 04:32:55,984 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-16 04:32:55,984 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 04:32:55,984 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 04:32:55,985 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 04:32:55,985 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 04:32:46" (3/4) ... [2023-02-16 04:32:55,987 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-02-16 04:32:56,020 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 04:32:56,020 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 04:32:56,021 INFO L158 Benchmark]: Toolchain (without parser) took 9531.84ms. Allocated memory was 125.8MB in the beginning and 237.0MB in the end (delta: 111.1MB). Free memory was 81.4MB in the beginning and 141.7MB in the end (delta: -60.2MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2023-02-16 04:32:56,021 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 04:32:56,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.16ms. Allocated memory is still 125.8MB. Free memory was 81.0MB in the beginning and 72.2MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-16 04:32:56,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.26ms. Allocated memory is still 125.8MB. Free memory was 72.2MB in the beginning and 70.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 04:32:56,021 INFO L158 Benchmark]: Boogie Preprocessor took 13.00ms. Allocated memory is still 125.8MB. Free memory was 70.6MB in the beginning and 69.7MB in the end (delta: 881.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 04:32:56,022 INFO L158 Benchmark]: RCFGBuilder took 179.31ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 69.7MB in the beginning and 136.7MB in the end (delta: -67.0MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2023-02-16 04:32:56,022 INFO L158 Benchmark]: BuchiAutomizer took 9120.49ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 136.6MB in the beginning and 145.9MB in the end (delta: -9.3MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. [2023-02-16 04:32:56,022 INFO L158 Benchmark]: Witness Printer took 35.97ms. Allocated memory is still 237.0MB. Free memory was 145.9MB in the beginning and 141.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-16 04:32:56,023 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 125.8MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 154.16ms. Allocated memory is still 125.8MB. Free memory was 81.0MB in the beginning and 72.2MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.26ms. Allocated memory is still 125.8MB. Free memory was 72.2MB in the beginning and 70.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.00ms. Allocated memory is still 125.8MB. Free memory was 70.6MB in the beginning and 69.7MB in the end (delta: 881.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 179.31ms. Allocated memory was 125.8MB in the beginning and 163.6MB in the end (delta: 37.7MB). Free memory was 69.7MB in the beginning and 136.7MB in the end (delta: -67.0MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 9120.49ms. Allocated memory was 163.6MB in the beginning and 237.0MB in the end (delta: 73.4MB). Free memory was 136.6MB in the beginning and 145.9MB in the end (delta: -9.3MB). Peak memory consumption was 62.4MB. Max. memory is 16.1GB. * Witness Printer took 35.97ms. Allocated memory is still 237.0MB. Free memory was 145.9MB in the beginning and 141.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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 17 terminating modules (9 trivial, 5 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 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 3222 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.0s and 13 iterations. TraceHistogramMax:19. Analysis of lassos took 4.9s. Construction of modules took 0.3s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 5. Minimization of det autom 2. Minimization of nondet autom 15. Automata minimization 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 2653 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 1, 0, 2]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 570/640 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 420 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 387 mSDsluCounter, 232 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 768 IncrementalHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 201 mSDtfsCounter, 768 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT2 conc0 concLT2 SILN0 SILU0 SILI2 SILT3 lasso1 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax174 hnf100 lsp44 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq188 hnf92 smp91 dnf137 smp95 tf107 neg95 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 83ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 11 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 12]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] [L12] COND TRUE i == 1 [L13] up = 1 VAL [i=1, up=1] [L15] COND FALSE !(i == 10) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE i > 0 VAL [i=2, up=1] [L12] COND FALSE !(i == 1) VAL [i=2, up=1] [L15] COND FALSE !(i == 10) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE i > 0 VAL [i=3, up=1] [L12] COND FALSE !(i == 1) VAL [i=3, up=1] [L15] COND FALSE !(i == 10) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE i > 0 VAL [i=4, up=1] [L12] COND FALSE !(i == 1) VAL [i=4, up=1] [L15] COND FALSE !(i == 10) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE i > 0 VAL [i=5, up=1] [L12] COND FALSE !(i == 1) VAL [i=5, up=1] [L15] COND FALSE !(i == 10) VAL [i=5, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=6, up=1] [L11] COND TRUE i > 0 VAL [i=6, up=1] [L12] COND FALSE !(i == 1) VAL [i=6, up=1] [L15] COND FALSE !(i == 10) VAL [i=6, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=7, up=1] [L11] COND TRUE i > 0 VAL [i=7, up=1] [L12] COND FALSE !(i == 1) VAL [i=7, up=1] [L15] COND FALSE !(i == 10) VAL [i=7, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=8, up=1] [L11] COND TRUE i > 0 VAL [i=8, up=1] [L12] COND FALSE !(i == 1) VAL [i=8, up=1] [L15] COND FALSE !(i == 10) VAL [i=8, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=9, up=1] [L11] COND TRUE i > 0 VAL [i=9, up=1] [L12] COND FALSE !(i == 1) VAL [i=9, up=1] [L15] COND FALSE !(i == 10) VAL [i=9, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=10, up=1] [L11] COND TRUE i > 0 VAL [i=10, up=1] [L12] COND FALSE !(i == 1) VAL [i=10, up=1] [L15] COND TRUE i == 10 [L16] up = 0 VAL [i=10, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE i > 0 VAL [i=9, up=0] [L12] COND FALSE !(i == 1) VAL [i=9, up=0] [L15] COND FALSE !(i == 10) VAL [i=9, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=8, up=0] [L11] COND TRUE i > 0 VAL [i=8, up=0] [L12] COND FALSE !(i == 1) VAL [i=8, up=0] [L15] COND FALSE !(i == 10) VAL [i=8, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=7, up=0] [L11] COND TRUE i > 0 VAL [i=7, up=0] [L12] COND FALSE !(i == 1) VAL [i=7, up=0] [L15] COND FALSE !(i == 10) VAL [i=7, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=6, up=0] [L11] COND TRUE i > 0 VAL [i=6, up=0] [L12] COND FALSE !(i == 1) VAL [i=6, up=0] [L15] COND FALSE !(i == 10) VAL [i=6, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=5, up=0] [L11] COND TRUE i > 0 VAL [i=5, up=0] [L12] COND FALSE !(i == 1) VAL [i=5, up=0] [L15] COND FALSE !(i == 10) VAL [i=5, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=4, up=0] [L11] COND TRUE i > 0 VAL [i=4, up=0] [L12] COND FALSE !(i == 1) VAL [i=4, up=0] [L15] COND FALSE !(i == 10) VAL [i=4, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=3, up=0] [L11] COND TRUE i > 0 VAL [i=3, up=0] [L12] COND FALSE !(i == 1) VAL [i=3, up=0] [L15] COND FALSE !(i == 10) VAL [i=3, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=2, up=0] [L11] COND TRUE i > 0 VAL [i=2, up=0] [L12] COND FALSE !(i == 1) VAL [i=2, up=0] [L15] COND FALSE !(i == 10) VAL [i=2, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=1, up=0] [L11] COND TRUE i > 0 VAL [i=1, up=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. - 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 VAL [up=0] [L11] COND TRUE i > 0 VAL [i=1, up=0] [L12] COND TRUE i == 1 [L13] up = 1 VAL [i=1, up=1] [L15] COND FALSE !(i == 10) VAL [i=1, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=2, up=1] [L11] COND TRUE i > 0 VAL [i=2, up=1] [L12] COND FALSE !(i == 1) VAL [i=2, up=1] [L15] COND FALSE !(i == 10) VAL [i=2, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=3, up=1] [L11] COND TRUE i > 0 VAL [i=3, up=1] [L12] COND FALSE !(i == 1) VAL [i=3, up=1] [L15] COND FALSE !(i == 10) VAL [i=3, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=4, up=1] [L11] COND TRUE i > 0 VAL [i=4, up=1] [L12] COND FALSE !(i == 1) VAL [i=4, up=1] [L15] COND FALSE !(i == 10) VAL [i=4, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=5, up=1] [L11] COND TRUE i > 0 VAL [i=5, up=1] [L12] COND FALSE !(i == 1) VAL [i=5, up=1] [L15] COND FALSE !(i == 10) VAL [i=5, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=6, up=1] [L11] COND TRUE i > 0 VAL [i=6, up=1] [L12] COND FALSE !(i == 1) VAL [i=6, up=1] [L15] COND FALSE !(i == 10) VAL [i=6, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=7, up=1] [L11] COND TRUE i > 0 VAL [i=7, up=1] [L12] COND FALSE !(i == 1) VAL [i=7, up=1] [L15] COND FALSE !(i == 10) VAL [i=7, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=8, up=1] [L11] COND TRUE i > 0 VAL [i=8, up=1] [L12] COND FALSE !(i == 1) VAL [i=8, up=1] [L15] COND FALSE !(i == 10) VAL [i=8, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=9, up=1] [L11] COND TRUE i > 0 VAL [i=9, up=1] [L12] COND FALSE !(i == 1) VAL [i=9, up=1] [L15] COND FALSE !(i == 10) VAL [i=9, up=1] [L18] COND TRUE up == 1 [L19] i = i+1 VAL [i=10, up=1] [L11] COND TRUE i > 0 VAL [i=10, up=1] [L12] COND FALSE !(i == 1) VAL [i=10, up=1] [L15] COND TRUE i == 10 [L16] up = 0 VAL [i=10, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=9, up=0] [L11] COND TRUE i > 0 VAL [i=9, up=0] [L12] COND FALSE !(i == 1) VAL [i=9, up=0] [L15] COND FALSE !(i == 10) VAL [i=9, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=8, up=0] [L11] COND TRUE i > 0 VAL [i=8, up=0] [L12] COND FALSE !(i == 1) VAL [i=8, up=0] [L15] COND FALSE !(i == 10) VAL [i=8, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=7, up=0] [L11] COND TRUE i > 0 VAL [i=7, up=0] [L12] COND FALSE !(i == 1) VAL [i=7, up=0] [L15] COND FALSE !(i == 10) VAL [i=7, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=6, up=0] [L11] COND TRUE i > 0 VAL [i=6, up=0] [L12] COND FALSE !(i == 1) VAL [i=6, up=0] [L15] COND FALSE !(i == 10) VAL [i=6, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=5, up=0] [L11] COND TRUE i > 0 VAL [i=5, up=0] [L12] COND FALSE !(i == 1) VAL [i=5, up=0] [L15] COND FALSE !(i == 10) VAL [i=5, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=4, up=0] [L11] COND TRUE i > 0 VAL [i=4, up=0] [L12] COND FALSE !(i == 1) VAL [i=4, up=0] [L15] COND FALSE !(i == 10) VAL [i=4, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=3, up=0] [L11] COND TRUE i > 0 VAL [i=3, up=0] [L12] COND FALSE !(i == 1) VAL [i=3, up=0] [L15] COND FALSE !(i == 10) VAL [i=3, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=2, up=0] [L11] COND TRUE i > 0 VAL [i=2, up=0] [L12] COND FALSE !(i == 1) VAL [i=2, up=0] [L15] COND FALSE !(i == 10) VAL [i=2, up=0] [L18] COND FALSE !(up == 1) [L21] i = i-1 VAL [i=1, up=0] [L11] COND TRUE i > 0 VAL [i=1, up=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! [2023-02-16 04:32:56,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2023-02-16 04:32:56,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2023-02-16 04:32:56,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2023-02-16 04:32:56,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2023-02-16 04:32:56,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2023-02-16 04:32:57,061 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)