./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 791161d1 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-?-791161d [2022-07-23 14:35:17,759 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 14:35:17,761 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 14:35:17,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 14:35:17,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 14:35:17,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 14:35:17,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 14:35:17,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 14:35:17,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 14:35:17,794 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 14:35:17,795 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 14:35:17,797 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 14:35:17,797 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 14:35:17,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 14:35:17,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 14:35:17,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 14:35:17,813 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 14:35:17,814 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 14:35:17,816 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 14:35:17,820 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 14:35:17,822 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 14:35:17,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 14:35:17,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 14:35:17,825 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 14:35:17,826 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 14:35:17,831 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 14:35:17,831 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 14:35:17,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 14:35:17,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 14:35:17,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 14:35:17,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 14:35:17,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 14:35:17,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 14:35:17,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 14:35:17,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 14:35:17,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 14:35:17,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 14:35:17,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 14:35:17,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 14:35:17,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 14:35:17,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 14:35:17,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 14:35:17,841 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 14:35:17,862 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 14:35:17,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 14:35:17,863 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 14:35:17,863 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 14:35:17,864 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 14:35:17,864 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 14:35:17,864 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 14:35:17,865 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 14:35:17,865 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 14:35:17,865 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 14:35:17,865 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 14:35:17,865 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 14:35:17,866 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 14:35:17,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 14:35:17,866 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 14:35:17,866 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 14:35:17,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 14:35:17,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 14:35:17,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 14:35:17,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 14:35:17,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 14:35:17,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 14:35:17,868 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 14:35:17,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 14:35:17,868 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 14:35:17,868 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 14:35:17,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 14:35:17,869 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 14:35:17,869 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 14:35:17,869 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 14:35:17,869 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 14:35:17,870 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 14:35:17,871 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-23 14:35:18,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 14:35:18,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 14:35:18,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 14:35:18,121 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 14:35:18,121 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 14:35:18,122 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-23 14:35:18,169 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6423f5807/814b0f51b4654065891593f78ef2a40b/FLAGbd88c2acc [2022-07-23 14:35:18,518 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 14:35:18,519 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/gcd_4.c [2022-07-23 14:35:18,523 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6423f5807/814b0f51b4654065891593f78ef2a40b/FLAGbd88c2acc [2022-07-23 14:35:18,951 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6423f5807/814b0f51b4654065891593f78ef2a40b [2022-07-23 14:35:18,953 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 14:35:18,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 14:35:18,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 14:35:18,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 14:35:18,958 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 14:35:18,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:35:18" (1/1) ... [2022-07-23 14:35:18,959 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59049437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:18, skipping insertion in model container [2022-07-23 14:35:18,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:35:18" (1/1) ... [2022-07-23 14:35:18,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 14:35:18,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 14:35:19,058 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-23 14:35:19,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:35:19,086 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 14:35:19,093 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-23 14:35:19,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:35:19,103 INFO L208 MainTranslator]: Completed translation [2022-07-23 14:35:19,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:19 WrapperNode [2022-07-23 14:35:19,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 14:35:19,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 14:35:19,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 14:35:19,105 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 14:35:19,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:19" (1/1) ... [2022-07-23 14:35:19,113 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:19" (1/1) ... [2022-07-23 14:35:19,123 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 59 [2022-07-23 14:35:19,124 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 14:35:19,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 14:35:19,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 14:35:19,124 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 14:35:19,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:19" (1/1) ... [2022-07-23 14:35:19,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:19" (1/1) ... [2022-07-23 14:35:19,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:19" (1/1) ... [2022-07-23 14:35:19,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:19" (1/1) ... [2022-07-23 14:35:19,132 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:19" (1/1) ... [2022-07-23 14:35:19,134 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:19" (1/1) ... [2022-07-23 14:35:19,134 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:19" (1/1) ... [2022-07-23 14:35:19,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 14:35:19,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 14:35:19,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 14:35:19,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 14:35:19,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:19" (1/1) ... [2022-07-23 14:35:19,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:19,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:19,158 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-23 14:35:19,163 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-23 14:35:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 14:35:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 14:35:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 14:35:19,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 14:35:19,220 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 14:35:19,221 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 14:35:19,352 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 14:35:19,356 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 14:35:19,356 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-23 14:35:19,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:35:19 BoogieIcfgContainer [2022-07-23 14:35:19,357 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 14:35:19,358 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 14:35:19,358 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 14:35:19,360 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 14:35:19,361 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:35:19,361 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 02:35:18" (1/3) ... [2022-07-23 14:35:19,362 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4097899a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:35:19, skipping insertion in model container [2022-07-23 14:35:19,362 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:35:19,362 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:19" (2/3) ... [2022-07-23 14:35:19,362 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4097899a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:35:19, skipping insertion in model container [2022-07-23 14:35:19,363 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:35:19,363 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:35:19" (3/3) ... [2022-07-23 14:35:19,364 INFO L354 chiAutomizerObserver]: Analyzing ICFG gcd_4.c [2022-07-23 14:35:19,426 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 14:35:19,427 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 14:35:19,427 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 14:35:19,427 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 14:35:19,427 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 14:35:19,427 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 14:35:19,427 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 14:35:19,428 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 14:35:19,430 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-23 14:35:19,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:35:19,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:19,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:19,457 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-23 14:35:19,457 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:35:19,457 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 14:35:19,458 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-23 14:35:19,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:35:19,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:19,461 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:19,462 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2022-07-23 14:35:19,462 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:35:19,466 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-23 14:35:19,467 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-23 14:35:19,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:19,475 INFO L85 PathProgramCache]: Analyzing trace with hash 28695882, now seen corresponding path program 1 times [2022-07-23 14:35:19,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:19,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570977211] [2022-07-23 14:35:19,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:19,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:19,562 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:19,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:19,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:19,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 1 times [2022-07-23 14:35:19,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:19,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549484475] [2022-07-23 14:35:19,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:19,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:19,614 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:19,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:19,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:19,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1806939727, now seen corresponding path program 1 times [2022-07-23 14:35:19,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:19,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952923399] [2022-07-23 14:35:19,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:19,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:19,704 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-23 14:35:19,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:19,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952923399] [2022-07-23 14:35:19,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952923399] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:19,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:19,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 14:35:19,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901524563] [2022-07-23 14:35:19,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:19,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:19,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:35:19,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:35:19,760 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-23 14:35:19,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:19,806 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-07-23 14:35:19,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:35:19,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 24 transitions. [2022-07-23 14:35:19,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:35:19,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 9 states and 10 transitions. [2022-07-23 14:35:19,819 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2022-07-23 14:35:19,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2022-07-23 14:35:19,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2022-07-23 14:35:19,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:19,820 INFO L369 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-23 14:35:19,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2022-07-23 14:35:19,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-07-23 14:35:19,840 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-23 14:35:19,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2022-07-23 14:35:19,841 INFO L392 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-23 14:35:19,841 INFO L374 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2022-07-23 14:35:19,841 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 14:35:19,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2022-07-23 14:35:19,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:35:19,843 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:19,843 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:19,844 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:19,844 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:35:19,844 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-23 14:35:19,844 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-23 14:35:19,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:19,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1806939725, now seen corresponding path program 1 times [2022-07-23 14:35:19,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:19,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653915423] [2022-07-23 14:35:19,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:19,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:19,870 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:19,876 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:19,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:19,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 2 times [2022-07-23 14:35:19,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:19,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277003150] [2022-07-23 14:35:19,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:19,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:19,879 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:19,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:19,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:19,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1302289042, now seen corresponding path program 1 times [2022-07-23 14:35:19,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:19,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521151283] [2022-07-23 14:35:19,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:19,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:19,922 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-23 14:35:19,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:19,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521151283] [2022-07-23 14:35:19,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521151283] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:19,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243132782] [2022-07-23 14:35:19,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:19,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:19,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:19,926 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-23 14:35:19,927 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-23 14:35:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:19,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 14:35:19,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:20,040 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-23 14:35:20,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:35:20,086 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-23 14:35:20,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243132782] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:35:20,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:35:20,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2022-07-23 14:35:20,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763168532] [2022-07-23 14:35:20,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:35:20,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:20,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 14:35:20,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-23 14:35:20,117 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-23 14:35:20,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:20,134 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-07-23 14:35:20,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 14:35:20,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2022-07-23 14:35:20,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:35:20,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2022-07-23 14:35:20,135 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-23 14:35:20,135 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-07-23 14:35:20,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2022-07-23 14:35:20,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:20,136 INFO L369 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-07-23 14:35:20,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2022-07-23 14:35:20,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-07-23 14:35:20,136 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-23 14:35:20,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-07-23 14:35:20,137 INFO L392 hiAutomatonCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-07-23 14:35:20,137 INFO L374 stractBuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-07-23 14:35:20,137 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 14:35:20,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 14 transitions. [2022-07-23 14:35:20,137 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:35:20,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:20,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:20,138 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2022-07-23 14:35:20,138 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:35:20,138 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-23 14:35:20,138 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-23 14:35:20,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:20,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1664285203, now seen corresponding path program 2 times [2022-07-23 14:35:20,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:20,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224374548] [2022-07-23 14:35:20,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:20,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:20,146 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:20,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:20,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:20,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 3 times [2022-07-23 14:35:20,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:20,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139670822] [2022-07-23 14:35:20,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:20,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:20,161 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:20,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:20,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:20,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1650246872, now seen corresponding path program 2 times [2022-07-23 14:35:20,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:20,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113915672] [2022-07-23 14:35:20,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:20,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:20,185 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:20,203 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:20,456 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:35:20,457 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:35:20,457 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:35:20,457 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:35:20,458 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:35:20,458 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:20,458 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:35:20,458 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:35:20,458 INFO L133 ssoRankerPreferences]: Filename of dumped script: gcd_4.c_Iteration3_Lasso [2022-07-23 14:35:20,458 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:35:20,458 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:35:20,470 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-23 14:35:20,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:20,488 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-23 14:35:20,503 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-23 14:35:20,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:20,514 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-23 14:35:20,529 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-23 14:35:20,530 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-23 14:35:20,532 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-23 14:35:20,534 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-23 14:35:20,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:20,682 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:35:20,684 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:35:20,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:20,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:20,687 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-23 14:35:20,688 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-23 14:35:20,716 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-23 14:35:20,722 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:20,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:20,722 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:35:20,722 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:35:20,736 INFO L401 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2022-07-23 14:35:20,736 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2022-07-23 14:35:20,756 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 14:35:20,776 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-07-23 14:35:20,777 INFO L444 ModelExtractionUtils]: 22 out of 36 variables were initially zero. Simplification set additionally 7 variables to zero. [2022-07-23 14:35:20,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:20,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:20,803 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-23 14:35:20,814 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 14:35:20,823 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-23 14:35:20,830 INFO L438 nArgumentSynthesizer]: Removed 3 redundant supporting invariants from a total of 4. [2022-07-23 14:35:20,830 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 14:35:20,831 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-23 14:35:20,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-23 14:35:20,862 INFO L293 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2022-07-23 14:35:20,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:20,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 14:35:20,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:21,005 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 14:35:21,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:21,015 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-23 14:35:21,017 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-23 14:35:21,017 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-23 14:35:21,071 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-23 14:35:21,095 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-23 14:35:21,096 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-23 14:35:21,097 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-23 14:35:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2022-07-23 14:35:21,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-23 14:35:21,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:35:21,099 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 14:35:21,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:21,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:21,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 14:35:21,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:21,218 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 14:35:21,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:21,224 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-23 14:35:21,226 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-23 14:35:21,226 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-23 14:35:21,274 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-23 14:35:21,275 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-23 14:35:21,275 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-23 14:35:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2022-07-23 14:35:21,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-23 14:35:21,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:35:21,277 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-23 14:35:21,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:21,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 14:35:21,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:21,377 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 14:35:21,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:21,383 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-23 14:35:21,384 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-23 14:35:21,384 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-23 14:35:21,467 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-23 14:35:21,468 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-23 14:35:21,469 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-23 14:35:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2022-07-23 14:35:21,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 11 letters. Loop has 2 letters. [2022-07-23 14:35:21,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:35:21,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 13 letters. Loop has 2 letters. [2022-07-23 14:35:21,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:35:21,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 11 letters. Loop has 4 letters. [2022-07-23 14:35:21,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 14:35:21,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2022-07-23 14:35:21,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2022-07-23 14:35:21,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 23 transitions. [2022-07-23 14:35:21,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-07-23 14:35:21,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2022-07-23 14:35:21,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2022-07-23 14:35:21,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:35:21,479 INFO L369 hiAutomatonCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-07-23 14:35:21,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2022-07-23 14:35:21,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-07-23 14:35:21,481 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-23 14:35:21,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-07-23 14:35:21,481 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-23 14:35:21,481 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-23 14:35:21,481 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 14:35:21,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2022-07-23 14:35:21,482 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:35:21,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:21,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:21,483 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1, 1, 1] [2022-07-23 14:35:21,483 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:35:21,483 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-23 14:35:21,483 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-23 14:35:21,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:21,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1650246870, now seen corresponding path program 3 times [2022-07-23 14:35:21,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:21,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819199487] [2022-07-23 14:35:21,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:21,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:21,543 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-23 14:35:21,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:21,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819199487] [2022-07-23 14:35:21,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819199487] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:21,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:21,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 14:35:21,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325941406] [2022-07-23 14:35:21,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:21,545 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:35:21,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:21,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 4 times [2022-07-23 14:35:21,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:21,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13571865] [2022-07-23 14:35:21,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:21,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:21,556 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:21,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:21,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:21,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 14:35:21,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-07-23 14:35:21,575 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-23 14:35:21,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:21,594 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-07-23 14:35:21,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 14:35:21,595 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2022-07-23 14:35:21,596 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:35:21,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 18 states and 20 transitions. [2022-07-23 14:35:21,597 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-23 14:35:21,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-23 14:35:21,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 20 transitions. [2022-07-23 14:35:21,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:35:21,599 INFO L369 hiAutomatonCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-07-23 14:35:21,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 20 transitions. [2022-07-23 14:35:21,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-07-23 14:35:21,601 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-23 14:35:21,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-07-23 14:35:21,602 INFO L392 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-23 14:35:21,602 INFO L374 stractBuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-23 14:35:21,602 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 14:35:21,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2022-07-23 14:35:21,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:35:21,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:21,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:21,604 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:21,604 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:35:21,604 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-23 14:35:21,604 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-23 14:35:21,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:21,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1044312667, now seen corresponding path program 3 times [2022-07-23 14:35:21,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:21,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952239524] [2022-07-23 14:35:21,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:21,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:21,665 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-23 14:35:21,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:21,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952239524] [2022-07-23 14:35:21,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952239524] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:21,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602060591] [2022-07-23 14:35:21,666 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 14:35:21,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:21,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:21,667 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-23 14:35:21,668 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-23 14:35:21,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-23 14:35:21,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:35:21,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-23 14:35:21,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:21,761 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-23 14:35:21,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:35:21,844 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-23 14:35:21,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602060591] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:35:21,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:35:21,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-07-23 14:35:21,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479326133] [2022-07-23 14:35:21,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:35:21,846 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:35:21,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:21,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 5 times [2022-07-23 14:35:21,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:21,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60267089] [2022-07-23 14:35:21,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:21,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:21,850 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:21,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:21,854 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:21,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:21,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-23 14:35:21,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-07-23 14:35:21,872 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-23 14:35:21,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:21,946 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-07-23 14:35:21,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 14:35:21,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2022-07-23 14:35:21,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:35:21,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 22 transitions. [2022-07-23 14:35:21,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2022-07-23 14:35:21,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2022-07-23 14:35:21,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 22 transitions. [2022-07-23 14:35:21,947 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-23 14:35:21,947 INFO L369 hiAutomatonCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-07-23 14:35:21,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 22 transitions. [2022-07-23 14:35:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2022-07-23 14:35:21,948 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-23 14:35:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-07-23 14:35:21,949 INFO L392 hiAutomatonCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-23 14:35:21,949 INFO L374 stractBuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-07-23 14:35:21,949 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 14:35:21,949 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 21 transitions. [2022-07-23 14:35:21,949 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-07-23 14:35:21,949 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:21,949 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:21,949 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 4, 2, 1, 1, 1, 1, 1] [2022-07-23 14:35:21,949 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-23 14:35:21,950 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-23 14:35:21,952 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-23 14:35:21,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:21,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1437871456, now seen corresponding path program 4 times [2022-07-23 14:35:21,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:21,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843441980] [2022-07-23 14:35:21,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:21,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:21,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:22,032 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-23 14:35:22,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:22,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843441980] [2022-07-23 14:35:22,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843441980] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:22,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090397436] [2022-07-23 14:35:22,034 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 14:35:22,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:22,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:22,035 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-23 14:35:22,054 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-23 14:35:22,068 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 14:35:22,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:35:22,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 14:35:22,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:22,180 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-23 14:35:22,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:35:22,293 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-23 14:35:22,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090397436] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:35:22,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:35:22,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-07-23 14:35:22,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759572698] [2022-07-23 14:35:22,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:35:22,294 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:35:22,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:22,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1862, now seen corresponding path program 6 times [2022-07-23 14:35:22,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:22,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706969807] [2022-07-23 14:35:22,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:22,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:22,296 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:22,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:22,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:22,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-23 14:35:22,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-07-23 14:35:22,309 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-23 14:35:22,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:22,406 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2022-07-23 14:35:22,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 14:35:22,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 15 transitions. [2022-07-23 14:35:22,407 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 14:35:22,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2022-07-23 14:35:22,407 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-23 14:35:22,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-23 14:35:22,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-23 14:35:22,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:22,407 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:35:22,407 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:35:22,407 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:35:22,407 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-23 14:35:22,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-23 14:35:22,407 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 14:35:22,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-23 14:35:22,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.07 02:35:22 BoogieIcfgContainer [2022-07-23 14:35:22,413 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-23 14:35:22,413 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 14:35:22,413 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 14:35:22,413 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 14:35:22,414 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:35:19" (3/4) ... [2022-07-23 14:35:22,415 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 14:35:22,415 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 14:35:22,416 INFO L158 Benchmark]: Toolchain (without parser) took 3462.03ms. Allocated memory was 88.1MB in the beginning and 155.2MB in the end (delta: 67.1MB). Free memory was 53.4MB in the beginning and 100.9MB in the end (delta: -47.6MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2022-07-23 14:35:22,416 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 88.1MB. Free memory was 57.6MB in the beginning and 57.5MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:35:22,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 148.35ms. Allocated memory was 88.1MB in the beginning and 121.6MB in the end (delta: 33.6MB). Free memory was 53.2MB in the beginning and 97.3MB in the end (delta: -44.1MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-07-23 14:35:22,417 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.09ms. Allocated memory is still 121.6MB. Free memory was 97.3MB in the beginning and 96.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-23 14:35:22,417 INFO L158 Benchmark]: Boogie Preprocessor took 11.14ms. Allocated memory is still 121.6MB. Free memory was 95.6MB in the beginning and 94.8MB in the end (delta: 797.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:35:22,417 INFO L158 Benchmark]: RCFGBuilder took 221.67ms. Allocated memory is still 121.6MB. Free memory was 94.8MB in the beginning and 85.1MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-23 14:35:22,417 INFO L158 Benchmark]: BuchiAutomizer took 3054.57ms. Allocated memory was 121.6MB in the beginning and 155.2MB in the end (delta: 33.6MB). Free memory was 85.1MB in the beginning and 101.9MB in the end (delta: -16.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-23 14:35:22,417 INFO L158 Benchmark]: Witness Printer took 2.40ms. Allocated memory is still 155.2MB. Free memory was 101.9MB in the beginning and 100.9MB in the end (delta: 997.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:35:22,418 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.13ms. Allocated memory is still 88.1MB. Free memory was 57.6MB in the beginning and 57.5MB in the end (delta: 26.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 148.35ms. Allocated memory was 88.1MB in the beginning and 121.6MB in the end (delta: 33.6MB). Free memory was 53.2MB in the beginning and 97.3MB in the end (delta: -44.1MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.09ms. Allocated memory is still 121.6MB. Free memory was 97.3MB in the beginning and 96.0MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.14ms. Allocated memory is still 121.6MB. Free memory was 95.6MB in the beginning and 94.8MB in the end (delta: 797.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 221.67ms. Allocated memory is still 121.6MB. Free memory was 94.8MB in the beginning and 85.1MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 3054.57ms. Allocated memory was 121.6MB in the beginning and 155.2MB in the end (delta: 33.6MB). Free memory was 85.1MB in the beginning and 101.9MB in the end (delta: -16.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Witness Printer took 2.40ms. Allocated memory is still 155.2MB. Free memory was 101.9MB in the beginning and 100.9MB in the end (delta: 997.5kB). 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.0s and 7 iterations. TraceHistogramMax:6. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. 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.2s 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: 145ms 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-23 14:35:22,445 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-23 14:35:22,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-23 14:35:22,855 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-23 14:35:23,044 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