./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/gcd_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/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-?-3598765 [2022-07-22 01:45:47,769 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 01:45:47,772 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 01:45:47,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 01:45:47,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 01:45:47,816 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 01:45:47,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 01:45:47,823 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 01:45:47,825 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 01:45:47,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 01:45:47,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 01:45:47,835 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 01:45:47,836 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 01:45:47,838 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 01:45:47,839 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 01:45:47,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 01:45:47,842 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 01:45:47,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 01:45:47,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 01:45:47,851 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 01:45:47,853 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 01:45:47,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 01:45:47,856 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 01:45:47,857 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 01:45:47,858 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 01:45:47,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 01:45:47,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 01:45:47,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 01:45:47,867 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 01:45:47,867 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 01:45:47,868 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 01:45:47,868 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 01:45:47,870 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 01:45:47,871 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 01:45:47,872 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 01:45:47,873 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 01:45:47,873 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 01:45:47,874 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 01:45:47,874 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 01:45:47,874 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 01:45:47,875 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 01:45:47,877 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 01:45:47,885 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 01:45:47,914 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 01:45:47,914 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 01:45:47,915 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 01:45:47,915 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 01:45:47,917 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 01:45:47,917 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 01:45:47,917 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 01:45:47,917 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 01:45:47,917 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 01:45:47,918 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 01:45:47,919 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 01:45:47,919 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 01:45:47,919 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 01:45:47,927 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 01:45:47,928 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 01:45:47,928 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 01:45:47,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 01:45:47,928 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 01:45:47,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 01:45:47,929 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 01:45:47,929 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 01:45:47,929 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 01:45:47,929 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 01:45:47,930 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 01:45:47,930 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 01:45:47,930 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 01:45:47,930 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 01:45:47,930 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 01:45:47,931 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 01:45:47,931 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 01:45:47,931 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 01:45:47,934 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 01:45:47,934 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-07-22 01:45:48,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 01:45:48,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 01:45:48,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 01:45:48,317 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 01:45:48,318 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 01:45:48,319 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/gcd_4.c [2022-07-22 01:45:48,389 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/353ca60d3/eedf6b46205b42de9954dfb79c0a853f/FLAG0f12d3db0 [2022-07-22 01:45:48,792 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 01:45:48,792 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_4.c [2022-07-22 01:45:48,798 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/353ca60d3/eedf6b46205b42de9954dfb79c0a853f/FLAG0f12d3db0 [2022-07-22 01:45:49,224 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/353ca60d3/eedf6b46205b42de9954dfb79c0a853f [2022-07-22 01:45:49,226 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 01:45:49,227 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 01:45:49,229 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 01:45:49,229 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 01:45:49,233 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 01:45:49,234 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:45:49" (1/1) ... [2022-07-22 01:45:49,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb95ede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:49, skipping insertion in model container [2022-07-22 01:45:49,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:45:49" (1/1) ... [2022-07-22 01:45:49,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 01:45:49,255 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 01:45:49,357 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-07-22 01:45:49,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:45:49,378 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 01:45:49,390 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-07-22 01:45:49,405 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 01:45:49,464 INFO L208 MainTranslator]: Completed translation [2022-07-22 01:45:49,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:49 WrapperNode [2022-07-22 01:45:49,466 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 01:45:49,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 01:45:49,467 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 01:45:49,467 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 01:45:49,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:49" (1/1) ... [2022-07-22 01:45:49,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:49" (1/1) ... [2022-07-22 01:45:49,501 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 59 [2022-07-22 01:45:49,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 01:45:49,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 01:45:49,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 01:45:49,502 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 01:45:49,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:49" (1/1) ... [2022-07-22 01:45:49,510 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:49" (1/1) ... [2022-07-22 01:45:49,520 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:49" (1/1) ... [2022-07-22 01:45:49,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:49" (1/1) ... [2022-07-22 01:45:49,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:49" (1/1) ... [2022-07-22 01:45:49,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:49" (1/1) ... [2022-07-22 01:45:49,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:49" (1/1) ... [2022-07-22 01:45:49,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 01:45:49,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 01:45:49,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 01:45:49,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 01:45:49,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:49" (1/1) ... [2022-07-22 01:45:49,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:49,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:49,560 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:49,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 01:45:49,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 01:45:49,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 01:45:49,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 01:45:49,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 01:45:49,637 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 01:45:49,639 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 01:45:49,789 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 01:45:49,795 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 01:45:49,796 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 01:45:49,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:45:49 BoogieIcfgContainer [2022-07-22 01:45:49,798 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 01:45:49,799 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 01:45:49,799 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 01:45:49,802 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 01:45:49,802 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:45:49,803 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 01:45:49" (1/3) ... [2022-07-22 01:45:49,804 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@330e0f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:45:49, skipping insertion in model container [2022-07-22 01:45:49,804 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:45:49,804 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:45:49" (2/3) ... [2022-07-22 01:45:49,805 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@330e0f6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 01:45:49, skipping insertion in model container [2022-07-22 01:45:49,805 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 01:45:49,805 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:45:49" (3/3) ... [2022-07-22 01:45:49,807 INFO L354 chiAutomizerObserver]: Analyzing ICFG gcd_4.c [2022-07-22 01:45:49,875 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 01:45:49,876 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 01:45:49,876 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 01:45:49,876 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 01:45:49,876 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 01:45:49,876 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 01:45:49,876 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 01:45:49,877 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 01:45:49,880 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-07-22 01:45:49,894 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 01:45:49,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:49,895 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:49,900 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 01:45:49,900 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:45:49,900 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 01:45:49,901 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-07-22 01:45:49,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 01:45:49,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:49,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:49,904 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-22 01:45:49,904 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:45:49,910 INFO L752 eck$LassoCheckResult]: Stem: 6#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); 11#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; 18#L22true assume !(gcd_test_~a#1 < 0); 12#L22-2true assume !(gcd_test_~b#1 < 0); 13#L23-1true assume !(0 == gcd_test_~a#1); 4#L30-2true [2022-07-22 01:45:49,911 INFO L754 eck$LassoCheckResult]: Loop: 4#L30-2true assume !!(0 != gcd_test_~b#1); 7#L30true assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 4#L30-2true [2022-07-22 01:45:49,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:49,916 INFO L85 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2022-07-22 01:45:49,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:49,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331229471] [2022-07-22 01:45:49,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:49,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:50,021 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:50,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:50,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:50,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 1 times [2022-07-22 01:45:50,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:50,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179304611] [2022-07-22 01:45:50,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:50,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:50,097 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:50,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:50,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:50,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1806939727, now seen corresponding path program 1 times [2022-07-22 01:45:50,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:50,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906357213] [2022-07-22 01:45:50,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:50,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:50,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:50,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:50,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:50,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906357213] [2022-07-22 01:45:50,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906357213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:50,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:45:50,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 01:45:50,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781394098] [2022-07-22 01:45:50,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:50,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:50,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 01:45:50,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 01:45:50,333 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-07-22 01:45:50,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:50,375 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-07-22 01:45:50,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 01:45:50,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2022-07-22 01:45:50,388 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 01:45:50,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 9 states and 10 transitions. [2022-07-22 01:45:50,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-22 01:45:50,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-22 01:45:50,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2022-07-22 01:45:50,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:50,394 INFO L369 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-22 01:45:50,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2022-07-22 01:45:50,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-07-22 01:45:50,413 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-07-22 01:45:50,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-07-22 01:45:50,414 INFO L392 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-22 01:45:50,414 INFO L374 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-22 01:45:50,415 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 01:45:50,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2022-07-22 01:45:50,415 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 01:45:50,416 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:50,416 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:50,416 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:50,416 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:45:50,417 INFO L752 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-07-22 01:45:50,417 INFO L754 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-07-22 01:45:50,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:50,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1806939725, now seen corresponding path program 1 times [2022-07-22 01:45:50,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:50,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765784030] [2022-07-22 01:45:50,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:50,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:50,430 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:50,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:50,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 2 times [2022-07-22 01:45:50,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:50,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184273374] [2022-07-22 01:45:50,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:50,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:50,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:50,447 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:50,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:50,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:50,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1302289042, now seen corresponding path program 1 times [2022-07-22 01:45:50,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:50,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399321161] [2022-07-22 01:45:50,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:50,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:50,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:50,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:50,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399321161] [2022-07-22 01:45:50,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399321161] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:45:50,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37921932] [2022-07-22 01:45:50,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:50,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:45:50,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:50,503 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-07-22 01:45:50,533 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-07-22 01:45:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:50,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-22 01:45:50,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:50,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:50,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:45:50,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:50,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37921932] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:45:50,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:45:50,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-07-22 01:45:50,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129854457] [2022-07-22 01:45:50,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:45:50,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:50,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 01:45:50,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-22 01:45:50,712 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-07-22 01:45:50,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:50,734 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-07-22 01:45:50,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 01:45:50,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2022-07-22 01:45:50,748 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 01:45:50,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2022-07-22 01:45:50,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-22 01:45:50,749 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-22 01:45:50,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2022-07-22 01:45:50,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:50,749 INFO L369 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-07-22 01:45:50,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2022-07-22 01:45:50,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-22 01:45:50,751 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-07-22 01:45:50,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-07-22 01:45:50,751 INFO L392 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-07-22 01:45:50,752 INFO L374 stractBuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-07-22 01:45:50,752 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 01:45:50,752 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2022-07-22 01:45:50,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 01:45:50,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:50,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:50,753 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2022-07-22 01:45:50,753 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:45:50,754 INFO L752 eck$LassoCheckResult]: Stem: 143#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); 144#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; 140#L22 assume !(gcd_test_~a#1 < 0); 141#L22-2 assume !(gcd_test_~b#1 < 0); 145#L23-1 assume !(0 == gcd_test_~a#1); 146#L30-2 assume !!(0 != gcd_test_~b#1); 142#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 138#L30-2 assume !!(0 != gcd_test_~b#1); 139#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 150#L30-2 assume !!(0 != gcd_test_~b#1); 149#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 148#L30-2 [2022-07-22 01:45:50,754 INFO L754 eck$LassoCheckResult]: Loop: 148#L30-2 assume !!(0 != gcd_test_~b#1); 147#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 148#L30-2 [2022-07-22 01:45:50,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:50,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1664285203, now seen corresponding path program 2 times [2022-07-22 01:45:50,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:50,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585282434] [2022-07-22 01:45:50,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:50,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:50,779 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:50,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:50,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:50,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 3 times [2022-07-22 01:45:50,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:50,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917076942] [2022-07-22 01:45:50,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:50,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:50,811 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:50,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:50,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:50,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1650246872, now seen corresponding path program 2 times [2022-07-22 01:45:50,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:50,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697394818] [2022-07-22 01:45:50,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:50,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:50,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:50,839 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:50,868 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:51,161 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 01:45:51,162 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 01:45:51,162 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 01:45:51,162 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 01:45:51,162 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 01:45:51,162 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:51,162 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 01:45:51,163 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 01:45:51,163 INFO L133 ssoRankerPreferences]: Filename of dumped script: gcd_4.c_Iteration3_Lasso [2022-07-22 01:45:51,163 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 01:45:51,163 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 01:45:51,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:51,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:51,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:51,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:51,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:51,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:51,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:51,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:51,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:51,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:51,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 01:45:51,460 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 01:45:51,463 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 01:45:51,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:51,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:51,467 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:51,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 01:45:51,488 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 01:45:51,488 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 01:45:51,488 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-22 01:45:51,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 01:45:51,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 01:45:51,518 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-22 01:45:51,519 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-22 01:45:51,559 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 01:45:51,587 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-22 01:45:51,587 INFO L444 ModelExtractionUtils]: 22 out of 36 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-07-22 01:45:51,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 01:45:51,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:51,600 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 01:45:51,627 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 01:45:51,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 01:45:51,660 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2022-07-22 01:45:51,661 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 01:45:51,661 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_gcd_test_~b#1, ULTIMATE.start_gcd_test_~a#1) = 1*ULTIMATE.start_gcd_test_~b#1 - 1*ULTIMATE.start_gcd_test_~a#1 + 1 Supporting invariants [1*ULTIMATE.start_gcd_test_~a#1 - 2 >= 0] [2022-07-22 01:45:51,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:51,714 INFO L293 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2022-07-22 01:45:51,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:51,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:51,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 01:45:51,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:51,907 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 01:45:51,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:51,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:51,922 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-07-22 01:45:51,922 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-07-22 01:45:51,986 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-07-22 01:45:51,987 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-07-22 01:45:51,988 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-07-22 01:45:51,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2022-07-22 01:45:51,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-22 01:45:51,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:45:51,991 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 01:45:52,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:52,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 01:45:52,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:52,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:52,149 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 01:45:52,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:52,158 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-07-22 01:45:52,159 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-07-22 01:45:52,207 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-07-22 01:45:52,208 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-07-22 01:45:52,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-07-22 01:45:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2022-07-22 01:45:52,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-22 01:45:52,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:45:52,209 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-22 01:45:52,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:52,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:52,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 01:45:52,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:52,327 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-22 01:45:52,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:52,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:52,337 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-07-22 01:45:52,338 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-07-22 01:45:52,439 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-07-22 01:45:52,440 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-07-22 01:45:52,441 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-07-22 01:45:52,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-07-22 01:45:52,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-22 01:45:52,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:45:52,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 13 letters. Loop has 2 letters. [2022-07-22 01:45:52,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:45:52,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 11 letters. Loop has 4 letters. [2022-07-22 01:45:52,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 01:45:52,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2022-07-22 01:45:52,444 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-22 01:45:52,445 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 23 transitions. [2022-07-22 01:45:52,445 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-22 01:45:52,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-22 01:45:52,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2022-07-22 01:45:52,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:45:52,446 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-22 01:45:52,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2022-07-22 01:45:52,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-07-22 01:45:52,447 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-07-22 01:45:52,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-07-22 01:45:52,448 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-22 01:45:52,448 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-22 01:45:52,448 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 01:45:52,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2022-07-22 01:45:52,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 01:45:52,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:52,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:52,450 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2022-07-22 01:45:52,450 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:45:52,450 INFO L752 eck$LassoCheckResult]: Stem: 402#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); 403#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; 400#L22 assume !(gcd_test_~a#1 < 0); 401#L22-2 assume !(gcd_test_~b#1 < 0); 404#L23-1 assume !(0 == gcd_test_~a#1); 405#L30-2 assume !!(0 != gcd_test_~b#1); 411#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 410#L30-2 assume !!(0 != gcd_test_~b#1); 409#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 408#L30-2 assume !!(0 != gcd_test_~b#1); 407#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 406#L30-2 assume !!(0 != gcd_test_~b#1); 399#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 395#L30-2 [2022-07-22 01:45:52,450 INFO L754 eck$LassoCheckResult]: Loop: 395#L30-2 assume !!(0 != gcd_test_~b#1); 396#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 395#L30-2 [2022-07-22 01:45:52,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:52,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1650246870, now seen corresponding path program 3 times [2022-07-22 01:45:52,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:52,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424523866] [2022-07-22 01:45:52,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:52,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:52,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:52,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424523866] [2022-07-22 01:45:52,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424523866] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 01:45:52,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 01:45:52,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 01:45:52,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793473795] [2022-07-22 01:45:52,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 01:45:52,516 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:45:52,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:52,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 4 times [2022-07-22 01:45:52,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:52,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99520182] [2022-07-22 01:45:52,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:52,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:52,521 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:52,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:52,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:52,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:52,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-22 01:45:52,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-22 01:45:52,541 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-07-22 01:45:52,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:52,565 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-07-22 01:45:52,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 01:45:52,566 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2022-07-22 01:45:52,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 01:45:52,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 20 transitions. [2022-07-22 01:45:52,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-22 01:45:52,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-22 01:45:52,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2022-07-22 01:45:52,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:45:52,569 INFO L369 hiAutomatonCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-07-22 01:45:52,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2022-07-22 01:45:52,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-07-22 01:45:52,570 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-07-22 01:45:52,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-07-22 01:45:52,571 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-22 01:45:52,571 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-22 01:45:52,571 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 01:45:52,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2022-07-22 01:45:52,571 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 01:45:52,572 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:52,572 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:52,572 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1, 1] [2022-07-22 01:45:52,572 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:45:52,573 INFO L752 eck$LassoCheckResult]: Stem: 447#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); 448#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; 440#L22 assume !(gcd_test_~a#1 < 0); 441#L22-2 assume !(gcd_test_~b#1 < 0); 449#L23-1 assume !(0 == gcd_test_~a#1); 450#L30-2 assume !!(0 != gcd_test_~b#1); 456#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 455#L30-2 assume !!(0 != gcd_test_~b#1); 454#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 453#L30-2 assume !!(0 != gcd_test_~b#1); 452#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 451#L30-2 assume !!(0 != gcd_test_~b#1); 445#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 444#L30-2 assume !!(0 != gcd_test_~b#1); 446#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 442#L30-2 [2022-07-22 01:45:52,573 INFO L754 eck$LassoCheckResult]: Loop: 442#L30-2 assume !!(0 != gcd_test_~b#1); 443#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 442#L30-2 [2022-07-22 01:45:52,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:52,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1044312667, now seen corresponding path program 3 times [2022-07-22 01:45:52,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:52,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475708559] [2022-07-22 01:45:52,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:52,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:52,642 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:52,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:52,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475708559] [2022-07-22 01:45:52,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475708559] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:45:52,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423546194] [2022-07-22 01:45:52,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-22 01:45:52,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:45:52,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:52,648 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:45:52,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-22 01:45:52,685 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-22 01:45:52,686 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:45:52,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-22 01:45:52,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:52,776 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:52,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:45:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:52,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423546194] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:45:52,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:45:52,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-07-22 01:45:52,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079200895] [2022-07-22 01:45:52,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:45:52,893 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:45:52,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:52,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 5 times [2022-07-22 01:45:52,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:52,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747412251] [2022-07-22 01:45:52,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:52,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:52,899 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:52,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:52,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:52,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-22 01:45:52,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-07-22 01:45:52,925 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-07-22 01:45:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:53,017 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-07-22 01:45:53,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 01:45:53,018 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2022-07-22 01:45:53,019 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 01:45:53,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 22 transitions. [2022-07-22 01:45:53,020 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-22 01:45:53,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-22 01:45:53,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2022-07-22 01:45:53,020 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 01:45:53,020 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-07-22 01:45:53,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2022-07-22 01:45:53,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-07-22 01:45:53,021 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-07-22 01:45:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-07-22 01:45:53,021 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-22 01:45:53,022 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-22 01:45:53,022 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-22 01:45:53,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2022-07-22 01:45:53,022 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-22 01:45:53,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 01:45:53,022 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 01:45:53,023 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 2, 1, 1, 1, 1, 1] [2022-07-22 01:45:53,023 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-22 01:45:53,025 INFO L752 eck$LassoCheckResult]: Stem: 591#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); 592#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; 587#L22 assume !(gcd_test_~a#1 < 0); 588#L22-2 assume !(gcd_test_~b#1 < 0); 593#L23-1 assume !(0 == gcd_test_~a#1); 594#L30-2 assume !!(0 != gcd_test_~b#1); 601#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 600#L30-2 assume !!(0 != gcd_test_~b#1); 599#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 598#L30-2 assume !!(0 != gcd_test_~b#1); 597#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 595#L30-2 assume !!(0 != gcd_test_~b#1); 596#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 585#L30-2 assume !!(0 != gcd_test_~b#1); 586#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 590#L30-2 assume !!(0 != gcd_test_~b#1); 589#L30 assume gcd_test_~a#1 > gcd_test_~b#1;gcd_test_~a#1 := gcd_test_~a#1 - gcd_test_~b#1; 583#L30-2 [2022-07-22 01:45:53,025 INFO L754 eck$LassoCheckResult]: Loop: 583#L30-2 assume !!(0 != gcd_test_~b#1); 584#L30 assume !(gcd_test_~a#1 > gcd_test_~b#1);gcd_test_~b#1 := gcd_test_~b#1 - gcd_test_~a#1; 583#L30-2 [2022-07-22 01:45:53,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:53,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1437871456, now seen corresponding path program 4 times [2022-07-22 01:45:53,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:53,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721313039] [2022-07-22 01:45:53,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:53,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:53,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 01:45:53,162 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:53,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 01:45:53,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721313039] [2022-07-22 01:45:53,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721313039] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-22 01:45:53,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115205470] [2022-07-22 01:45:53,164 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-22 01:45:53,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-22 01:45:53,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 01:45:53,166 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-22 01:45:53,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-22 01:45:53,197 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-22 01:45:53,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-22 01:45:53,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-22 01:45:53,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 01:45:53,358 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:53,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 01:45:53,502 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 01:45:53,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115205470] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 01:45:53,503 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-22 01:45:53,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-07-22 01:45:53,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213240535] [2022-07-22 01:45:53,504 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-22 01:45:53,504 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 01:45:53,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 01:45:53,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 6 times [2022-07-22 01:45:53,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 01:45:53,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305676879] [2022-07-22 01:45:53,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 01:45:53,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 01:45:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:53,509 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 01:45:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 01:45:53,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 01:45:53,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 01:45:53,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-22 01:45:53,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-07-22 01:45:53,528 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-07-22 01:45:53,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 01:45:53,650 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2022-07-22 01:45:53,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 01:45:53,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 15 transitions. [2022-07-22 01:45:53,652 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 01:45:53,652 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2022-07-22 01:45:53,652 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-22 01:45:53,652 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-22 01:45:53,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-22 01:45:53,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 01:45:53,652 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 01:45:53,653 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 01:45:53,653 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 01:45:53,653 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-22 01:45:53,653 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-22 01:45:53,653 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 01:45:53,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-22 01:45:53,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 01:45:53 BoogieIcfgContainer [2022-07-22 01:45:53,660 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 01:45:53,660 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 01:45:53,661 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 01:45:53,661 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 01:45:53,661 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:45:49" (3/4) ... [2022-07-22 01:45:53,664 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 01:45:53,664 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 01:45:53,665 INFO L158 Benchmark]: Toolchain (without parser) took 4437.50ms. Allocated memory was 56.6MB in the beginning and 88.1MB in the end (delta: 31.5MB). Free memory was 35.3MB in the beginning and 44.1MB in the end (delta: -8.8MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2022-07-22 01:45:53,665 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 56.6MB. Free memory is still 38.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:45:53,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.87ms. Allocated memory is still 56.6MB. Free memory was 35.1MB in the beginning and 40.6MB in the end (delta: -5.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 01:45:53,666 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.66ms. Allocated memory is still 56.6MB. Free memory was 40.6MB in the beginning and 39.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:45:53,666 INFO L158 Benchmark]: Boogie Preprocessor took 28.10ms. Allocated memory is still 56.6MB. Free memory was 39.0MB in the beginning and 38.1MB in the end (delta: 934.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:45:53,666 INFO L158 Benchmark]: RCFGBuilder took 267.23ms. Allocated memory is still 56.6MB. Free memory was 37.9MB in the beginning and 28.7MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 01:45:53,667 INFO L158 Benchmark]: BuchiAutomizer took 3861.31ms. Allocated memory was 56.6MB in the beginning and 88.1MB in the end (delta: 31.5MB). Free memory was 28.7MB in the beginning and 44.1MB in the end (delta: -15.4MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. [2022-07-22 01:45:53,667 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 88.1MB. Free memory is still 44.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 01:45:53,669 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 56.6MB. Free memory is still 38.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 236.87ms. Allocated memory is still 56.6MB. Free memory was 35.1MB in the beginning and 40.6MB in the end (delta: -5.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.66ms. Allocated memory is still 56.6MB. Free memory was 40.6MB in the beginning and 39.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.10ms. Allocated memory is still 56.6MB. Free memory was 39.0MB in the beginning and 38.1MB in the end (delta: 934.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 267.23ms. Allocated memory is still 56.6MB. Free memory was 37.9MB in the beginning and 28.7MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 3861.31ms. Allocated memory was 56.6MB in the beginning and 88.1MB in the end (delta: 31.5MB). Free memory was 28.7MB in the beginning and 44.1MB in the end (delta: -15.4MB). Peak memory consumption was 18.8MB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 88.1MB. Free memory is still 44.1MB. There was no memory consumed. 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 + -1 * a + 1 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 3.8s and 7 iterations. TraceHistogramMax:6. Analysis of lassos took 2.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 4 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 66 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 66 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 45 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 290 IncrementalHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 33 mSDtfsCounter, 290 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: 196ms VariablesStem: 6 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-22 01:45:53,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:53,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-22 01:45:54,109 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-07-22 01:45:54,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE