./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/gcd_4.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/bitvector/gcd_4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 679f2fe8d678884423b2dff47bf2c3c7ede0374b3a8bb68f9a9e8a332d8776ef --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:36:53,840 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:36:53,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:36:53,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:36:53,884 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:36:53,887 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:36:53,888 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:36:53,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:36:53,891 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:36:53,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:36:53,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:36:53,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:36:53,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:36:53,899 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:36:53,900 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:36:53,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:36:53,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:36:53,904 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:36:53,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:36:53,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:36:53,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:36:53,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:36:53,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:36:53,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:36:53,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:36:53,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:36:53,919 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:36:53,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:36:53,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:36:53,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:36:53,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:36:53,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:36:53,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:36:53,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:36:53,925 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:36:53,926 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:36:53,926 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:36:53,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:36:53,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:36:53,927 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:36:53,927 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:36:53,928 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:36:53,953 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:36:53,954 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:36:53,954 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:36:53,954 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:36:53,955 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:36:53,955 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:36:53,955 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:36:53,956 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:36:53,956 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:36:53,956 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:36:53,957 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:36:53,957 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:36:53,957 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:36:53,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:36:53,957 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:36:53,957 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:36:53,957 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:36:53,957 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:36:53,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:36:53,958 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:36:53,958 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:36:53,958 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:36:53,958 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:36:53,958 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:36:53,959 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:36:53,959 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:36:53,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:36:53,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:36:53,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:36:53,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:36:53,960 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:36:53,961 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:36:53,961 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 679f2fe8d678884423b2dff47bf2c3c7ede0374b3a8bb68f9a9e8a332d8776ef [2022-02-21 03:36:54,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:36:54,196 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:36:54,199 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:36:54,200 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:36:54,200 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:36:54,201 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/gcd_4.c [2022-02-21 03:36:54,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b459ce8/accba12d76e9408e830d81c8b7172b76/FLAGc0724ced3 [2022-02-21 03:36:54,632 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:36:54,633 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_4.c [2022-02-21 03:36:54,637 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b459ce8/accba12d76e9408e830d81c8b7172b76/FLAGc0724ced3 [2022-02-21 03:36:54,648 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b4b459ce8/accba12d76e9408e830d81c8b7172b76 [2022-02-21 03:36:54,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:36:54,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:36:54,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:54,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:36:54,656 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:36:54,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:54" (1/1) ... [2022-02-21 03:36:54,658 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@314fd712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:54, skipping insertion in model container [2022-02-21 03:36:54,658 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:36:54" (1/1) ... [2022-02-21 03:36:54,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:36:54,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:36:54,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_4.c[662,675] [2022-02-21 03:36:54,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:54,871 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:36:54,893 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_4.c[662,675] [2022-02-21 03:36:54,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:36:54,919 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:36:54,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:54 WrapperNode [2022-02-21 03:36:54,921 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:36:54,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:54,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:36:54,922 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:36:54,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:54" (1/1) ... [2022-02-21 03:36:54,935 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:54" (1/1) ... [2022-02-21 03:36:54,991 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 59 [2022-02-21 03:36:54,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:36:55,005 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:36:55,005 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:36:55,005 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:36:55,020 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:54" (1/1) ... [2022-02-21 03:36:55,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:54" (1/1) ... [2022-02-21 03:36:55,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:54" (1/1) ... [2022-02-21 03:36:55,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:54" (1/1) ... [2022-02-21 03:36:55,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:54" (1/1) ... [2022-02-21 03:36:55,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:54" (1/1) ... [2022-02-21 03:36:55,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:54" (1/1) ... [2022-02-21 03:36:55,062 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:36:55,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:36:55,067 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:36:55,067 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:36:55,068 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:54" (1/1) ... [2022-02-21 03:36:55,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:55,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:55,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:55,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 03:36:55,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:36:55,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:36:55,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:36:55,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:36:55,177 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:36:55,178 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:36:55,310 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:36:55,314 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:36:55,315 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 03:36:55,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:55 BoogieIcfgContainer [2022-02-21 03:36:55,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:36:55,317 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:36:55,317 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:36:55,320 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:36:55,320 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:55,321 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:36:54" (1/3) ... [2022-02-21 03:36:55,322 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1383dd82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:55, skipping insertion in model container [2022-02-21 03:36:55,322 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:55,322 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:36:54" (2/3) ... [2022-02-21 03:36:55,322 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1383dd82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:36:55, skipping insertion in model container [2022-02-21 03:36:55,322 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:36:55,322 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:55" (3/3) ... [2022-02-21 03:36:55,323 INFO L388 chiAutomizerObserver]: Analyzing ICFG gcd_4.c [2022-02-21 03:36:55,365 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:36:55,365 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:36:55,365 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:36:55,365 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:36:55,366 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:36:55,366 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:36:55,366 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:36:55,366 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:36:55,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:55,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:55,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:55,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:55,400 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:36:55,400 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:55,400 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:36:55,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:55,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:55,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:55,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:55,406 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-02-21 03:36:55,406 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:55,411 INFO L791 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; 19#L22true assume !(gcd_test_~a#1 < 0); 13#L22-2true assume !(gcd_test_~b#1 < 0); 14#L23-1true assume !(0 == gcd_test_~a#1); 5#L30-2true [2022-02-21 03:36:55,412 INFO L793 eck$LassoCheckResult]: Loop: 5#L30-2true assume !!(0 != gcd_test_~b#1); 8#L30true assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 5#L30-2true [2022-02-21 03:36:55,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:55,416 INFO L85 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2022-02-21 03:36:55,422 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:55,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621019028] [2022-02-21 03:36:55,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:55,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:55,502 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:55,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:55,534 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:55,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:55,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 1 times [2022-02-21 03:36:55,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:55,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083053575] [2022-02-21 03:36:55,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:55,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:55,545 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:55,549 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:55,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:55,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1806939727, now seen corresponding path program 1 times [2022-02-21 03:36:55,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:55,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427631869] [2022-02-21 03:36:55,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:55,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:55,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {29#true} is VALID [2022-02-21 03:36:55,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {31#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} is VALID [2022-02-21 03:36:55,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} assume !(gcd_test_~a#1 < 0); {31#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} is VALID [2022-02-21 03:36:55,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {31#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} assume !(gcd_test_~b#1 < 0); {31#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} is VALID [2022-02-21 03:36:55,687 INFO L290 TraceCheckUtils]: 4: Hoare triple {31#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} assume !(0 == gcd_test_~a#1); {31#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} is VALID [2022-02-21 03:36:55,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} assume !!(0 != gcd_test_~b#1); {31#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} is VALID [2022-02-21 03:36:55,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {30#false} is VALID [2022-02-21 03:36:55,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:55,692 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:55,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427631869] [2022-02-21 03:36:55,693 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427631869] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:55,693 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:36:55,693 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:36:55,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333794374] [2022-02-21 03:36:55,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:55,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:55,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:36:55,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:36:55,775 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 20 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) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:55,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:55,839 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-02-21 03:36:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:36:55,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:55,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:55,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2022-02-21 03:36:55,862 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:55,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 9 states and 10 transitions. [2022-02-21 03:36:55,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-02-21 03:36:55,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-02-21 03:36:55,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2022-02-21 03:36:55,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:55,867 INFO L681 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-02-21 03:36:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2022-02-21 03:36:55,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-02-21 03:36:55,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:55,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states and 10 transitions. Second operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:55,889 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states and 10 transitions. Second operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:55,891 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:55,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:55,897 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-21 03:36:55,898 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:36:55,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:55,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:55,900 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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) Second operand 9 states and 10 transitions. [2022-02-21 03:36:55,902 INFO L87 Difference]: Start difference. First operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 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) Second operand 9 states and 10 transitions. [2022-02-21 03:36:55,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:55,911 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2022-02-21 03:36:55,912 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:36:55,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:55,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:55,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:55,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:55,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:55,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-02-21 03:36:55,919 INFO L704 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-02-21 03:36:55,919 INFO L587 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-02-21 03:36:55,920 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:36:55,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2022-02-21 03:36:55,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:55,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:55,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:55,922 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:55,922 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:55,923 INFO L791 eck$LassoCheckResult]: Stem: 59#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); 60#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; 55#L22 assume !(gcd_test_~a#1 < 0); 56#L22-2 assume !(gcd_test_~b#1 < 0); 62#L23-1 assume !(0 == gcd_test_~a#1); 63#L30-2 assume !!(0 != gcd_test_~b#1); 61#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 57#L30-2 [2022-02-21 03:36:55,924 INFO L793 eck$LassoCheckResult]: Loop: 57#L30-2 assume !!(0 != gcd_test_~b#1); 58#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 57#L30-2 [2022-02-21 03:36:55,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:55,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1806939725, now seen corresponding path program 1 times [2022-02-21 03:36:55,926 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:55,926 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175682863] [2022-02-21 03:36:55,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:55,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:55,947 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:55,958 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:55,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:55,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 2 times [2022-02-21 03:36:55,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:55,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660357153] [2022-02-21 03:36:55,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:55,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:55,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:55,966 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:55,970 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:55,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:55,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1302289042, now seen corresponding path program 1 times [2022-02-21 03:36:55,971 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:55,971 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981453998] [2022-02-21 03:36:55,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:55,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:56,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {89#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {89#true} is VALID [2022-02-21 03:36:56,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {89#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {91#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} is VALID [2022-02-21 03:36:56,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {91#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} assume !(gcd_test_~a#1 < 0); {91#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} is VALID [2022-02-21 03:36:56,059 INFO L290 TraceCheckUtils]: 3: Hoare triple {91#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} assume !(gcd_test_~b#1 < 0); {91#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} is VALID [2022-02-21 03:36:56,060 INFO L290 TraceCheckUtils]: 4: Hoare triple {91#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} assume !(0 == gcd_test_~a#1); {91#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} is VALID [2022-02-21 03:36:56,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {91#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} assume !!(0 != gcd_test_~b#1); {91#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} is VALID [2022-02-21 03:36:56,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {91#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {92#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)))} is VALID [2022-02-21 03:36:56,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {92#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)))} assume !!(0 != gcd_test_~b#1); {92#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)))} is VALID [2022-02-21 03:36:56,063 INFO L290 TraceCheckUtils]: 8: Hoare triple {92#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {90#false} is VALID [2022-02-21 03:36:56,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:56,064 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:56,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981453998] [2022-02-21 03:36:56,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981453998] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:56,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855636804] [2022-02-21 03:36:56,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:56,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:56,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:56,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:56,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-21 03:36:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:56,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-21 03:36:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:56,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:56,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {89#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {89#true} is VALID [2022-02-21 03:36:56,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {89#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {99#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:56,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~a#1 < 0); {99#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:56,341 INFO L290 TraceCheckUtils]: 3: Hoare triple {99#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~b#1 < 0); {99#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:56,342 INFO L290 TraceCheckUtils]: 4: Hoare triple {99#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(0 == gcd_test_~a#1); {99#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:56,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {99#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {99#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:56,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {99#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {115#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:56,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {115#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {115#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:56,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {115#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {90#false} is VALID [2022-02-21 03:36:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:56,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:36:56,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {122#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {90#false} is VALID [2022-02-21 03:36:56,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {122#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !!(0 != gcd_test_~b#1); {122#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-21 03:36:56,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {129#(< (* |ULTIMATE.start_gcd_test_~b#1| 2) |ULTIMATE.start_gcd_test_~a#1|)} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {122#(< |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-21 03:36:56,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {129#(< (* |ULTIMATE.start_gcd_test_~b#1| 2) |ULTIMATE.start_gcd_test_~a#1|)} assume !!(0 != gcd_test_~b#1); {129#(< (* |ULTIMATE.start_gcd_test_~b#1| 2) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-21 03:36:56,518 INFO L290 TraceCheckUtils]: 4: Hoare triple {129#(< (* |ULTIMATE.start_gcd_test_~b#1| 2) |ULTIMATE.start_gcd_test_~a#1|)} assume !(0 == gcd_test_~a#1); {129#(< (* |ULTIMATE.start_gcd_test_~b#1| 2) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-21 03:36:56,519 INFO L290 TraceCheckUtils]: 3: Hoare triple {129#(< (* |ULTIMATE.start_gcd_test_~b#1| 2) |ULTIMATE.start_gcd_test_~a#1|)} assume !(gcd_test_~b#1 < 0); {129#(< (* |ULTIMATE.start_gcd_test_~b#1| 2) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-21 03:36:56,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {129#(< (* |ULTIMATE.start_gcd_test_~b#1| 2) |ULTIMATE.start_gcd_test_~a#1|)} assume !(gcd_test_~a#1 < 0); {129#(< (* |ULTIMATE.start_gcd_test_~b#1| 2) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-21 03:36:56,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {89#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {129#(< (* |ULTIMATE.start_gcd_test_~b#1| 2) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-21 03:36:56,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {89#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {89#true} is VALID [2022-02-21 03:36:56,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:56,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855636804] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:36:56,521 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:36:56,521 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-02-21 03:36:56,522 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934777988] [2022-02-21 03:36:56,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:36:56,541 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:56,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-21 03:36:56,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-02-21 03:36:56,542 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:56,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:56,583 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-02-21 03:36:56,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 03:36:56,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:56,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:56,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2022-02-21 03:36:56,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:56,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2022-02-21 03:36:56,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 03:36:56,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-02-21 03:36:56,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2022-02-21 03:36:56,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:36:56,658 INFO L681 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-02-21 03:36:56,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2022-02-21 03:36:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-02-21 03:36:56,661 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:56,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 14 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:56,662 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 14 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:56,662 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:56,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:56,664 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-02-21 03:36:56,664 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-02-21 03:36:56,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:56,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:56,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 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 13 states and 14 transitions. [2022-02-21 03:36:56,666 INFO L87 Difference]: Start difference. First operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 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 13 states and 14 transitions. [2022-02-21 03:36:56,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:56,672 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-02-21 03:36:56,672 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-02-21 03:36:56,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:56,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:56,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:56,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:56,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-02-21 03:36:56,674 INFO L704 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-02-21 03:36:56,674 INFO L587 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-02-21 03:36:56,681 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:36:56,681 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2022-02-21 03:36:56,682 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:56,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:56,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:56,683 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2022-02-21 03:36:56,684 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:56,684 INFO L791 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); 163#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; 158#L22 assume !(gcd_test_~a#1 < 0); 159#L22-2 assume !(gcd_test_~b#1 < 0); 165#L23-1 assume !(0 == gcd_test_~a#1); 166#L30-2 assume !!(0 != gcd_test_~b#1); 164#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 160#L30-2 assume !!(0 != gcd_test_~b#1); 161#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 170#L30-2 assume !!(0 != gcd_test_~b#1); 169#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 168#L30-2 [2022-02-21 03:36:56,684 INFO L793 eck$LassoCheckResult]: Loop: 168#L30-2 assume !!(0 != gcd_test_~b#1); 167#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 168#L30-2 [2022-02-21 03:36:56,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:56,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1664285203, now seen corresponding path program 2 times [2022-02-21 03:36:56,686 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:56,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244745081] [2022-02-21 03:36:56,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:56,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:56,718 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:56,730 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:56,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:56,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 3 times [2022-02-21 03:36:56,731 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:56,731 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224295615] [2022-02-21 03:36:56,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:56,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:56,736 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:56,738 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:56,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:56,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1650246872, now seen corresponding path program 2 times [2022-02-21 03:36:56,739 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:56,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087224171] [2022-02-21 03:36:56,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:56,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:56,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:56,752 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:56,763 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:57,038 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:36:57,039 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:36:57,039 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:36:57,039 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:36:57,040 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:36:57,040 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:57,040 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:36:57,040 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:36:57,040 INFO L133 ssoRankerPreferences]: Filename of dumped script: gcd_4.c_Iteration3_Lasso [2022-02-21 03:36:57,040 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:36:57,040 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:36:57,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:57,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:57,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:57,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:57,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:57,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:57,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:57,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:57,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:57,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:57,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:36:57,350 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:36:57,352 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:36:57,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:57,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:57,355 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:57,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:57,368 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:57,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:57,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:57,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:57,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:57,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:57,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:57,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 03:36:57,388 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:57,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 03:36:57,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:57,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:57,409 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:57,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 03:36:57,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:57,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:57,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:57,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:57,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:57,431 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:57,431 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:57,453 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:57,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:57,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:57,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:57,472 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:57,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 03:36:57,474 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:57,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:57,481 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:57,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:57,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:57,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:57,496 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:57,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:57,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 03:36:57,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:57,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:57,537 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:57,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 03:36:57,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:57,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:57,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:57,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:57,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:57,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:57,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:57,568 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:57,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 03:36:57,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:57,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:57,636 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:57,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 03:36:57,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:57,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:57,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:57,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:57,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:57,676 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:57,676 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:57,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:57,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:57,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:57,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:57,720 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:57,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:57,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:57,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:57,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:57,737 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:57,745 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:57,745 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:57,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 03:36:57,755 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:57,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:57,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:57,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:57,792 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:57,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 03:36:57,794 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:57,801 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:57,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:57,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:57,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:57,803 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:57,803 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:57,819 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:57,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:57,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:57,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:57,838 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:57,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:36:57,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:57,847 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:57,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:57,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:57,848 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:57,849 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:57,849 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:57,862 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:57,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:57,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:57,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:57,881 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:57,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:36:57,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:57,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:57,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:57,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:57,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:57,893 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:57,893 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:57,902 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:57,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 03:36:57,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:57,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:57,928 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:57,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:36:57,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:57,973 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:57,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:57,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:57,974 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:57,976 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:57,976 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:57,986 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:58,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:58,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:58,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:58,008 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:58,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:36:58,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:58,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:58,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:58,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:58,018 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:58,021 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:36:58,021 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:36:58,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:58,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:58,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:58,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:58,057 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:58,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:36:58,060 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:58,068 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:58,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:58,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:58,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:58,068 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:58,073 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:58,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:58,074 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:58,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:58,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:58,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:58,119 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:58,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:36:58,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:58,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:58,130 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:36:58,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:58,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:36:58,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:58,131 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:36:58,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:36:58,132 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:36:58,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 03:36:58,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:58,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:58,157 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:58,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:36:58,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:36:58,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:36:58,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:36:58,169 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 03:36:58,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:36:58,181 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-02-21 03:36:58,181 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-02-21 03:36:58,208 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:36:58,252 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2022-02-21 03:36:58,252 INFO L444 ModelExtractionUtils]: 22 out of 36 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-02-21 03:36:58,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:36:58,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:58,255 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:36:58,280 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:36:58,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:36:58,301 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 4. [2022-02-21 03:36:58,301 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:36:58,301 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_gcd_test_~b#1) = 1*ULTIMATE.start_gcd_test_~b#1 Supporting invariants [1*ULTIMATE.start_gcd_test_~b#1 >= 0, 1*ULTIMATE.start_gcd_test_~a#1 - 2 >= 0] [2022-02-21 03:36:58,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:58,345 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2022-02-21 03:36:58,354 INFO L390 LassoCheck]: Loop: "assume !!(0 != gcd_test_~b#1);" "assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1;" [2022-02-21 03:36:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:58,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:58,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:36:58,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:58,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:58,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {206#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {206#unseeded} is VALID [2022-02-21 03:36:58,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {247#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:58,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {247#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~a#1 < 0); {247#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:58,654 INFO L290 TraceCheckUtils]: 3: Hoare triple {247#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~b#1 < 0); {247#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:58,655 INFO L290 TraceCheckUtils]: 4: Hoare triple {247#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(0 == gcd_test_~a#1); {247#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:58,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {247#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:58,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {247#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {263#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:58,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {263#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:58,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {263#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {270#(and unseeded (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:58,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {270#(and unseeded (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {270#(and unseeded (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:58,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {270#(and unseeded (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {235#(and unseeded (>= (+ |ULTIMATE.start_gcd_test_~a#1| (- 2)) 0))} is VALID [2022-02-21 03:36:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:58,666 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:36:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:58,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:58,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#(and (>= oldRank0 |ULTIMATE.start_gcd_test_~b#1|) (>= (+ |ULTIMATE.start_gcd_test_~a#1| (- 2)) 0))} assume !!(0 != gcd_test_~b#1); {236#(and (>= oldRank0 |ULTIMATE.start_gcd_test_~b#1|) (>= (+ |ULTIMATE.start_gcd_test_~a#1| (- 2)) 0))} is VALID [2022-02-21 03:36:58,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#(and (>= oldRank0 |ULTIMATE.start_gcd_test_~b#1|) (>= (+ |ULTIMATE.start_gcd_test_~a#1| (- 2)) 0))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {238#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_gcd_test_~b#1|))) (>= (+ |ULTIMATE.start_gcd_test_~a#1| (- 2)) 0))} is VALID [2022-02-21 03:36:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:58,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:58,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:58,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:58,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,745 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.4 stem predicates 1 loop predicates [2022-02-21 03:36:58,746 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:58,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:36:58,834 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 15 transitions. Complement of second has 6 states. [2022-02-21 03:36:58,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:58,834 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:58,834 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. cyclomatic complexity: 2 [2022-02-21 03:36:58,834 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:58,835 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:58,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:58,837 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:58,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:58,838 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2022-02-21 03:36:58,838 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:58,838 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:58,838 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:58,840 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 14 transitions. cyclomatic complexity: 2 [2022-02-21 03:36:58,840 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:36:58,841 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:58,841 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:58,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 8 transitions. cyclomatic complexity: 6 [2022-02-21 03:36:58,842 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:58,842 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:36:58,842 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 15 transitions. cyclomatic complexity: 2 [2022-02-21 03:36:58,843 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:36:58,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:58,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:58,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:58,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:58,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:58,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:58,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:36:58,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:36:58,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:36:58,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:36:58,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:36:58,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:36:58,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:36:58,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:36:58,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:36:58,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:36:58,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:36:58,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:36:58,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:58,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:58,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:58,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:36:58,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:36:58,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:36:58,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:58,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:58,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:58,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,853 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2022-02-21 03:36:58,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:58,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:58,855 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:36:58,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:58,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:36:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:58,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:59,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {206#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {206#unseeded} is VALID [2022-02-21 03:36:59,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {313#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:59,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {313#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~a#1 < 0); {313#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:59,086 INFO L290 TraceCheckUtils]: 3: Hoare triple {313#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~b#1 < 0); {313#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:59,087 INFO L290 TraceCheckUtils]: 4: Hoare triple {313#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(0 == gcd_test_~a#1); {313#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:59,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {313#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:59,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {329#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:59,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {329#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {329#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:59,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {329#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {336#(and unseeded (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:59,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {336#(and unseeded (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {336#(and unseeded (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:59,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {336#(and unseeded (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {235#(and unseeded (>= (+ |ULTIMATE.start_gcd_test_~a#1| (- 2)) 0))} is VALID [2022-02-21 03:36:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:59,095 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:36:59,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:59,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:59,107 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#(and (>= oldRank0 |ULTIMATE.start_gcd_test_~b#1|) (>= (+ |ULTIMATE.start_gcd_test_~a#1| (- 2)) 0))} assume !!(0 != gcd_test_~b#1); {236#(and (>= oldRank0 |ULTIMATE.start_gcd_test_~b#1|) (>= (+ |ULTIMATE.start_gcd_test_~a#1| (- 2)) 0))} is VALID [2022-02-21 03:36:59,108 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#(and (>= oldRank0 |ULTIMATE.start_gcd_test_~b#1|) (>= (+ |ULTIMATE.start_gcd_test_~a#1| (- 2)) 0))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {238#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_gcd_test_~b#1|))) (>= (+ |ULTIMATE.start_gcd_test_~a#1| (- 2)) 0))} is VALID [2022-02-21 03:36:59,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:59,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:59,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,120 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.4 stem predicates 1 loop predicates [2022-02-21 03:36:59,120 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,195 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 15 transitions. Complement of second has 6 states. [2022-02-21 03:36:59,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:36:59,195 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:59,195 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. cyclomatic complexity: 2 [2022-02-21 03:36:59,196 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:59,196 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:59,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,197 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:59,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:59,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2022-02-21 03:36:59,197 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:59,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:59,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:59,198 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 14 transitions. cyclomatic complexity: 2 [2022-02-21 03:36:59,198 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:36:59,198 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,199 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:36:59,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states and 8 transitions. cyclomatic complexity: 6 [2022-02-21 03:36:59,199 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:36:59,199 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:36:59,199 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 15 transitions. cyclomatic complexity: 2 [2022-02-21 03:36:59,200 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:36:59,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:36:59,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:36:59,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:36:59,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:36:59,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:36:59,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:36:59,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:36:59,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:36:59,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:36:59,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:36:59,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:36:59,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:36:59,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:36:59,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:36:59,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 15 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:36:59,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,208 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:59,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2022-02-21 03:36:59,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,210 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:36:59,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:59,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:59,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:36:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:59,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:59,448 INFO L290 TraceCheckUtils]: 0: Hoare triple {206#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {206#unseeded} is VALID [2022-02-21 03:36:59,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {206#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {379#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:59,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~a#1 < 0); {379#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:59,450 INFO L290 TraceCheckUtils]: 3: Hoare triple {379#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~b#1 < 0); {379#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:59,451 INFO L290 TraceCheckUtils]: 4: Hoare triple {379#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(0 == gcd_test_~a#1); {379#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:59,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {379#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:59,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {379#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {395#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:59,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {395#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {395#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:59,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {395#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) unseeded (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {402#(and unseeded (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:59,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {402#(and unseeded (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {402#(and unseeded (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:36:59,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {402#(and unseeded (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {235#(and unseeded (>= (+ |ULTIMATE.start_gcd_test_~a#1| (- 2)) 0))} is VALID [2022-02-21 03:36:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:59,459 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:36:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:59,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:36:59,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#(and (>= oldRank0 |ULTIMATE.start_gcd_test_~b#1|) (>= (+ |ULTIMATE.start_gcd_test_~a#1| (- 2)) 0))} assume !!(0 != gcd_test_~b#1); {236#(and (>= oldRank0 |ULTIMATE.start_gcd_test_~b#1|) (>= (+ |ULTIMATE.start_gcd_test_~a#1| (- 2)) 0))} is VALID [2022-02-21 03:36:59,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#(and (>= oldRank0 |ULTIMATE.start_gcd_test_~b#1|) (>= (+ |ULTIMATE.start_gcd_test_~a#1| (- 2)) 0))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {238#(and (or unseeded (and (>= oldRank0 0) (> oldRank0 |ULTIMATE.start_gcd_test_~b#1|))) (>= (+ |ULTIMATE.start_gcd_test_~a#1| (- 2)) 0))} is VALID [2022-02-21 03:36:59,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:59,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:59,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,487 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.4 stem predicates 1 loop predicates [2022-02-21 03:36:59,488 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,621 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 14 transitions. cyclomatic complexity: 2. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 25 transitions. Complement of second has 12 states. [2022-02-21 03:36:59,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 4 stem states 1 non-accepting loop states 2 accepting loop states [2022-02-21 03:36:59,621 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:59,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. cyclomatic complexity: 2 [2022-02-21 03:36:59,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:59,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:59,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:59,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:59,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:59,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2022-02-21 03:36:59,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:36:59,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:59,623 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:59,624 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 14 transitions. cyclomatic complexity: 2 [2022-02-21 03:36:59,624 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:36:59,624 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,625 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:59,626 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:36:59,626 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 21 states and 25 transitions. cyclomatic complexity: 6 [2022-02-21 03:36:59,626 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:36:59,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:59,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:59,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:59,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:36:59,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:36:59,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:36:59,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:36:59,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:36:59,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 21 letters. Loop has 21 letters. [2022-02-21 03:36:59,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:36:59,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:36:59,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 13 letters. [2022-02-21 03:36:59,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:36:59,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:36:59,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:36:59,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:36:59,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:36:59,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 2 letters. [2022-02-21 03:36:59,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:59,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:59,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2022-02-21 03:36:59,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:36:59,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:36:59,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:36:59,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:36:59,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:36:59,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 15 letters. Loop has 2 letters. [2022-02-21 03:36:59,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 14 transitions. cyclomatic complexity: 2 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:36:59,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 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) Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:36:59,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 21 states and 25 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 2 letters. [2022-02-21 03:36:59,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,637 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:36:59,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-02-21 03:36:59,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2022-02-21 03:36:59,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 13 letters. Loop has 2 letters. [2022-02-21 03:36:59,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 11 letters. Loop has 4 letters. [2022-02-21 03:36:59,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:36:59,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. cyclomatic complexity: 6 [2022-02-21 03:36:59,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-02-21 03:36:59,642 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 23 transitions. [2022-02-21 03:36:59,642 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-02-21 03:36:59,642 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-02-21 03:36:59,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2022-02-21 03:36:59,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:36:59,642 INFO L681 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-02-21 03:36:59,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2022-02-21 03:36:59,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-02-21 03:36:59,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:59,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states and 23 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,644 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states and 23 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,644 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,645 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:59,646 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-02-21 03:36:59,646 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-21 03:36:59,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:59,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:59,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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 19 states and 23 transitions. [2022-02-21 03:36:59,647 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 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 19 states and 23 transitions. [2022-02-21 03:36:59,648 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:59,649 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-02-21 03:36:59,649 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-21 03:36:59,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:59,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:59,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:59,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-02-21 03:36:59,651 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 03:36:59,651 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-02-21 03:36:59,651 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:36:59,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2022-02-21 03:36:59,651 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:59,651 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:59,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:59,652 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2022-02-21 03:36:59,652 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:59,652 INFO L791 eck$LassoCheckResult]: Stem: 464#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); 465#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; 457#L22 assume !(gcd_test_~a#1 < 0); 458#L22-2 assume !(gcd_test_~b#1 < 0); 466#L23-1 assume !(0 == gcd_test_~a#1); 467#L30-2 assume !!(0 != gcd_test_~b#1); 473#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 472#L30-2 assume !!(0 != gcd_test_~b#1); 471#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 470#L30-2 assume !!(0 != gcd_test_~b#1); 469#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 468#L30-2 assume !!(0 != gcd_test_~b#1); 463#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 459#L30-2 [2022-02-21 03:36:59,652 INFO L793 eck$LassoCheckResult]: Loop: 459#L30-2 assume !!(0 != gcd_test_~b#1); 460#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 459#L30-2 [2022-02-21 03:36:59,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:59,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1650246870, now seen corresponding path program 3 times [2022-02-21 03:36:59,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:59,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903169679] [2022-02-21 03:36:59,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:59,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:59,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {577#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {577#true} is VALID [2022-02-21 03:36:59,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {577#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {579#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:36:59,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {579#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !(gcd_test_~a#1 < 0); {579#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:36:59,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {579#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !(gcd_test_~b#1 < 0); {579#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:36:59,737 INFO L290 TraceCheckUtils]: 4: Hoare triple {579#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !(0 == gcd_test_~a#1); {579#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:36:59,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {579#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !!(0 != gcd_test_~b#1); {579#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:36:59,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {579#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {580#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63))} is VALID [2022-02-21 03:36:59,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {580#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63))} assume !!(0 != gcd_test_~b#1); {580#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63))} is VALID [2022-02-21 03:36:59,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {581#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} is VALID [2022-02-21 03:36:59,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {581#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} assume !!(0 != gcd_test_~b#1); {581#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} is VALID [2022-02-21 03:36:59,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {581#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {582#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63))} is VALID [2022-02-21 03:36:59,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {582#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63))} assume !!(0 != gcd_test_~b#1); {582#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63))} is VALID [2022-02-21 03:36:59,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {582#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {578#false} is VALID [2022-02-21 03:36:59,742 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:59,743 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:59,743 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903169679] [2022-02-21 03:36:59,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903169679] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:36:59,743 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:36:59,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:36:59,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515920548] [2022-02-21 03:36:59,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:36:59,744 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:36:59,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:59,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 4 times [2022-02-21 03:36:59,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:59,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073787991] [2022-02-21 03:36:59,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:59,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:59,748 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:36:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:36:59,750 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:36:59,767 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:36:59,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-21 03:36:59,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-02-21 03:36:59,768 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:36:59,827 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-02-21 03:36:59,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:36:59,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:36:59,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2022-02-21 03:36:59,842 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:59,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 20 transitions. [2022-02-21 03:36:59,843 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 03:36:59,843 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 03:36:59,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2022-02-21 03:36:59,843 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:36:59,844 INFO L681 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-02-21 03:36:59,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2022-02-21 03:36:59,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-02-21 03:36:59,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:36:59,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 20 transitions. Second operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,845 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 20 transitions. Second operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,845 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,846 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:59,847 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-02-21 03:36:59,847 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-21 03:36:59,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:59,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:59,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 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 18 states and 20 transitions. [2022-02-21 03:36:59,847 INFO L87 Difference]: Start difference. First operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 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 18 states and 20 transitions. [2022-02-21 03:36:59,848 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:36:59,849 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-02-21 03:36:59,849 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-02-21 03:36:59,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:36:59,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:36:59,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:36:59,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:36:59,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:36:59,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-02-21 03:36:59,850 INFO L704 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-21 03:36:59,851 INFO L587 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-02-21 03:36:59,851 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:36:59,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2022-02-21 03:36:59,851 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:36:59,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:36:59,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:36:59,852 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1, 1] [2022-02-21 03:36:59,852 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:36:59,852 INFO L791 eck$LassoCheckResult]: Stem: 611#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); 612#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; 604#L22 assume !(gcd_test_~a#1 < 0); 605#L22-2 assume !(gcd_test_~b#1 < 0); 613#L23-1 assume !(0 == gcd_test_~a#1); 614#L30-2 assume !!(0 != gcd_test_~b#1); 620#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 619#L30-2 assume !!(0 != gcd_test_~b#1); 618#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 617#L30-2 assume !!(0 != gcd_test_~b#1); 616#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 615#L30-2 assume !!(0 != gcd_test_~b#1); 609#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 608#L30-2 assume !!(0 != gcd_test_~b#1); 610#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 606#L30-2 [2022-02-21 03:36:59,852 INFO L793 eck$LassoCheckResult]: Loop: 606#L30-2 assume !!(0 != gcd_test_~b#1); 607#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 606#L30-2 [2022-02-21 03:36:59,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:36:59,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1044312667, now seen corresponding path program 3 times [2022-02-21 03:36:59,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:36:59,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040077070] [2022-02-21 03:36:59,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:36:59,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:36:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:59,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {726#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {726#true} is VALID [2022-02-21 03:36:59,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {726#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {728#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:36:59,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {728#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !(gcd_test_~a#1 < 0); {728#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:36:59,924 INFO L290 TraceCheckUtils]: 3: Hoare triple {728#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !(gcd_test_~b#1 < 0); {728#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:36:59,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {728#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !(0 == gcd_test_~a#1); {728#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:36:59,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {728#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !!(0 != gcd_test_~b#1); {728#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:36:59,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {728#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {729#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63))} is VALID [2022-02-21 03:36:59,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {729#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63))} assume !!(0 != gcd_test_~b#1); {729#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63))} is VALID [2022-02-21 03:36:59,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {729#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {730#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} is VALID [2022-02-21 03:36:59,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {730#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} assume !!(0 != gcd_test_~b#1); {730#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} is VALID [2022-02-21 03:36:59,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {730#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {731#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63))} is VALID [2022-02-21 03:36:59,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {731#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63))} assume !!(0 != gcd_test_~b#1); {731#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63))} is VALID [2022-02-21 03:36:59,930 INFO L290 TraceCheckUtils]: 12: Hoare triple {731#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {732#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-21 03:36:59,930 INFO L290 TraceCheckUtils]: 13: Hoare triple {732#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|)} assume !!(0 != gcd_test_~b#1); {732#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-21 03:36:59,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {732#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|)} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {727#false} is VALID [2022-02-21 03:36:59,931 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:36:59,931 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:36:59,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040077070] [2022-02-21 03:36:59,931 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040077070] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:36:59,932 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650786061] [2022-02-21 03:36:59,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-21 03:36:59,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:36:59,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:36:59,933 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:36:59,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-02-21 03:36:59,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-02-21 03:36:59,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:36:59,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-21 03:36:59,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:36:59,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:00,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {726#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {726#true} is VALID [2022-02-21 03:37:00,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {726#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {739#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:37:00,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {739#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !(gcd_test_~a#1 < 0); {739#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:37:00,209 INFO L290 TraceCheckUtils]: 3: Hoare triple {739#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !(gcd_test_~b#1 < 0); {739#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:37:00,212 INFO L290 TraceCheckUtils]: 4: Hoare triple {739#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !(0 == gcd_test_~a#1); {739#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:37:00,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {739#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !!(0 != gcd_test_~b#1); {739#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:37:00,213 INFO L290 TraceCheckUtils]: 6: Hoare triple {739#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {755#(and (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-21 03:37:00,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {755#(and (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} assume !!(0 != gcd_test_~b#1); {755#(and (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-21 03:37:00,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {755#(and (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {762#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} is VALID [2022-02-21 03:37:00,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {762#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} assume !!(0 != gcd_test_~b#1); {762#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} is VALID [2022-02-21 03:37:00,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {762#(and (<= 18 |ULTIMATE.start_gcd_test_~b#1|) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {769#(and (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-21 03:37:00,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {769#(and (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} assume !!(0 != gcd_test_~b#1); {769#(and (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-21 03:37:00,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {769#(and (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63) (<= 18 |ULTIMATE.start_gcd_test_~b#1|))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {776#(and (<= 18 (div (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) 63) 3)) (<= 18 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)))} is VALID [2022-02-21 03:37:00,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {776#(and (<= 18 (div (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) 63) 3)) (<= 18 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)))} assume !!(0 != gcd_test_~b#1); {776#(and (<= 18 (div (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) 63) 3)) (<= 18 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)))} is VALID [2022-02-21 03:37:00,220 INFO L290 TraceCheckUtils]: 14: Hoare triple {776#(and (<= 18 (div (+ (* |ULTIMATE.start_gcd_test_~a#1| (- 1)) 63) 3)) (<= 18 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {727#false} is VALID [2022-02-21 03:37:00,221 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:00,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:37:00,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {732#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|)} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {727#false} is VALID [2022-02-21 03:37:00,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {732#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|)} assume !!(0 != gcd_test_~b#1); {732#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-21 03:37:00,617 INFO L290 TraceCheckUtils]: 12: Hoare triple {789#(<= (* |ULTIMATE.start_gcd_test_~a#1| 2) |ULTIMATE.start_gcd_test_~b#1|)} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {732#(<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-21 03:37:00,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {789#(<= (* |ULTIMATE.start_gcd_test_~a#1| 2) |ULTIMATE.start_gcd_test_~b#1|)} assume !!(0 != gcd_test_~b#1); {789#(<= (* |ULTIMATE.start_gcd_test_~a#1| 2) |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-21 03:37:00,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {796#(<= |ULTIMATE.start_gcd_test_~a#1| (+ |ULTIMATE.start_gcd_test_~b#1| (div |ULTIMATE.start_gcd_test_~b#1| 2)))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {789#(<= (* |ULTIMATE.start_gcd_test_~a#1| 2) |ULTIMATE.start_gcd_test_~b#1|)} is VALID [2022-02-21 03:37:00,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {796#(<= |ULTIMATE.start_gcd_test_~a#1| (+ |ULTIMATE.start_gcd_test_~b#1| (div |ULTIMATE.start_gcd_test_~b#1| 2)))} assume !!(0 != gcd_test_~b#1); {796#(<= |ULTIMATE.start_gcd_test_~a#1| (+ |ULTIMATE.start_gcd_test_~b#1| (div |ULTIMATE.start_gcd_test_~b#1| 2)))} is VALID [2022-02-21 03:37:00,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {803#(<= |ULTIMATE.start_gcd_test_~a#1| (+ (div |ULTIMATE.start_gcd_test_~b#1| 2) (* |ULTIMATE.start_gcd_test_~b#1| 2)))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {796#(<= |ULTIMATE.start_gcd_test_~a#1| (+ |ULTIMATE.start_gcd_test_~b#1| (div |ULTIMATE.start_gcd_test_~b#1| 2)))} is VALID [2022-02-21 03:37:00,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {803#(<= |ULTIMATE.start_gcd_test_~a#1| (+ (div |ULTIMATE.start_gcd_test_~b#1| 2) (* |ULTIMATE.start_gcd_test_~b#1| 2)))} assume !!(0 != gcd_test_~b#1); {803#(<= |ULTIMATE.start_gcd_test_~a#1| (+ (div |ULTIMATE.start_gcd_test_~b#1| 2) (* |ULTIMATE.start_gcd_test_~b#1| 2)))} is VALID [2022-02-21 03:37:00,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {810#(<= |ULTIMATE.start_gcd_test_~a#1| (+ (div |ULTIMATE.start_gcd_test_~b#1| 2) (* |ULTIMATE.start_gcd_test_~b#1| 3)))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {803#(<= |ULTIMATE.start_gcd_test_~a#1| (+ (div |ULTIMATE.start_gcd_test_~b#1| 2) (* |ULTIMATE.start_gcd_test_~b#1| 2)))} is VALID [2022-02-21 03:37:00,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {810#(<= |ULTIMATE.start_gcd_test_~a#1| (+ (div |ULTIMATE.start_gcd_test_~b#1| 2) (* |ULTIMATE.start_gcd_test_~b#1| 3)))} assume !!(0 != gcd_test_~b#1); {810#(<= |ULTIMATE.start_gcd_test_~a#1| (+ (div |ULTIMATE.start_gcd_test_~b#1| 2) (* |ULTIMATE.start_gcd_test_~b#1| 3)))} is VALID [2022-02-21 03:37:00,621 INFO L290 TraceCheckUtils]: 4: Hoare triple {810#(<= |ULTIMATE.start_gcd_test_~a#1| (+ (div |ULTIMATE.start_gcd_test_~b#1| 2) (* |ULTIMATE.start_gcd_test_~b#1| 3)))} assume !(0 == gcd_test_~a#1); {810#(<= |ULTIMATE.start_gcd_test_~a#1| (+ (div |ULTIMATE.start_gcd_test_~b#1| 2) (* |ULTIMATE.start_gcd_test_~b#1| 3)))} is VALID [2022-02-21 03:37:00,622 INFO L290 TraceCheckUtils]: 3: Hoare triple {810#(<= |ULTIMATE.start_gcd_test_~a#1| (+ (div |ULTIMATE.start_gcd_test_~b#1| 2) (* |ULTIMATE.start_gcd_test_~b#1| 3)))} assume !(gcd_test_~b#1 < 0); {810#(<= |ULTIMATE.start_gcd_test_~a#1| (+ (div |ULTIMATE.start_gcd_test_~b#1| 2) (* |ULTIMATE.start_gcd_test_~b#1| 3)))} is VALID [2022-02-21 03:37:00,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {810#(<= |ULTIMATE.start_gcd_test_~a#1| (+ (div |ULTIMATE.start_gcd_test_~b#1| 2) (* |ULTIMATE.start_gcd_test_~b#1| 3)))} assume !(gcd_test_~a#1 < 0); {810#(<= |ULTIMATE.start_gcd_test_~a#1| (+ (div |ULTIMATE.start_gcd_test_~b#1| 2) (* |ULTIMATE.start_gcd_test_~b#1| 3)))} is VALID [2022-02-21 03:37:00,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {726#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {810#(<= |ULTIMATE.start_gcd_test_~a#1| (+ (div |ULTIMATE.start_gcd_test_~b#1| 2) (* |ULTIMATE.start_gcd_test_~b#1| 3)))} is VALID [2022-02-21 03:37:00,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {726#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {726#true} is VALID [2022-02-21 03:37:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:00,623 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650786061] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:37:00,624 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:37:00,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-02-21 03:37:00,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626750466] [2022-02-21 03:37:00,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:37:00,625 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:00,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:00,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 5 times [2022-02-21 03:37:00,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:00,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214417] [2022-02-21 03:37:00,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:00,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:00,633 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:00,636 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:00,659 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:00,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-21 03:37:00,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-02-21 03:37:00,660 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. cyclomatic complexity: 4 Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:00,857 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-21 03:37:00,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:37:00,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 16 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:00,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:00,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2022-02-21 03:37:00,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:00,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 22 transitions. [2022-02-21 03:37:00,895 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-02-21 03:37:00,895 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-02-21 03:37:00,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2022-02-21 03:37:00,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:00,895 INFO L681 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-02-21 03:37:00,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2022-02-21 03:37:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-02-21 03:37:00,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:00,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states and 22 transitions. Second operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:00,897 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states and 22 transitions. Second operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:00,897 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:00,899 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:00,900 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-21 03:37:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-02-21 03:37:00,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:00,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:00,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 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) Second operand 20 states and 22 transitions. [2022-02-21 03:37:00,901 INFO L87 Difference]: Start difference. First operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 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) Second operand 20 states and 22 transitions. [2022-02-21 03:37:00,901 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:00,902 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-02-21 03:37:00,902 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-02-21 03:37:00,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:00,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:00,903 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:00,903 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.105263157894737) internal successors, (21), 18 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-02-21 03:37:00,904 INFO L704 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-02-21 03:37:00,904 INFO L587 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-02-21 03:37:00,904 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:37:00,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2022-02-21 03:37:00,905 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:00,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:00,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:00,906 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [6, 4, 2, 1, 1, 1, 1, 1] [2022-02-21 03:37:00,906 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2022-02-21 03:37:00,906 INFO L791 eck$LassoCheckResult]: Stem: 859#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); 860#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; 855#L22 assume !(gcd_test_~a#1 < 0); 856#L22-2 assume !(gcd_test_~b#1 < 0); 861#L23-1 assume !(0 == gcd_test_~a#1); 862#L30-2 assume !!(0 != gcd_test_~b#1); 869#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 868#L30-2 assume !!(0 != gcd_test_~b#1); 867#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 866#L30-2 assume !!(0 != gcd_test_~b#1); 865#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 863#L30-2 assume !!(0 != gcd_test_~b#1); 864#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 853#L30-2 assume !!(0 != gcd_test_~b#1); 854#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 858#L30-2 assume !!(0 != gcd_test_~b#1); 857#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 851#L30-2 [2022-02-21 03:37:00,906 INFO L793 eck$LassoCheckResult]: Loop: 851#L30-2 assume !!(0 != gcd_test_~b#1); 852#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 851#L30-2 [2022-02-21 03:37:00,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:00,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1437871456, now seen corresponding path program 4 times [2022-02-21 03:37:00,907 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:00,907 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80747279] [2022-02-21 03:37:00,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:00,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:01,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {987#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {987#true} is VALID [2022-02-21 03:37:01,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {987#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {989#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:37:01,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {989#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !(gcd_test_~a#1 < 0); {989#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:37:01,057 INFO L290 TraceCheckUtils]: 3: Hoare triple {989#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !(gcd_test_~b#1 < 0); {989#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:37:01,057 INFO L290 TraceCheckUtils]: 4: Hoare triple {989#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !(0 == gcd_test_~a#1); {989#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:37:01,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {989#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume !!(0 != gcd_test_~b#1); {989#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} is VALID [2022-02-21 03:37:01,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {989#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~a#1| 63))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {990#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63) (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)))} is VALID [2022-02-21 03:37:01,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {990#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63) (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)))} assume !!(0 != gcd_test_~b#1); {990#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63) (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)))} is VALID [2022-02-21 03:37:01,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {990#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 63) (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {991#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63) (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))))} is VALID [2022-02-21 03:37:01,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {991#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63) (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))))} assume !!(0 != gcd_test_~b#1); {991#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63) (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))))} is VALID [2022-02-21 03:37:01,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {991#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2)) 63) (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {992#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63) (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))))} is VALID [2022-02-21 03:37:01,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {992#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63) (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))))} assume !!(0 != gcd_test_~b#1); {992#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63) (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))))} is VALID [2022-02-21 03:37:01,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {992#(and (= (+ |ULTIMATE.start_gcd_test_~b#1| (- 18)) 0) (<= (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3)) 63) (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {993#(and (<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-21 03:37:01,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {993#(and (<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))} assume !!(0 != gcd_test_~b#1); {993#(and (<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))} is VALID [2022-02-21 03:37:01,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {993#(and (<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~a#1| |ULTIMATE.start_gcd_test_~b#1|))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {994#(and (<= |ULTIMATE.start_gcd_test_~b#1| 0) (< 0 (+ |ULTIMATE.start_gcd_test_~b#1| 1)))} is VALID [2022-02-21 03:37:01,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {994#(and (<= |ULTIMATE.start_gcd_test_~b#1| 0) (< 0 (+ |ULTIMATE.start_gcd_test_~b#1| 1)))} assume !!(0 != gcd_test_~b#1); {988#false} is VALID [2022-02-21 03:37:01,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {988#false} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {988#false} is VALID [2022-02-21 03:37:01,063 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:01,063 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:01,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80747279] [2022-02-21 03:37:01,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80747279] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:37:01,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066330400] [2022-02-21 03:37:01,064 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-21 03:37:01,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:37:01,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:01,065 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:37:01,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-02-21 03:37:01,093 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-21 03:37:01,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-21 03:37:01,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-21 03:37:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:01,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:01,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {987#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {987#true} is VALID [2022-02-21 03:37:01,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {987#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {1001#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:37:01,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {1001#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~a#1 < 0); {1001#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:37:01,866 INFO L290 TraceCheckUtils]: 3: Hoare triple {1001#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~b#1 < 0); {1001#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:37:01,866 INFO L290 TraceCheckUtils]: 4: Hoare triple {1001#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(0 == gcd_test_~a#1); {1001#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:37:01,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {1001#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {1001#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:37:01,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {1001#(and (<= 63 |ULTIMATE.start_gcd_test_~a#1|) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1017#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:37:01,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {1017#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {1017#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:37:01,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {1017#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1024#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:37:01,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {1024#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {1024#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:37:01,869 INFO L290 TraceCheckUtils]: 10: Hoare triple {1024#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 2))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1031#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:37:01,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {1031#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !!(0 != gcd_test_~b#1); {1031#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} is VALID [2022-02-21 03:37:01,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {1031#(and (<= 63 (+ |ULTIMATE.start_gcd_test_~a#1| (* |ULTIMATE.start_gcd_test_~b#1| 3))) (<= |ULTIMATE.start_gcd_test_~b#1| 18))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {1038#(and (<= (div (+ |ULTIMATE.start_gcd_test_~a#1| (- 63)) (- 3)) 18) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 18))} is VALID [2022-02-21 03:37:01,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {1038#(and (<= (div (+ |ULTIMATE.start_gcd_test_~a#1| (- 63)) (- 3)) 18) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 18))} assume !!(0 != gcd_test_~b#1); {1038#(and (<= (div (+ |ULTIMATE.start_gcd_test_~a#1| (- 63)) (- 3)) 18) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 18))} is VALID [2022-02-21 03:37:01,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {1038#(and (<= (div (+ |ULTIMATE.start_gcd_test_~a#1| (- 63)) (- 3)) 18) (<= (+ |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|) 18))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {994#(and (<= |ULTIMATE.start_gcd_test_~b#1| 0) (< 0 (+ |ULTIMATE.start_gcd_test_~b#1| 1)))} is VALID [2022-02-21 03:37:01,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {994#(and (<= |ULTIMATE.start_gcd_test_~b#1| 0) (< 0 (+ |ULTIMATE.start_gcd_test_~b#1| 1)))} assume !!(0 != gcd_test_~b#1); {988#false} is VALID [2022-02-21 03:37:01,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {988#false} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {988#false} is VALID [2022-02-21 03:37:01,872 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:01,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:37:02,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {988#false} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {988#false} is VALID [2022-02-21 03:37:02,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {994#(and (<= |ULTIMATE.start_gcd_test_~b#1| 0) (< 0 (+ |ULTIMATE.start_gcd_test_~b#1| 1)))} assume !!(0 != gcd_test_~b#1); {988#false} is VALID [2022-02-21 03:37:02,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {1057#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {994#(and (<= |ULTIMATE.start_gcd_test_~b#1| 0) (< 0 (+ |ULTIMATE.start_gcd_test_~b#1| 1)))} is VALID [2022-02-21 03:37:02,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {1057#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} assume !!(0 != gcd_test_~b#1); {1057#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-21 03:37:02,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {1064#(<= |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| 2))} assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; {1057#(<= |ULTIMATE.start_gcd_test_~b#1| |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-21 03:37:02,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {1064#(<= |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| 2))} assume !!(0 != gcd_test_~b#1); {1064#(<= |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| 2))} is VALID [2022-02-21 03:37:02,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {1071#(<= (+ |ULTIMATE.start_gcd_test_~b#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) |ULTIMATE.start_gcd_test_~a#1|)} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1064#(<= |ULTIMATE.start_gcd_test_~b#1| (* |ULTIMATE.start_gcd_test_~a#1| 2))} is VALID [2022-02-21 03:37:02,301 INFO L290 TraceCheckUtils]: 9: Hoare triple {1071#(<= (+ |ULTIMATE.start_gcd_test_~b#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) |ULTIMATE.start_gcd_test_~a#1|)} assume !!(0 != gcd_test_~b#1); {1071#(<= (+ |ULTIMATE.start_gcd_test_~b#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-21 03:37:02,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {1078#(<= (+ (* |ULTIMATE.start_gcd_test_~b#1| 2) (div (* |ULTIMATE.start_gcd_test_~b#1| (- 1)) (- 2))) |ULTIMATE.start_gcd_test_~a#1|)} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1071#(<= (+ |ULTIMATE.start_gcd_test_~b#1| (div (- |ULTIMATE.start_gcd_test_~b#1|) (- 2))) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-21 03:37:02,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {1078#(<= (+ (* |ULTIMATE.start_gcd_test_~b#1| 2) (div (* |ULTIMATE.start_gcd_test_~b#1| (- 1)) (- 2))) |ULTIMATE.start_gcd_test_~a#1|)} assume !!(0 != gcd_test_~b#1); {1078#(<= (+ (* |ULTIMATE.start_gcd_test_~b#1| 2) (div (* |ULTIMATE.start_gcd_test_~b#1| (- 1)) (- 2))) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-21 03:37:02,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {1085#(<= (+ (div (* |ULTIMATE.start_gcd_test_~b#1| (- 1)) (- 2)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) |ULTIMATE.start_gcd_test_~a#1|)} assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; {1078#(<= (+ (* |ULTIMATE.start_gcd_test_~b#1| 2) (div (* |ULTIMATE.start_gcd_test_~b#1| (- 1)) (- 2))) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-21 03:37:02,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {1085#(<= (+ (div (* |ULTIMATE.start_gcd_test_~b#1| (- 1)) (- 2)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) |ULTIMATE.start_gcd_test_~a#1|)} assume !!(0 != gcd_test_~b#1); {1085#(<= (+ (div (* |ULTIMATE.start_gcd_test_~b#1| (- 1)) (- 2)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-21 03:37:02,304 INFO L290 TraceCheckUtils]: 4: Hoare triple {1085#(<= (+ (div (* |ULTIMATE.start_gcd_test_~b#1| (- 1)) (- 2)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) |ULTIMATE.start_gcd_test_~a#1|)} assume !(0 == gcd_test_~a#1); {1085#(<= (+ (div (* |ULTIMATE.start_gcd_test_~b#1| (- 1)) (- 2)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-21 03:37:02,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {1085#(<= (+ (div (* |ULTIMATE.start_gcd_test_~b#1| (- 1)) (- 2)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) |ULTIMATE.start_gcd_test_~a#1|)} assume !(gcd_test_~b#1 < 0); {1085#(<= (+ (div (* |ULTIMATE.start_gcd_test_~b#1| (- 1)) (- 2)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-21 03:37:02,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {1085#(<= (+ (div (* |ULTIMATE.start_gcd_test_~b#1| (- 1)) (- 2)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) |ULTIMATE.start_gcd_test_~a#1|)} assume !(gcd_test_~a#1 < 0); {1085#(<= (+ (div (* |ULTIMATE.start_gcd_test_~b#1| (- 1)) (- 2)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-21 03:37:02,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {987#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret4#1, main_~x~0#1, main_~y~0#1, main_~g~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~g~0#1;main_~x~0#1 := 63;main_~y~0#1 := 18;assume { :begin_inline_gcd_test } true;gcd_test_#in~a#1, gcd_test_#in~b#1 := main_~x~0#1, main_~y~0#1;havoc gcd_test_#res#1;havoc gcd_test_~a#1, gcd_test_~b#1;gcd_test_~a#1 := gcd_test_#in~a#1;gcd_test_~b#1 := gcd_test_#in~b#1; {1085#(<= (+ (div (* |ULTIMATE.start_gcd_test_~b#1| (- 1)) (- 2)) (* |ULTIMATE.start_gcd_test_~b#1| 3)) |ULTIMATE.start_gcd_test_~a#1|)} is VALID [2022-02-21 03:37:02,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {987#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {987#true} is VALID [2022-02-21 03:37:02,306 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:02,306 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066330400] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:37:02,306 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:37:02,307 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-02-21 03:37:02,307 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762551742] [2022-02-21 03:37:02,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:37:02,307 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:02,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:02,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 6 times [2022-02-21 03:37:02,308 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:02,308 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408336958] [2022-02-21 03:37:02,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:02,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:02,312 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:02,314 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:02,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:02,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-21 03:37:02,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-02-21 03:37:02,331 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. cyclomatic complexity: 4 Second operand has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:02,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:02,599 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2022-02-21 03:37:02,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-21 03:37:02,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.5) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:02,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:02,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 15 transitions. [2022-02-21 03:37:02,648 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:02,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2022-02-21 03:37:02,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:37:02,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:37:02,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:37:02,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:02,649 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:02,649 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:02,649 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:02,649 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:37:02,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:37:02,649 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:02,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:37:02,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:37:02 BoogieIcfgContainer [2022-02-21 03:37:02,654 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:37:02,655 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:37:02,655 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:37:02,655 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:37:02,656 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:36:55" (3/4) ... [2022-02-21 03:37:02,657 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:37:02,657 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:37:02,658 INFO L158 Benchmark]: Toolchain (without parser) took 8006.81ms. Allocated memory was 90.2MB in the beginning and 159.4MB in the end (delta: 69.2MB). Free memory was 51.2MB in the beginning and 125.9MB in the end (delta: -74.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:37:02,658 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 90.2MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:37:02,659 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.33ms. Allocated memory is still 90.2MB. Free memory was 51.0MB in the beginning and 64.7MB in the end (delta: -13.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 03:37:02,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.27ms. Allocated memory is still 90.2MB. Free memory was 64.7MB in the beginning and 62.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:37:02,659 INFO L158 Benchmark]: Boogie Preprocessor took 60.96ms. Allocated memory is still 90.2MB. Free memory was 62.9MB in the beginning and 61.9MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 03:37:02,660 INFO L158 Benchmark]: RCFGBuilder took 249.72ms. Allocated memory is still 90.2MB. Free memory was 61.9MB in the beginning and 51.4MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 03:37:02,660 INFO L158 Benchmark]: BuchiAutomizer took 7337.34ms. Allocated memory was 90.2MB in the beginning and 159.4MB in the end (delta: 69.2MB). Free memory was 51.2MB in the beginning and 127.0MB in the end (delta: -75.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:37:02,660 INFO L158 Benchmark]: Witness Printer took 2.36ms. Allocated memory is still 159.4MB. Free memory was 127.0MB in the beginning and 125.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:37:02,666 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 90.2MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.33ms. Allocated memory is still 90.2MB. Free memory was 51.0MB in the beginning and 64.7MB in the end (delta: -13.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.27ms. Allocated memory is still 90.2MB. Free memory was 64.7MB in the beginning and 62.9MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.96ms. Allocated memory is still 90.2MB. Free memory was 62.9MB in the beginning and 61.9MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 249.72ms. Allocated memory is still 90.2MB. Free memory was 61.9MB in the beginning and 51.4MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 7337.34ms. Allocated memory was 90.2MB in the beginning and 159.4MB in the end (delta: 69.2MB). Free memory was 51.2MB in the beginning and 127.0MB in the end (delta: -75.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.36ms. Allocated memory is still 159.4MB. Free memory was 127.0MB in the beginning and 125.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 6 terminating modules (5 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function b and consists of 7 locations. 5 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.2s and 7 iterations. TraceHistogramMax:6. Analysis of lassos took 4.9s. Construction of modules took 0.3s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 5. Nontrivial modules had stage [0, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 280 IncrementalHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 33 mSDtfsCounter, 280 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN3 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital97 mio100 ax100 hnf100 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq202 hnf91 smp100 dnf127 smp100 tf100 neg95 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 144ms VariablesStem: 6 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:37:02,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:02,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:03,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:03,297 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 Result: TRUE