./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/byte_add_2-2.i -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 de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 15:07:31,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 15:07:31,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 15:07:31,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 15:07:31,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 15:07:31,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 15:07:31,791 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 15:07:31,795 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 15:07:31,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 15:07:31,800 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 15:07:31,800 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 15:07:31,802 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 15:07:31,803 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 15:07:31,816 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 15:07:31,817 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 15:07:31,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 15:07:31,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 15:07:31,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 15:07:31,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 15:07:31,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 15:07:31,834 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 15:07:31,835 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 15:07:31,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 15:07:31,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 15:07:31,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 15:07:31,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 15:07:31,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 15:07:31,843 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 15:07:31,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 15:07:31,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 15:07:31,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 15:07:31,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 15:07:31,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 15:07:31,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 15:07:31,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 15:07:31,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 15:07:31,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 15:07:31,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 15:07:31,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 15:07:31,850 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 15:07:31,850 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 15:07:31,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 15:07:31,852 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 15:07:31,896 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 15:07:31,896 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 15:07:31,897 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 15:07:31,897 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 15:07:31,898 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 15:07:31,898 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 15:07:31,898 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 15:07:31,899 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 15:07:31,899 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 15:07:31,899 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 15:07:31,900 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 15:07:31,900 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 15:07:31,900 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 15:07:31,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 15:07:31,900 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 15:07:31,900 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 15:07:31,900 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 15:07:31,901 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 15:07:31,901 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 15:07:31,901 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 15:07:31,901 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 15:07:31,901 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 15:07:31,901 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 15:07:31,901 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 15:07:31,902 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 15:07:31,902 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 15:07:31,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 15:07:31,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 15:07:31,902 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 15:07:31,902 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 15:07:31,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 15:07:31,903 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 15:07:31,904 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 -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2022-07-14 15:07:32,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 15:07:32,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 15:07:32,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 15:07:32,145 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 15:07:32,146 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 15:07:32,147 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2022-07-14 15:07:32,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d5ddba3/005c9e9c746145ccbd5dfde560ad6b1f/FLAGc589f5eaf [2022-07-14 15:07:32,584 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 15:07:32,584 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2022-07-14 15:07:32,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d5ddba3/005c9e9c746145ccbd5dfde560ad6b1f/FLAGc589f5eaf [2022-07-14 15:07:32,604 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67d5ddba3/005c9e9c746145ccbd5dfde560ad6b1f [2022-07-14 15:07:32,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 15:07:32,607 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 15:07:32,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 15:07:32,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 15:07:32,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 15:07:32,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:07:32" (1/1) ... [2022-07-14 15:07:32,611 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53d442ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:32, skipping insertion in model container [2022-07-14 15:07:32,611 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 03:07:32" (1/1) ... [2022-07-14 15:07:32,616 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 15:07:32,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 15:07:32,780 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/byte_add_2-2.i[1168,1181] [2022-07-14 15:07:32,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:07:32,832 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 15:07:32,844 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/byte_add_2-2.i[1168,1181] [2022-07-14 15:07:32,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 15:07:32,881 INFO L208 MainTranslator]: Completed translation [2022-07-14 15:07:32,881 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:32 WrapperNode [2022-07-14 15:07:32,881 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 15:07:32,882 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 15:07:32,882 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 15:07:32,882 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 15:07:32,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:32" (1/1) ... [2022-07-14 15:07:32,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:32" (1/1) ... [2022-07-14 15:07:32,940 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 145 [2022-07-14 15:07:32,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 15:07:32,941 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 15:07:32,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 15:07:32,942 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 15:07:32,947 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:32" (1/1) ... [2022-07-14 15:07:32,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:32" (1/1) ... [2022-07-14 15:07:32,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:32" (1/1) ... [2022-07-14 15:07:32,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:32" (1/1) ... [2022-07-14 15:07:32,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:32" (1/1) ... [2022-07-14 15:07:32,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:32" (1/1) ... [2022-07-14 15:07:33,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:32" (1/1) ... [2022-07-14 15:07:33,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 15:07:33,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 15:07:33,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 15:07:33,017 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 15:07:33,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:32" (1/1) ... [2022-07-14 15:07:33,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:33,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:33,037 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:33,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-14 15:07:33,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 15:07:33,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 15:07:33,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 15:07:33,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 15:07:33,117 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 15:07:33,118 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 15:07:33,524 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 15:07:33,528 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 15:07:33,535 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 15:07:33,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:07:33 BoogieIcfgContainer [2022-07-14 15:07:33,536 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 15:07:33,537 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 15:07:33,537 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 15:07:33,539 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 15:07:33,540 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:07:33,541 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 03:07:32" (1/3) ... [2022-07-14 15:07:33,541 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1321e71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:07:33, skipping insertion in model container [2022-07-14 15:07:33,541 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:07:33,542 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 03:07:32" (2/3) ... [2022-07-14 15:07:33,542 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1321e71f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 03:07:33, skipping insertion in model container [2022-07-14 15:07:33,542 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 15:07:33,542 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:07:33" (3/3) ... [2022-07-14 15:07:33,543 INFO L354 chiAutomizerObserver]: Analyzing ICFG byte_add_2-2.i [2022-07-14 15:07:33,583 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 15:07:33,583 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 15:07:33,583 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 15:07:33,583 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 15:07:33,584 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 15:07:33,584 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 15:07:33,584 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 15:07:33,584 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 15:07:33,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:33,604 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-07-14 15:07:33,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:33,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:33,609 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-14 15:07:33,609 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:33,609 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 15:07:33,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 50 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:33,615 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-07-14 15:07:33,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:33,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:33,616 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-14 15:07:33,616 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:33,621 INFO L752 eck$LassoCheckResult]: Stem: 41#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(15, 2); 34#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 29#L59true assume !(0 == mp_add_~a3~0#1 % 256); 11#L59-1true mp_add_~nb~0#1 := 4; 12#L69true assume !(0 == mp_add_~b3~0#1 % 256); 48#L69-1true mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 14#L80-2true [2022-07-14 15:07:33,622 INFO L754 eck$LassoCheckResult]: Loop: 14#L80-2true assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 21#L83true assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 50#L83-1true assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6#L89true assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 28#L95-1true assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 38#L99-1true assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 8#L100-1true assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 15#L101-1true assume !(3 == mp_add_~i~0#1 % 256); 16#L102-1true mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14#L80-2true [2022-07-14 15:07:33,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:33,626 INFO L85 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2022-07-14 15:07:33,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:33,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622640314] [2022-07-14 15:07:33,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:33,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:33,725 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:33,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:33,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:33,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1026291578, now seen corresponding path program 1 times [2022-07-14 15:07:33,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:33,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361124334] [2022-07-14 15:07:33,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:33,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:33,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:33,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:33,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:33,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361124334] [2022-07-14 15:07:33,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361124334] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:33,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:33,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:07:33,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841543480] [2022-07-14 15:07:33,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:33,816 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:33,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:33,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:07:33,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:07:33,860 INFO L87 Difference]: Start difference. First operand has 50 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 0 states have call successors, (0), 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, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:34,044 INFO L93 Difference]: Finished difference Result 78 states and 114 transitions. [2022-07-14 15:07:34,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:07:34,048 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 114 transitions. [2022-07-14 15:07:34,053 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2022-07-14 15:07:34,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 66 states and 98 transitions. [2022-07-14 15:07:34,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2022-07-14 15:07:34,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2022-07-14 15:07:34,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 98 transitions. [2022-07-14 15:07:34,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:34,073 INFO L369 hiAutomatonCegarLoop]: Abstraction has 66 states and 98 transitions. [2022-07-14 15:07:34,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 98 transitions. [2022-07-14 15:07:34,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-07-14 15:07:34,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.5) internal successors, (96), 63 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:34,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2022-07-14 15:07:34,105 INFO L392 hiAutomatonCegarLoop]: Abstraction has 64 states and 96 transitions. [2022-07-14 15:07:34,106 INFO L374 stractBuchiCegarLoop]: Abstraction has 64 states and 96 transitions. [2022-07-14 15:07:34,106 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 15:07:34,106 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 96 transitions. [2022-07-14 15:07:34,111 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2022-07-14 15:07:34,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:34,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:34,112 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:34,112 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:34,112 INFO L752 eck$LassoCheckResult]: Stem: 163#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(15, 2); 152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 139#L59 assume !(0 == mp_add_~a3~0#1 % 256); 140#L59-1 mp_add_~nb~0#1 := 4; 159#L69 assume !(0 == mp_add_~b3~0#1 % 256); 149#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 165#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 166#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 194#L83-1 [2022-07-14 15:07:34,113 INFO L754 eck$LassoCheckResult]: Loop: 194#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 138#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 144#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 181#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 184#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 172#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 173#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 174#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 179#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 180#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 162#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 168#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 169#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 194#L83-1 [2022-07-14 15:07:34,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:34,114 INFO L85 PathProgramCache]: Analyzing trace with hash 532072804, now seen corresponding path program 1 times [2022-07-14 15:07:34,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:34,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673514944] [2022-07-14 15:07:34,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:34,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:34,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:34,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673514944] [2022-07-14 15:07:34,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673514944] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:34,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:34,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 15:07:34,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297637041] [2022-07-14 15:07:34,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:34,359 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:34,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:34,359 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 1 times [2022-07-14 15:07:34,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:34,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692697239] [2022-07-14 15:07:34,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:34,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:34,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:34,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:34,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692697239] [2022-07-14 15:07:34,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692697239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:34,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:34,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 15:07:34,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968847949] [2022-07-14 15:07:34,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:34,412 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:34,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:34,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 15:07:34,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 15:07:34,413 INFO L87 Difference]: Start difference. First operand 64 states and 96 transitions. cyclomatic complexity: 34 Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:34,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:34,744 INFO L93 Difference]: Finished difference Result 217 states and 305 transitions. [2022-07-14 15:07:34,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 15:07:34,746 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 217 states and 305 transitions. [2022-07-14 15:07:34,747 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 147 [2022-07-14 15:07:34,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 217 states to 217 states and 305 transitions. [2022-07-14 15:07:34,749 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 217 [2022-07-14 15:07:34,750 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 217 [2022-07-14 15:07:34,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 217 states and 305 transitions. [2022-07-14 15:07:34,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:34,751 INFO L369 hiAutomatonCegarLoop]: Abstraction has 217 states and 305 transitions. [2022-07-14 15:07:34,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states and 305 transitions. [2022-07-14 15:07:34,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 79. [2022-07-14 15:07:34,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 78 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:34,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2022-07-14 15:07:34,756 INFO L392 hiAutomatonCegarLoop]: Abstraction has 79 states and 114 transitions. [2022-07-14 15:07:34,756 INFO L374 stractBuchiCegarLoop]: Abstraction has 79 states and 114 transitions. [2022-07-14 15:07:34,757 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 15:07:34,757 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 114 transitions. [2022-07-14 15:07:34,757 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2022-07-14 15:07:34,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:34,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:34,758 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:34,758 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:34,758 INFO L752 eck$LassoCheckResult]: Stem: 463#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(15, 2); 451#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 435#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 437#L61 assume !(0 == mp_add_~a2~0#1 % 256); 438#L59-1 mp_add_~nb~0#1 := 4; 488#L69 assume !(0 == mp_add_~b3~0#1 % 256); 483#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 484#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 489#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 453#L83-1 [2022-07-14 15:07:34,758 INFO L754 eck$LassoCheckResult]: Loop: 453#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 440#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 442#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 459#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 448#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 449#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 470#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 473#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 482#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 505#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 462#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 467#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 452#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 453#L83-1 [2022-07-14 15:07:34,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:34,759 INFO L85 PathProgramCache]: Analyzing trace with hash -384676570, now seen corresponding path program 1 times [2022-07-14 15:07:34,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:34,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867715167] [2022-07-14 15:07:34,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:34,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:34,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:34,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867715167] [2022-07-14 15:07:34,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867715167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:34,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:34,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 15:07:34,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164370070] [2022-07-14 15:07:34,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:34,852 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:34,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:34,852 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 2 times [2022-07-14 15:07:34,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:34,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509444938] [2022-07-14 15:07:34,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:34,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:34,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:34,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:34,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509444938] [2022-07-14 15:07:34,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509444938] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:34,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:34,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 15:07:34,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558494226] [2022-07-14 15:07:34,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:34,884 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:34,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:34,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 15:07:34,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 15:07:34,885 INFO L87 Difference]: Start difference. First operand 79 states and 114 transitions. cyclomatic complexity: 37 Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:35,449 INFO L93 Difference]: Finished difference Result 387 states and 549 transitions. [2022-07-14 15:07:35,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 15:07:35,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 387 states and 549 transitions. [2022-07-14 15:07:35,452 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 279 [2022-07-14 15:07:35,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 387 states to 387 states and 549 transitions. [2022-07-14 15:07:35,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 387 [2022-07-14 15:07:35,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 387 [2022-07-14 15:07:35,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 387 states and 549 transitions. [2022-07-14 15:07:35,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:35,457 INFO L369 hiAutomatonCegarLoop]: Abstraction has 387 states and 549 transitions. [2022-07-14 15:07:35,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states and 549 transitions. [2022-07-14 15:07:35,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 184. [2022-07-14 15:07:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 184 states have (on average 1.4076086956521738) internal successors, (259), 183 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:35,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 259 transitions. [2022-07-14 15:07:35,464 INFO L392 hiAutomatonCegarLoop]: Abstraction has 184 states and 259 transitions. [2022-07-14 15:07:35,464 INFO L374 stractBuchiCegarLoop]: Abstraction has 184 states and 259 transitions. [2022-07-14 15:07:35,464 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 15:07:35,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 259 transitions. [2022-07-14 15:07:35,465 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 113 [2022-07-14 15:07:35,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:35,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:35,466 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:35,466 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:35,466 INFO L752 eck$LassoCheckResult]: Stem: 960#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(15, 2); 945#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 927#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 929#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 931#L63 assume !(0 == mp_add_~a1~0#1 % 256); 932#L59-1 mp_add_~nb~0#1 := 4; 985#L69 assume !(0 == mp_add_~b3~0#1 % 256); 981#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 982#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1021#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1044#L83-1 [2022-07-14 15:07:35,467 INFO L754 eck$LassoCheckResult]: Loop: 1044#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1041#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 1036#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1032#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1030#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1026#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 979#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 980#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1023#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1051#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1049#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1048#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1046#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1044#L83-1 [2022-07-14 15:07:35,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:35,467 INFO L85 PathProgramCache]: Analyzing trace with hash -2089936051, now seen corresponding path program 1 times [2022-07-14 15:07:35,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:35,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218564488] [2022-07-14 15:07:35,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:35,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:35,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:35,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:35,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:35,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218564488] [2022-07-14 15:07:35,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218564488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:35,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:35,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 15:07:35,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190008214] [2022-07-14 15:07:35,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:35,553 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:35,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:35,553 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 3 times [2022-07-14 15:07:35,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:35,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336980674] [2022-07-14 15:07:35,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:35,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:35,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:35,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336980674] [2022-07-14 15:07:35,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336980674] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:35,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:35,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 15:07:35,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2491338] [2022-07-14 15:07:35,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:35,581 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:35,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:35,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 15:07:35,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 15:07:35,582 INFO L87 Difference]: Start difference. First operand 184 states and 259 transitions. cyclomatic complexity: 79 Second operand has 8 states, 7 states have (on average 1.4285714285714286) 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-14 15:07:36,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:36,392 INFO L93 Difference]: Finished difference Result 482 states and 675 transitions. [2022-07-14 15:07:36,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 15:07:36,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 675 transitions. [2022-07-14 15:07:36,395 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 345 [2022-07-14 15:07:36,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 482 states and 675 transitions. [2022-07-14 15:07:36,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2022-07-14 15:07:36,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2022-07-14 15:07:36,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 482 states and 675 transitions. [2022-07-14 15:07:36,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:36,398 INFO L369 hiAutomatonCegarLoop]: Abstraction has 482 states and 675 transitions. [2022-07-14 15:07:36,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states and 675 transitions. [2022-07-14 15:07:36,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 270. [2022-07-14 15:07:36,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 1.4037037037037037) internal successors, (379), 269 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:36,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 379 transitions. [2022-07-14 15:07:36,405 INFO L392 hiAutomatonCegarLoop]: Abstraction has 270 states and 379 transitions. [2022-07-14 15:07:36,406 INFO L374 stractBuchiCegarLoop]: Abstraction has 270 states and 379 transitions. [2022-07-14 15:07:36,406 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 15:07:36,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 379 transitions. [2022-07-14 15:07:36,407 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 175 [2022-07-14 15:07:36,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:36,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:36,407 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:36,408 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:36,408 INFO L752 eck$LassoCheckResult]: Stem: 1655#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(15, 2); 1643#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 1624#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1626#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1628#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1629#L59-1 mp_add_~nb~0#1 := 4; 1684#L69 assume !(0 == mp_add_~b3~0#1 % 256); 1681#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1678#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1679#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1645#L83-1 [2022-07-14 15:07:36,408 INFO L754 eck$LassoCheckResult]: Loop: 1645#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1631#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 1633#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1677#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1879#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1663#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1664#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1680#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1737#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1673#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1654#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1659#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1644#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1645#L83-1 [2022-07-14 15:07:36,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:36,408 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194353, now seen corresponding path program 1 times [2022-07-14 15:07:36,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:36,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918671028] [2022-07-14 15:07:36,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:36,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:36,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:36,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:36,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918671028] [2022-07-14 15:07:36,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918671028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:36,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:36,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 15:07:36,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842317371] [2022-07-14 15:07:36,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:36,486 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:36,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:36,487 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 4 times [2022-07-14 15:07:36,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:36,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249211511] [2022-07-14 15:07:36,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:36,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:36,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:36,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249211511] [2022-07-14 15:07:36,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249211511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:36,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:36,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 15:07:36,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010445275] [2022-07-14 15:07:36,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:36,528 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:36,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:36,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 15:07:36,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 15:07:36,530 INFO L87 Difference]: Start difference. First operand 270 states and 379 transitions. cyclomatic complexity: 115 Second operand has 8 states, 7 states have (on average 1.4285714285714286) 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-14 15:07:37,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:37,252 INFO L93 Difference]: Finished difference Result 370 states and 514 transitions. [2022-07-14 15:07:37,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 15:07:37,253 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 370 states and 514 transitions. [2022-07-14 15:07:37,255 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 243 [2022-07-14 15:07:37,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 370 states to 370 states and 514 transitions. [2022-07-14 15:07:37,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 370 [2022-07-14 15:07:37,256 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 370 [2022-07-14 15:07:37,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 370 states and 514 transitions. [2022-07-14 15:07:37,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:37,261 INFO L369 hiAutomatonCegarLoop]: Abstraction has 370 states and 514 transitions. [2022-07-14 15:07:37,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states and 514 transitions. [2022-07-14 15:07:37,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 304. [2022-07-14 15:07:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 304 states have (on average 1.4046052631578947) internal successors, (427), 303 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:37,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 427 transitions. [2022-07-14 15:07:37,274 INFO L392 hiAutomatonCegarLoop]: Abstraction has 304 states and 427 transitions. [2022-07-14 15:07:37,274 INFO L374 stractBuchiCegarLoop]: Abstraction has 304 states and 427 transitions. [2022-07-14 15:07:37,275 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 15:07:37,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 304 states and 427 transitions. [2022-07-14 15:07:37,276 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 212 [2022-07-14 15:07:37,277 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:37,277 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:37,278 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:37,278 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:37,279 INFO L752 eck$LassoCheckResult]: Stem: 2326#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(15, 2); 2311#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 2298#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 2300#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 2302#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 2303#L59-1 mp_add_~nb~0#1 := 4; 2318#L69 assume !(0 == mp_add_~b3~0#1 % 256); 2341#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 2342#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2340#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2323#L84 [2022-07-14 15:07:37,279 INFO L754 eck$LassoCheckResult]: Loop: 2323#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 2324#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 2329#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 2312#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 2313#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2293#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 2295#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 2319#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 2305#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 2306#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 2333#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 2345#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2549#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2323#L84 [2022-07-14 15:07:37,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:37,279 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194379, now seen corresponding path program 1 times [2022-07-14 15:07:37,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:37,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070717923] [2022-07-14 15:07:37,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:37,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:37,296 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:37,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:37,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:37,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1738393452, now seen corresponding path program 5 times [2022-07-14 15:07:37,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:37,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559763214] [2022-07-14 15:07:37,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:37,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:37,332 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:37,340 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:37,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:37,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1295002104, now seen corresponding path program 1 times [2022-07-14 15:07:37,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:37,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792870321] [2022-07-14 15:07:37,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:37,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:37,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:37,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:37,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792870321] [2022-07-14 15:07:37,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792870321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:37,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:37,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 15:07:37,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855126288] [2022-07-14 15:07:37,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:37,520 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:07:37,521 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:07:37,521 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:07:37,521 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:07:37,521 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 15:07:37,522 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:37,522 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:07:37,522 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:07:37,522 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration6_Loop [2022-07-14 15:07:37,522 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:07:37,522 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:07:37,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-14 15:07:37,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:37,770 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:07:37,771 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 15:07:37,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:37,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:37,774 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:37,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-14 15:07:37,776 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:07:37,776 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:07:37,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-14 15:07:37,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:37,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:37,836 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:37,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-14 15:07:37,849 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 15:07:37,850 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:07:38,449 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 15:07:38,458 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-14 15:07:38,458 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:07:38,458 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:07:38,458 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:07:38,458 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:07:38,458 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:07:38,458 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:38,459 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:07:38,459 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:07:38,459 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration6_Loop [2022-07-14 15:07:38,459 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:07:38,459 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:07:38,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:38,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:38,770 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:07:38,774 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:07:38,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:38,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:38,777 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:38,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-14 15:07:38,779 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:38,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:38,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:38,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:38,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:38,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:38,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:07:38,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:38,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:38,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:38,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:38,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:38,840 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:38,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-14 15:07:38,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:38,849 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:38,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:38,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:38,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:38,850 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:38,852 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:07:38,852 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:38,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:38,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:38,873 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-14 15:07:38,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:38,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:38,874 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:38,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-14 15:07:38,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:38,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:38,882 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:38,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:38,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:38,883 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:07:38,886 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-14 15:07:38,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:38,889 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:38,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:38,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:38,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:38,906 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:38,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-14 15:07:38,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:38,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:38,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:38,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:38,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:38,914 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:07:38,918 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-14 15:07:38,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:38,924 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:38,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-07-14 15:07:38,939 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-14 15:07:38,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:38,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:38,941 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:38,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-14 15:07:38,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:38,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:38,950 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:38,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:38,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:38,950 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:07:38,954 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:07:38,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:38,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:38,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:38,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:38,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:38,975 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:38,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-14 15:07:38,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:38,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:38,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:38,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:38,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:38,989 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:07:38,994 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:07:38,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:39,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:39,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:39,017 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-14 15:07:39,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:39,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:39,018 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:39,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-14 15:07:39,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:39,026 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:39,026 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:39,026 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:39,026 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:39,026 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:07:39,031 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-14 15:07:39,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:39,041 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:39,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:39,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:39,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:39,060 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:39,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:39,072 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:39,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:39,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:39,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:39,072 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:07:39,078 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-14 15:07:39,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:39,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-14 15:07:39,089 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:39,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:39,107 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-14 15:07:39,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:39,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:39,116 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:39,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-14 15:07:39,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:39,123 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:39,123 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:07:39,123 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:39,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:39,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:39,124 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:07:39,127 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-14 15:07:39,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:39,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:39,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:39,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:39,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:39,172 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:39,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-14 15:07:39,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:39,201 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:39,201 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:07:39,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:39,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:39,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:39,202 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:07:39,206 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-14 15:07:39,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:39,222 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:39,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:39,239 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-14 15:07:39,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:39,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:39,249 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:39,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-14 15:07:39,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:39,259 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:39,259 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-14 15:07:39,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:39,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:39,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:39,260 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:07:39,266 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:07:39,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:39,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:39,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:39,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:39,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:39,318 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:39,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-14 15:07:39,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:39,327 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:39,327 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-14 15:07:39,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:39,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:39,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:39,327 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:07:39,334 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:07:39,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:39,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:39,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:39,402 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-14 15:07:39,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:39,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:39,415 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:39,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-14 15:07:39,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:39,425 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:39,425 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:07:39,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:39,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:39,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:39,426 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:07:39,437 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-14 15:07:39,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:39,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:39,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:39,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:39,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:39,490 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:39,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-14 15:07:39,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:39,500 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:39,500 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:07:39,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:39,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:39,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:39,500 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:07:39,508 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-14 15:07:39,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:39,526 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:39,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:39,550 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-14 15:07:39,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:39,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:39,564 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:39,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-07-14 15:07:39,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:39,576 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:39,576 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:07:39,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:39,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:39,576 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:39,576 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:07:39,581 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:07:39,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:39,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:39,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:39,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:39,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:39,635 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:39,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:39,647 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:39,647 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:07:39,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:39,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:39,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:39,648 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:07:39,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-07-14 15:07:39,653 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:07:39,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:39,671 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:39,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:39,695 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-14 15:07:39,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:39,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:39,711 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:39,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-07-14 15:07:39,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:39,737 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:39,738 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:07:39,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:39,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:39,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:39,738 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-14 15:07:39,744 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:39,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:39,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:39,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:39,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:39,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:39,809 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:39,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-14 15:07:39,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:39,833 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:39,833 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:07:39,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:39,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:39,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:39,834 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-14 15:07:39,840 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:39,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:39,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:39,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:39,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:39,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 15:07:39,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 15:07:39,897 INFO L87 Difference]: Start difference. First operand 304 states and 427 transitions. cyclomatic complexity: 130 Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:40,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:40,068 INFO L93 Difference]: Finished difference Result 621 states and 854 transitions. [2022-07-14 15:07:40,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 15:07:40,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 621 states and 854 transitions. [2022-07-14 15:07:40,074 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 424 [2022-07-14 15:07:40,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 621 states to 621 states and 854 transitions. [2022-07-14 15:07:40,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 621 [2022-07-14 15:07:40,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 621 [2022-07-14 15:07:40,079 INFO L73 IsDeterministic]: Start isDeterministic. Operand 621 states and 854 transitions. [2022-07-14 15:07:40,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:40,080 INFO L369 hiAutomatonCegarLoop]: Abstraction has 621 states and 854 transitions. [2022-07-14 15:07:40,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states and 854 transitions. [2022-07-14 15:07:40,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 328. [2022-07-14 15:07:40,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 328 states have (on average 1.375) internal successors, (451), 327 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 451 transitions. [2022-07-14 15:07:40,086 INFO L392 hiAutomatonCegarLoop]: Abstraction has 328 states and 451 transitions. [2022-07-14 15:07:40,086 INFO L374 stractBuchiCegarLoop]: Abstraction has 328 states and 451 transitions. [2022-07-14 15:07:40,087 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-14 15:07:40,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 328 states and 451 transitions. [2022-07-14 15:07:40,088 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 212 [2022-07-14 15:07:40,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:40,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:40,088 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:40,088 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:40,089 INFO L752 eck$LassoCheckResult]: Stem: 3262#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(15, 2); 3247#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 3234#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 3236#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 3238#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 3239#L59-1 mp_add_~nb~0#1 := 4; 3254#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 3243#L71 assume !(0 == mp_add_~b2~0#1 % 256); 3244#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 3556#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3281#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3259#L84 [2022-07-14 15:07:40,089 INFO L754 eck$LassoCheckResult]: Loop: 3259#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 3260#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 3285#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 3553#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 3552#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3231#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 3233#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 3255#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 3241#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 3242#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 3531#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 3301#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3302#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3259#L84 [2022-07-14 15:07:40,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:40,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2143364048, now seen corresponding path program 1 times [2022-07-14 15:07:40,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:40,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611981555] [2022-07-14 15:07:40,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:40,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:40,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:40,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:40,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611981555] [2022-07-14 15:07:40,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611981555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:40,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:40,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:07:40,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249608004] [2022-07-14 15:07:40,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:40,143 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:40,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:40,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1738393452, now seen corresponding path program 6 times [2022-07-14 15:07:40,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:40,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843166639] [2022-07-14 15:07:40,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:40,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:40,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:40,151 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:40,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:40,265 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:07:40,266 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:07:40,266 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:07:40,266 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:07:40,266 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 15:07:40,266 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:40,266 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:07:40,266 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:07:40,266 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration7_Loop [2022-07-14 15:07:40,266 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:07:40,266 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:07:40,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:40,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:40,519 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:07:40,519 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 15:07:40,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:40,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:40,528 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:40,544 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:07:40,544 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:07:40,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-14 15:07:40,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-14 15:07:40,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:40,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:40,599 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:40,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-14 15:07:40,602 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 15:07:40,602 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:07:42,234 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 15:07:42,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:42,239 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:07:42,239 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:07:42,239 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:07:42,239 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:07:42,239 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:07:42,239 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:42,239 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:07:42,239 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:07:42,239 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration7_Loop [2022-07-14 15:07:42,239 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:07:42,239 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:07:42,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:42,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:42,452 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:07:42,452 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:07:42,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:42,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:42,453 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:42,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-14 15:07:42,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:42,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:42,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:42,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:42,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:42,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:42,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:07:42,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:42,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:42,482 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-14 15:07:42,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:42,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:42,483 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:42,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-07-14 15:07:42,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:42,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:42,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:42,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:42,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:42,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:42,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:07:42,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:42,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:42,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-07-14 15:07:42,525 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-14 15:07:42,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:42,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:42,527 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:42,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-14 15:07:42,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:42,536 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:42,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:42,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:42,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:42,537 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:07:42,541 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-14 15:07:42,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:42,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:42,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:42,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:42,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:42,584 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:42,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-14 15:07:42,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:42,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:42,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:42,595 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:42,595 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:42,595 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:07:42,599 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-14 15:07:42,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:42,603 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:42,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:42,628 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-14 15:07:42,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:42,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:42,629 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:42,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-14 15:07:42,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:42,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:42,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:42,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:42,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:42,658 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:07:42,662 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:07:42,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:42,667 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:42,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-07-14 15:07:42,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:42,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:42,691 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:42,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-14 15:07:42,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:42,699 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:42,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:42,700 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:42,700 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:42,700 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:07:42,704 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:07:42,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:42,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:42,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:42,733 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-14 15:07:42,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:42,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:42,735 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:42,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-14 15:07:42,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:42,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:42,745 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:42,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:42,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:42,745 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:07:42,751 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-14 15:07:42,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:42,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:42,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-14 15:07:42,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:42,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:42,781 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:42,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-14 15:07:42,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:42,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:42,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:42,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:42,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:42,790 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:07:42,794 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-14 15:07:42,795 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:42,809 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:42,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:42,825 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-14 15:07:42,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:42,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:42,826 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:42,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-14 15:07:42,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:42,834 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:42,834 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:07:42,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:42,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:42,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:42,834 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:07:42,837 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-14 15:07:42,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:42,853 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:42,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:42,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:42,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:42,870 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:42,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-14 15:07:42,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:42,879 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:42,879 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:07:42,879 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:42,880 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:42,880 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:42,880 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:07:42,883 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-14 15:07:42,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:42,898 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:42,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:42,914 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-14 15:07:42,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:42,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:42,917 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:42,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-07-14 15:07:42,934 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:42,942 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:42,942 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-14 15:07:42,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:42,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:42,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:42,942 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:07:42,949 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:07:42,949 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:42,963 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:42,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-07-14 15:07:42,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:42,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:42,989 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:42,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-07-14 15:07:42,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:42,998 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:42,998 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-14 15:07:42,999 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:42,999 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:42,999 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:42,999 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:07:43,004 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:07:43,004 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:43,035 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:43,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:43,074 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-14 15:07:43,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:43,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:43,080 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:43,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:43,094 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:43,094 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:07:43,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:43,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:43,095 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:43,095 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:07:43,101 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-14 15:07:43,101 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:43,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-07-14 15:07:43,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:43,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:43,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:43,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:43,158 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:43,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:43,187 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:43,187 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:07:43,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:43,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:43,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:43,188 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:07:43,196 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-14 15:07:43,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:43,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-07-14 15:07:43,210 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:43,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:43,254 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-14 15:07:43,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:43,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:43,256 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:43,264 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:43,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-07-14 15:07:43,272 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:43,272 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:07:43,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:43,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:43,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:43,272 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:07:43,278 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:07:43,278 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:43,295 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:43,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:43,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:43,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:43,322 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:43,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-07-14 15:07:43,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:43,332 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:43,332 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:07:43,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:43,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:43,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:43,332 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:07:43,337 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:07:43,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:43,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:43,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:43,386 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-14 15:07:43,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:43,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:43,388 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:43,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:43,398 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:43,399 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:07:43,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:43,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:43,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:43,399 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-14 15:07:43,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:43,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:43,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-07-14 15:07:43,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:43,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:43,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:43,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:43,446 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:43,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-07-14 15:07:43,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:43,454 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:43,454 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:07:43,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:43,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:43,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:07:43,455 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-14 15:07:43,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:43,461 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:43,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:43,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:43,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:43,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:07:43,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:07:43,489 INFO L87 Difference]: Start difference. First operand 328 states and 451 transitions. cyclomatic complexity: 130 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:43,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:43,502 INFO L93 Difference]: Finished difference Result 293 states and 401 transitions. [2022-07-14 15:07:43,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:07:43,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 293 states and 401 transitions. [2022-07-14 15:07:43,504 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 212 [2022-07-14 15:07:43,505 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 293 states to 293 states and 401 transitions. [2022-07-14 15:07:43,505 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 293 [2022-07-14 15:07:43,505 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 293 [2022-07-14 15:07:43,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 293 states and 401 transitions. [2022-07-14 15:07:43,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:43,505 INFO L369 hiAutomatonCegarLoop]: Abstraction has 293 states and 401 transitions. [2022-07-14 15:07:43,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states and 401 transitions. [2022-07-14 15:07:43,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2022-07-14 15:07:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 293 states have (on average 1.3686006825938566) internal successors, (401), 292 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 401 transitions. [2022-07-14 15:07:43,509 INFO L392 hiAutomatonCegarLoop]: Abstraction has 293 states and 401 transitions. [2022-07-14 15:07:43,509 INFO L374 stractBuchiCegarLoop]: Abstraction has 293 states and 401 transitions. [2022-07-14 15:07:43,509 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-14 15:07:43,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 293 states and 401 transitions. [2022-07-14 15:07:43,510 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 212 [2022-07-14 15:07:43,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:43,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:43,510 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:43,510 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:43,510 INFO L752 eck$LassoCheckResult]: Stem: 3887#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(15, 2); 3872#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 3861#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 3863#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 3865#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 3866#L59-1 mp_add_~nb~0#1 := 4; 4148#L69 assume !(0 == mp_add_~b3~0#1 % 256); 4147#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 4146#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4145#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4144#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 4143#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 4141#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4139#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4138#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 4129#L90 [2022-07-14 15:07:43,511 INFO L754 eck$LassoCheckResult]: Loop: 4129#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 4124#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 4135#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 4128#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 4086#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 3871#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 4082#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4076#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4077#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4109#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4108#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4105#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4103#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 4101#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 4099#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4097#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4098#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 4129#L90 [2022-07-14 15:07:43,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:43,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 1 times [2022-07-14 15:07:43,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:43,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015178687] [2022-07-14 15:07:43,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:43,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:43,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:43,519 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:43,527 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:43,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:43,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1188749690, now seen corresponding path program 1 times [2022-07-14 15:07:43,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:43,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203490387] [2022-07-14 15:07:43,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:43,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:43,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:43,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:43,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203490387] [2022-07-14 15:07:43,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203490387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:43,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:43,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:07:43,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189507840] [2022-07-14 15:07:43,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:43,577 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:43,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:43,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 15:07:43,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 15:07:43,577 INFO L87 Difference]: Start difference. First operand 293 states and 401 transitions. cyclomatic complexity: 115 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:43,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:43,693 INFO L93 Difference]: Finished difference Result 443 states and 622 transitions. [2022-07-14 15:07:43,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 15:07:43,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 443 states and 622 transitions. [2022-07-14 15:07:43,696 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 361 [2022-07-14 15:07:43,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 443 states to 442 states and 621 transitions. [2022-07-14 15:07:43,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 442 [2022-07-14 15:07:43,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 442 [2022-07-14 15:07:43,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 442 states and 621 transitions. [2022-07-14 15:07:43,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:43,698 INFO L369 hiAutomatonCegarLoop]: Abstraction has 442 states and 621 transitions. [2022-07-14 15:07:43,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states and 621 transitions. [2022-07-14 15:07:43,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 404. [2022-07-14 15:07:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 404 states have (on average 1.381188118811881) internal successors, (558), 403 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:43,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 558 transitions. [2022-07-14 15:07:43,703 INFO L392 hiAutomatonCegarLoop]: Abstraction has 404 states and 558 transitions. [2022-07-14 15:07:43,703 INFO L374 stractBuchiCegarLoop]: Abstraction has 404 states and 558 transitions. [2022-07-14 15:07:43,703 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-14 15:07:43,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 404 states and 558 transitions. [2022-07-14 15:07:43,704 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 323 [2022-07-14 15:07:43,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:43,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:43,704 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:43,704 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:43,705 INFO L752 eck$LassoCheckResult]: Stem: 4629#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(15, 2); 4614#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 4599#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 4601#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 4603#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 4604#L59-1 mp_add_~nb~0#1 := 4; 4703#L69 assume !(0 == mp_add_~b3~0#1 % 256); 4650#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 4632#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4633#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4627#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 4628#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 4634#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4615#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4616#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 4639#L90 [2022-07-14 15:07:43,705 INFO L754 eck$LassoCheckResult]: Loop: 4639#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 4640#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 5002#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 4994#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 4990#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 4758#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 4759#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4751#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4752#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4655#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4656#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4945#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4939#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4938#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 4652#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4624#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 4611#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 4612#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4638#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4723#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4724#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4999#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 5001#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 5000#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4998#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4995#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 4639#L90 [2022-07-14 15:07:43,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:43,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 2 times [2022-07-14 15:07:43,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:43,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082531600] [2022-07-14 15:07:43,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:43,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:43,712 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:43,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:43,719 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:43,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:43,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1293860767, now seen corresponding path program 1 times [2022-07-14 15:07:43,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:43,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259555938] [2022-07-14 15:07:43,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:43,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:43,729 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 15:07:43,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:43,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259555938] [2022-07-14 15:07:43,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259555938] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:43,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:43,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:07:43,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393452818] [2022-07-14 15:07:43,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:43,730 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:43,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:43,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:07:43,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:07:43,730 INFO L87 Difference]: Start difference. First operand 404 states and 558 transitions. cyclomatic complexity: 161 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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-14 15:07:43,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:43,807 INFO L93 Difference]: Finished difference Result 528 states and 720 transitions. [2022-07-14 15:07:43,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:07:43,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 528 states and 720 transitions. [2022-07-14 15:07:43,810 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 447 [2022-07-14 15:07:43,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 528 states to 528 states and 720 transitions. [2022-07-14 15:07:43,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 528 [2022-07-14 15:07:43,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 528 [2022-07-14 15:07:43,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 528 states and 720 transitions. [2022-07-14 15:07:43,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:43,812 INFO L369 hiAutomatonCegarLoop]: Abstraction has 528 states and 720 transitions. [2022-07-14 15:07:43,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states and 720 transitions. [2022-07-14 15:07:43,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 474. [2022-07-14 15:07:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 474 states have (on average 1.3734177215189873) internal successors, (651), 473 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:43,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 651 transitions. [2022-07-14 15:07:43,818 INFO L392 hiAutomatonCegarLoop]: Abstraction has 474 states and 651 transitions. [2022-07-14 15:07:43,818 INFO L374 stractBuchiCegarLoop]: Abstraction has 474 states and 651 transitions. [2022-07-14 15:07:43,818 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-14 15:07:43,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 474 states and 651 transitions. [2022-07-14 15:07:43,819 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 393 [2022-07-14 15:07:43,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:43,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:43,820 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:43,820 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:43,820 INFO L752 eck$LassoCheckResult]: Stem: 5570#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(15, 2); 5554#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 5544#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 5546#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 5548#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 5549#L59-1 mp_add_~nb~0#1 := 4; 5793#L69 assume !(0 == mp_add_~b3~0#1 % 256); 5588#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 5589#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6006#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 6005#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 6004#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6003#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6002#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6001#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 5957#L90 [2022-07-14 15:07:43,820 INFO L754 eck$LassoCheckResult]: Loop: 5957#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 5938#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 5998#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 5954#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 5955#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 5799#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 5800#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5758#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5759#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5752#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5753#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5826#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 5827#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5817#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 5801#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 5802#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 5958#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5756#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5750#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5751#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5933#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 5934#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 6009#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6008#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6007#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 5956#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 5957#L90 [2022-07-14 15:07:43,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:43,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 3 times [2022-07-14 15:07:43,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:43,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342621178] [2022-07-14 15:07:43,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:43,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:43,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:43,830 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:43,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:43,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:43,837 INFO L85 PathProgramCache]: Analyzing trace with hash 900833757, now seen corresponding path program 1 times [2022-07-14 15:07:43,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:43,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880369210] [2022-07-14 15:07:43,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:43,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:43,874 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:43,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:43,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880369210] [2022-07-14 15:07:43,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880369210] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:43,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:43,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 15:07:43,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009280207] [2022-07-14 15:07:43,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:43,875 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:43,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:43,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 15:07:43,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 15:07:43,876 INFO L87 Difference]: Start difference. First operand 474 states and 651 transitions. cyclomatic complexity: 183 Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:44,024 INFO L93 Difference]: Finished difference Result 957 states and 1290 transitions. [2022-07-14 15:07:44,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 15:07:44,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 957 states and 1290 transitions. [2022-07-14 15:07:44,028 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 833 [2022-07-14 15:07:44,032 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 957 states to 956 states and 1289 transitions. [2022-07-14 15:07:44,032 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 956 [2022-07-14 15:07:44,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 956 [2022-07-14 15:07:44,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 956 states and 1289 transitions. [2022-07-14 15:07:44,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:44,033 INFO L369 hiAutomatonCegarLoop]: Abstraction has 956 states and 1289 transitions. [2022-07-14 15:07:44,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states and 1289 transitions. [2022-07-14 15:07:44,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 715. [2022-07-14 15:07:44,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 715 states have (on average 1.358041958041958) internal successors, (971), 714 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:44,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 971 transitions. [2022-07-14 15:07:44,051 INFO L392 hiAutomatonCegarLoop]: Abstraction has 715 states and 971 transitions. [2022-07-14 15:07:44,051 INFO L374 stractBuchiCegarLoop]: Abstraction has 715 states and 971 transitions. [2022-07-14 15:07:44,051 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-14 15:07:44,051 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 715 states and 971 transitions. [2022-07-14 15:07:44,053 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 628 [2022-07-14 15:07:44,053 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:44,053 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:44,053 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:44,053 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:44,054 INFO L752 eck$LassoCheckResult]: Stem: 7010#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(15, 2); 6996#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 6986#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 6988#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 6990#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 6991#L59-1 mp_add_~nb~0#1 := 4; 7328#L69 assume !(0 == mp_add_~b3~0#1 % 256); 7030#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 7031#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7436#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7435#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 7434#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 7433#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 7431#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 7429#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 7421#L90 [2022-07-14 15:07:44,054 INFO L754 eck$LassoCheckResult]: Loop: 7421#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 7371#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 7426#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 7424#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 7416#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 7344#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 7345#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 7410#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7408#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7405#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7404#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7403#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 7400#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7401#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 7343#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 7340#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 7341#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 7372#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7363#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7362#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7360#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7361#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 7432#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 7430#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 7428#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 7420#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 7421#L90 [2022-07-14 15:07:44,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:44,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 4 times [2022-07-14 15:07:44,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:44,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021131185] [2022-07-14 15:07:44,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:44,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:44,062 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:44,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:44,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:44,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1994925345, now seen corresponding path program 1 times [2022-07-14 15:07:44,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:44,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51555720] [2022-07-14 15:07:44,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:44,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:44,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:44,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51555720] [2022-07-14 15:07:44,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51555720] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:44,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119204398] [2022-07-14 15:07:44,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:44,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:44,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:44,129 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:07:44,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-07-14 15:07:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:44,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 15:07:44,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:44,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:44,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119204398] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:44,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:44,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-07-14 15:07:44,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477909318] [2022-07-14 15:07:44,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:44,268 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:44,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:44,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 15:07:44,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-14 15:07:44,269 INFO L87 Difference]: Start difference. First operand 715 states and 971 transitions. cyclomatic complexity: 264 Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:44,622 INFO L93 Difference]: Finished difference Result 1221 states and 1613 transitions. [2022-07-14 15:07:44,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 15:07:44,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1221 states and 1613 transitions. [2022-07-14 15:07:44,627 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1055 [2022-07-14 15:07:44,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1221 states to 1221 states and 1613 transitions. [2022-07-14 15:07:44,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1221 [2022-07-14 15:07:44,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1221 [2022-07-14 15:07:44,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1221 states and 1613 transitions. [2022-07-14 15:07:44,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:44,634 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1221 states and 1613 transitions. [2022-07-14 15:07:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states and 1613 transitions. [2022-07-14 15:07:44,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1080. [2022-07-14 15:07:44,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1080 states have (on average 1.336111111111111) internal successors, (1443), 1079 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:44,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1443 transitions. [2022-07-14 15:07:44,665 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1080 states and 1443 transitions. [2022-07-14 15:07:44,665 INFO L374 stractBuchiCegarLoop]: Abstraction has 1080 states and 1443 transitions. [2022-07-14 15:07:44,665 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-14 15:07:44,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1080 states and 1443 transitions. [2022-07-14 15:07:44,668 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 961 [2022-07-14 15:07:44,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:44,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:44,670 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:44,670 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:44,670 INFO L752 eck$LassoCheckResult]: Stem: 9113#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(15, 2); 9097#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 9087#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 9089#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 9091#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 9092#L59-1 mp_add_~nb~0#1 := 4; 9625#L69 assume !(0 == mp_add_~b3~0#1 % 256); 9133#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 9114#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 9115#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 9815#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 9814#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 9813#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 9812#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 9811#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 9776#L90 [2022-07-14 15:07:44,670 INFO L754 eck$LassoCheckResult]: Loop: 9776#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 9665#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 9810#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 9808#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 9804#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 9651#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 9650#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 9649#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 9646#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 9641#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 9640#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 9629#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 9630#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 9730#L90 assume !(0 == mp_add_~i~0#1 % 256); 9729#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 9728#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 9726#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 9722#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 9720#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 9719#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 9718#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 9717#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 9716#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 9715#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 9714#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 9670#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 9783#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 9781#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 9780#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 9775#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 9776#L90 [2022-07-14 15:07:44,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:44,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 5 times [2022-07-14 15:07:44,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:44,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304742602] [2022-07-14 15:07:44,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:44,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:44,680 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:44,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:44,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:44,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1196420781, now seen corresponding path program 1 times [2022-07-14 15:07:44,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:44,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136450403] [2022-07-14 15:07:44,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:44,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 15:07:44,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:44,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136450403] [2022-07-14 15:07:44,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136450403] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:44,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:44,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 15:07:44,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920958156] [2022-07-14 15:07:44,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:44,730 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:44,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:44,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 15:07:44,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 15:07:44,731 INFO L87 Difference]: Start difference. First operand 1080 states and 1443 transitions. cyclomatic complexity: 371 Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:44,856 INFO L93 Difference]: Finished difference Result 1442 states and 1866 transitions. [2022-07-14 15:07:44,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 15:07:44,858 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1442 states and 1866 transitions. [2022-07-14 15:07:44,863 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1308 [2022-07-14 15:07:44,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1442 states to 1441 states and 1863 transitions. [2022-07-14 15:07:44,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1441 [2022-07-14 15:07:44,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1441 [2022-07-14 15:07:44,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1441 states and 1863 transitions. [2022-07-14 15:07:44,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:44,870 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1441 states and 1863 transitions. [2022-07-14 15:07:44,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states and 1863 transitions. [2022-07-14 15:07:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1128. [2022-07-14 15:07:44,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1128 states have (on average 1.3111702127659575) internal successors, (1479), 1127 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:44,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1479 transitions. [2022-07-14 15:07:44,881 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1128 states and 1479 transitions. [2022-07-14 15:07:44,881 INFO L374 stractBuchiCegarLoop]: Abstraction has 1128 states and 1479 transitions. [2022-07-14 15:07:44,881 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-14 15:07:44,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1128 states and 1479 transitions. [2022-07-14 15:07:44,885 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1043 [2022-07-14 15:07:44,885 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:44,885 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:44,885 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:44,885 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:44,885 INFO L752 eck$LassoCheckResult]: Stem: 11643#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(15, 2); 11628#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 11618#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 11620#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 11622#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 11623#L59-1 mp_add_~nb~0#1 := 4; 12063#L69 assume !(0 == mp_add_~b3~0#1 % 256); 11661#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 11662#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 12556#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 12557#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 12574#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 12542#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 12543#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 12538#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 12537#L90 [2022-07-14 15:07:44,886 INFO L754 eck$LassoCheckResult]: Loop: 12537#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 12438#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 12535#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 12533#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 12529#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 12527#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 12481#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 12526#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 12525#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 12524#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 12523#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 12522#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 12520#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 12521#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 11665#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 11666#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 12071#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 12064#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 12065#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 11710#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 11658#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 11659#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 11612#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 11614#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 12403#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 12401#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 12393#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 12392#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 11699#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 11700#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 12418#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 12554#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 12555#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 12540#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 12541#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 12537#L90 [2022-07-14 15:07:44,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:44,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 6 times [2022-07-14 15:07:44,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:44,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483701099] [2022-07-14 15:07:44,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:44,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:44,894 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:44,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:44,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:44,905 INFO L85 PathProgramCache]: Analyzing trace with hash -239832150, now seen corresponding path program 2 times [2022-07-14 15:07:44,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:44,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689822997] [2022-07-14 15:07:44,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:44,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:44,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:44,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:44,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689822997] [2022-07-14 15:07:44,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689822997] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:44,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652726598] [2022-07-14 15:07:44,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 15:07:44,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:44,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:44,960 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:07:44,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-07-14 15:07:45,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 15:07:45,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:07:45,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 15:07:45,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:45,024 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-14 15:07:45,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 15:07:45,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652726598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:45,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 15:07:45,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-07-14 15:07:45,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112869350] [2022-07-14 15:07:45,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:45,025 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:45,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:45,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 15:07:45,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 15:07:45,026 INFO L87 Difference]: Start difference. First operand 1128 states and 1479 transitions. cyclomatic complexity: 357 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 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-14 15:07:45,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:45,171 INFO L93 Difference]: Finished difference Result 1310 states and 1689 transitions. [2022-07-14 15:07:45,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 15:07:45,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1310 states and 1689 transitions. [2022-07-14 15:07:45,177 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1216 [2022-07-14 15:07:45,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1310 states to 1301 states and 1680 transitions. [2022-07-14 15:07:45,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1301 [2022-07-14 15:07:45,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1301 [2022-07-14 15:07:45,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1301 states and 1680 transitions. [2022-07-14 15:07:45,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:45,182 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1301 states and 1680 transitions. [2022-07-14 15:07:45,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states and 1680 transitions. [2022-07-14 15:07:45,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1218. [2022-07-14 15:07:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1218 states have (on average 1.2980295566502462) internal successors, (1581), 1217 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:45,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1581 transitions. [2022-07-14 15:07:45,197 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1218 states and 1581 transitions. [2022-07-14 15:07:45,197 INFO L374 stractBuchiCegarLoop]: Abstraction has 1218 states and 1581 transitions. [2022-07-14 15:07:45,197 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-14 15:07:45,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1218 states and 1581 transitions. [2022-07-14 15:07:45,200 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1135 [2022-07-14 15:07:45,200 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:45,200 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:45,201 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:45,201 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:45,201 INFO L752 eck$LassoCheckResult]: Stem: 14190#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(15, 2); 14177#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 14162#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 14164#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 14166#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 14167#L59-1 mp_add_~nb~0#1 := 4; 15185#L69 assume !(0 == mp_add_~b3~0#1 % 256); 15184#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 15183#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 15182#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 15181#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 15180#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 15179#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 15177#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 15176#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 15174#L90 [2022-07-14 15:07:45,201 INFO L754 eck$LassoCheckResult]: Loop: 15174#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 14642#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 15173#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 15172#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 15169#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 15162#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 14630#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 15161#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 15160#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 15159#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 15158#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 15157#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 15155#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 15145#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 15135#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 15136#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 15129#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 15130#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14264#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14265#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 15335#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 15272#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 15270#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 14513#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 14514#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 14393#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 14395#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14382#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14383#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 14645#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 14646#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 15244#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 15243#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 15242#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 15241#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 15174#L90 [2022-07-14 15:07:45,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:45,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 7 times [2022-07-14 15:07:45,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:45,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142616442] [2022-07-14 15:07:45,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:45,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:45,209 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:45,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:45,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:45,217 INFO L85 PathProgramCache]: Analyzing trace with hash -632859160, now seen corresponding path program 2 times [2022-07-14 15:07:45,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:45,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472509909] [2022-07-14 15:07:45,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:45,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:45,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:45,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472509909] [2022-07-14 15:07:45,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472509909] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:45,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615291072] [2022-07-14 15:07:45,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 15:07:45,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:45,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:45,305 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:07:45,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-07-14 15:07:45,382 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 15:07:45,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:07:45,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 15:07:45,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 15:07:45,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:45,490 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 15:07:45,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615291072] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:45,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:45,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-07-14 15:07:45,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006448526] [2022-07-14 15:07:45,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:45,491 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:45,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:45,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 15:07:45,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-14 15:07:45,491 INFO L87 Difference]: Start difference. First operand 1218 states and 1581 transitions. cyclomatic complexity: 368 Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:46,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:46,693 INFO L93 Difference]: Finished difference Result 2021 states and 2495 transitions. [2022-07-14 15:07:46,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-14 15:07:46,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2021 states and 2495 transitions. [2022-07-14 15:07:46,703 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1839 [2022-07-14 15:07:46,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2021 states to 1992 states and 2457 transitions. [2022-07-14 15:07:46,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1992 [2022-07-14 15:07:46,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1992 [2022-07-14 15:07:46,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1992 states and 2457 transitions. [2022-07-14 15:07:46,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:46,713 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1992 states and 2457 transitions. [2022-07-14 15:07:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states and 2457 transitions. [2022-07-14 15:07:46,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1219. [2022-07-14 15:07:46,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1219 states have (on average 1.2748154224774406) internal successors, (1554), 1218 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:46,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1554 transitions. [2022-07-14 15:07:46,731 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1219 states and 1554 transitions. [2022-07-14 15:07:46,731 INFO L374 stractBuchiCegarLoop]: Abstraction has 1219 states and 1554 transitions. [2022-07-14 15:07:46,731 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-14 15:07:46,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1219 states and 1554 transitions. [2022-07-14 15:07:46,744 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1117 [2022-07-14 15:07:46,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:46,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:46,745 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:46,745 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:46,745 INFO L752 eck$LassoCheckResult]: Stem: 17761#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(15, 2); 17745#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 17734#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 17736#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 17738#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 17739#L59-1 mp_add_~nb~0#1 := 4; 18130#L69 assume !(0 == mp_add_~b3~0#1 % 256); 18129#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 18128#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18127#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 18114#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 18115#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 18108#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 18109#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 18102#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 18101#L90 [2022-07-14 15:07:46,745 INFO L754 eck$LassoCheckResult]: Loop: 18101#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 18100#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 18099#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 18097#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 18093#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 18094#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 18092#L96-8 mp_add_~carry~0#1 := 1; 18090#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 18088#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 18086#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 18084#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18071#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18072#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18062#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 18063#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 18057#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 18054#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 18053#L96-8 mp_add_~carry~0#1 := 1; 18047#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 18046#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 17910#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 18041#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18038#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18035#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18032#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 18024#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 18020#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 18021#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 18022#L96-8 mp_add_~carry~0#1 := 1; 18019#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 18013#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 18011#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 18009#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18003#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18002#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18000#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 17997#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 17992#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 17993#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 17991#L96-8 mp_add_~carry~0#1 := 1; 17989#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 17987#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 17976#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 17972#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 17967#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 17965#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 17963#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 17955#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 17943#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 17944#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 18050#L96-8 mp_add_~carry~0#1 := 1; 17928#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 17929#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 17916#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 17912#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 17901#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 17900#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 17883#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 17884#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 17970#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 17940#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 17936#L96-8 mp_add_~carry~0#1 := 1; 17930#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 17931#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 17917#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 17913#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 17905#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 17902#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 17841#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 17842#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 18103#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 17986#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 17985#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 17984#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 17982#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 17981#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 17978#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 17979#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 18104#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 18111#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 18112#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 18105#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 18106#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 18101#L90 [2022-07-14 15:07:46,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:46,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 8 times [2022-07-14 15:07:46,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:46,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800814390] [2022-07-14 15:07:46,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:46,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:46,753 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:46,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:46,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:46,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1271323788, now seen corresponding path program 1 times [2022-07-14 15:07:46,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:46,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525898973] [2022-07-14 15:07:46,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:46,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:46,775 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2022-07-14 15:07:46,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:46,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525898973] [2022-07-14 15:07:46,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525898973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:46,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:46,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 15:07:46,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413875481] [2022-07-14 15:07:46,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:46,776 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:46,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:46,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 15:07:46,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 15:07:46,777 INFO L87 Difference]: Start difference. First operand 1219 states and 1554 transitions. cyclomatic complexity: 340 Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:46,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:46,826 INFO L93 Difference]: Finished difference Result 1534 states and 1856 transitions. [2022-07-14 15:07:46,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 15:07:46,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1534 states and 1856 transitions. [2022-07-14 15:07:46,831 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1259 [2022-07-14 15:07:46,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1534 states to 1390 states and 1712 transitions. [2022-07-14 15:07:46,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1390 [2022-07-14 15:07:46,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1390 [2022-07-14 15:07:46,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1390 states and 1712 transitions. [2022-07-14 15:07:46,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:46,837 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1390 states and 1712 transitions. [2022-07-14 15:07:46,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states and 1712 transitions. [2022-07-14 15:07:46,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1113. [2022-07-14 15:07:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1113 states have (on average 1.2461814914645104) internal successors, (1387), 1112 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:46,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1387 transitions. [2022-07-14 15:07:46,849 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1113 states and 1387 transitions. [2022-07-14 15:07:46,849 INFO L374 stractBuchiCegarLoop]: Abstraction has 1113 states and 1387 transitions. [2022-07-14 15:07:46,849 INFO L287 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-14 15:07:46,849 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1113 states and 1387 transitions. [2022-07-14 15:07:46,851 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 996 [2022-07-14 15:07:46,851 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:46,851 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:46,852 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:46,852 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:46,852 INFO L752 eck$LassoCheckResult]: Stem: 20520#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(15, 2); 20505#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 20487#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 20489#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 20491#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 20492#L59-1 mp_add_~nb~0#1 := 4; 20816#L69 assume !(0 == mp_add_~b3~0#1 % 256); 20815#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 20814#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 20813#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 20811#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 20812#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 20807#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 20808#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 20803#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 20802#L90 [2022-07-14 15:07:46,852 INFO L754 eck$LassoCheckResult]: Loop: 20802#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 20801#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 20800#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 20798#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 20793#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 20795#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 20788#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20789#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20784#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20785#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20780#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 20781#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20777#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 20776#L90 assume !(0 == mp_add_~i~0#1 % 256); 20775#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 20671#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 20771#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 20768#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 20769#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 20770#L96-8 mp_add_~carry~0#1 := 1; 20767#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20765#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 20763#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20761#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20759#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20757#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 20752#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20753#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 20756#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 20741#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20751#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20749#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 20747#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20745#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20727#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 20728#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20723#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 20721#L90 assume !(0 == mp_add_~i~0#1 % 256); 20719#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 20716#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 20708#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 20704#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 20700#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 20696#L96-8 mp_add_~carry~0#1 := 1; 20694#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20692#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20690#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20688#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 20656#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20686#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 20685#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20683#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 20684#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 21336#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 21334#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20679#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20678#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20644#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20677#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 20675#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20676#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 20672#L90 assume !(0 == mp_add_~i~0#1 % 256); 20670#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 20669#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 20667#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 20664#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 20661#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 20660#L96-8 mp_add_~carry~0#1 := 1; 20659#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20658#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20657#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20655#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20654#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20653#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 20652#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20650#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 20649#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 20648#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20646#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20645#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20643#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20642#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20564#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 20565#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 20804#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 20809#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 20810#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 20805#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 20806#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 20802#L90 [2022-07-14 15:07:46,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:46,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 9 times [2022-07-14 15:07:46,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:46,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101999275] [2022-07-14 15:07:46,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:46,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:46,858 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:46,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:46,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:46,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1286195251, now seen corresponding path program 1 times [2022-07-14 15:07:46,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:46,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834862468] [2022-07-14 15:07:46,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:46,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:46,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:46,945 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-14 15:07:46,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:46,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834862468] [2022-07-14 15:07:46,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834862468] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:46,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:46,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 15:07:46,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534013265] [2022-07-14 15:07:46,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:46,946 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:46,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:46,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 15:07:46,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 15:07:46,947 INFO L87 Difference]: Start difference. First operand 1113 states and 1387 transitions. cyclomatic complexity: 279 Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:47,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:47,328 INFO L93 Difference]: Finished difference Result 1733 states and 2133 transitions. [2022-07-14 15:07:47,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 15:07:47,328 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1733 states and 2133 transitions. [2022-07-14 15:07:47,333 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1451 [2022-07-14 15:07:47,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1733 states to 1704 states and 2102 transitions. [2022-07-14 15:07:47,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1704 [2022-07-14 15:07:47,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1704 [2022-07-14 15:07:47,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1704 states and 2102 transitions. [2022-07-14 15:07:47,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:47,340 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1704 states and 2102 transitions. [2022-07-14 15:07:47,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states and 2102 transitions. [2022-07-14 15:07:47,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1392. [2022-07-14 15:07:47,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1392 states have (on average 1.2564655172413792) internal successors, (1749), 1391 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:47,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1749 transitions. [2022-07-14 15:07:47,354 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1392 states and 1749 transitions. [2022-07-14 15:07:47,355 INFO L374 stractBuchiCegarLoop]: Abstraction has 1392 states and 1749 transitions. [2022-07-14 15:07:47,355 INFO L287 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-07-14 15:07:47,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1392 states and 1749 transitions. [2022-07-14 15:07:47,357 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1229 [2022-07-14 15:07:47,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:47,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:47,358 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:47,358 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:47,358 INFO L752 eck$LassoCheckResult]: Stem: 23390#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(15, 2); 23375#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 23358#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 23360#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 23362#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 23363#L59-1 mp_add_~nb~0#1 := 4; 23665#L69 assume !(0 == mp_add_~b3~0#1 % 256); 23664#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 23663#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23662#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 23660#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 23661#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 23656#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 23657#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 23652#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23651#L90 [2022-07-14 15:07:47,358 INFO L754 eck$LassoCheckResult]: Loop: 23651#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 23650#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 23649#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 23647#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 23642#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 23644#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 24670#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 24669#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 24668#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 24667#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 24666#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 24665#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23632#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23631#L90 assume !(0 == mp_add_~i~0#1 % 256); 23630#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 23532#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 23628#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 23624#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 23621#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23620#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 23619#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23618#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23617#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23616#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23615#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23614#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23613#L90 assume !(0 == mp_add_~i~0#1 % 256); 23612#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 23611#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 23609#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 23605#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 23603#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23601#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23599#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 23594#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23595#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23588#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23589#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23581#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23579#L90 assume !(0 == mp_add_~i~0#1 % 256); 23577#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 23574#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 23571#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 23567#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 23563#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 23559#L96-8 mp_add_~carry~0#1 := 1; 23557#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23555#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23553#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23551#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 23517#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23549#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23548#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23546#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 23547#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 23542#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23543#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23540#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23539#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23505#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23538#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23536#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23537#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23533#L90 assume !(0 == mp_add_~i~0#1 % 256); 23531#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 23530#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 23528#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 23525#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 23522#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 23521#L96-8 mp_add_~carry~0#1 := 1; 23520#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23519#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23518#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23516#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23515#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23514#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23513#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23511#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 23510#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 23509#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23507#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23506#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23504#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23503#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23432#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23433#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 23653#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 23658#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 23659#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 23654#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 23655#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23651#L90 [2022-07-14 15:07:47,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:47,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 10 times [2022-07-14 15:07:47,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:47,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580038794] [2022-07-14 15:07:47,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:47,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:47,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:47,365 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:47,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:47,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:47,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1983601108, now seen corresponding path program 1 times [2022-07-14 15:07:47,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:47,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784788082] [2022-07-14 15:07:47,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:47,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:47,397 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-14 15:07:47,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:47,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784788082] [2022-07-14 15:07:47,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784788082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:47,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:47,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:07:47,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744548388] [2022-07-14 15:07:47,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:47,399 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:47,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:47,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:07:47,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:07:47,399 INFO L87 Difference]: Start difference. First operand 1392 states and 1749 transitions. cyclomatic complexity: 364 Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 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-14 15:07:47,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:47,439 INFO L93 Difference]: Finished difference Result 1392 states and 1705 transitions. [2022-07-14 15:07:47,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:07:47,440 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1392 states and 1705 transitions. [2022-07-14 15:07:47,443 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1229 [2022-07-14 15:07:47,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1392 states to 1392 states and 1705 transitions. [2022-07-14 15:07:47,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1392 [2022-07-14 15:07:47,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1392 [2022-07-14 15:07:47,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1392 states and 1705 transitions. [2022-07-14 15:07:47,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:47,449 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1392 states and 1705 transitions. [2022-07-14 15:07:47,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states and 1705 transitions. [2022-07-14 15:07:47,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1392. [2022-07-14 15:07:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1392 states have (on average 1.2248563218390804) internal successors, (1705), 1391 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:47,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1705 transitions. [2022-07-14 15:07:47,462 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1392 states and 1705 transitions. [2022-07-14 15:07:47,462 INFO L374 stractBuchiCegarLoop]: Abstraction has 1392 states and 1705 transitions. [2022-07-14 15:07:47,462 INFO L287 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-07-14 15:07:47,462 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1392 states and 1705 transitions. [2022-07-14 15:07:47,465 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1229 [2022-07-14 15:07:47,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:47,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:47,465 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:47,465 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:47,466 INFO L752 eck$LassoCheckResult]: Stem: 26180#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(15, 2); 26166#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 26148#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 26150#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 26152#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 26153#L59-1 mp_add_~nb~0#1 := 4; 26467#L69 assume !(0 == mp_add_~b3~0#1 % 256); 26466#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 26465#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 26463#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 26464#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 27508#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 27507#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 27506#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 26457#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26456#L90 [2022-07-14 15:07:47,466 INFO L754 eck$LassoCheckResult]: Loop: 26456#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 26455#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26453#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 26451#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 26447#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 26449#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 26442#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26443#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26438#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26439#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26434#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 26435#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26431#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26430#L90 assume !(0 == mp_add_~i~0#1 % 256); 26429#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 26329#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 26426#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 26422#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 26424#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 27402#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 26417#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26416#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26414#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26415#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 27391#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26410#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26409#L90 assume !(0 == mp_add_~i~0#1 % 256); 26407#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26405#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 26403#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 26400#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 26398#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26396#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26394#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 26392#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26390#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26388#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 26386#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26377#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26375#L90 assume !(0 == mp_add_~i~0#1 % 256); 26373#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26370#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 26367#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 26364#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 26365#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26383#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26382#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26381#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 26380#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26379#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 26378#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26376#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26374#L90 assume !(0 == mp_add_~i~0#1 % 256); 26372#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26369#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 26366#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 26326#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 26324#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26338#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26337#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26336#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26302#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26335#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 26333#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26334#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26330#L90 assume !(0 == mp_add_~i~0#1 % 256); 26328#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26327#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 26325#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 26323#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 26322#L96 assume !(0 == mp_add_~partial_sum~0#1); 26321#L96-2 assume !false; 26320#L96-4 assume !false; 26319#L96-6 assume !(mp_add_~partial_sum~0#1 >= 0);mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1; 26318#L96-8 mp_add_~carry~0#1 := 1; 26317#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26316#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26315#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26313#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26312#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26311#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 26310#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26308#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 26307#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 26306#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26304#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26303#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26301#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26300#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26228#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 26229#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 26458#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 26462#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 26461#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 26459#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 26460#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26456#L90 [2022-07-14 15:07:47,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:47,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 11 times [2022-07-14 15:07:47,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:47,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747244635] [2022-07-14 15:07:47,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:47,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:47,472 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:47,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:47,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:47,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1164629126, now seen corresponding path program 1 times [2022-07-14 15:07:47,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:47,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427461973] [2022-07-14 15:07:47,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:47,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-07-14 15:07:47,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:47,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427461973] [2022-07-14 15:07:47,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427461973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:47,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 15:07:47,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 15:07:47,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151134412] [2022-07-14 15:07:47,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:47,496 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:47,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:47,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 15:07:47,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 15:07:47,496 INFO L87 Difference]: Start difference. First operand 1392 states and 1705 transitions. cyclomatic complexity: 320 Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:47,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:47,543 INFO L93 Difference]: Finished difference Result 1504 states and 1823 transitions. [2022-07-14 15:07:47,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 15:07:47,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1504 states and 1823 transitions. [2022-07-14 15:07:47,547 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1341 [2022-07-14 15:07:47,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1504 states to 1504 states and 1823 transitions. [2022-07-14 15:07:47,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1504 [2022-07-14 15:07:47,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1504 [2022-07-14 15:07:47,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1504 states and 1823 transitions. [2022-07-14 15:07:47,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:47,553 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1504 states and 1823 transitions. [2022-07-14 15:07:47,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states and 1823 transitions. [2022-07-14 15:07:47,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1423. [2022-07-14 15:07:47,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 1423 states have (on average 1.2241742796907942) internal successors, (1742), 1422 states have internal predecessors, (1742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:47,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1742 transitions. [2022-07-14 15:07:47,567 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1423 states and 1742 transitions. [2022-07-14 15:07:47,567 INFO L374 stractBuchiCegarLoop]: Abstraction has 1423 states and 1742 transitions. [2022-07-14 15:07:47,567 INFO L287 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-07-14 15:07:47,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1423 states and 1742 transitions. [2022-07-14 15:07:47,570 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1260 [2022-07-14 15:07:47,570 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:47,570 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:47,571 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:47,571 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:47,571 INFO L752 eck$LassoCheckResult]: Stem: 29082#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(15, 2); 29066#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 29055#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 29057#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 29059#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 29060#L59-1 mp_add_~nb~0#1 := 4; 29363#L69 assume !(0 == mp_add_~b3~0#1 % 256); 29362#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 29361#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29360#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 29359#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 29358#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 29357#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 29356#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 29354#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29353#L90 [2022-07-14 15:07:47,571 INFO L754 eck$LassoCheckResult]: Loop: 29353#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 29352#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29350#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29348#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29345#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29341#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 29342#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29337#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29338#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29334#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29333#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29332#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 29331#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29330#L90 assume !(0 == mp_add_~i~0#1 % 256); 29329#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 29222#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29326#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29322#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29324#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29317#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 29318#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29313#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29314#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29309#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29307#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 29305#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29304#L90 assume !(0 == mp_add_~i~0#1 % 256); 29303#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29302#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 29301#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29299#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29297#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29295#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29293#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 29291#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29289#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29287#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29285#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 29283#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29277#L90 assume !(0 == mp_add_~i~0#1 % 256); 29280#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29278#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29274#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 29275#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29270#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29268#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29266#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29254#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 29253#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29250#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29251#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 29247#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29245#L90 assume !(0 == mp_add_~i~0#1 % 256); 29246#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29239#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29240#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29265#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29217#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29233#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29231#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29229#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29196#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29228#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29226#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 29227#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29223#L90 assume !(0 == mp_add_~i~0#1 % 256); 29221#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29220#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29218#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29216#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 29215#L96 assume !(0 == mp_add_~partial_sum~0#1); 29214#L96-2 assume !false; 29213#L96-4 assume !false; 29212#L96-6 assume !(mp_add_~partial_sum~0#1 >= 0);mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1; 29211#L96-8 mp_add_~carry~0#1 := 1; 29210#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29209#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29208#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29206#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29205#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29204#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29203#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 29201#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 29200#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29199#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29198#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29197#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29195#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29194#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29121#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29122#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 29355#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 30411#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 30410#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 30409#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 30408#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29353#L90 [2022-07-14 15:07:47,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:47,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 12 times [2022-07-14 15:07:47,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:47,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635942001] [2022-07-14 15:07:47,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:47,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:47,577 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:47,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:47,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:47,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1588275848, now seen corresponding path program 2 times [2022-07-14 15:07:47,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:47,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100165606] [2022-07-14 15:07:47,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:47,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:47,603 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 162 proven. 7 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-14 15:07:47,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:47,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100165606] [2022-07-14 15:07:47,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100165606] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:47,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10000964] [2022-07-14 15:07:47,604 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 15:07:47,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:47,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:47,606 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:07:47,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-07-14 15:07:47,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 15:07:47,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:07:47,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 15:07:47,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:47,674 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 162 proven. 7 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-14 15:07:47,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 162 proven. 7 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-14 15:07:47,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10000964] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:47,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:47,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-07-14 15:07:47,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097854907] [2022-07-14 15:07:47,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:47,699 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:47,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:47,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 15:07:47,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 15:07:47,699 INFO L87 Difference]: Start difference. First operand 1423 states and 1742 transitions. cyclomatic complexity: 326 Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:47,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:47,727 INFO L93 Difference]: Finished difference Result 700 states and 790 transitions. [2022-07-14 15:07:47,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 15:07:47,728 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 700 states and 790 transitions. [2022-07-14 15:07:47,729 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 424 [2022-07-14 15:07:47,731 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 700 states to 556 states and 641 transitions. [2022-07-14 15:07:47,731 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 556 [2022-07-14 15:07:47,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 556 [2022-07-14 15:07:47,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 556 states and 641 transitions. [2022-07-14 15:07:47,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:47,732 INFO L369 hiAutomatonCegarLoop]: Abstraction has 556 states and 641 transitions. [2022-07-14 15:07:47,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states and 641 transitions. [2022-07-14 15:07:47,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 453. [2022-07-14 15:07:47,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 453 states have (on average 1.1280353200883002) internal successors, (511), 452 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:47,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 511 transitions. [2022-07-14 15:07:47,737 INFO L392 hiAutomatonCegarLoop]: Abstraction has 453 states and 511 transitions. [2022-07-14 15:07:47,737 INFO L374 stractBuchiCegarLoop]: Abstraction has 453 states and 511 transitions. [2022-07-14 15:07:47,737 INFO L287 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2022-07-14 15:07:47,737 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 453 states and 511 transitions. [2022-07-14 15:07:47,738 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 321 [2022-07-14 15:07:47,738 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:47,738 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:47,738 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:47,739 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:47,739 INFO L752 eck$LassoCheckResult]: Stem: 31777#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(15, 2); 31766#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 31755#L59 assume !(0 == mp_add_~a3~0#1 % 256); 31756#L59-1 mp_add_~nb~0#1 := 4; 31992#L69 assume !(0 == mp_add_~b3~0#1 % 256); 31991#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 31990#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 31989#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 31988#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 31987#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 31986#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 31985#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 31984#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31983#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 31982#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 31981#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 31980#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 31979#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 31978#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 31977#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 31976#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 31975#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 31974#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31972#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 31973#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 32014#L84 assume !(0 == mp_add_~i~0#1 % 256); 31960#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 31958#L85-1 [2022-07-14 15:07:47,739 INFO L754 eck$LassoCheckResult]: Loop: 31958#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 31957#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 31907#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31908#L90 assume !(0 == mp_add_~i~0#1 % 256); 31923#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 31924#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 31903#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 31904#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 31895#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 31896#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 31887#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 31888#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 31879#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31880#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 31870#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 31872#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31955#L90 assume !(0 == mp_add_~i~0#1 % 256); 32033#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 32032#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 32031#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 32030#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32029#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32028#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 32027#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 32026#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32025#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32024#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32022#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 32021#L84 assume !(0 == mp_add_~i~0#1 % 256); 32020#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 32019#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 32018#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 32008#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 32002#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32009#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32005#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 32000#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 31995#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 31993#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31971#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 31967#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 31963#L84 assume !(0 == mp_add_~i~0#1 % 256); 31964#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 31958#L85-1 [2022-07-14 15:07:47,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:47,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1596563941, now seen corresponding path program 1 times [2022-07-14 15:07:47,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:47,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998018256] [2022-07-14 15:07:47,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:47,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:47,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:47,749 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:47,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:47,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:47,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1729137940, now seen corresponding path program 1 times [2022-07-14 15:07:47,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:47,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198964930] [2022-07-14 15:07:47,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:47,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:47,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:47,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198964930] [2022-07-14 15:07:47,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198964930] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:47,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331769059] [2022-07-14 15:07:47,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:47,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:47,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:47,838 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:07:47,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-07-14 15:07:47,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:47,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 15:07:47,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:47,963 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:47,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 15:07:47,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [331769059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:47,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 15:07:47,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-14 15:07:47,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055421920] [2022-07-14 15:07:47,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:47,964 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:47,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:47,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 15:07:47,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-14 15:07:47,965 INFO L87 Difference]: Start difference. First operand 453 states and 511 transitions. cyclomatic complexity: 64 Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:48,221 INFO L93 Difference]: Finished difference Result 763 states and 854 transitions. [2022-07-14 15:07:48,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 15:07:48,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 763 states and 854 transitions. [2022-07-14 15:07:48,223 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 520 [2022-07-14 15:07:48,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 763 states to 744 states and 835 transitions. [2022-07-14 15:07:48,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 744 [2022-07-14 15:07:48,226 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 744 [2022-07-14 15:07:48,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 744 states and 835 transitions. [2022-07-14 15:07:48,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:48,226 INFO L369 hiAutomatonCegarLoop]: Abstraction has 744 states and 835 transitions. [2022-07-14 15:07:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states and 835 transitions. [2022-07-14 15:07:48,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 455. [2022-07-14 15:07:48,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 455 states have (on average 1.1274725274725275) internal successors, (513), 454 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 513 transitions. [2022-07-14 15:07:48,232 INFO L392 hiAutomatonCegarLoop]: Abstraction has 455 states and 513 transitions. [2022-07-14 15:07:48,232 INFO L374 stractBuchiCegarLoop]: Abstraction has 455 states and 513 transitions. [2022-07-14 15:07:48,232 INFO L287 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2022-07-14 15:07:48,232 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 455 states and 513 transitions. [2022-07-14 15:07:48,233 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 318 [2022-07-14 15:07:48,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:48,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:48,233 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:48,233 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:48,234 INFO L752 eck$LassoCheckResult]: Stem: 33143#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(15, 2); 33131#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 33122#L59 assume !(0 == mp_add_~a3~0#1 % 256); 33123#L59-1 mp_add_~nb~0#1 := 4; 33136#L69 assume !(0 == mp_add_~b3~0#1 % 256); 33295#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 33296#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33291#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 33292#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 33287#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 33288#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 33283#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 33284#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 33279#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 33280#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 33275#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 33276#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 33271#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33272#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 33267#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 33268#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 33263#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 33264#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 33259#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33260#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 33412#L84 assume !(0 == mp_add_~i~0#1 % 256); 33253#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 33249#L85-1 [2022-07-14 15:07:48,234 INFO L754 eck$LassoCheckResult]: Loop: 33249#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 33250#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 33241#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 33242#L90 assume !(0 == mp_add_~i~0#1 % 256); 33247#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 33248#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 33239#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 33240#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33235#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 33236#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 33231#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 33232#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 33227#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 33228#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33223#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 33224#L84 assume !(0 == mp_add_~i~0#1 % 256); 33219#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 33220#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 33215#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 33216#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 33472#L90 assume !(0 == mp_add_~i~0#1 % 256); 33471#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 33470#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 33469#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 33468#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33467#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 33466#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 33465#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 33464#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 33463#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 33462#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33460#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 33459#L84 assume !(0 == mp_add_~i~0#1 % 256); 33458#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 33457#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 33456#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 33404#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 33399#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33453#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 33397#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 33378#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 33302#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 33298#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 33299#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33415#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 33254#L84 assume !(0 == mp_add_~i~0#1 % 256); 33255#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 33249#L85-1 [2022-07-14 15:07:48,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:48,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1596563941, now seen corresponding path program 2 times [2022-07-14 15:07:48,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:48,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830862273] [2022-07-14 15:07:48,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:48,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:48,244 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:48,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:48,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:48,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:48,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2031036704, now seen corresponding path program 1 times [2022-07-14 15:07:48,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:48,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922958378] [2022-07-14 15:07:48,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:48,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:48,304 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:48,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:48,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922958378] [2022-07-14 15:07:48,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922958378] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:48,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503259292] [2022-07-14 15:07:48,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:48,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:48,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:48,306 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:07:48,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-07-14 15:07:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:48,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 15:07:48,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-14 15:07:48,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 15:07:48,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503259292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:48,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 15:07:48,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-14 15:07:48,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627579874] [2022-07-14 15:07:48,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:48,403 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:48,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:48,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 15:07:48,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 15:07:48,404 INFO L87 Difference]: Start difference. First operand 455 states and 513 transitions. cyclomatic complexity: 64 Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:48,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:48,521 INFO L93 Difference]: Finished difference Result 569 states and 637 transitions. [2022-07-14 15:07:48,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 15:07:48,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 569 states and 637 transitions. [2022-07-14 15:07:48,523 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 413 [2022-07-14 15:07:48,524 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 569 states to 515 states and 561 transitions. [2022-07-14 15:07:48,524 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 515 [2022-07-14 15:07:48,524 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 515 [2022-07-14 15:07:48,524 INFO L73 IsDeterministic]: Start isDeterministic. Operand 515 states and 561 transitions. [2022-07-14 15:07:48,525 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:48,525 INFO L369 hiAutomatonCegarLoop]: Abstraction has 515 states and 561 transitions. [2022-07-14 15:07:48,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states and 561 transitions. [2022-07-14 15:07:48,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 462. [2022-07-14 15:07:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 462 states have (on average 1.0952380952380953) internal successors, (506), 461 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:48,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 506 transitions. [2022-07-14 15:07:48,530 INFO L392 hiAutomatonCegarLoop]: Abstraction has 462 states and 506 transitions. [2022-07-14 15:07:48,530 INFO L374 stractBuchiCegarLoop]: Abstraction has 462 states and 506 transitions. [2022-07-14 15:07:48,530 INFO L287 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2022-07-14 15:07:48,530 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 462 states and 506 transitions. [2022-07-14 15:07:48,531 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 360 [2022-07-14 15:07:48,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:48,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:48,531 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:48,531 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:48,532 INFO L752 eck$LassoCheckResult]: Stem: 34317#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(15, 2); 34305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 34296#L59 assume !(0 == mp_add_~a3~0#1 % 256); 34297#L59-1 mp_add_~nb~0#1 := 4; 34572#L69 assume !(0 == mp_add_~b3~0#1 % 256); 34571#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 34570#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34569#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34568#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 34567#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34566#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34565#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34564#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34563#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 34562#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 34561#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 34560#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34559#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34558#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 34557#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34556#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34555#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34554#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34552#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34551#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34549#L84 assume !(0 == mp_add_~i~0#1 % 256); 34548#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 34547#L85-1 [2022-07-14 15:07:48,532 INFO L754 eck$LassoCheckResult]: Loop: 34547#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34545#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34536#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34537#L90 assume !(0 == mp_add_~i~0#1 % 256); 34542#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 34540#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 34538#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34534#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34532#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34530#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 34528#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34526#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34524#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34522#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34519#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34517#L84 assume !(0 == mp_add_~i~0#1 % 256); 34515#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34513#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 34511#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34509#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34508#L90 assume !(0 == mp_add_~i~0#1 % 256); 34507#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 34506#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 34503#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34504#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34499#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34500#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34495#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 34496#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34489#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34490#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34480#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34481#L84 assume !(0 == mp_add_~i~0#1 % 256); 34471#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34472#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34463#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 34464#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 34585#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34605#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34604#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34603#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34602#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 34574#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34601#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34599#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34598#L84 assume !(0 == mp_add_~i~0#1 % 256); 34597#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34596#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34593#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34589#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 34583#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34581#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34579#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34577#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34575#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34553#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34487#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34488#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34478#L84 assume !(0 == mp_add_~i~0#1 % 256); 34479#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 34547#L85-1 [2022-07-14 15:07:48,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:48,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1596563941, now seen corresponding path program 3 times [2022-07-14 15:07:48,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:48,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53339819] [2022-07-14 15:07:48,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:48,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:48,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:48,540 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:48,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:48,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:48,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1710168569, now seen corresponding path program 2 times [2022-07-14 15:07:48,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:48,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425180151] [2022-07-14 15:07:48,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:48,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:48,593 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 71 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:48,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:48,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425180151] [2022-07-14 15:07:48,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425180151] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:48,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098157132] [2022-07-14 15:07:48,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 15:07:48,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:48,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:48,595 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:07:48,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-07-14 15:07:48,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 15:07:48,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 15:07:48,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 15:07:48,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-14 15:07:48,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 15:07:48,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098157132] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 15:07:48,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 15:07:48,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2022-07-14 15:07:48,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340556965] [2022-07-14 15:07:48,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 15:07:48,717 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:48,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:48,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 15:07:48,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 15:07:48,718 INFO L87 Difference]: Start difference. First operand 462 states and 506 transitions. cyclomatic complexity: 50 Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:48,809 INFO L93 Difference]: Finished difference Result 459 states and 494 transitions. [2022-07-14 15:07:48,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 15:07:48,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 459 states and 494 transitions. [2022-07-14 15:07:48,811 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 196 [2022-07-14 15:07:48,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 459 states to 459 states and 494 transitions. [2022-07-14 15:07:48,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 459 [2022-07-14 15:07:48,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 459 [2022-07-14 15:07:48,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 459 states and 494 transitions. [2022-07-14 15:07:48,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:48,813 INFO L369 hiAutomatonCegarLoop]: Abstraction has 459 states and 494 transitions. [2022-07-14 15:07:48,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 494 transitions. [2022-07-14 15:07:48,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 395. [2022-07-14 15:07:48,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 395 states have (on average 1.0734177215189873) internal successors, (424), 394 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:48,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 424 transitions. [2022-07-14 15:07:48,818 INFO L392 hiAutomatonCegarLoop]: Abstraction has 395 states and 424 transitions. [2022-07-14 15:07:48,818 INFO L374 stractBuchiCegarLoop]: Abstraction has 395 states and 424 transitions. [2022-07-14 15:07:48,818 INFO L287 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2022-07-14 15:07:48,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 395 states and 424 transitions. [2022-07-14 15:07:48,819 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 151 [2022-07-14 15:07:48,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:48,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:48,819 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:48,819 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-14 15:07:48,820 INFO L752 eck$LassoCheckResult]: Stem: 35427#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(15, 2); 35417#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 35404#L59 assume !(0 == mp_add_~a3~0#1 % 256); 35405#L59-1 mp_add_~nb~0#1 := 4; 35683#L69 assume !(0 == mp_add_~b3~0#1 % 256); 35682#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 35681#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35680#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35679#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 35678#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35677#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35676#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35675#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35674#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 35673#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 35672#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 35671#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 35670#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35669#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 35668#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35667#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35666#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35665#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35664#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35663#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35662#L84 assume !(0 == mp_add_~i~0#1 % 256); 35661#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 35659#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35657#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35654#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 35652#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35650#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35648#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 35646#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35644#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35642#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35640#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35637#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35635#L84 assume !(0 == mp_add_~i~0#1 % 256); 35633#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35631#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 35628#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35615#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 35611#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35612#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35606#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35607#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 35599#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35600#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35591#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35592#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35583#L84 assume !(0 == mp_add_~i~0#1 % 256); 35584#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35575#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35576#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 35569#L83-1 [2022-07-14 15:07:48,820 INFO L754 eck$LassoCheckResult]: Loop: 35569#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 35570#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35716#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35715#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35713#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35711#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 35691#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35708#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35707#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35705#L84 assume !(0 == mp_add_~i~0#1 % 256); 35702#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35700#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35688#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35458#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 35459#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35452#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35453#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35561#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35605#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35597#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35598#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35590#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35585#L84 assume !(0 == mp_add_~i~0#1 % 256); 35586#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35577#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35578#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 35569#L83-1 [2022-07-14 15:07:48,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:48,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1143904857, now seen corresponding path program 1 times [2022-07-14 15:07:48,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:48,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373391899] [2022-07-14 15:07:48,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:48,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:48,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 41 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-07-14 15:07:48,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:48,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373391899] [2022-07-14 15:07:48,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373391899] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:48,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150578974] [2022-07-14 15:07:48,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:48,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:48,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:48,867 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:07:48,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-07-14 15:07:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:48,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 15:07:48,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:49,014 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-14 15:07:49,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:49,102 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 42 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-14 15:07:49,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150578974] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:49,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:49,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2022-07-14 15:07:49,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260316424] [2022-07-14 15:07:49,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:49,103 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:49,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:49,103 INFO L85 PathProgramCache]: Analyzing trace with hash -860927907, now seen corresponding path program 1 times [2022-07-14 15:07:49,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:49,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230302894] [2022-07-14 15:07:49,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:49,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:49,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:49,139 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:49,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:49,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230302894] [2022-07-14 15:07:49,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230302894] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:49,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126919776] [2022-07-14 15:07:49,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:49,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:49,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:49,142 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:07:49,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:49,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-07-14 15:07:49,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 15:07:49,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:49,212 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:49,212 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:49,253 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 15:07:49,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126919776] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:49,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:49,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-07-14 15:07:49,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398042191] [2022-07-14 15:07:49,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:49,254 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 15:07:49,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:49,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 15:07:49,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-07-14 15:07:49,255 INFO L87 Difference]: Start difference. First operand 395 states and 424 transitions. cyclomatic complexity: 34 Second operand has 13 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:49,592 INFO L93 Difference]: Finished difference Result 507 states and 540 transitions. [2022-07-14 15:07:49,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 15:07:49,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 507 states and 540 transitions. [2022-07-14 15:07:49,593 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 78 [2022-07-14 15:07:49,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 507 states to 505 states and 532 transitions. [2022-07-14 15:07:49,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 505 [2022-07-14 15:07:49,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 505 [2022-07-14 15:07:49,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 505 states and 532 transitions. [2022-07-14 15:07:49,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:49,595 INFO L369 hiAutomatonCegarLoop]: Abstraction has 505 states and 532 transitions. [2022-07-14 15:07:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states and 532 transitions. [2022-07-14 15:07:49,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 404. [2022-07-14 15:07:49,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 404 states have (on average 1.0445544554455446) internal successors, (422), 403 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:49,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 422 transitions. [2022-07-14 15:07:49,599 INFO L392 hiAutomatonCegarLoop]: Abstraction has 404 states and 422 transitions. [2022-07-14 15:07:49,599 INFO L374 stractBuchiCegarLoop]: Abstraction has 404 states and 422 transitions. [2022-07-14 15:07:49,600 INFO L287 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2022-07-14 15:07:49,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 404 states and 422 transitions. [2022-07-14 15:07:49,600 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 50 [2022-07-14 15:07:49,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:49,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:49,601 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:49,601 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:49,601 INFO L752 eck$LassoCheckResult]: Stem: 36848#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(15, 2); 36838#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 36824#L59 assume !(0 == mp_add_~a3~0#1 % 256); 36825#L59-1 mp_add_~nb~0#1 := 4; 37105#L69 assume !(0 == mp_add_~b3~0#1 % 256); 37104#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 37103#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 37102#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37101#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 37100#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 37099#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 37098#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 37097#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 37096#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 37095#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 37094#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 37093#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 37092#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 37091#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 37090#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37089#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37088#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37087#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37086#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 37085#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37084#L84 assume !(0 == mp_add_~i~0#1 % 256); 37083#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 37082#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 37080#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 37077#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 37072#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 37073#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37064#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 37065#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37058#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37059#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37052#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 37053#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37045#L84 assume !(0 == mp_add_~i~0#1 % 256); 37046#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 37039#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 37040#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 37035#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 37034#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 37033#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37032#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37031#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 37030#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37029#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37028#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 37027#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37026#L84 assume !(0 == mp_add_~i~0#1 % 256); 37025#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 37024#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 37023#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 37022#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 37021#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 37020#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37019#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37018#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37017#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 37016#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37015#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 37014#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37013#L84 assume !(0 == mp_add_~i~0#1 % 256); 37012#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 37011#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 37010#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 37009#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 37008#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 37007#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37006#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37005#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37004#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37003#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37002#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 37001#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37000#L84 assume !(0 == mp_add_~i~0#1 % 256); 36999#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 36998#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 36997#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 36987#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 36988#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 37222#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37220#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37218#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37216#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37214#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37212#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 36880#L83 [2022-07-14 15:07:49,601 INFO L754 eck$LassoCheckResult]: Loop: 36880#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 36881#L84 assume !(0 == mp_add_~i~0#1 % 256); 37227#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 37226#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 37225#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 37224#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 37223#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 37221#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37219#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37217#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37215#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37213#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37211#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 36880#L83 [2022-07-14 15:07:49,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:49,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1357058734, now seen corresponding path program 1 times [2022-07-14 15:07:49,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:49,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528123941] [2022-07-14 15:07:49,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:49,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 91 proven. 3 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-14 15:07:49,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:49,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528123941] [2022-07-14 15:07:49,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528123941] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:49,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795001901] [2022-07-14 15:07:49,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:49,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:49,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:49,672 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:07:49,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-07-14 15:07:49,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:49,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 15:07:49,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:49,843 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 88 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-14 15:07:49,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 92 proven. 3 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-14 15:07:49,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795001901] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:49,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:49,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2022-07-14 15:07:49,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924804606] [2022-07-14 15:07:49,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:49,923 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:49,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:49,924 INFO L85 PathProgramCache]: Analyzing trace with hash -550141162, now seen corresponding path program 1 times [2022-07-14 15:07:49,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:49,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032732476] [2022-07-14 15:07:49,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:49,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:49,927 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:49,929 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:50,015 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:07:50,016 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:07:50,016 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:07:50,016 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:07:50,016 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 15:07:50,016 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:50,016 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:07:50,016 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:07:50,016 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration24_Loop [2022-07-14 15:07:50,016 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:07:50,016 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:07:50,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:50,555 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:07:50,555 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 15:07:50,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:50,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:50,557 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:50,558 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-07-14 15:07:50,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:07:50,560 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:07:50,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:50,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:50,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:50,743 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:50,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-07-14 15:07:50,745 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 15:07:50,745 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:07:50,855 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 15:07:50,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-14 15:07:50,858 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:07:50,858 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:07:50,859 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:07:50,859 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:07:50,859 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:07:50,859 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:50,859 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:07:50,859 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:07:50,859 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration24_Loop [2022-07-14 15:07:50,859 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:07:50,859 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:07:50,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:51,280 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:07:51,280 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:07:51,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:51,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:51,281 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:51,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-07-14 15:07:51,284 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:51,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:51,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:51,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:51,289 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:07:51,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:51,296 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:07:51,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:51,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:51,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:51,326 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-14 15:07:51,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:51,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:51,340 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:51,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-07-14 15:07:51,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:51,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:51,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:51,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:51,349 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:07:51,349 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:07:51,357 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:51,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:51,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:51,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:51,389 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-14 15:07:51,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:51,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:51,390 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:51,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-07-14 15:07:51,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:51,398 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:51,398 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:51,398 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:51,399 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:07:51,399 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:07:51,409 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-14 15:07:51,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:51,425 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:51,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:51,441 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-14 15:07:51,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:51,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:51,442 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:51,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:51,466 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:51,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:51,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:51,466 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:07:51,466 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:07:51,479 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2022-07-14 15:07:51,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:51,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-07-14 15:07:51,495 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:51,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:51,511 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-14 15:07:51,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:51,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:51,512 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:51,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:51,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Waiting until timeout for monitored process [2022-07-14 15:07:51,528 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:51,528 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:07:51,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:51,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:51,528 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:07:51,528 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:07:51,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:51,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:51,554 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:51,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:51,570 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-14 15:07:51,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:51,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:51,571 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:51,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-07-14 15:07:51,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:51,594 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:51,594 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-14 15:07:51,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:51,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:51,594 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:07:51,595 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:07:51,608 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-14 15:07:51,608 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:51,634 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:51,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:51,651 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-14 15:07:51,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:51,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:51,664 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:51,668 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:51,674 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:51,674 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:07:51,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:51,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:51,674 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:07:51,674 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:07:51,691 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2022-07-14 15:07:51,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:51,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-07-14 15:07:51,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:51,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:51,744 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-14 15:07:51,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:51,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:51,746 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:51,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-07-14 15:07:51,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:51,754 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:51,754 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:07:51,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:51,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:51,754 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:07:51,754 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:07:51,765 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-14 15:07:51,766 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:51,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:51,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:51,803 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-14 15:07:51,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:51,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:51,816 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:51,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-14 15:07:51,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:51,824 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:51,824 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:07:51,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:51,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:51,824 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:07:51,824 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-14 15:07:51,841 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-14 15:07:51,842 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:51,868 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:51,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:51,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:51,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 15:07:51,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2022-07-14 15:07:51,885 INFO L87 Difference]: Start difference. First operand 404 states and 422 transitions. cyclomatic complexity: 22 Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:51,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:51,981 INFO L93 Difference]: Finished difference Result 350 states and 364 transitions. [2022-07-14 15:07:51,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 15:07:51,982 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 350 states and 364 transitions. [2022-07-14 15:07:51,983 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 43 [2022-07-14 15:07:51,984 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 350 states to 350 states and 364 transitions. [2022-07-14 15:07:51,984 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350 [2022-07-14 15:07:51,984 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 350 [2022-07-14 15:07:51,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 350 states and 364 transitions. [2022-07-14 15:07:51,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:51,984 INFO L369 hiAutomatonCegarLoop]: Abstraction has 350 states and 364 transitions. [2022-07-14 15:07:51,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states and 364 transitions. [2022-07-14 15:07:51,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 331. [2022-07-14 15:07:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 331 states have (on average 1.042296072507553) internal successors, (345), 330 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 345 transitions. [2022-07-14 15:07:51,987 INFO L392 hiAutomatonCegarLoop]: Abstraction has 331 states and 345 transitions. [2022-07-14 15:07:51,987 INFO L374 stractBuchiCegarLoop]: Abstraction has 331 states and 345 transitions. [2022-07-14 15:07:51,987 INFO L287 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2022-07-14 15:07:51,987 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331 states and 345 transitions. [2022-07-14 15:07:51,988 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2022-07-14 15:07:51,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:51,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:51,988 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:51,988 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:51,988 INFO L752 eck$LassoCheckResult]: Stem: 38149#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(15, 2); 38137#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 38128#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 38130#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 38132#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 38133#L59-1 mp_add_~nb~0#1 := 4; 38281#L69 assume !(0 == mp_add_~b3~0#1 % 256); 38280#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 38279#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38278#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 38277#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 38276#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 38275#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 38274#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 38273#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38272#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 38271#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 38270#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 38269#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38268#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 38267#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 38266#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38265#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38264#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38263#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38262#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38261#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 38260#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38259#L90 assume !(0 == mp_add_~i~0#1 % 256); 38258#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 38257#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 38256#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38255#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 38254#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38253#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 38252#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38251#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38250#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38249#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38248#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 38247#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38246#L90 assume !(0 == mp_add_~i~0#1 % 256); 38245#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 38244#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 38243#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38242#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 38241#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38240#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38239#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 38238#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38237#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38236#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38235#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 38234#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38233#L90 assume !(0 == mp_add_~i~0#1 % 256); 38232#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 38231#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 38230#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 38229#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 38228#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38227#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38226#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38225#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 38224#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38223#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38222#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 38221#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38220#L90 assume !(0 == mp_add_~i~0#1 % 256); 38219#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 38218#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 38217#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38216#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 38215#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38214#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38213#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38212#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38211#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38210#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38209#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 38208#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38207#L90 assume !(0 == mp_add_~i~0#1 % 256); 38206#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 38205#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 38204#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38203#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 38202#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38201#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38200#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38199#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38198#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38197#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38164#L83 [2022-07-14 15:07:51,989 INFO L754 eck$LassoCheckResult]: Loop: 38164#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 38196#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38195#L90 assume !(0 == mp_add_~i~0#1 % 256); 38194#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 38192#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 38189#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38188#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 38187#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38186#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38185#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38184#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38183#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38163#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38164#L83 [2022-07-14 15:07:51,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:51,989 INFO L85 PathProgramCache]: Analyzing trace with hash 346319115, now seen corresponding path program 1 times [2022-07-14 15:07:51,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:51,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120401990] [2022-07-14 15:07:51,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:51,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 100 proven. 90 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-14 15:07:52,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:52,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120401990] [2022-07-14 15:07:52,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120401990] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:52,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433506426] [2022-07-14 15:07:52,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:52,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:52,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:52,068 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:07:52,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-07-14 15:07:52,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:52,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 15:07:52,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:52,528 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 96 proven. 20 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-14 15:07:52,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:56,365 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 88 proven. 28 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-14 15:07:56,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433506426] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:56,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:56,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-07-14 15:07:56,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126490811] [2022-07-14 15:07:56,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:56,368 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:56,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:56,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1677168882, now seen corresponding path program 1 times [2022-07-14 15:07:56,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:56,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593887754] [2022-07-14 15:07:56,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:56,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:56,391 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:56,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:56,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:56,507 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:07:56,507 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:07:56,507 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:07:56,507 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:07:56,507 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 15:07:56,507 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:56,507 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:07:56,507 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:07:56,507 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration25_Loop [2022-07-14 15:07:56,507 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:07:56,507 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:07:56,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:56,958 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:07:56,958 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 15:07:56,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:56,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:56,967 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:56,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-14 15:07:56,977 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:07:56,978 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:07:57,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:57,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:57,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:57,162 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:57,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-14 15:07:57,164 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 15:07:57,164 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:07:57,260 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 15:07:57,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:57,264 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:07:57,264 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:07:57,264 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:07:57,264 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:07:57,264 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:07:57,264 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:57,265 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:07:57,265 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:07:57,265 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration25_Loop [2022-07-14 15:07:57,265 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:07:57,265 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:07:57,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:57,766 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:07:57,767 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:07:57,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:57,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:57,768 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:57,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-14 15:07:57,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:57,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:57,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:57,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:57,777 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:07:57,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:07:57,783 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:07:57,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:57,797 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:57,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:57,814 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-14 15:07:57,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:57,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:57,815 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:57,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-14 15:07:57,825 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:57,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:57,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:57,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:57,831 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:07:57,831 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:07:57,844 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:57,844 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:57,860 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:57,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:57,876 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-14 15:07:57,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:57,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:57,878 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:57,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-14 15:07:57,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:57,912 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:57,912 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:57,912 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:57,912 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:07:57,912 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:07:57,922 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-14 15:07:57,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:57,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:57,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-14 15:07:57,951 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-14 15:07:57,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:57,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:57,952 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:57,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-14 15:07:57,955 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:57,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:07:57,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:57,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:57,962 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:07:57,962 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:07:57,975 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2022-07-14 15:07:57,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:57,989 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:58,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:58,006 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-14 15:07:58,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:58,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:58,014 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:58,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-14 15:07:58,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:58,038 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:58,038 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:07:58,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:58,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:58,039 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:07:58,039 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:07:58,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:07:58,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:58,071 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:58,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-07-14 15:07:58,088 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-14 15:07:58,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:58,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:58,089 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:58,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-07-14 15:07:58,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:58,103 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:58,103 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-14 15:07:58,103 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:58,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:58,103 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:07:58,103 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:07:58,115 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-14 15:07:58,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:58,146 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:58,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-07-14 15:07:58,163 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-14 15:07:58,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:58,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:58,164 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:58,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-07-14 15:07:58,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:58,174 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:58,174 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:07:58,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:58,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:58,174 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:07:58,174 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:07:58,189 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2022-07-14 15:07:58,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:58,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:58,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:58,241 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-14 15:07:58,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:58,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:58,242 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:58,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-07-14 15:07:58,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:58,250 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:58,250 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:07:58,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:58,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:58,250 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:07:58,250 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:07:58,261 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-14 15:07:58,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:58,277 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:58,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:58,294 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-14 15:07:58,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:58,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:58,295 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:58,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-07-14 15:07:58,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:07:58,304 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:07:58,304 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:07:58,304 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:07:58,304 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:07:58,304 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 15:07:58,304 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-14 15:07:58,321 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-14 15:07:58,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:07:58,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:07:58,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2022-07-14 15:07:58,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:07:58,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-14 15:07:58,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-07-14 15:07:58,365 INFO L87 Difference]: Start difference. First operand 331 states and 345 transitions. cyclomatic complexity: 17 Second operand has 17 states, 17 states have (on average 8.588235294117647) internal successors, (146), 17 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:07:59,149 INFO L93 Difference]: Finished difference Result 281 states and 286 transitions. [2022-07-14 15:07:59,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 15:07:59,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 281 states and 286 transitions. [2022-07-14 15:07:59,150 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-14 15:07:59,151 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 281 states to 214 states and 219 transitions. [2022-07-14 15:07:59,151 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2022-07-14 15:07:59,151 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2022-07-14 15:07:59,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 219 transitions. [2022-07-14 15:07:59,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:07:59,151 INFO L369 hiAutomatonCegarLoop]: Abstraction has 214 states and 219 transitions. [2022-07-14 15:07:59,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states and 219 transitions. [2022-07-14 15:07:59,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 183. [2022-07-14 15:07:59,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 183 states have (on average 1.0273224043715847) internal successors, (188), 182 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:07:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 188 transitions. [2022-07-14 15:07:59,153 INFO L392 hiAutomatonCegarLoop]: Abstraction has 183 states and 188 transitions. [2022-07-14 15:07:59,153 INFO L374 stractBuchiCegarLoop]: Abstraction has 183 states and 188 transitions. [2022-07-14 15:07:59,153 INFO L287 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2022-07-14 15:07:59,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 188 transitions. [2022-07-14 15:07:59,153 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-14 15:07:59,153 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:07:59,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:07:59,154 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:59,154 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:07:59,154 INFO L752 eck$LassoCheckResult]: Stem: 39337#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(15, 2); 39328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 39315#L59 assume !(0 == mp_add_~a3~0#1 % 256); 39316#L59-1 mp_add_~nb~0#1 := 4; 39333#L69 assume !(0 == mp_add_~b3~0#1 % 256); 39334#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 39398#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39399#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39394#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 39395#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39390#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39391#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39386#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 39387#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 39382#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 39383#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 39378#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 39379#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 39374#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 39375#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39370#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39371#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39366#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39367#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39362#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39363#L84 assume !(0 == mp_add_~i~0#1 % 256); 39358#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 39359#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39354#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39355#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 39350#L90 assume !(0 == mp_add_~i~0#1 % 256); 39351#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 39446#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 39444#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 39442#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 39440#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39438#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 39436#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39434#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39432#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39430#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39428#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 39402#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 39491#L90 assume !(0 == mp_add_~i~0#1 % 256); 39490#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 39489#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 39487#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 39485#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 39483#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39481#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39478#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 39477#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39476#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39475#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39403#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 39384#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 39385#L90 assume !(0 == mp_add_~i~0#1 % 256); 39347#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 39321#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 39322#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 39323#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 39497#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39496#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39495#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39341#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 39342#L102-1 [2022-07-14 15:07:59,163 INFO L754 eck$LassoCheckResult]: Loop: 39342#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39338#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39339#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39335#L84 assume !(0 == mp_add_~i~0#1 % 256); 39336#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39340#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39329#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39330#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 39324#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 39325#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39332#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39326#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39327#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39342#L102-1 [2022-07-14 15:07:59,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:59,164 INFO L85 PathProgramCache]: Analyzing trace with hash -511302633, now seen corresponding path program 1 times [2022-07-14 15:07:59,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:59,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471459384] [2022-07-14 15:07:59,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:59,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 45 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 15:07:59,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:07:59,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471459384] [2022-07-14 15:07:59,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471459384] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:07:59,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071708085] [2022-07-14 15:07:59,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:59,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:07:59,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:59,266 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:07:59,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-07-14 15:07:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:07:59,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 15:07:59,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:07:59,544 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-14 15:07:59,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:07:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 61 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 15:07:59,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071708085] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:07:59,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:07:59,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 6] total 12 [2022-07-14 15:07:59,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628977621] [2022-07-14 15:07:59,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:07:59,664 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 15:07:59,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:07:59,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1466073576, now seen corresponding path program 2 times [2022-07-14 15:07:59,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:07:59,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569221157] [2022-07-14 15:07:59,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:07:59,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:07:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:59,671 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:07:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:07:59,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:07:59,742 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:07:59,742 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:07:59,742 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:07:59,743 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:07:59,743 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 15:07:59,743 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:59,743 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:07:59,743 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:07:59,743 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration26_Loop [2022-07-14 15:07:59,743 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:07:59,743 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:07:59,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:59,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:07:59,897 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:07:59,897 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 15:07:59,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:59,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:59,899 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:59,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-07-14 15:07:59,902 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:07:59,902 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:07:59,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-07-14 15:07:59,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:07:59,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:07:59,953 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:07:59,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-07-14 15:07:59,955 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 15:07:59,955 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:08:00,487 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 15:08:00,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:00,493 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:08:00,493 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:08:00,493 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:08:00,493 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:08:00,493 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:08:00,493 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:00,493 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:08:00,493 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:08:00,493 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration26_Loop [2022-07-14 15:08:00,493 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:08:00,493 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:08:00,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:08:00,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:08:00,648 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:08:00,648 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:08:00,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:00,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:00,650 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:00,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-07-14 15:08:00,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:00,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:08:00,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:00,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:00,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:00,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:08:00,688 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:08:00,688 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:00,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:00,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:00,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:00,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:00,708 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:00,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-07-14 15:08:00,711 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:00,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:08:00,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:00,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:00,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:00,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:08:00,720 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:08:00,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:00,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:00,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:00,739 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-14 15:08:00,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:00,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:00,741 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:00,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-07-14 15:08:00,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:00,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:08:00,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:00,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:00,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:00,751 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:08:00,753 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-14 15:08:00,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:00,785 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:00,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2022-07-14 15:08:00,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:00,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:00,802 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:00,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-07-14 15:08:00,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:00,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:08:00,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:00,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:00,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:00,811 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:08:00,812 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-14 15:08:00,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:00,814 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:00,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2022-07-14 15:08:00,830 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-14 15:08:00,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:00,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:00,832 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:00,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-07-14 15:08:00,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:00,841 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:08:00,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:00,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:00,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:00,842 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:08:00,845 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:08:00,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:00,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:00,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2022-07-14 15:08:00,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:00,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:00,866 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:00,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-07-14 15:08:00,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:00,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:08:00,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:00,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:00,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:00,875 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:08:00,876 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:08:00,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:00,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:00,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:00,896 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-14 15:08:00,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:00,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:00,898 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:00,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-07-14 15:08:00,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:00,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:08:00,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:00,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:00,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:00,907 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:08:00,911 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-14 15:08:00,911 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:00,916 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:00,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:00,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:00,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:00,934 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:00,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-07-14 15:08:00,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:00,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:08:00,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:00,942 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:00,942 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:00,942 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:08:00,944 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-14 15:08:00,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:00,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:00,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2022-07-14 15:08:00,963 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-14 15:08:00,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:00,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:00,965 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:00,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-07-14 15:08:00,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:00,973 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:00,973 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:08:00,973 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:00,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:00,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:00,974 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:08:00,976 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-14 15:08:00,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:00,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:00,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2022-07-14 15:08:00,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:00,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:00,999 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:01,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-07-14 15:08:01,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:01,007 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:01,007 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:08:01,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:01,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:01,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:01,007 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:08:01,009 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-14 15:08:01,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:01,012 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:01,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:01,028 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-14 15:08:01,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:01,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:01,030 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:01,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-07-14 15:08:01,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:01,041 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:01,041 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-14 15:08:01,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:01,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:01,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:01,042 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:08:01,047 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:08:01,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:01,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:01,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:01,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:01,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:01,077 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:01,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-07-14 15:08:01,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:01,086 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:01,086 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-14 15:08:01,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:01,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:01,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:01,086 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:08:01,088 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:08:01,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:01,093 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:01,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2022-07-14 15:08:01,109 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-14 15:08:01,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:01,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:01,111 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:01,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-07-14 15:08:01,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:01,119 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:01,119 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:08:01,119 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:01,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:01,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:01,120 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:08:01,124 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-14 15:08:01,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:01,136 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:01,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:01,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:01,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:01,154 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:01,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-07-14 15:08:01,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:01,162 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:01,163 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:08:01,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:01,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:01,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:01,163 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:08:01,165 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-14 15:08:01,165 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:01,181 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:01,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2022-07-14 15:08:01,197 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-14 15:08:01,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:01,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:01,198 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:01,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-07-14 15:08:01,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:01,206 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:01,206 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:08:01,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:01,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:01,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:01,206 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:08:01,209 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:08:01,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:01,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:01,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2022-07-14 15:08:01,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:01,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:01,232 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:01,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-07-14 15:08:01,234 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:01,239 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:01,240 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:08:01,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:01,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:01,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:01,240 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:08:01,242 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:08:01,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:01,257 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:01,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2022-07-14 15:08:01,272 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-14 15:08:01,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:01,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:01,274 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:01,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-07-14 15:08:01,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:01,282 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:01,282 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:08:01,282 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:01,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:01,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:01,283 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-14 15:08:01,288 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:08:01,288 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:01,303 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:01,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2022-07-14 15:08:01,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:01,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:01,320 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:01,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-07-14 15:08:01,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:01,329 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:01,329 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:08:01,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:01,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:01,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:01,329 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-14 15:08:01,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:08:01,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:01,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:01,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:01,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:08:01,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 15:08:01,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-14 15:08:01,363 INFO L87 Difference]: Start difference. First operand 183 states and 188 transitions. cyclomatic complexity: 6 Second operand has 12 states, 12 states have (on average 9.75) internal successors, (117), 12 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:08:01,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:08:01,675 INFO L93 Difference]: Finished difference Result 247 states and 248 transitions. [2022-07-14 15:08:01,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 15:08:01,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 247 states and 248 transitions. [2022-07-14 15:08:01,676 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2022-07-14 15:08:01,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 247 states to 165 states and 166 transitions. [2022-07-14 15:08:01,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 165 [2022-07-14 15:08:01,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 165 [2022-07-14 15:08:01,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 165 states and 166 transitions. [2022-07-14 15:08:01,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:08:01,677 INFO L369 hiAutomatonCegarLoop]: Abstraction has 165 states and 166 transitions. [2022-07-14 15:08:01,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states and 166 transitions. [2022-07-14 15:08:01,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 123. [2022-07-14 15:08:01,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.008130081300813) internal successors, (124), 122 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:08:01,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2022-07-14 15:08:01,678 INFO L392 hiAutomatonCegarLoop]: Abstraction has 123 states and 124 transitions. [2022-07-14 15:08:01,678 INFO L374 stractBuchiCegarLoop]: Abstraction has 123 states and 124 transitions. [2022-07-14 15:08:01,678 INFO L287 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2022-07-14 15:08:01,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 124 transitions. [2022-07-14 15:08:01,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-14 15:08:01,679 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 15:08:01,679 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 15:08:01,679 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:08:01,679 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 15:08:01,679 INFO L752 eck$LassoCheckResult]: Stem: 40175#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(15, 2); 40166#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 40159#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 40160#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 40162#L63 assume !(0 == mp_add_~a1~0#1 % 256); 40163#L59-1 mp_add_~nb~0#1 := 4; 40171#L69 assume !(0 == mp_add_~b3~0#1 % 256); 40172#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 40228#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40229#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 40224#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 40225#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 40220#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 40221#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 40216#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 40217#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 40212#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 40213#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 40208#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 40209#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 40204#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 40205#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 40200#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 40201#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 40196#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 40197#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40192#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 40193#L84 assume !(0 == mp_add_~i~0#1 % 256); 40188#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 40189#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 40263#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 40262#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 40261#L90 assume !(0 == mp_add_~i~0#1 % 256); 40260#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 40259#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 40258#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 40257#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 40256#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 40255#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 40253#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 40254#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 40273#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 40272#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40184#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 40185#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 40270#L90 assume !(0 == mp_add_~i~0#1 % 256); 40269#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 40268#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 40267#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 40266#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 40265#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 40264#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 40252#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 40251#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 40183#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 40176#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40177#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 40271#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 40181#L90 assume !(0 == mp_add_~i~0#1 % 256); 40182#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 40154#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 40155#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 40156#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 40276#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 40275#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 40274#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 40179#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 40180#L102-1 [2022-07-14 15:08:01,680 INFO L754 eck$LassoCheckResult]: Loop: 40180#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 40231#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40230#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 40173#L84 assume !(0 == mp_add_~i~0#1 % 256); 40174#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 40178#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 40167#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 40168#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 40157#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 40158#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 40170#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 40164#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 40165#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 40180#L102-1 [2022-07-14 15:08:01,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:08:01,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1379271090, now seen corresponding path program 1 times [2022-07-14 15:08:01,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:08:01,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658367182] [2022-07-14 15:08:01,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:08:01,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:08:01,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:08:01,693 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:08:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:08:01,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:08:01,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:08:01,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1466073576, now seen corresponding path program 3 times [2022-07-14 15:08:01,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:08:01,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021078518] [2022-07-14 15:08:01,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:08:01,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:08:01,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:08:01,740 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 15:08:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 15:08:01,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 15:08:01,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 15:08:01,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1731585259, now seen corresponding path program 1 times [2022-07-14 15:08:01,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 15:08:01,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825717976] [2022-07-14 15:08:01,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:08:01,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 15:08:01,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:08:01,830 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 86 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-14 15:08:01,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 15:08:01,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825717976] [2022-07-14 15:08:01,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825717976] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 15:08:01,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586691163] [2022-07-14 15:08:01,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 15:08:01,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 15:08:01,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:01,832 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 15:08:01,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-07-14 15:08:01,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 15:08:01,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 15:08:01,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 15:08:02,017 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 95 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-14 15:08:02,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 15:08:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 87 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-14 15:08:02,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586691163] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 15:08:02,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 15:08:02,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-07-14 15:08:02,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251991608] [2022-07-14 15:08:02,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 15:08:02,251 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:08:02,252 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:08:02,252 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:08:02,252 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:08:02,252 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 15:08:02,252 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:02,252 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:08:02,252 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:08:02,252 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration27_Loop [2022-07-14 15:08:02,253 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:08:02,253 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:08:02,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:08:02,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:08:02,471 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:08:02,472 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 15:08:02,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:02,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:02,473 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:02,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-07-14 15:08:02,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 15:08:02,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:08:02,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:02,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:02,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:02,580 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:02,607 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 15:08:02,608 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 15:08:02,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-07-14 15:08:03,502 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 15:08:03,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:03,507 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 15:08:03,507 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 15:08:03,507 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 15:08:03,507 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 15:08:03,507 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 15:08:03,507 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:03,507 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 15:08:03,507 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 15:08:03,507 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration27_Loop [2022-07-14 15:08:03,507 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 15:08:03,507 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 15:08:03,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:08:03,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-14 15:08:03,637 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 15:08:03,637 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 15:08:03,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:03,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:03,639 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:03,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2022-07-14 15:08:03,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:03,647 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:08:03,647 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:03,647 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:03,647 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:03,647 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:08:03,649 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:08:03,649 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:03,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:03,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2022-07-14 15:08:03,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:03,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:03,669 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:03,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-07-14 15:08:03,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:03,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:08:03,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:03,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:03,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:03,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 15:08:03,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 15:08:03,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:03,680 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:03,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2022-07-14 15:08:03,700 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-14 15:08:03,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:03,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:03,701 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:03,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-07-14 15:08:03,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:03,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:08:03,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:03,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:03,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:03,710 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:08:03,714 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-14 15:08:03,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:03,717 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:03,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:03,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:03,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:03,736 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:03,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2022-07-14 15:08:03,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:03,744 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:08:03,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:03,744 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:03,744 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:03,744 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:08:03,746 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-14 15:08:03,746 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:03,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:03,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2022-07-14 15:08:03,768 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-14 15:08:03,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:03,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:03,769 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:03,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2022-07-14 15:08:03,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:03,777 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:08:03,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:03,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:03,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:03,777 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:08:03,781 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:08:03,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:03,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:03,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:03,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:03,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:03,813 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:03,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2022-07-14 15:08:03,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:03,821 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:08:03,821 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:03,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:03,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:03,821 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:08:03,823 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:08:03,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:03,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:03,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:03,853 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-14 15:08:03,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:03,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:03,855 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:03,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-07-14 15:08:03,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:03,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:08:03,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:03,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:03,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:03,863 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:08:03,867 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-14 15:08:03,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:03,882 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:03,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:03,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:03,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:03,899 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:03,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-07-14 15:08:03,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:03,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 15:08:03,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:03,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:03,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:03,907 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:08:03,909 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-14 15:08:03,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:03,924 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:03,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:03,940 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-14 15:08:03,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:03,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:03,943 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:03,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-07-14 15:08:03,945 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:03,951 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:03,951 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:08:03,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:03,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:03,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:03,951 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:08:03,954 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-14 15:08:03,954 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:03,959 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:03,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:03,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:03,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:03,976 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:03,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-07-14 15:08:03,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:03,983 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:03,983 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:08:03,983 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:03,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:03,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:03,984 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-14 15:08:03,985 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-14 15:08:03,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:04,001 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:04,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:04,017 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-14 15:08:04,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:04,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:04,018 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:04,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2022-07-14 15:08:04,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:04,026 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:04,027 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-14 15:08:04,027 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:04,027 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:04,027 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:04,027 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:08:04,030 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:08:04,030 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:04,046 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:04,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:04,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:04,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:04,064 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:04,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2022-07-14 15:08:04,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:04,072 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:04,072 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-14 15:08:04,072 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:04,072 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:04,072 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:04,072 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:08:04,074 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:08:04,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:04,079 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:04,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2022-07-14 15:08:04,095 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-14 15:08:04,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:04,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:04,097 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:04,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2022-07-14 15:08:04,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:04,106 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:04,106 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:08:04,106 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:04,106 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:04,106 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:04,106 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:08:04,111 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-14 15:08:04,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:04,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:04,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2022-07-14 15:08:04,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:04,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:04,144 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:04,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2022-07-14 15:08:04,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:04,152 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:04,153 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:08:04,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:04,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:04,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:04,153 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-14 15:08:04,156 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-14 15:08:04,156 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:04,162 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:04,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2022-07-14 15:08:04,178 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-14 15:08:04,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:04,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:04,180 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:04,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2022-07-14 15:08:04,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:04,188 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:04,188 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:08:04,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:04,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:04,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:04,189 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:08:04,192 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:08:04,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:04,197 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:04,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2022-07-14 15:08:04,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:04,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:04,215 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:04,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-07-14 15:08:04,217 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:04,235 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:04,235 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-14 15:08:04,235 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:04,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:04,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:04,236 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-14 15:08:04,238 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 15:08:04,238 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:04,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:04,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2022-07-14 15:08:04,258 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-14 15:08:04,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:04,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:04,259 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:04,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2022-07-14 15:08:04,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:04,267 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:04,268 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:08:04,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:04,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:04,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:04,268 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-14 15:08:04,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:08:04,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:04,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:04,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:04,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 15:08:04,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 15:08:04,306 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 15:08:04,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-07-14 15:08:04,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-14 15:08:04,314 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-14 15:08:04,314 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-14 15:08:04,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 15:08:04,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 15:08:04,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 15:08:04,314 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-14 15:08:04,317 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-14 15:08:04,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 15:08:04,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 15:08:04,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2022-07-14 15:08:04,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 15:08:04,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 15:08:04,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-07-14 15:08:04,339 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. cyclomatic complexity: 2 Second operand has 15 states, 15 states have (on average 7.6) internal successors, (114), 15 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 15:08:04,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 15:08:04,683 INFO L93 Difference]: Finished difference Result 139 states and 138 transitions. [2022-07-14 15:08:04,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 15:08:04,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 138 transitions. [2022-07-14 15:08:04,684 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:08:04,684 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 0 states and 0 transitions. [2022-07-14 15:08:04,684 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 15:08:04,684 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 15:08:04,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 15:08:04,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 15:08:04,685 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:08:04,685 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:08:04,685 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 15:08:04,685 INFO L287 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2022-07-14 15:08:04,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-14 15:08:04,685 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 15:08:04,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-14 15:08:04,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 03:08:04 BoogieIcfgContainer [2022-07-14 15:08:04,690 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 15:08:04,691 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 15:08:04,691 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 15:08:04,691 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 15:08:04,692 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 03:07:33" (3/4) ... [2022-07-14 15:08:04,693 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 15:08:04,693 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 15:08:04,694 INFO L158 Benchmark]: Toolchain (without parser) took 32086.72ms. Allocated memory was 88.1MB in the beginning and 337.6MB in the end (delta: 249.6MB). Free memory was 52.8MB in the beginning and 260.6MB in the end (delta: -207.8MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2022-07-14 15:08:04,694 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 88.1MB. Free memory was 57.3MB in the beginning and 57.3MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:08:04,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.43ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 52.5MB in the beginning and 80.3MB in the end (delta: -27.8MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2022-07-14 15:08:04,695 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.88ms. Allocated memory is still 107.0MB. Free memory was 80.3MB in the beginning and 72.0MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 15:08:04,695 INFO L158 Benchmark]: Boogie Preprocessor took 73.78ms. Allocated memory is still 107.0MB. Free memory was 72.0MB in the beginning and 67.4MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 15:08:04,695 INFO L158 Benchmark]: RCFGBuilder took 520.47ms. Allocated memory is still 107.0MB. Free memory was 67.4MB in the beginning and 61.5MB in the end (delta: 6.0MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2022-07-14 15:08:04,696 INFO L158 Benchmark]: BuchiAutomizer took 31153.54ms. Allocated memory was 107.0MB in the beginning and 337.6MB in the end (delta: 230.7MB). Free memory was 61.1MB in the beginning and 261.6MB in the end (delta: -200.6MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2022-07-14 15:08:04,696 INFO L158 Benchmark]: Witness Printer took 2.24ms. Allocated memory is still 337.6MB. Free memory is still 260.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 15:08:04,698 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.14ms. Allocated memory is still 88.1MB. Free memory was 57.3MB in the beginning and 57.3MB in the end (delta: 26.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.43ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 52.5MB in the beginning and 80.3MB in the end (delta: -27.8MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.88ms. Allocated memory is still 107.0MB. Free memory was 80.3MB in the beginning and 72.0MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.78ms. Allocated memory is still 107.0MB. Free memory was 72.0MB in the beginning and 67.4MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 520.47ms. Allocated memory is still 107.0MB. Free memory was 67.4MB in the beginning and 61.5MB in the end (delta: 6.0MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 31153.54ms. Allocated memory was 107.0MB in the beginning and 337.6MB in the end (delta: 230.7MB). Free memory was 61.1MB in the beginning and 261.6MB in the end (delta: -200.6MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * Witness Printer took 2.24ms. Allocated memory is still 337.6MB. Free memory is still 260.6MB. 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 27 terminating modules (27 trivial, 0 deterministic, 0 nondeterministic). 27 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 31.1s and 28 iterations. TraceHistogramMax:7. Analysis of lassos took 22.5s. Construction of modules took 4.6s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 0. Minimization of det autom 27. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 3929 StatesRemovedByMinimization, 24 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5015 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5015 mSDsluCounter, 4327 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2839 mSDsCounter, 681 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7168 IncrementalHoareTripleChecker+Invalid, 7849 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 681 mSolverCounterUnsat, 1488 mSDtfsCounter, 7168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI16 SFLT0 conc2 concLT0 SILN0 SILU4 SILI5 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital62 mio100 ax100 hnf100 lsp78 ukn100 mio100 lsp100 div455 bol100 ite100 ukn100 eq145 hnf96 smp36 dnf131 smp99 tf101 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 65ms VariablesStem: 0 VariablesLoop: 20 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.6s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-14 15:08:04,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:04,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:05,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:05,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-07-14 15:08:05,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:05,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:05,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:06,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:06,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:06,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-07-14 15:08:06,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-07-14 15:08:06,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-07-14 15:08:07,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-07-14 15:08:07,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE