./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/byte_add-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c 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-1.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 7dfc9f1e1cbceb1807370dcac22a0449d857eff9a54bdefbc84178983a910e84 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:26:13,898 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:26:13,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:26:13,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:26:13,959 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:26:13,960 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:26:13,962 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:26:13,963 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:26:13,965 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:26:13,972 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:26:13,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:26:13,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:26:13,974 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:26:13,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:26:13,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:26:13,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:26:13,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:26:13,981 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:26:13,982 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:26:13,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:26:13,988 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:26:13,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:26:13,989 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:26:13,990 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:26:13,991 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:26:13,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:26:13,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:26:13,997 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:26:13,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:26:13,998 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:26:13,999 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:26:13,999 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:26:14,000 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:26:14,001 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:26:14,001 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:26:14,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:26:14,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:26:14,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:26:14,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:26:14,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:26:14,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:26:14,006 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:26:14,007 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-13 03:26:14,030 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:26:14,030 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:26:14,030 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:26:14,031 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:26:14,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:26:14,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:26:14,032 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:26:14,032 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:26:14,032 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:26:14,033 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:26:14,033 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:26:14,033 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:26:14,034 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:26:14,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:26:14,034 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 03:26:14,034 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:26:14,034 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:26:14,034 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 03:26:14,035 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:26:14,035 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:26:14,035 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:26:14,035 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:26:14,035 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 03:26:14,035 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:26:14,036 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:26:14,036 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:26:14,036 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:26:14,036 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:26:14,036 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:26:14,037 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:26:14,037 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:26:14,038 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:26:14,038 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 -> 7dfc9f1e1cbceb1807370dcac22a0449d857eff9a54bdefbc84178983a910e84 [2022-07-13 03:26:14,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:26:14,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:26:14,248 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:26:14,249 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:26:14,249 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:26:14,250 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-1.i [2022-07-13 03:26:14,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b34001df/e95f19a158b94a7597696be11ea578bb/FLAG324340f0a [2022-07-13 03:26:14,677 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:26:14,680 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i [2022-07-13 03:26:14,690 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b34001df/e95f19a158b94a7597696be11ea578bb/FLAG324340f0a [2022-07-13 03:26:14,707 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b34001df/e95f19a158b94a7597696be11ea578bb [2022-07-13 03:26:14,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:26:14,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:26:14,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:26:14,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:26:14,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:26:14,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:26:14" (1/1) ... [2022-07-13 03:26:14,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a769d27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:14, skipping insertion in model container [2022-07-13 03:26:14,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:26:14" (1/1) ... [2022-07-13 03:26:14,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:26:14,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:26:14,897 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-1.i[1166,1179] [2022-07-13 03:26:14,948 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:26:14,959 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:26:14,970 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-1.i[1166,1179] [2022-07-13 03:26:14,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:26:15,004 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:26:15,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:15 WrapperNode [2022-07-13 03:26:15,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:26:15,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:26:15,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:26:15,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:26:15,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:15" (1/1) ... [2022-07-13 03:26:15,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:15" (1/1) ... [2022-07-13 03:26:15,065 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 146 [2022-07-13 03:26:15,066 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:26:15,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:26:15,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:26:15,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:26:15,073 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:15" (1/1) ... [2022-07-13 03:26:15,073 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:15" (1/1) ... [2022-07-13 03:26:15,085 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:15" (1/1) ... [2022-07-13 03:26:15,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:15" (1/1) ... [2022-07-13 03:26:15,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:15" (1/1) ... [2022-07-13 03:26:15,118 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:15" (1/1) ... [2022-07-13 03:26:15,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:15" (1/1) ... [2022-07-13 03:26:15,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:26:15,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:26:15,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:26:15,131 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:26:15,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:15" (1/1) ... [2022-07-13 03:26:15,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:15,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:15,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:15,167 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-13 03:26:15,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 03:26:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 03:26:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:26:15,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:26:15,286 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:26:15,287 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:26:15,728 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:26:15,735 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:26:15,736 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 03:26:15,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:26:15 BoogieIcfgContainer [2022-07-13 03:26:15,737 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:26:15,738 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:26:15,738 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:26:15,740 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:26:15,740 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:26:15,741 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:26:14" (1/3) ... [2022-07-13 03:26:15,741 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55ec55d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:26:15, skipping insertion in model container [2022-07-13 03:26:15,741 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:26:15,741 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:26:15" (2/3) ... [2022-07-13 03:26:15,742 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55ec55d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:26:15, skipping insertion in model container [2022-07-13 03:26:15,742 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:26:15,743 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:26:15" (3/3) ... [2022-07-13 03:26:15,743 INFO L354 chiAutomizerObserver]: Analyzing ICFG byte_add-1.i [2022-07-13 03:26:15,793 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:26:15,793 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:26:15,794 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:26:15,794 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:26:15,794 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:26:15,794 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:26:15,794 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:26:15,794 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:26:15,798 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-13 03:26:15,812 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-07-13 03:26:15,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:15,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:15,818 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-13 03:26:15,818 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:15,818 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:26:15,819 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-13 03:26:15,823 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-07-13 03:26:15,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:15,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:15,825 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-13 03:26:15,825 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:15,831 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(13, 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~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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-13 03:26:15,831 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 > 254); 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-13 03:26:15,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:15,836 INFO L85 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2022-07-13 03:26:15,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:15,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421424603] [2022-07-13 03:26:15,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:15,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:15,931 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:15,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:15,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:15,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1026291578, now seen corresponding path program 1 times [2022-07-13 03:26:15,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:15,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904953622] [2022-07-13 03:26:15,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:15,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:16,071 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-13 03:26:16,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:16,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904953622] [2022-07-13 03:26:16,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904953622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:16,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:16,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:26:16,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588704643] [2022-07-13 03:26:16,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:16,076 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:16,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:16,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:26:16,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:26:16,103 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-13 03:26:16,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:16,239 INFO L93 Difference]: Finished difference Result 78 states and 114 transitions. [2022-07-13 03:26:16,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:26:16,243 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 114 transitions. [2022-07-13 03:26:16,245 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2022-07-13 03:26:16,249 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 66 states and 98 transitions. [2022-07-13 03:26:16,250 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2022-07-13 03:26:16,250 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2022-07-13 03:26:16,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 98 transitions. [2022-07-13 03:26:16,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:16,252 INFO L369 hiAutomatonCegarLoop]: Abstraction has 66 states and 98 transitions. [2022-07-13 03:26:16,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 98 transitions. [2022-07-13 03:26:16,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-07-13 03:26:16,273 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-13 03:26:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2022-07-13 03:26:16,279 INFO L392 hiAutomatonCegarLoop]: Abstraction has 64 states and 96 transitions. [2022-07-13 03:26:16,279 INFO L374 stractBuchiCegarLoop]: Abstraction has 64 states and 96 transitions. [2022-07-13 03:26:16,279 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:26:16,279 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 96 transitions. [2022-07-13 03:26:16,283 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2022-07-13 03:26:16,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:16,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:16,284 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:16,284 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:16,284 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(13, 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~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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-13 03:26:16,285 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 > 254); 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-13 03:26:16,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:16,285 INFO L85 PathProgramCache]: Analyzing trace with hash 532072804, now seen corresponding path program 1 times [2022-07-13 03:26:16,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:16,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339763728] [2022-07-13 03:26:16,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:16,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:16,467 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-13 03:26:16,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:16,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339763728] [2022-07-13 03:26:16,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339763728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:16,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:16,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 03:26:16,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299999407] [2022-07-13 03:26:16,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:16,472 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:16,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:16,473 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 1 times [2022-07-13 03:26:16,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:16,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249489969] [2022-07-13 03:26:16,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:16,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:16,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-13 03:26:16,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:16,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249489969] [2022-07-13 03:26:16,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249489969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:16,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:16,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:26:16,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039054549] [2022-07-13 03:26:16,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:16,531 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:16,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:16,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 03:26:16,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 03:26:16,532 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-13 03:26:16,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:16,901 INFO L93 Difference]: Finished difference Result 222 states and 310 transitions. [2022-07-13 03:26:16,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 03:26:16,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 310 transitions. [2022-07-13 03:26:16,905 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 147 [2022-07-13 03:26:16,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 222 states and 310 transitions. [2022-07-13 03:26:16,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 222 [2022-07-13 03:26:16,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 222 [2022-07-13 03:26:16,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 222 states and 310 transitions. [2022-07-13 03:26:16,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:16,908 INFO L369 hiAutomatonCegarLoop]: Abstraction has 222 states and 310 transitions. [2022-07-13 03:26:16,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states and 310 transitions. [2022-07-13 03:26:16,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 79. [2022-07-13 03:26:16,918 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-13 03:26:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2022-07-13 03:26:16,918 INFO L392 hiAutomatonCegarLoop]: Abstraction has 79 states and 114 transitions. [2022-07-13 03:26:16,918 INFO L374 stractBuchiCegarLoop]: Abstraction has 79 states and 114 transitions. [2022-07-13 03:26:16,918 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:26:16,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 114 transitions. [2022-07-13 03:26:16,919 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2022-07-13 03:26:16,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:16,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:16,920 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:16,920 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:16,920 INFO L752 eck$LassoCheckResult]: Stem: 470#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(13, 2); 458#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 442#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 444#L61 assume !(0 == mp_add_~a2~0#1 % 256); 445#L59-1 mp_add_~nb~0#1 := 4; 495#L69 assume !(0 == mp_add_~b3~0#1 % 256); 490#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 491#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; 496#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 460#L83-1 [2022-07-13 03:26:16,920 INFO L754 eck$LassoCheckResult]: Loop: 460#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 447#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 449#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 466#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 455#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 456#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 477#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 480#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; 512#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; 469#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 474#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 459#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 460#L83-1 [2022-07-13 03:26:16,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:16,920 INFO L85 PathProgramCache]: Analyzing trace with hash -384676570, now seen corresponding path program 1 times [2022-07-13 03:26:16,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:16,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022594625] [2022-07-13 03:26:16,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:16,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:17,040 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-13 03:26:17,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:17,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022594625] [2022-07-13 03:26:17,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022594625] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:17,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:17,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 03:26:17,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963799568] [2022-07-13 03:26:17,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:17,041 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:17,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:17,041 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 2 times [2022-07-13 03:26:17,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:17,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62005830] [2022-07-13 03:26:17,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:17,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:17,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:17,075 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-13 03:26:17,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:17,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62005830] [2022-07-13 03:26:17,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62005830] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:17,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:17,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:26:17,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610957013] [2022-07-13 03:26:17,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:17,076 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:17,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:17,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 03:26:17,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 03:26:17,076 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-13 03:26:17,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:17,662 INFO L93 Difference]: Finished difference Result 387 states and 549 transitions. [2022-07-13 03:26:17,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 03:26:17,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 387 states and 549 transitions. [2022-07-13 03:26:17,665 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 279 [2022-07-13 03:26:17,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 387 states to 387 states and 549 transitions. [2022-07-13 03:26:17,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 387 [2022-07-13 03:26:17,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 387 [2022-07-13 03:26:17,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 387 states and 549 transitions. [2022-07-13 03:26:17,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:17,669 INFO L369 hiAutomatonCegarLoop]: Abstraction has 387 states and 549 transitions. [2022-07-13 03:26:17,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states and 549 transitions. [2022-07-13 03:26:17,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 184. [2022-07-13 03:26:17,690 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-13 03:26:17,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 259 transitions. [2022-07-13 03:26:17,691 INFO L392 hiAutomatonCegarLoop]: Abstraction has 184 states and 259 transitions. [2022-07-13 03:26:17,691 INFO L374 stractBuchiCegarLoop]: Abstraction has 184 states and 259 transitions. [2022-07-13 03:26:17,691 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:26:17,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 259 transitions. [2022-07-13 03:26:17,692 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 113 [2022-07-13 03:26:17,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:17,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:17,692 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:17,693 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:17,693 INFO L752 eck$LassoCheckResult]: Stem: 967#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(13, 2); 952#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 934#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 936#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 938#L63 assume !(0 == mp_add_~a1~0#1 % 256); 939#L59-1 mp_add_~nb~0#1 := 4; 992#L69 assume !(0 == mp_add_~b3~0#1 % 256); 988#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 989#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; 1028#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1051#L83-1 [2022-07-13 03:26:17,693 INFO L754 eck$LassoCheckResult]: Loop: 1051#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1048#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 1043#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1039#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1037#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1033#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 986#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 987#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; 1030#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1058#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; 1056#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1055#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1053#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1051#L83-1 [2022-07-13 03:26:17,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:17,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2089936051, now seen corresponding path program 1 times [2022-07-13 03:26:17,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:17,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942337279] [2022-07-13 03:26:17,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:17,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:17,826 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-13 03:26:17,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:17,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942337279] [2022-07-13 03:26:17,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942337279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:17,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:17,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 03:26:17,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274919328] [2022-07-13 03:26:17,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:17,828 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:17,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:17,828 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 3 times [2022-07-13 03:26:17,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:17,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421685225] [2022-07-13 03:26:17,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:17,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:17,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:17,855 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-13 03:26:17,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:17,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421685225] [2022-07-13 03:26:17,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421685225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:17,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:17,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:26:17,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703067289] [2022-07-13 03:26:17,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:17,856 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:17,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:17,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 03:26:17,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 03:26:17,857 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-13 03:26:18,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:18,752 INFO L93 Difference]: Finished difference Result 482 states and 675 transitions. [2022-07-13 03:26:18,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 03:26:18,753 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 675 transitions. [2022-07-13 03:26:18,756 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 345 [2022-07-13 03:26:18,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 482 states and 675 transitions. [2022-07-13 03:26:18,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2022-07-13 03:26:18,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2022-07-13 03:26:18,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 482 states and 675 transitions. [2022-07-13 03:26:18,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:18,760 INFO L369 hiAutomatonCegarLoop]: Abstraction has 482 states and 675 transitions. [2022-07-13 03:26:18,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states and 675 transitions. [2022-07-13 03:26:18,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 270. [2022-07-13 03:26:18,769 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-13 03:26:18,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 379 transitions. [2022-07-13 03:26:18,770 INFO L392 hiAutomatonCegarLoop]: Abstraction has 270 states and 379 transitions. [2022-07-13 03:26:18,771 INFO L374 stractBuchiCegarLoop]: Abstraction has 270 states and 379 transitions. [2022-07-13 03:26:18,771 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:26:18,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 379 transitions. [2022-07-13 03:26:18,774 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 175 [2022-07-13 03:26:18,774 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:18,774 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:18,774 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:18,774 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:18,775 INFO L752 eck$LassoCheckResult]: Stem: 1665#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(13, 2); 1650#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 1631#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1633#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1635#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1636#L59-1 mp_add_~nb~0#1 := 4; 1693#L69 assume !(0 == mp_add_~b3~0#1 % 256); 1689#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1690#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; 1817#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1850#L83-1 [2022-07-13 03:26:18,775 INFO L754 eck$LassoCheckResult]: Loop: 1850#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1847#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 1827#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1826#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1825#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1822#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1818#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1815#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; 1816#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1859#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; 1856#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1855#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1853#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1850#L83-1 [2022-07-13 03:26:18,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:18,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194353, now seen corresponding path program 1 times [2022-07-13 03:26:18,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:18,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133210299] [2022-07-13 03:26:18,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:18,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:18,843 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-13 03:26:18,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:18,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133210299] [2022-07-13 03:26:18,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133210299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:18,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:18,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 03:26:18,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362413615] [2022-07-13 03:26:18,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:18,844 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:18,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:18,844 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 4 times [2022-07-13 03:26:18,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:18,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42823447] [2022-07-13 03:26:18,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:18,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:18,881 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-13 03:26:18,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:18,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42823447] [2022-07-13 03:26:18,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42823447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:18,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:18,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:26:18,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845970726] [2022-07-13 03:26:18,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:18,882 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:18,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:18,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 03:26:18,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-13 03:26:18,884 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-13 03:26:19,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:19,548 INFO L93 Difference]: Finished difference Result 370 states and 514 transitions. [2022-07-13 03:26:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 03:26:19,549 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 370 states and 514 transitions. [2022-07-13 03:26:19,551 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 243 [2022-07-13 03:26:19,555 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 370 states to 370 states and 514 transitions. [2022-07-13 03:26:19,556 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 370 [2022-07-13 03:26:19,556 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 370 [2022-07-13 03:26:19,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 370 states and 514 transitions. [2022-07-13 03:26:19,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:19,557 INFO L369 hiAutomatonCegarLoop]: Abstraction has 370 states and 514 transitions. [2022-07-13 03:26:19,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states and 514 transitions. [2022-07-13 03:26:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 304. [2022-07-13 03:26:19,568 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-13 03:26:19,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 427 transitions. [2022-07-13 03:26:19,576 INFO L392 hiAutomatonCegarLoop]: Abstraction has 304 states and 427 transitions. [2022-07-13 03:26:19,576 INFO L374 stractBuchiCegarLoop]: Abstraction has 304 states and 427 transitions. [2022-07-13 03:26:19,576 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:26:19,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 304 states and 427 transitions. [2022-07-13 03:26:19,577 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 212 [2022-07-13 03:26:19,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:19,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:19,578 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:19,578 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:19,578 INFO L752 eck$LassoCheckResult]: Stem: 2331#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(13, 2); 2318#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 2305#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 2307#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 2309#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 2310#L59-1 mp_add_~nb~0#1 := 4; 2327#L69 assume !(0 == mp_add_~b3~0#1 % 256); 2315#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 2346#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; 2345#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2328#L84 [2022-07-13 03:26:19,578 INFO L754 eck$LassoCheckResult]: Loop: 2328#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; 2329#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 2334#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 2319#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 2320#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2300#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 2302#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 2326#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 2312#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 2313#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 2338#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 2349#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; 2556#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2328#L84 [2022-07-13 03:26:19,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:19,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194379, now seen corresponding path program 1 times [2022-07-13 03:26:19,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:19,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878788547] [2022-07-13 03:26:19,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:19,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:19,607 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:19,623 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:19,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:19,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1738393452, now seen corresponding path program 5 times [2022-07-13 03:26:19,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:19,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216037675] [2022-07-13 03:26:19,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:19,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:19,630 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:19,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:19,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:19,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1295002104, now seen corresponding path program 1 times [2022-07-13 03:26:19,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:19,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841277073] [2022-07-13 03:26:19,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:19,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:19,693 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-13 03:26:19,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:19,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841277073] [2022-07-13 03:26:19,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841277073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:19,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:19,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:26:19,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970735190] [2022-07-13 03:26:19,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:19,767 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:26:19,768 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:26:19,768 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:26:19,768 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:26:19,768 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:26:19,768 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:19,769 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:26:19,769 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:26:19,769 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration6_Loop [2022-07-13 03:26:19,769 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:26:19,769 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:26:19,780 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-13 03:26:19,788 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-13 03:26:20,020 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:26:20,021 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:26:20,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:20,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:20,025 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-13 03:26:20,030 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-13 03:26:20,032 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:26:20,032 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:20,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:20,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:20,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:20,076 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-13 03:26:20,079 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-13 03:26:20,080 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:26:20,080 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:20,749 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:26:20,754 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-13 03:26:20,754 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:26:20,754 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:26:20,754 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:26:20,754 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:26:20,754 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:26:20,754 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:20,754 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:26:20,754 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:26:20,754 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration6_Loop [2022-07-13 03:26:20,754 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:26:20,754 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:26:20,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-13 03:26:20,765 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-13 03:26:20,973 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:26:20,976 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:26:20,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:20,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:20,981 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-13 03:26:20,982 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-13 03:26:20,992 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-13 03:26:20,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:20,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:20,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:20,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:20,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:21,001 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:21,002 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:21,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:21,034 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-13 03:26:21,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:21,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:21,035 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-13 03:26:21,036 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-13 03:26:21,038 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-13 03:26:21,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:21,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:21,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:21,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:21,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:21,046 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:21,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:21,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:21,080 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-13 03:26:21,080 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-13 03:26:21,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:21,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:21,081 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-13 03:26:21,082 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-13 03:26:21,085 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-13 03:26:21,090 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:21,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:21,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:21,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:21,090 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:21,094 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:21,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:21,104 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:21,121 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-13 03:26:21,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:21,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:21,123 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-13 03:26:21,124 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-13 03:26:21,126 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-13 03:26:21,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:21,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:21,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:21,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:21,132 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:21,137 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:21,137 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:21,141 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:21,162 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-13 03:26:21,163 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-13 03:26:21,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:21,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:21,165 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-13 03:26:21,166 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-13 03:26:21,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-13 03:26:21,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:21,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:21,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:21,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:21,173 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:21,176 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:21,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:21,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:21,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-13 03:26:21,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:21,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:21,210 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-13 03:26:21,211 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-13 03:26:21,212 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-13 03:26:21,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:21,218 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:21,218 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:21,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:21,219 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:21,223 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:21,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:21,238 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:21,253 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-13 03:26:21,253 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-13 03:26:21,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:21,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:21,254 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-13 03:26:21,257 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-13 03:26:21,257 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-13 03:26:21,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:21,263 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:21,263 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:21,263 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:21,264 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:21,270 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:21,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:21,283 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:21,298 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-13 03:26:21,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:21,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:21,299 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-13 03:26:21,308 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-13 03:26:21,309 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-13 03:26:21,315 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:21,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:21,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:21,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:21,315 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:21,321 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:21,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:21,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:21,343 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-13 03:26:21,343 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-13 03:26:21,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:21,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:21,344 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-13 03:26:21,344 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-13 03:26:21,347 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-13 03:26:21,352 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:21,352 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:21,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:21,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:21,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:21,353 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:21,357 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:21,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:21,372 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:21,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-07-13 03:26:21,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:21,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:21,391 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-13 03:26:21,392 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-13 03:26:21,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-13 03:26:21,399 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:21,399 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:21,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:21,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:21,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:21,399 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:21,403 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:21,403 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:21,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:21,435 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-13 03:26:21,436 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-13 03:26:21,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:21,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:21,437 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-13 03:26:21,438 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-13 03:26:21,440 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-13 03:26:21,446 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:21,446 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-13 03:26:21,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:21,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:21,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:21,446 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:21,450 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:21,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:21,466 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:21,483 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-13 03:26:21,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:21,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:21,485 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-13 03:26:21,486 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-13 03:26:21,487 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-13 03:26:21,494 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:21,494 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-13 03:26:21,494 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:21,494 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:21,494 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:21,494 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:21,500 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:21,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:21,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:21,524 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-13 03:26:21,524 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-13 03:26:21,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:21,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:21,525 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-13 03:26:21,526 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-13 03:26:21,527 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-13 03:26:21,533 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:21,533 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:21,533 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:21,533 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:21,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:21,533 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:21,539 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:21,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:21,553 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:21,568 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-13 03:26:21,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:21,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:21,569 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-13 03:26:21,569 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-13 03:26:21,571 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-13 03:26:21,577 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:21,577 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:21,577 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:21,577 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:21,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:21,577 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:21,585 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:21,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:21,605 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:21,620 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-13 03:26:21,621 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-13 03:26:21,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:21,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:21,622 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-13 03:26:21,623 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-13 03:26:21,624 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-13 03:26:21,629 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:21,629 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:21,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:21,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:21,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:21,630 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:21,633 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:21,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:21,649 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:21,667 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-13 03:26:21,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:21,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:21,668 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-13 03:26:21,683 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-13 03:26:21,687 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-13 03:26:21,693 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:21,693 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:21,693 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:21,693 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:21,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:21,693 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:21,697 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:21,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:21,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:21,726 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-13 03:26:21,726 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-13 03:26:21,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:21,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:21,727 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-13 03:26:21,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-13 03:26:21,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-13 03:26:21,737 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:21,737 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:21,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:21,737 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:21,737 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:21,737 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-13 03:26:21,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:21,742 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:21,750 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:21,765 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-13 03:26:21,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:21,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:21,766 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-13 03:26:21,767 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-13 03:26:21,768 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-13 03:26:21,774 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:21,774 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:21,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:21,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:21,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:21,774 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-13 03:26:21,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:21,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:21,798 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:21,814 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-13 03:26:21,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:21,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:26:21,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 03:26:21,815 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-13 03:26:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:21,915 INFO L93 Difference]: Finished difference Result 621 states and 854 transitions. [2022-07-13 03:26:21,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 03:26:21,916 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 621 states and 854 transitions. [2022-07-13 03:26:21,919 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 424 [2022-07-13 03:26:21,921 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 621 states to 621 states and 854 transitions. [2022-07-13 03:26:21,921 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 621 [2022-07-13 03:26:21,921 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 621 [2022-07-13 03:26:21,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 621 states and 854 transitions. [2022-07-13 03:26:21,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:21,922 INFO L369 hiAutomatonCegarLoop]: Abstraction has 621 states and 854 transitions. [2022-07-13 03:26:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states and 854 transitions. [2022-07-13 03:26:21,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 328. [2022-07-13 03:26:21,926 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-13 03:26:21,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 451 transitions. [2022-07-13 03:26:21,927 INFO L392 hiAutomatonCegarLoop]: Abstraction has 328 states and 451 transitions. [2022-07-13 03:26:21,927 INFO L374 stractBuchiCegarLoop]: Abstraction has 328 states and 451 transitions. [2022-07-13 03:26:21,927 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-13 03:26:21,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 328 states and 451 transitions. [2022-07-13 03:26:21,928 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 212 [2022-07-13 03:26:21,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:21,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:21,929 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:21,929 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:21,929 INFO L752 eck$LassoCheckResult]: Stem: 3269#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(13, 2); 3254#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 3241#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 3243#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 3245#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 3246#L59-1 mp_add_~nb~0#1 := 4; 3263#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 3250#L71 assume !(0 == mp_add_~b2~0#1 % 256); 3251#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 3286#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; 3284#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3265#L84 [2022-07-13 03:26:21,929 INFO L754 eck$LassoCheckResult]: Loop: 3265#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; 3266#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 3560#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 3559#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 3548#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3238#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 3240#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 3288#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 3547#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 3533#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 3396#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 3394#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; 3395#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3265#L84 [2022-07-13 03:26:21,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:21,930 INFO L85 PathProgramCache]: Analyzing trace with hash 2143364048, now seen corresponding path program 1 times [2022-07-13 03:26:21,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:21,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336430744] [2022-07-13 03:26:21,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:21,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:21,941 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:21,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:21,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:21,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1738393452, now seen corresponding path program 6 times [2022-07-13 03:26:21,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:21,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336006321] [2022-07-13 03:26:21,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:21,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:21,957 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:21,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:21,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:21,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1046711293, now seen corresponding path program 1 times [2022-07-13 03:26:21,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:21,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691757809] [2022-07-13 03:26:21,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:21,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:22,006 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-13 03:26:22,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:22,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691757809] [2022-07-13 03:26:22,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691757809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:22,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:22,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 03:26:22,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661954111] [2022-07-13 03:26:22,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:22,068 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:26:22,069 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:26:22,069 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:26:22,069 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:26:22,069 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:26:22,069 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:22,069 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:26:22,069 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:26:22,069 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration7_Loop [2022-07-13 03:26:22,069 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:26:22,069 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:26:22,069 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-13 03:26:22,081 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-13 03:26:22,313 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:26:22,314 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:26:22,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:22,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:22,315 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-13 03:26:22,322 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:26:22,322 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:22,339 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-13 03:26:22,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:22,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:22,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:22,368 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-13 03:26:22,369 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-13 03:26:22,379 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:26:22,380 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:24,111 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:26:24,115 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-13 03:26:24,116 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:26:24,116 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:26:24,116 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:26:24,116 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:26:24,116 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:26:24,116 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:24,116 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:26:24,116 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:26:24,116 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration7_Loop [2022-07-13 03:26:24,116 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:26:24,116 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:26:24,117 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-13 03:26:24,124 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-13 03:26:24,324 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:26:24,324 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:26:24,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:24,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:24,326 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-13 03:26:24,327 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-13 03:26:24,328 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-13 03:26:24,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:24,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:24,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:24,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:24,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:24,335 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:24,335 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:24,337 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:24,354 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-13 03:26:24,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:24,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:24,356 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-13 03:26:24,356 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-13 03:26:24,358 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-13 03:26:24,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:24,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:24,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:24,363 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:24,363 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:24,365 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:24,365 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:24,367 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:24,383 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-13 03:26:24,383 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-13 03:26:24,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:24,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:24,384 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-13 03:26:24,394 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-13 03:26:24,394 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-13 03:26:24,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:24,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:24,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:24,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:24,400 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:24,402 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:24,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:24,405 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:24,420 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-13 03:26:24,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:24,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:24,421 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-13 03:26:24,422 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-13 03:26:24,424 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-13 03:26:24,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:24,430 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:24,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:24,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:24,430 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:24,432 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:24,433 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:24,436 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:24,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-07-13 03:26:24,451 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-13 03:26:24,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:24,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:24,452 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-13 03:26:24,453 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-13 03:26:24,454 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-13 03:26:24,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:24,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:24,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:24,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:24,472 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:24,481 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:24,481 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:24,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:24,514 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-13 03:26:24,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:24,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:24,515 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-13 03:26:24,517 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-13 03:26:24,517 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-13 03:26:24,523 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:24,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:24,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:24,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:24,523 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:24,527 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:24,527 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:24,537 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:24,552 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-13 03:26:24,553 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-13 03:26:24,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:24,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:24,554 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-13 03:26:24,554 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-13 03:26:24,556 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-13 03:26:24,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:24,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:24,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:24,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:24,561 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:24,566 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:24,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:24,570 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:24,585 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-13 03:26:24,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:24,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:24,586 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-13 03:26:24,587 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-13 03:26:24,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-13 03:26:24,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:24,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:24,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:24,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:24,594 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:24,599 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:24,599 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:24,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:24,625 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-13 03:26:24,627 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-13 03:26:24,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:24,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:24,628 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-13 03:26:24,629 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-13 03:26:24,630 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-13 03:26:24,635 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:24,635 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:24,636 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:24,636 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:24,636 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:24,636 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:24,638 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:24,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:24,643 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:24,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-13 03:26:24,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:24,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:24,660 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-13 03:26:24,660 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-13 03:26:24,662 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-13 03:26:24,667 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:24,668 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:24,668 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:24,668 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:24,668 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:24,668 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:24,671 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:24,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:24,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:24,704 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-13 03:26:24,705 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-13 03:26:24,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:24,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:24,706 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-13 03:26:24,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:24,722 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:24,722 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-13 03:26:24,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:24,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:24,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:24,722 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:24,726 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:24,726 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:24,734 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-13 03:26:24,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:24,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:24,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:24,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:24,775 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-13 03:26:24,788 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-13 03:26:24,789 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-13 03:26:24,795 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:24,795 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-13 03:26:24,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:24,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:24,795 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:24,795 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:24,799 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:24,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:24,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:24,832 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-13 03:26:24,832 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-13 03:26:24,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:24,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:24,848 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-13 03:26:24,861 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-13 03:26:24,867 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:24,867 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:24,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:24,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:24,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:24,867 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:24,873 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:24,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:24,887 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-13 03:26:24,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:24,907 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-13 03:26:24,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:24,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:24,908 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-13 03:26:24,909 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-13 03:26:24,911 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-13 03:26:24,917 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:24,917 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:24,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:24,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:24,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:24,917 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:24,923 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:24,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:24,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:24,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-07-13 03:26:24,951 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-13 03:26:24,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:24,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:24,952 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-13 03:26:24,953 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-13 03:26:24,954 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-13 03:26:24,959 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:24,959 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:24,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:24,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:24,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:24,960 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:24,963 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:24,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:24,968 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:24,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-07-13 03:26:24,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:24,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:24,984 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-13 03:26:24,985 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-13 03:26:24,986 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-13 03:26:24,991 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:24,991 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:24,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:24,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:24,992 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:24,992 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:24,995 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:24,995 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:25,000 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:25,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-07-13 03:26:25,016 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-13 03:26:25,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:25,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:25,017 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-13 03:26:25,017 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-13 03:26:25,018 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-13 03:26:25,024 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:25,024 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:25,024 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:25,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:25,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:25,024 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-13 03:26:25,029 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:25,029 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:25,045 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:25,062 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-13 03:26:25,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:25,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:25,063 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-13 03:26:25,064 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-13 03:26:25,065 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-13 03:26:25,071 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:25,071 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:25,071 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:25,071 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:25,071 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:25,072 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-13 03:26:25,077 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:25,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:25,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:25,117 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-13 03:26:25,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:25,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 03:26:25,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 03:26:25,118 INFO L87 Difference]: Start difference. First operand 328 states and 451 transitions. cyclomatic complexity: 130 Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 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-13 03:26:25,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:25,381 INFO L93 Difference]: Finished difference Result 946 states and 1289 transitions. [2022-07-13 03:26:25,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 03:26:25,382 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 946 states and 1289 transitions. [2022-07-13 03:26:25,388 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 636 [2022-07-13 03:26:25,393 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 946 states to 946 states and 1289 transitions. [2022-07-13 03:26:25,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 946 [2022-07-13 03:26:25,394 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 946 [2022-07-13 03:26:25,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 946 states and 1289 transitions. [2022-07-13 03:26:25,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:25,395 INFO L369 hiAutomatonCegarLoop]: Abstraction has 946 states and 1289 transitions. [2022-07-13 03:26:25,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 946 states and 1289 transitions. [2022-07-13 03:26:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 946 to 328. [2022-07-13 03:26:25,403 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-13 03:26:25,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 451 transitions. [2022-07-13 03:26:25,404 INFO L392 hiAutomatonCegarLoop]: Abstraction has 328 states and 451 transitions. [2022-07-13 03:26:25,404 INFO L374 stractBuchiCegarLoop]: Abstraction has 328 states and 451 transitions. [2022-07-13 03:26:25,404 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-13 03:26:25,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 328 states and 451 transitions. [2022-07-13 03:26:25,406 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 212 [2022-07-13 03:26:25,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:25,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:25,406 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:25,406 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:25,407 INFO L752 eck$LassoCheckResult]: Stem: 4558#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(13, 2); 4543#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 4530#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 4532#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 4534#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 4535#L59-1 mp_add_~nb~0#1 := 4; 4552#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 4554#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 4579#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 4580#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 4846#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; 4576#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4577#L84 [2022-07-13 03:26:25,407 INFO L754 eck$LassoCheckResult]: Loop: 4577#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; 4844#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 4842#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4841#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4839#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4837#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 4835#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 4827#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4834#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4566#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4567#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4596#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; 4597#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4577#L84 [2022-07-13 03:26:25,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:25,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2012081280, now seen corresponding path program 1 times [2022-07-13 03:26:25,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:25,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904231445] [2022-07-13 03:26:25,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:25,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:25,418 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:25,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:25,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:25,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1738393452, now seen corresponding path program 7 times [2022-07-13 03:26:25,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:25,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441367099] [2022-07-13 03:26:25,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:25,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:25,434 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:25,439 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:25,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:25,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2075550029, now seen corresponding path program 1 times [2022-07-13 03:26:25,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:25,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000408321] [2022-07-13 03:26:25,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:25,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:25,512 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-13 03:26:25,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:25,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000408321] [2022-07-13 03:26:25,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000408321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:25,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:25,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 03:26:25,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836262511] [2022-07-13 03:26:25,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:25,593 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:26:25,593 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:26:25,593 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:26:25,593 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:26:25,593 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:26:25,593 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:25,593 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:26:25,593 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:26:25,593 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration8_Loop [2022-07-13 03:26:25,593 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:26:25,593 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:26:25,594 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-13 03:26:25,602 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-13 03:26:25,800 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:26:25,801 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:26:25,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:25,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:25,802 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:25,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-07-13 03:26:25,804 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:26:25,804 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:25,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:25,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:25,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:25,863 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:25,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-07-13 03:26:25,865 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:26:25,865 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:26:26,605 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:26:26,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-07-13 03:26:26,608 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:26:26,609 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:26:26,609 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:26:26,609 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:26:26,609 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:26:26,609 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:26,609 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:26:26,609 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:26:26,609 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration8_Loop [2022-07-13 03:26:26,609 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:26:26,609 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:26:26,610 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-13 03:26:26,616 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-13 03:26:26,804 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:26:26,804 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:26:26,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:26,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:26,806 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:26,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-07-13 03:26:26,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:26,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:26,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:26,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:26,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:26,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:26,815 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:26,815 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:26,828 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:26,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:26,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:26,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:26,845 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:26,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-07-13 03:26:26,847 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-13 03:26:26,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:26,853 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:26,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:26,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:26,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:26:26,855 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:26:26,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:26,857 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:26,879 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-07-13 03:26:26,879 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-13 03:26:26,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:26,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:26,881 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:26,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-07-13 03:26:26,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:26,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:26,890 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:26,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:26,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:26,890 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:26,892 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:26,892 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:26,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:26,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-07-13 03:26:26,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:26,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:26,912 INFO L229 MonitoredProcess]: Starting monitored process 47 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-13 03:26:26,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-07-13 03:26:26,915 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-13 03:26:26,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:26,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:26,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:26,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:26,921 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:26,924 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:26,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:26,927 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:26,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-07-13 03:26:26,943 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-13 03:26:26,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:26,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:26,944 INFO L229 MonitoredProcess]: Starting monitored process 48 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-13 03:26:26,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-07-13 03:26:26,946 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-13 03:26:26,952 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:26,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:26,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:26,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:26,953 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:26,956 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:26,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:26,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:26,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-07-13 03:26:26,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:26,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:26,977 INFO L229 MonitoredProcess]: Starting monitored process 49 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-13 03:26:26,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-07-13 03:26:26,979 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-13 03:26:26,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:26,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:26,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:26,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:26,985 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:26,989 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:26,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:26,994 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:27,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-07-13 03:26:27,010 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-13 03:26:27,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:27,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:27,011 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:27,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-07-13 03:26:27,013 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-13 03:26:27,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:27,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:27,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:27,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:27,020 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:27,024 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:27,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:27,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:27,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-07-13 03:26:27,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:27,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:27,049 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-13 03:26:27,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-07-13 03:26:27,067 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-13 03:26:27,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:26:27,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:27,080 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:27,080 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:27,080 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:27,086 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:27,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:27,100 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:27,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-07-13 03:26:27,115 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-13 03:26:27,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:27,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:27,117 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-13 03:26:27,117 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-13 03:26:27,119 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-13 03:26:27,125 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:27,125 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:27,125 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:27,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:27,125 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:27,125 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:27,128 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:27,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:27,134 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:27,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-07-13 03:26:27,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:27,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:27,166 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-13 03:26:27,167 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-13 03:26:27,168 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-13 03:26:27,174 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:27,174 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:27,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:27,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:27,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:27,175 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-13 03:26:27,177 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-13 03:26:27,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:27,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:27,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-07-13 03:26:27,203 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-13 03:26:27,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:27,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:27,204 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-13 03:26:27,212 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-13 03:26:27,212 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-13 03:26:27,218 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:27,218 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-13 03:26:27,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:27,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:27,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:27,219 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:27,222 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:27,222 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:27,229 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:27,244 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-13 03:26:27,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:27,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:27,245 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-13 03:26:27,245 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-13 03:26:27,247 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-13 03:26:27,253 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:27,253 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-13 03:26:27,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:27,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:27,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:27,253 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:27,257 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:27,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:27,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:27,279 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-13 03:26:27,280 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-13 03:26:27,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:27,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:27,281 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-13 03:26:27,281 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-13 03:26:27,282 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:27,289 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:27,289 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:27,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:27,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:27,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:27,290 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:27,296 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:27,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:27,311 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:27,330 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-13 03:26:27,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:27,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:27,332 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-13 03:26:27,333 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-13 03:26:27,334 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-13 03:26:27,341 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:27,341 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:27,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:27,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:27,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:27,341 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-13 03:26:27,346 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-13 03:26:27,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:27,357 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:27,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Ended with exit code 0 [2022-07-13 03:26:27,373 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-13 03:26:27,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:27,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:27,374 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-13 03:26:27,375 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-13 03:26:27,376 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-13 03:26:27,382 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:27,382 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:27,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:27,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:27,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:27,382 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:27,385 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:27,386 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:27,400 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:27,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Ended with exit code 0 [2022-07-13 03:26:27,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:27,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:27,417 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-13 03:26:27,417 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-13 03:26:27,419 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-13 03:26:27,425 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:27,425 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-13 03:26:27,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:27,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:27,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:27,425 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-13 03:26:27,429 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-13 03:26:27,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:27,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:27,449 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-13 03:26:27,449 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-13 03:26:27,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:27,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:27,450 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-13 03:26:27,451 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-13 03:26:27,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:26:27,458 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:27,458 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:27,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:27,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:27,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:27,458 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-13 03:26:27,463 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:27,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:27,472 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:27,487 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-13 03:26:27,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:26:27,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:27,489 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-13 03:26:27,489 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-13 03:26:27,491 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-13 03:26:27,496 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-13 03:26:27,496 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-13 03:26:27,496 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:26:27,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:26:27,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:26:27,497 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-13 03:26:27,501 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-13 03:26:27,501 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:26:27,510 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:26:27,526 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-13 03:26:27,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:27,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 03:26:27,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 03:26:27,526 INFO L87 Difference]: Start difference. First operand 328 states and 451 transitions. cyclomatic complexity: 130 Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 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-13 03:26:27,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:27,931 INFO L93 Difference]: Finished difference Result 1321 states and 1776 transitions. [2022-07-13 03:26:27,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 03:26:27,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1321 states and 1776 transitions. [2022-07-13 03:26:27,937 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 848 [2022-07-13 03:26:27,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1321 states to 1321 states and 1776 transitions. [2022-07-13 03:26:27,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1321 [2022-07-13 03:26:27,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1321 [2022-07-13 03:26:27,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1321 states and 1776 transitions. [2022-07-13 03:26:27,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:27,944 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1321 states and 1776 transitions. [2022-07-13 03:26:27,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states and 1776 transitions. [2022-07-13 03:26:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 301. [2022-07-13 03:26:27,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 301 states have (on average 1.398671096345515) internal successors, (421), 300 states have internal predecessors, (421), 0 states have call successors, (0), 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-13 03:26:27,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 421 transitions. [2022-07-13 03:26:27,952 INFO L392 hiAutomatonCegarLoop]: Abstraction has 301 states and 421 transitions. [2022-07-13 03:26:27,952 INFO L374 stractBuchiCegarLoop]: Abstraction has 301 states and 421 transitions. [2022-07-13 03:26:27,952 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-13 03:26:27,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 301 states and 421 transitions. [2022-07-13 03:26:27,953 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 212 [2022-07-13 03:26:27,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:27,953 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:27,955 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:27,955 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-13 03:26:27,956 INFO L752 eck$LassoCheckResult]: Stem: 6225#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(13, 2); 6211#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 6193#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 6195#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 6197#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 6198#L59-1 mp_add_~nb~0#1 := 4; 6220#L69 assume !(0 == mp_add_~b3~0#1 % 256); 6244#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 6227#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; 6228#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 6242#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; 6245#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6229#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6230#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6246#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 6237#L90 [2022-07-13 03:26:27,956 INFO L754 eck$LassoCheckResult]: Loop: 6237#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; 6238#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 6200#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 6201#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 6202#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 6204#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 6221#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6208#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6209#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6234#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6332#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; 6333#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 6223#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; 6224#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6493#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6212#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6213#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 6237#L90 [2022-07-13 03:26:27,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:27,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 1 times [2022-07-13 03:26:27,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:27,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171100172] [2022-07-13 03:26:27,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:27,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:27,968 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:27,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:27,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:27,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1188749690, now seen corresponding path program 1 times [2022-07-13 03:26:27,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:27,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368152849] [2022-07-13 03:26:27,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:27,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:28,005 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-13 03:26:28,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:28,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368152849] [2022-07-13 03:26:28,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368152849] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:28,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:28,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:26:28,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741546411] [2022-07-13 03:26:28,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:28,006 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:28,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:28,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:26:28,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 03:26:28,006 INFO L87 Difference]: Start difference. First operand 301 states and 421 transitions. cyclomatic complexity: 127 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-13 03:26:28,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:28,112 INFO L93 Difference]: Finished difference Result 451 states and 642 transitions. [2022-07-13 03:26:28,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 03:26:28,113 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 451 states and 642 transitions. [2022-07-13 03:26:28,115 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 361 [2022-07-13 03:26:28,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 451 states to 450 states and 641 transitions. [2022-07-13 03:26:28,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 450 [2022-07-13 03:26:28,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 450 [2022-07-13 03:26:28,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 450 states and 641 transitions. [2022-07-13 03:26:28,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:28,118 INFO L369 hiAutomatonCegarLoop]: Abstraction has 450 states and 641 transitions. [2022-07-13 03:26:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states and 641 transitions. [2022-07-13 03:26:28,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 412. [2022-07-13 03:26:28,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 412 states have (on average 1.4029126213592233) internal successors, (578), 411 states have internal predecessors, (578), 0 states have call successors, (0), 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-13 03:26:28,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 578 transitions. [2022-07-13 03:26:28,123 INFO L392 hiAutomatonCegarLoop]: Abstraction has 412 states and 578 transitions. [2022-07-13 03:26:28,123 INFO L374 stractBuchiCegarLoop]: Abstraction has 412 states and 578 transitions. [2022-07-13 03:26:28,123 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-13 03:26:28,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 412 states and 578 transitions. [2022-07-13 03:26:28,125 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 323 [2022-07-13 03:26:28,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:28,126 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:28,126 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:28,127 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-13 03:26:28,127 INFO L752 eck$LassoCheckResult]: Stem: 6986#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(13, 2); 6971#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 6952#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 6954#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 6956#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 6957#L59-1 mp_add_~nb~0#1 := 4; 6983#L69 assume !(0 == mp_add_~b3~0#1 % 256); 6966#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 6988#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; 6989#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7002#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; 7345#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6990#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6972#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6973#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 6995#L90 [2022-07-13 03:26:28,127 INFO L754 eck$LassoCheckResult]: Loop: 6995#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; 6996#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 6959#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 6960#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 6961#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 7030#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 7031#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 7058#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7059#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7053#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7054#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; 7303#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 7304#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7347#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 7006#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 7007#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 6968#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 6969#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6994#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7047#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; 7048#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 6984#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; 6985#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 7005#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 7344#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 7343#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 6995#L90 [2022-07-13 03:26:28,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:28,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 2 times [2022-07-13 03:26:28,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:28,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844764846] [2022-07-13 03:26:28,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:28,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:28,135 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:28,143 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:28,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:28,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1293860767, now seen corresponding path program 1 times [2022-07-13 03:26:28,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:28,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104920107] [2022-07-13 03:26:28,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:28,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:28,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:28,155 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-13 03:26:28,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:28,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104920107] [2022-07-13 03:26:28,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104920107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:28,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:28,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:26:28,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380840505] [2022-07-13 03:26:28,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:28,156 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:28,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:28,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:26:28,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:26:28,157 INFO L87 Difference]: Start difference. First operand 412 states and 578 transitions. cyclomatic complexity: 173 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-13 03:26:28,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:28,217 INFO L93 Difference]: Finished difference Result 536 states and 740 transitions. [2022-07-13 03:26:28,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:26:28,217 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 536 states and 740 transitions. [2022-07-13 03:26:28,219 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 447 [2022-07-13 03:26:28,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 536 states to 536 states and 740 transitions. [2022-07-13 03:26:28,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 536 [2022-07-13 03:26:28,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 536 [2022-07-13 03:26:28,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 536 states and 740 transitions. [2022-07-13 03:26:28,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:28,222 INFO L369 hiAutomatonCegarLoop]: Abstraction has 536 states and 740 transitions. [2022-07-13 03:26:28,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states and 740 transitions. [2022-07-13 03:26:28,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 482. [2022-07-13 03:26:28,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 482 states have (on average 1.392116182572614) internal successors, (671), 481 states have internal predecessors, (671), 0 states have call successors, (0), 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-13 03:26:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 671 transitions. [2022-07-13 03:26:28,229 INFO L392 hiAutomatonCegarLoop]: Abstraction has 482 states and 671 transitions. [2022-07-13 03:26:28,229 INFO L374 stractBuchiCegarLoop]: Abstraction has 482 states and 671 transitions. [2022-07-13 03:26:28,229 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-13 03:26:28,229 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 671 transitions. [2022-07-13 03:26:28,231 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 393 [2022-07-13 03:26:28,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:28,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:28,231 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:28,231 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-13 03:26:28,232 INFO L752 eck$LassoCheckResult]: Stem: 7937#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(13, 2); 7925#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 7906#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 7908#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 7910#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 7911#L59-1 mp_add_~nb~0#1 := 4; 7992#L69 assume !(0 == mp_add_~b3~0#1 % 256); 7958#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 7959#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; 8203#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8201#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; 8200#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 8188#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 8182#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 8176#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 8164#L90 [2022-07-13 03:26:28,232 INFO L754 eck$LassoCheckResult]: Loop: 8164#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; 8168#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 8166#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 8162#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 8158#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 8154#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 8153#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8152#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8151#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8150#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8149#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; 7953#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 7954#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8193#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 8186#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8181#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 8179#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8177#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8175#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8174#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; 8172#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8171#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; 8170#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 8169#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 8167#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 8163#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 8164#L90 [2022-07-13 03:26:28,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:28,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 3 times [2022-07-13 03:26:28,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:28,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731164500] [2022-07-13 03:26:28,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:28,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:28,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:28,240 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:28,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:28,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:28,249 INFO L85 PathProgramCache]: Analyzing trace with hash 900833757, now seen corresponding path program 1 times [2022-07-13 03:26:28,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:28,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819747266] [2022-07-13 03:26:28,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:28,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:28,303 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-13 03:26:28,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:28,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819747266] [2022-07-13 03:26:28,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819747266] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:28,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:28,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:26:28,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942466662] [2022-07-13 03:26:28,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:28,305 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:28,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:28,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 03:26:28,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 03:26:28,305 INFO L87 Difference]: Start difference. First operand 482 states and 671 transitions. cyclomatic complexity: 195 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-13 03:26:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:28,473 INFO L93 Difference]: Finished difference Result 965 states and 1310 transitions. [2022-07-13 03:26:28,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 03:26:28,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 965 states and 1310 transitions. [2022-07-13 03:26:28,478 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 833 [2022-07-13 03:26:28,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 965 states to 964 states and 1309 transitions. [2022-07-13 03:26:28,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 964 [2022-07-13 03:26:28,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 964 [2022-07-13 03:26:28,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 964 states and 1309 transitions. [2022-07-13 03:26:28,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:28,483 INFO L369 hiAutomatonCegarLoop]: Abstraction has 964 states and 1309 transitions. [2022-07-13 03:26:28,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states and 1309 transitions. [2022-07-13 03:26:28,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 723. [2022-07-13 03:26:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 723 states have (on average 1.3706777316735823) internal successors, (991), 722 states have internal predecessors, (991), 0 states have call successors, (0), 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-13 03:26:28,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 991 transitions. [2022-07-13 03:26:28,492 INFO L392 hiAutomatonCegarLoop]: Abstraction has 723 states and 991 transitions. [2022-07-13 03:26:28,492 INFO L374 stractBuchiCegarLoop]: Abstraction has 723 states and 991 transitions. [2022-07-13 03:26:28,492 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-13 03:26:28,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 723 states and 991 transitions. [2022-07-13 03:26:28,494 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 628 [2022-07-13 03:26:28,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:28,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:28,495 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:28,495 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-13 03:26:28,495 INFO L752 eck$LassoCheckResult]: Stem: 9396#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(13, 2); 9384#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 9364#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 9366#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 9368#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 9369#L59-1 mp_add_~nb~0#1 := 4; 9698#L69 assume !(0 == mp_add_~b3~0#1 % 256); 9412#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 9413#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; 9782#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 9781#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; 9780#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 9779#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 9778#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 9777#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 9772#L90 [2022-07-13 03:26:28,495 INFO L754 eck$LassoCheckResult]: Loop: 9772#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; 9753#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 9773#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 9769#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 9770#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 9724#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 9725#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 9815#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 9814#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 9813#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 9812#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; 9811#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 9810#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 9785#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 9723#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 9720#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 9721#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 9787#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 9752#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 9749#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; 9745#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 9746#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; 9776#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 9775#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 9774#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 9771#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 9772#L90 [2022-07-13 03:26:28,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:28,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 4 times [2022-07-13 03:26:28,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:28,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915578295] [2022-07-13 03:26:28,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:28,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:28,502 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:28,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:28,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:28,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1994925345, now seen corresponding path program 1 times [2022-07-13 03:26:28,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:28,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129894662] [2022-07-13 03:26:28,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:28,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:28,597 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-13 03:26:28,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:28,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129894662] [2022-07-13 03:26:28,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129894662] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:28,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865003412] [2022-07-13 03:26:28,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:28,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:28,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:28,599 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:28,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-07-13 03:26:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:28,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 03:26:28,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:28,761 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-13 03:26:28,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:28,792 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-13 03:26:28,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865003412] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:28,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:28,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-07-13 03:26:28,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569313869] [2022-07-13 03:26:28,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:28,794 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:28,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:28,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 03:26:28,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-13 03:26:28,794 INFO L87 Difference]: Start difference. First operand 723 states and 991 transitions. cyclomatic complexity: 276 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-13 03:26:29,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:29,121 INFO L93 Difference]: Finished difference Result 1229 states and 1633 transitions. [2022-07-13 03:26:29,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 03:26:29,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1229 states and 1633 transitions. [2022-07-13 03:26:29,126 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1055 [2022-07-13 03:26:29,130 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1229 states to 1229 states and 1633 transitions. [2022-07-13 03:26:29,130 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1229 [2022-07-13 03:26:29,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1229 [2022-07-13 03:26:29,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1229 states and 1633 transitions. [2022-07-13 03:26:29,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:29,132 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1229 states and 1633 transitions. [2022-07-13 03:26:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states and 1633 transitions. [2022-07-13 03:26:29,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1088. [2022-07-13 03:26:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1088 states have (on average 1.3446691176470589) internal successors, (1463), 1087 states have internal predecessors, (1463), 0 states have call successors, (0), 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-13 03:26:29,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 1463 transitions. [2022-07-13 03:26:29,145 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1088 states and 1463 transitions. [2022-07-13 03:26:29,145 INFO L374 stractBuchiCegarLoop]: Abstraction has 1088 states and 1463 transitions. [2022-07-13 03:26:29,145 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-13 03:26:29,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1088 states and 1463 transitions. [2022-07-13 03:26:29,148 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 961 [2022-07-13 03:26:29,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:29,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:29,149 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:29,149 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-13 03:26:29,149 INFO L752 eck$LassoCheckResult]: Stem: 11512#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(13, 2); 11500#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 11481#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 11483#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 11485#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 11486#L59-1 mp_add_~nb~0#1 := 4; 12028#L69 assume !(0 == mp_add_~b3~0#1 % 256); 11533#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 11514#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; 11515#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 12216#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; 12215#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 12214#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 12213#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 12212#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 12192#L90 [2022-07-13 03:26:29,150 INFO L754 eck$LassoCheckResult]: Loop: 12192#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; 12070#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 12211#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 12209#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 12205#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 12056#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 12055#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 12054#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 12052#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 12047#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 12046#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; 12035#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 12036#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 12135#L90 assume !(0 == mp_add_~i~0#1 % 256); 12134#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; 12133#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 12131#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 12127#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 12125#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 12124#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 12123#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 12122#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 12121#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 12120#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; 12119#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 12075#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; 12203#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 12202#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 12201#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 12191#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 12192#L90 [2022-07-13 03:26:29,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:29,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 5 times [2022-07-13 03:26:29,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:29,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258335642] [2022-07-13 03:26:29,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:29,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:29,158 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:29,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:29,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:29,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1196420781, now seen corresponding path program 1 times [2022-07-13 03:26:29,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:29,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331933497] [2022-07-13 03:26:29,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:29,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:29,191 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-13 03:26:29,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:29,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331933497] [2022-07-13 03:26:29,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331933497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:29,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:29,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:26:29,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795666603] [2022-07-13 03:26:29,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:29,193 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:29,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:29,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:26:29,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 03:26:29,193 INFO L87 Difference]: Start difference. First operand 1088 states and 1463 transitions. cyclomatic complexity: 383 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-13 03:26:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:29,305 INFO L93 Difference]: Finished difference Result 1450 states and 1886 transitions. [2022-07-13 03:26:29,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 03:26:29,306 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1450 states and 1886 transitions. [2022-07-13 03:26:29,320 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1308 [2022-07-13 03:26:29,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1450 states to 1449 states and 1883 transitions. [2022-07-13 03:26:29,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1449 [2022-07-13 03:26:29,326 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1449 [2022-07-13 03:26:29,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1449 states and 1883 transitions. [2022-07-13 03:26:29,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:29,328 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1449 states and 1883 transitions. [2022-07-13 03:26:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states and 1883 transitions. [2022-07-13 03:26:29,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1136. [2022-07-13 03:26:29,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 1136 states have (on average 1.3195422535211268) internal successors, (1499), 1135 states have internal predecessors, (1499), 0 states have call successors, (0), 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-13 03:26:29,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1499 transitions. [2022-07-13 03:26:29,344 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1136 states and 1499 transitions. [2022-07-13 03:26:29,344 INFO L374 stractBuchiCegarLoop]: Abstraction has 1136 states and 1499 transitions. [2022-07-13 03:26:29,344 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-13 03:26:29,344 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1136 states and 1499 transitions. [2022-07-13 03:26:29,347 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1043 [2022-07-13 03:26:29,347 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:29,347 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:29,348 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:29,348 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-13 03:26:29,349 INFO L752 eck$LassoCheckResult]: Stem: 14063#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(13, 2); 14049#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 14029#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 14031#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 14033#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 14034#L59-1 mp_add_~nb~0#1 := 4; 14503#L69 assume !(0 == mp_add_~b3~0#1 % 256); 14084#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 14085#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; 14968#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 14966#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; 14967#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 14951#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 14952#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 14941#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 14940#L90 [2022-07-13 03:26:29,349 INFO L754 eck$LassoCheckResult]: Loop: 14940#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; 14838#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 14939#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 14934#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 14930#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 14928#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 14887#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 14927#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 14926#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14925#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14924#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; 14923#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 14921#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 14922#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 15020#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 15019#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 15018#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 15017#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 15016#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 15015#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; 15014#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 15013#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 14865#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 15000#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 14795#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 14796#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 14510#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14511#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14157#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; 14158#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 14842#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; 14964#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 14965#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 14947#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 14948#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 14940#L90 [2022-07-13 03:26:29,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:29,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 6 times [2022-07-13 03:26:29,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:29,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68594568] [2022-07-13 03:26:29,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:29,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:29,363 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:29,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:29,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:29,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:29,388 INFO L85 PathProgramCache]: Analyzing trace with hash -239832150, now seen corresponding path program 2 times [2022-07-13 03:26:29,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:29,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003632202] [2022-07-13 03:26:29,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:29,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:29,418 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-13 03:26:29,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:29,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003632202] [2022-07-13 03:26:29,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003632202] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:29,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355817992] [2022-07-13 03:26:29,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 03:26:29,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:29,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:29,420 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-13 03:26:29,421 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-13 03:26:29,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 03:26:29,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:26:29,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 03:26:29,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:29,488 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-13 03:26:29,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 03:26:29,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355817992] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:29,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 03:26:29,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-07-13 03:26:29,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924822682] [2022-07-13 03:26:29,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:29,490 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:29,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:29,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:26:29,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 03:26:29,490 INFO L87 Difference]: Start difference. First operand 1136 states and 1499 transitions. cyclomatic complexity: 369 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-13 03:26:29,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:29,625 INFO L93 Difference]: Finished difference Result 1318 states and 1709 transitions. [2022-07-13 03:26:29,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 03:26:29,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1318 states and 1709 transitions. [2022-07-13 03:26:29,630 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1216 [2022-07-13 03:26:29,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1318 states to 1309 states and 1700 transitions. [2022-07-13 03:26:29,634 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1309 [2022-07-13 03:26:29,635 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1309 [2022-07-13 03:26:29,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1309 states and 1700 transitions. [2022-07-13 03:26:29,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:29,636 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1309 states and 1700 transitions. [2022-07-13 03:26:29,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states and 1700 transitions. [2022-07-13 03:26:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1226. [2022-07-13 03:26:29,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 1226 states have (on average 1.3058727569331159) internal successors, (1601), 1225 states have internal predecessors, (1601), 0 states have call successors, (0), 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-13 03:26:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1601 transitions. [2022-07-13 03:26:29,648 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1226 states and 1601 transitions. [2022-07-13 03:26:29,649 INFO L374 stractBuchiCegarLoop]: Abstraction has 1226 states and 1601 transitions. [2022-07-13 03:26:29,649 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-13 03:26:29,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1226 states and 1601 transitions. [2022-07-13 03:26:29,652 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1135 [2022-07-13 03:26:29,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:29,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:29,652 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:29,652 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-13 03:26:29,653 INFO L752 eck$LassoCheckResult]: Stem: 16625#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(13, 2); 16613#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 16600#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 16602#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 16604#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 16605#L59-1 mp_add_~nb~0#1 := 4; 16737#L69 assume !(0 == mp_add_~b3~0#1 % 256); 16643#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 16629#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; 16630#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 17817#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; 17816#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 17815#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 17814#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 17773#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 17772#L90 [2022-07-13 03:26:29,653 INFO L754 eck$LassoCheckResult]: Loop: 17772#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; 17492#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 17771#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 17769#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 17763#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 17737#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 17478#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 17735#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 17734#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 16705#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 16695#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; 16696#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 17704#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 17703#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 17805#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 17804#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 17803#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 17802#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 17801#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 16697#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; 16698#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 17428#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 17421#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 17416#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 17417#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 16740#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 16741#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 17477#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 16650#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; 16651#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 17499#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; 17795#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 17794#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 17792#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 17789#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 17772#L90 [2022-07-13 03:26:29,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:29,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 7 times [2022-07-13 03:26:29,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:29,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456749251] [2022-07-13 03:26:29,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:29,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:29,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:29,659 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:29,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:29,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:29,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:29,666 INFO L85 PathProgramCache]: Analyzing trace with hash -632859160, now seen corresponding path program 2 times [2022-07-13 03:26:29,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:29,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151520630] [2022-07-13 03:26:29,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:29,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:29,698 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-13 03:26:29,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:29,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151520630] [2022-07-13 03:26:29,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151520630] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:29,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124842720] [2022-07-13 03:26:29,698 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 03:26:29,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:29,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:29,736 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:29,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-07-13 03:26:29,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 03:26:29,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:26:29,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 03:26:29,769 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:29,806 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-13 03:26:29,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:29,847 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-13 03:26:29,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124842720] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:29,848 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:29,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-07-13 03:26:29,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948676987] [2022-07-13 03:26:29,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:29,849 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:29,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:29,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 03:26:29,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-13 03:26:29,849 INFO L87 Difference]: Start difference. First operand 1226 states and 1601 transitions. cyclomatic complexity: 380 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-13 03:26:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:30,932 INFO L93 Difference]: Finished difference Result 2029 states and 2515 transitions. [2022-07-13 03:26:30,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-13 03:26:30,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2029 states and 2515 transitions. [2022-07-13 03:26:30,939 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1839 [2022-07-13 03:26:30,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2029 states to 2000 states and 2477 transitions. [2022-07-13 03:26:30,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2000 [2022-07-13 03:26:30,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2000 [2022-07-13 03:26:30,947 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2000 states and 2477 transitions. [2022-07-13 03:26:30,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:30,948 INFO L369 hiAutomatonCegarLoop]: Abstraction has 2000 states and 2477 transitions. [2022-07-13 03:26:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states and 2477 transitions. [2022-07-13 03:26:30,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1227. [2022-07-13 03:26:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1227 states have (on average 1.2828035859820701) internal successors, (1574), 1226 states have internal predecessors, (1574), 0 states have call successors, (0), 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-13 03:26:30,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1574 transitions. [2022-07-13 03:26:30,964 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1227 states and 1574 transitions. [2022-07-13 03:26:30,964 INFO L374 stractBuchiCegarLoop]: Abstraction has 1227 states and 1574 transitions. [2022-07-13 03:26:30,964 INFO L287 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-13 03:26:30,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1227 states and 1574 transitions. [2022-07-13 03:26:30,967 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1117 [2022-07-13 03:26:30,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:30,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:30,968 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:30,968 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-13 03:26:30,968 INFO L752 eck$LassoCheckResult]: Stem: 20209#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(13, 2); 20197#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 20176#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 20178#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 20180#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 20181#L59-1 mp_add_~nb~0#1 := 4; 20585#L69 assume !(0 == mp_add_~b3~0#1 % 256); 20582#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 20581#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; 20580#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 20579#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; 20578#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 20577#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 20576#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 20574#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 20550#L90 [2022-07-13 03:26:30,969 INFO L754 eck$LassoCheckResult]: Loop: 20550#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; 20570#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 20568#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 20566#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 20563#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 20564#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 20571#L96-8 mp_add_~carry~0#1 := 1; 20569#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 20567#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20565#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20562#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20517#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20518#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; 20509#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20510#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 20504#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 20501#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 20499#L96-8 mp_add_~carry~0#1 := 1; 20497#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20494#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 20361#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20489#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20486#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20483#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; 20480#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20472#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 20468#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 20469#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 20470#L96-8 mp_add_~carry~0#1 := 1; 20467#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20462#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20460#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 20458#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20452#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20451#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; 20449#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20446#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 20441#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 20442#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 20440#L96-8 mp_add_~carry~0#1 := 1; 20438#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20436#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20426#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20422#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 20416#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20414#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; 20412#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20404#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 20406#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 20386#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 20383#L96-8 mp_add_~carry~0#1 := 1; 20377#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20378#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20366#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20363#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20352#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20351#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; 20334#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20335#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 20421#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 20389#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 20390#L96-8 mp_add_~carry~0#1 := 1; 20379#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20380#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20367#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20364#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20356#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20353#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; 20292#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20293#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 20373#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 20374#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20435#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20434#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20432#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20431#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20428#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; 20429#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 20557#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; 20556#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 20553#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 20551#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 20549#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 20550#L90 [2022-07-13 03:26:30,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:30,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 8 times [2022-07-13 03:26:30,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:30,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672898197] [2022-07-13 03:26:30,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:30,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:30,976 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:30,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:30,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:30,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1271323788, now seen corresponding path program 1 times [2022-07-13 03:26:30,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:30,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234046332] [2022-07-13 03:26:30,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:30,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:30,998 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-13 03:26:30,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:30,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234046332] [2022-07-13 03:26:30,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234046332] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:30,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:30,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 03:26:30,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302850790] [2022-07-13 03:26:30,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:30,999 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:30,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:30,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:26:30,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 03:26:31,000 INFO L87 Difference]: Start difference. First operand 1227 states and 1574 transitions. cyclomatic complexity: 352 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-13 03:26:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:31,037 INFO L93 Difference]: Finished difference Result 1542 states and 1876 transitions. [2022-07-13 03:26:31,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 03:26:31,037 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1542 states and 1876 transitions. [2022-07-13 03:26:31,041 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1259 [2022-07-13 03:26:31,045 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1542 states to 1398 states and 1732 transitions. [2022-07-13 03:26:31,046 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1398 [2022-07-13 03:26:31,046 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1398 [2022-07-13 03:26:31,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1398 states and 1732 transitions. [2022-07-13 03:26:31,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:31,048 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1398 states and 1732 transitions. [2022-07-13 03:26:31,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states and 1732 transitions. [2022-07-13 03:26:31,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1121. [2022-07-13 03:26:31,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 1121 states have (on average 1.255129348795718) internal successors, (1407), 1120 states have internal predecessors, (1407), 0 states have call successors, (0), 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-13 03:26:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1407 transitions. [2022-07-13 03:26:31,061 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1121 states and 1407 transitions. [2022-07-13 03:26:31,061 INFO L374 stractBuchiCegarLoop]: Abstraction has 1121 states and 1407 transitions. [2022-07-13 03:26:31,061 INFO L287 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-07-13 03:26:31,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1121 states and 1407 transitions. [2022-07-13 03:26:31,063 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 996 [2022-07-13 03:26:31,063 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:31,063 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:31,064 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:31,064 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-13 03:26:31,064 INFO L752 eck$LassoCheckResult]: Stem: 22987#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(13, 2); 22973#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 22959#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 22961#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 22963#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 22964#L59-1 mp_add_~nb~0#1 := 4; 23278#L69 assume !(0 == mp_add_~b3~0#1 % 256); 23275#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 23274#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; 23273#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 23271#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; 23272#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 23267#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 23268#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 23263#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23262#L90 [2022-07-13 03:26:31,064 INFO L754 eck$LassoCheckResult]: Loop: 23262#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; 23261#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 23260#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 23258#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 23253#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 23255#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 23248#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23249#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23244#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23245#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23240#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; 23241#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23237#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23236#L90 assume !(0 == mp_add_~i~0#1 % 256); 23235#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; 23131#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 23231#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 23228#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 23229#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 23230#L96-8 mp_add_~carry~0#1 := 1; 23227#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23225#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 23223#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23221#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23219#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23217#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; 23212#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23213#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 23216#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 23201#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23211#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23209#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 23207#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23205#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23187#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; 23188#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23183#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23181#L90 assume !(0 == mp_add_~i~0#1 % 256); 23179#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 23176#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 23168#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; 23164#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 23160#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 23156#L96-8 mp_add_~carry~0#1 := 1; 23154#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23152#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23150#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23148#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 23116#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23146#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; 23145#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23143#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 23144#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 23956#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23954#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23139#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23138#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23105#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23137#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; 23135#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23136#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23132#L90 assume !(0 == mp_add_~i~0#1 % 256); 23130#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 23129#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 23127#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 23124#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 23121#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 23120#L96-8 mp_add_~carry~0#1 := 1; 23119#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23118#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23117#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23115#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23114#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23113#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; 23112#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23110#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 23109#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 23108#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23107#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23106#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23104#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23103#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23032#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; 23033#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 23264#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; 23269#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 23270#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 23265#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 23266#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23262#L90 [2022-07-13 03:26:31,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:31,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 9 times [2022-07-13 03:26:31,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:31,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263316186] [2022-07-13 03:26:31,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:31,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:31,070 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:31,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:31,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:31,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1286195251, now seen corresponding path program 1 times [2022-07-13 03:26:31,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:31,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26335405] [2022-07-13 03:26:31,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:31,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:31,174 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-13 03:26:31,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:31,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26335405] [2022-07-13 03:26:31,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26335405] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:31,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:31,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 03:26:31,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740376855] [2022-07-13 03:26:31,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:31,175 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:31,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:31,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 03:26:31,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-13 03:26:31,176 INFO L87 Difference]: Start difference. First operand 1121 states and 1407 transitions. cyclomatic complexity: 291 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-13 03:26:31,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:31,448 INFO L93 Difference]: Finished difference Result 1741 states and 2153 transitions. [2022-07-13 03:26:31,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 03:26:31,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1741 states and 2153 transitions. [2022-07-13 03:26:31,452 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1451 [2022-07-13 03:26:31,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1741 states to 1712 states and 2122 transitions. [2022-07-13 03:26:31,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1712 [2022-07-13 03:26:31,465 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1712 [2022-07-13 03:26:31,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1712 states and 2122 transitions. [2022-07-13 03:26:31,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:31,467 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1712 states and 2122 transitions. [2022-07-13 03:26:31,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states and 2122 transitions. [2022-07-13 03:26:31,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1400. [2022-07-13 03:26:31,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1400 states have (on average 1.2635714285714286) internal successors, (1769), 1399 states have internal predecessors, (1769), 0 states have call successors, (0), 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-13 03:26:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1769 transitions. [2022-07-13 03:26:31,482 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1400 states and 1769 transitions. [2022-07-13 03:26:31,482 INFO L374 stractBuchiCegarLoop]: Abstraction has 1400 states and 1769 transitions. [2022-07-13 03:26:31,483 INFO L287 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-07-13 03:26:31,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1400 states and 1769 transitions. [2022-07-13 03:26:31,485 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1229 [2022-07-13 03:26:31,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:31,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:31,485 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:31,486 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-13 03:26:31,486 INFO L752 eck$LassoCheckResult]: Stem: 25873#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(13, 2); 25858#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 25844#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 25846#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 25848#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 25849#L59-1 mp_add_~nb~0#1 := 4; 26143#L69 assume !(0 == mp_add_~b3~0#1 % 256); 26140#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 26139#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; 26137#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 26138#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; 26134#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 26135#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 26131#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 26129#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26128#L90 [2022-07-13 03:26:31,486 INFO L754 eck$LassoCheckResult]: Loop: 26128#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; 26127#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26126#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 26124#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 26119#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 26121#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 26114#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26115#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26110#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26111#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26106#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; 26107#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26103#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26102#L90 assume !(0 == mp_add_~i~0#1 % 256); 26101#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; 26003#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 26099#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 26095#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 26092#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26091#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 26090#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26089#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26088#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26087#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; 26086#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26085#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26084#L90 assume !(0 == mp_add_~i~0#1 % 256); 26083#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26082#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; 26080#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 26076#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 26074#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26072#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26070#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 26065#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26066#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26059#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; 26060#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26052#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26050#L90 assume !(0 == mp_add_~i~0#1 % 256); 26048#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26045#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 26042#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; 26038#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 26034#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 26030#L96-8 mp_add_~carry~0#1 := 1; 26028#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26026#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26024#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26022#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 25988#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26020#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; 26019#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26018#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 26015#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 26013#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26014#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26011#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26010#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 25977#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26009#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; 26007#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26008#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26004#L90 assume !(0 == mp_add_~i~0#1 % 256); 26002#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26001#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 25999#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 25996#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 25993#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 25992#L96-8 mp_add_~carry~0#1 := 1; 25991#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 25990#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 25989#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 25987#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 25986#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 25985#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; 25984#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 25982#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 25981#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 25980#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 25979#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 25978#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 25976#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 25975#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 25913#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; 25914#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 26130#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; 26136#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 26132#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 26133#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 27124#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26128#L90 [2022-07-13 03:26:31,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:31,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 10 times [2022-07-13 03:26:31,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:31,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683747310] [2022-07-13 03:26:31,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:31,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:31,508 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:31,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:31,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:31,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1983601108, now seen corresponding path program 1 times [2022-07-13 03:26:31,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:31,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581977783] [2022-07-13 03:26:31,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:31,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:31,537 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-13 03:26:31,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:31,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581977783] [2022-07-13 03:26:31,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581977783] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:31,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:31,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:26:31,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701692816] [2022-07-13 03:26:31,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:31,539 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:31,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:31,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:26:31,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:26:31,539 INFO L87 Difference]: Start difference. First operand 1400 states and 1769 transitions. cyclomatic complexity: 376 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-13 03:26:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:31,555 INFO L93 Difference]: Finished difference Result 1400 states and 1725 transitions. [2022-07-13 03:26:31,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:26:31,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1400 states and 1725 transitions. [2022-07-13 03:26:31,559 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1229 [2022-07-13 03:26:31,568 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1400 states to 1400 states and 1725 transitions. [2022-07-13 03:26:31,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1400 [2022-07-13 03:26:31,569 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1400 [2022-07-13 03:26:31,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1400 states and 1725 transitions. [2022-07-13 03:26:31,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:31,570 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1400 states and 1725 transitions. [2022-07-13 03:26:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states and 1725 transitions. [2022-07-13 03:26:31,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 1400. [2022-07-13 03:26:31,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1400 states have (on average 1.2321428571428572) internal successors, (1725), 1399 states have internal predecessors, (1725), 0 states have call successors, (0), 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-13 03:26:31,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1725 transitions. [2022-07-13 03:26:31,587 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1400 states and 1725 transitions. [2022-07-13 03:26:31,587 INFO L374 stractBuchiCegarLoop]: Abstraction has 1400 states and 1725 transitions. [2022-07-13 03:26:31,587 INFO L287 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-07-13 03:26:31,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1400 states and 1725 transitions. [2022-07-13 03:26:31,589 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1229 [2022-07-13 03:26:31,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:31,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:31,591 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:31,591 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-13 03:26:31,591 INFO L752 eck$LassoCheckResult]: Stem: 28677#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(13, 2); 28665#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 28645#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 28647#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 28649#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 28650#L59-1 mp_add_~nb~0#1 := 4; 28958#L69 assume !(0 == mp_add_~b3~0#1 % 256); 28955#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 28954#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; 28952#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 28953#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; 29848#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 28948#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 28949#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 28944#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28943#L90 [2022-07-13 03:26:31,592 INFO L754 eck$LassoCheckResult]: Loop: 28943#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; 28942#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 28940#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 28938#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 28934#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 28936#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 28929#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28930#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28925#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 28926#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28922#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; 28921#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 28920#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28919#L90 assume !(0 == mp_add_~i~0#1 % 256); 28918#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; 28819#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 28915#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 28911#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 28913#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29955#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 29953#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29951#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29950#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29949#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; 29948#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 28901#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28900#L90 assume !(0 == mp_add_~i~0#1 % 256); 28898#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 28896#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; 28894#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 28891#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 28889#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 28887#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28885#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 28883#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 28881#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28879#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; 28877#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 28868#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28866#L90 assume !(0 == mp_add_~i~0#1 % 256); 28864#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 28861#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 28858#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; 28855#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 28856#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 28874#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28873#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28872#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 28871#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28870#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; 28869#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 28867#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28865#L90 assume !(0 == mp_add_~i~0#1 % 256); 28863#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 28860#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 28857#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; 28816#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 28814#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 28828#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28827#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28826#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 28792#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28825#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; 28823#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 28824#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28820#L90 assume !(0 == mp_add_~i~0#1 % 256); 28818#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 28817#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 28815#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 28813#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 28812#L96 assume !(0 == mp_add_~partial_sum~0#1); 28811#L96-2 assume !false; 28810#L96-4 assume !false; 28809#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; 28808#L96-8 mp_add_~carry~0#1 := 1; 28807#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 28806#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28805#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28803#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 28802#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28801#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; 28800#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 28798#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 28797#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 28796#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 28794#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28793#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28791#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 28790#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28724#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; 28725#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 28945#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; 28950#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 28951#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 28946#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 28947#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 28943#L90 [2022-07-13 03:26:31,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:31,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 11 times [2022-07-13 03:26:31,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:31,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632109627] [2022-07-13 03:26:31,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:31,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:31,599 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:31,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:31,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:31,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1164629126, now seen corresponding path program 1 times [2022-07-13 03:26:31,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:31,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268152276] [2022-07-13 03:26:31,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:31,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:31,633 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-13 03:26:31,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:31,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268152276] [2022-07-13 03:26:31,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268152276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:31,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:26:31,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 03:26:31,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571989430] [2022-07-13 03:26:31,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:31,635 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:31,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:31,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 03:26:31,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 03:26:31,635 INFO L87 Difference]: Start difference. First operand 1400 states and 1725 transitions. cyclomatic complexity: 332 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-13 03:26:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:31,679 INFO L93 Difference]: Finished difference Result 1512 states and 1843 transitions. [2022-07-13 03:26:31,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 03:26:31,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1512 states and 1843 transitions. [2022-07-13 03:26:31,691 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1341 [2022-07-13 03:26:31,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1512 states to 1512 states and 1843 transitions. [2022-07-13 03:26:31,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1512 [2022-07-13 03:26:31,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1512 [2022-07-13 03:26:31,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1512 states and 1843 transitions. [2022-07-13 03:26:31,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:31,696 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1512 states and 1843 transitions. [2022-07-13 03:26:31,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states and 1843 transitions. [2022-07-13 03:26:31,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1431. [2022-07-13 03:26:31,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1431 states, 1431 states have (on average 1.2313067784765899) internal successors, (1762), 1430 states have internal predecessors, (1762), 0 states have call successors, (0), 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-13 03:26:31,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 1762 transitions. [2022-07-13 03:26:31,710 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1431 states and 1762 transitions. [2022-07-13 03:26:31,710 INFO L374 stractBuchiCegarLoop]: Abstraction has 1431 states and 1762 transitions. [2022-07-13 03:26:31,710 INFO L287 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2022-07-13 03:26:31,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1431 states and 1762 transitions. [2022-07-13 03:26:31,712 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1260 [2022-07-13 03:26:31,712 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:31,713 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:31,713 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:31,713 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-13 03:26:31,713 INFO L752 eck$LassoCheckResult]: Stem: 31598#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(13, 2); 31583#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 31569#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 31571#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 31573#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 31574#L59-1 mp_add_~nb~0#1 := 4; 31886#L69 assume !(0 == mp_add_~b3~0#1 % 256); 31883#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 31882#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; 31881#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 31879#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; 31880#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 31875#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 31876#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 31871#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31870#L90 [2022-07-13 03:26:31,713 INFO L754 eck$LassoCheckResult]: Loop: 31870#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; 31869#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 31867#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 31865#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 31861#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 31863#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 31856#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 31857#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32969#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32968#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31850#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; 31851#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 31847#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31846#L90 assume !(0 == mp_add_~i~0#1 % 256); 31845#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; 31739#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 31842#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 31839#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 31835#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 31836#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 31831#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 31832#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32889#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32887#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; 32886#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 31822#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31821#L90 assume !(0 == mp_add_~i~0#1 % 256); 31820#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 31819#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; 31818#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 31816#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 31814#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 31812#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 31810#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 31808#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 31806#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31804#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; 31802#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 31800#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31794#L90 assume !(0 == mp_add_~i~0#1 % 256); 31797#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 31795#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 31791#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; 31792#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 31787#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 31785#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 31783#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 31771#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 31770#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31767#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; 31768#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 31764#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31762#L90 assume !(0 == mp_add_~i~0#1 % 256); 31763#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 31756#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 31757#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 31782#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 31734#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 31750#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 31748#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 31746#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 31713#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31745#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; 31743#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 31744#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31740#L90 assume !(0 == mp_add_~i~0#1 % 256); 31738#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 31737#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 31735#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 31733#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254; 31732#L96 assume !(0 == mp_add_~partial_sum~0#1); 31731#L96-2 assume !false; 31730#L96-4 assume !false; 31729#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; 31728#L96-8 mp_add_~carry~0#1 := 1; 31727#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 31726#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 31725#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 31723#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 31722#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31721#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; 31720#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 31718#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 31717#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 31716#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 31715#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 31714#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 31712#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 31711#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31626#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; 31627#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 31872#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; 31877#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 31878#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 31873#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 31874#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31870#L90 [2022-07-13 03:26:31,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:31,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 12 times [2022-07-13 03:26:31,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:31,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729560181] [2022-07-13 03:26:31,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:31,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:31,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:31,735 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:31,741 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:31,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:31,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1588275848, now seen corresponding path program 2 times [2022-07-13 03:26:31,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:31,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395040566] [2022-07-13 03:26:31,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:31,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:31,773 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-13 03:26:31,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:31,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395040566] [2022-07-13 03:26:31,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395040566] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:31,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915941382] [2022-07-13 03:26:31,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 03:26:31,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:31,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:31,785 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:31,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-07-13 03:26:31,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 03:26:31,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:26:31,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 03:26:31,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:31,859 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-13 03:26:31,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:31,878 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-13 03:26:31,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915941382] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:31,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:31,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-07-13 03:26:31,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060525143] [2022-07-13 03:26:31,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:31,879 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:31,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:31,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:26:31,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 03:26:31,879 INFO L87 Difference]: Start difference. First operand 1431 states and 1762 transitions. cyclomatic complexity: 338 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-13 03:26:31,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:31,901 INFO L93 Difference]: Finished difference Result 708 states and 810 transitions. [2022-07-13 03:26:31,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 03:26:31,901 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 708 states and 810 transitions. [2022-07-13 03:26:31,903 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 424 [2022-07-13 03:26:31,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 708 states to 564 states and 661 transitions. [2022-07-13 03:26:31,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 564 [2022-07-13 03:26:31,904 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 564 [2022-07-13 03:26:31,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 564 states and 661 transitions. [2022-07-13 03:26:31,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:31,905 INFO L369 hiAutomatonCegarLoop]: Abstraction has 564 states and 661 transitions. [2022-07-13 03:26:31,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states and 661 transitions. [2022-07-13 03:26:31,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 461. [2022-07-13 03:26:31,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 461 states have (on average 1.1518438177874186) internal successors, (531), 460 states have internal predecessors, (531), 0 states have call successors, (0), 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-13 03:26:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 531 transitions. [2022-07-13 03:26:31,909 INFO L392 hiAutomatonCegarLoop]: Abstraction has 461 states and 531 transitions. [2022-07-13 03:26:31,909 INFO L374 stractBuchiCegarLoop]: Abstraction has 461 states and 531 transitions. [2022-07-13 03:26:31,909 INFO L287 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2022-07-13 03:26:31,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 461 states and 531 transitions. [2022-07-13 03:26:31,910 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 321 [2022-07-13 03:26:31,910 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:31,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:31,911 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-13 03:26:31,911 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-13 03:26:31,911 INFO L752 eck$LassoCheckResult]: Stem: 34311#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(13, 2); 34299#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 34287#L59 assume !(0 == mp_add_~a3~0#1 % 256); 34288#L59-1 mp_add_~nb~0#1 := 4; 34536#L69 assume !(0 == mp_add_~b3~0#1 % 256); 34533#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 34532#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; 34531#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34530#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; 34529#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34528#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34527#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34526#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34525#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; 34524#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 34523#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 34522#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34521#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 34520#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 34519#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34518#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34517#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34516#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34514#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; 34515#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34558#L84 assume !(0 == mp_add_~i~0#1 % 256); 34500#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; 34498#L85-1 [2022-07-13 03:26:31,911 INFO L754 eck$LassoCheckResult]: Loop: 34498#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34497#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34446#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34447#L90 assume !(0 == mp_add_~i~0#1 % 256); 34462#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; 34463#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 34442#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34443#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 34434#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34435#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 34426#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34427#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34418#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34419#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; 34409#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 34411#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34494#L90 assume !(0 == mp_add_~i~0#1 % 256); 34577#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 34576#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; 34575#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34574#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 34573#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34572#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34571#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 34570#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34569#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34568#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; 34566#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34565#L84 assume !(0 == mp_add_~i~0#1 % 256); 34564#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34563#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34562#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; 34552#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 34546#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 34553#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34549#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34544#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34539#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 34537#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34513#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; 34509#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34505#L84 assume !(0 == mp_add_~i~0#1 % 256); 34506#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; 34498#L85-1 [2022-07-13 03:26:31,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:31,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1596563941, now seen corresponding path program 1 times [2022-07-13 03:26:31,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:31,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767021064] [2022-07-13 03:26:31,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:31,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:31,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:31,919 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:31,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:31,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:31,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1729137940, now seen corresponding path program 1 times [2022-07-13 03:26:31,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:31,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362259768] [2022-07-13 03:26:31,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:31,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:31,984 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-13 03:26:31,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:31,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362259768] [2022-07-13 03:26:31,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362259768] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:31,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964960570] [2022-07-13 03:26:31,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:31,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:31,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:31,986 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:31,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-07-13 03:26:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:32,019 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:26:32,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:32,107 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-13 03:26:32,107 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 03:26:32,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964960570] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:32,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 03:26:32,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-13 03:26:32,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22879892] [2022-07-13 03:26:32,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:32,107 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:32,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:32,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 03:26:32,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-13 03:26:32,108 INFO L87 Difference]: Start difference. First operand 461 states and 531 transitions. cyclomatic complexity: 76 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-13 03:26:32,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:32,303 INFO L93 Difference]: Finished difference Result 771 states and 874 transitions. [2022-07-13 03:26:32,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 03:26:32,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 771 states and 874 transitions. [2022-07-13 03:26:32,305 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 520 [2022-07-13 03:26:32,307 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 771 states to 752 states and 855 transitions. [2022-07-13 03:26:32,307 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 752 [2022-07-13 03:26:32,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 752 [2022-07-13 03:26:32,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 752 states and 855 transitions. [2022-07-13 03:26:32,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:32,308 INFO L369 hiAutomatonCegarLoop]: Abstraction has 752 states and 855 transitions. [2022-07-13 03:26:32,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states and 855 transitions. [2022-07-13 03:26:32,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 463. [2022-07-13 03:26:32,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 463 states have (on average 1.1511879049676026) internal successors, (533), 462 states have internal predecessors, (533), 0 states have call successors, (0), 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-13 03:26:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 533 transitions. [2022-07-13 03:26:32,314 INFO L392 hiAutomatonCegarLoop]: Abstraction has 463 states and 533 transitions. [2022-07-13 03:26:32,314 INFO L374 stractBuchiCegarLoop]: Abstraction has 463 states and 533 transitions. [2022-07-13 03:26:32,314 INFO L287 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2022-07-13 03:26:32,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 463 states and 533 transitions. [2022-07-13 03:26:32,315 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 318 [2022-07-13 03:26:32,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:32,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:32,315 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-13 03:26:32,315 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-13 03:26:32,315 INFO L752 eck$LassoCheckResult]: Stem: 35689#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(13, 2); 35679#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 35663#L59 assume !(0 == mp_add_~a3~0#1 % 256); 35664#L59-1 mp_add_~nb~0#1 := 4; 35684#L69 assume !(0 == mp_add_~b3~0#1 % 256); 35834#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 35835#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; 35830#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35831#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; 35826#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35827#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35822#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35823#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35818#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; 35819#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 35814#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 35815#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 35810#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 35811#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 35806#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35807#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35802#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35803#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35796#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; 35797#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35966#L84 assume !(0 == mp_add_~i~0#1 % 256); 35789#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; 35790#L85-1 [2022-07-13 03:26:32,316 INFO L754 eck$LassoCheckResult]: Loop: 35790#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35781#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35782#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35787#L90 assume !(0 == mp_add_~i~0#1 % 256); 35788#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; 35779#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 35780#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 36008#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 36007#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 36006#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 36005#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 36004#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 36003#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 36002#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; 36001#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 36000#L84 assume !(0 == mp_add_~i~0#1 % 256); 35999#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35998#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; 35997#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35995#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35994#L90 assume !(0 == mp_add_~i~0#1 % 256); 35993#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 35992#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; 35991#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 35990#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 35989#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35988#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35986#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 35983#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35980#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35977#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; 35968#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35969#L84 assume !(0 == mp_add_~i~0#1 % 256); 35972#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35956#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35945#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; 35946#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 35924#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 35923#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35922#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35921#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35843#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 35839#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35840#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; 35793#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35794#L84 assume !(0 == mp_add_~i~0#1 % 256); 35964#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; 35790#L85-1 [2022-07-13 03:26:32,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:32,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1596563941, now seen corresponding path program 2 times [2022-07-13 03:26:32,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:32,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978228670] [2022-07-13 03:26:32,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:32,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:32,323 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:32,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:32,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:32,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2031036704, now seen corresponding path program 1 times [2022-07-13 03:26:32,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:32,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188654358] [2022-07-13 03:26:32,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:32,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:32,381 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-13 03:26:32,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:32,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188654358] [2022-07-13 03:26:32,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188654358] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:32,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036839907] [2022-07-13 03:26:32,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:32,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:32,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:32,388 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:32,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-07-13 03:26:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:32,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:26:32,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:32,454 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-13 03:26:32,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 03:26:32,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036839907] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:32,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 03:26:32,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-13 03:26:32,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178376777] [2022-07-13 03:26:32,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:32,455 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:32,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:32,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:26:32,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-13 03:26:32,456 INFO L87 Difference]: Start difference. First operand 463 states and 533 transitions. cyclomatic complexity: 76 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-13 03:26:32,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:32,563 INFO L93 Difference]: Finished difference Result 577 states and 657 transitions. [2022-07-13 03:26:32,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 03:26:32,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 577 states and 657 transitions. [2022-07-13 03:26:32,565 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 413 [2022-07-13 03:26:32,566 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 577 states to 523 states and 581 transitions. [2022-07-13 03:26:32,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 523 [2022-07-13 03:26:32,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 523 [2022-07-13 03:26:32,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 523 states and 581 transitions. [2022-07-13 03:26:32,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:32,567 INFO L369 hiAutomatonCegarLoop]: Abstraction has 523 states and 581 transitions. [2022-07-13 03:26:32,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states and 581 transitions. [2022-07-13 03:26:32,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 470. [2022-07-13 03:26:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 470 states have (on average 1.1191489361702127) internal successors, (526), 469 states have internal predecessors, (526), 0 states have call successors, (0), 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-13 03:26:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 526 transitions. [2022-07-13 03:26:32,575 INFO L392 hiAutomatonCegarLoop]: Abstraction has 470 states and 526 transitions. [2022-07-13 03:26:32,575 INFO L374 stractBuchiCegarLoop]: Abstraction has 470 states and 526 transitions. [2022-07-13 03:26:32,575 INFO L287 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2022-07-13 03:26:32,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 470 states and 526 transitions. [2022-07-13 03:26:32,576 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 360 [2022-07-13 03:26:32,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:32,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:32,577 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-13 03:26:32,577 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-13 03:26:32,577 INFO L752 eck$LassoCheckResult]: Stem: 36880#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(13, 2); 36869#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 36852#L59 assume !(0 == mp_add_~a3~0#1 % 256); 36853#L59-1 mp_add_~nb~0#1 := 4; 37142#L69 assume !(0 == mp_add_~b3~0#1 % 256); 37139#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 37138#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; 37137#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37136#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; 37135#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 37134#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 37133#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 37132#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 37131#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; 37130#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 37129#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 37128#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 37127#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 37126#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 37125#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37124#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37123#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37122#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37120#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; 37119#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37117#L84 assume !(0 == mp_add_~i~0#1 % 256); 37116#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; 37115#L85-1 [2022-07-13 03:26:32,577 INFO L754 eck$LassoCheckResult]: Loop: 37115#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 37113#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 37104#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 37105#L90 assume !(0 == mp_add_~i~0#1 % 256); 37110#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; 37108#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 37106#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 37102#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 37100#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37098#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 37096#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37094#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37092#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37090#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; 37087#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37085#L84 assume !(0 == mp_add_~i~0#1 % 256); 37083#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 37081#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; 37079#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; 37076#L90 assume !(0 == mp_add_~i~0#1 % 256); 37075#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 37074#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; 37071#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 37072#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 37067#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37068#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37063#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 37064#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37058#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37059#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; 37049#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37050#L84 assume !(0 == mp_add_~i~0#1 % 256); 37040#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 37041#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 37032#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; 37033#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 37155#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 37175#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37174#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37173#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37172#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 37144#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37171#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; 37169#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37168#L84 assume !(0 == mp_add_~i~0#1 % 256); 37167#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 37166#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 37163#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 37159#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 37153#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 37151#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37149#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37147#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37145#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37121#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37056#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; 37057#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37047#L84 assume !(0 == mp_add_~i~0#1 % 256); 37048#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; 37115#L85-1 [2022-07-13 03:26:32,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:32,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1596563941, now seen corresponding path program 3 times [2022-07-13 03:26:32,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:32,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215021629] [2022-07-13 03:26:32,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:32,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:32,585 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:26:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:26:32,593 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:26:32,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:32,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1710168569, now seen corresponding path program 2 times [2022-07-13 03:26:32,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:32,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317351372] [2022-07-13 03:26:32,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:32,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:32,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:32,647 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-13 03:26:32,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:32,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317351372] [2022-07-13 03:26:32,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317351372] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:32,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524858913] [2022-07-13 03:26:32,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 03:26:32,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:32,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:32,651 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:32,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-07-13 03:26:32,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 03:26:32,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:26:32,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 03:26:32,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:32,738 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-13 03:26:32,738 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 03:26:32,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524858913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:26:32,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 03:26:32,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2022-07-13 03:26:32,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80496813] [2022-07-13 03:26:32,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:26:32,739 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:32,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:32,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 03:26:32,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-13 03:26:32,739 INFO L87 Difference]: Start difference. First operand 470 states and 526 transitions. cyclomatic complexity: 62 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-13 03:26:32,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:32,819 INFO L93 Difference]: Finished difference Result 467 states and 514 transitions. [2022-07-13 03:26:32,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 03:26:32,819 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 467 states and 514 transitions. [2022-07-13 03:26:32,820 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 196 [2022-07-13 03:26:32,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 467 states to 467 states and 514 transitions. [2022-07-13 03:26:32,822 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 467 [2022-07-13 03:26:32,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 467 [2022-07-13 03:26:32,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 467 states and 514 transitions. [2022-07-13 03:26:32,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:32,822 INFO L369 hiAutomatonCegarLoop]: Abstraction has 467 states and 514 transitions. [2022-07-13 03:26:32,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states and 514 transitions. [2022-07-13 03:26:32,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 403. [2022-07-13 03:26:32,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 403 states have (on average 1.1017369727047146) internal successors, (444), 402 states have internal predecessors, (444), 0 states have call successors, (0), 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-13 03:26:32,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 444 transitions. [2022-07-13 03:26:32,826 INFO L392 hiAutomatonCegarLoop]: Abstraction has 403 states and 444 transitions. [2022-07-13 03:26:32,826 INFO L374 stractBuchiCegarLoop]: Abstraction has 403 states and 444 transitions. [2022-07-13 03:26:32,826 INFO L287 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2022-07-13 03:26:32,826 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 403 states and 444 transitions. [2022-07-13 03:26:32,827 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 151 [2022-07-13 03:26:32,827 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:32,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:32,827 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-13 03:26:32,827 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-13 03:26:32,827 INFO L752 eck$LassoCheckResult]: Stem: 38008#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(13, 2); 37998#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 37986#L59 assume !(0 == mp_add_~a3~0#1 % 256); 37987#L59-1 mp_add_~nb~0#1 := 4; 38284#L69 assume !(0 == mp_add_~b3~0#1 % 256); 38280#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 38278#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; 38276#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 38275#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; 38273#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 38271#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 38269#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 38267#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38265#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; 38263#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 38261#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 38260#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38256#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 38255#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 38251#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38250#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38249#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38248#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38247#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; 38246#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 38245#L84 assume !(0 == mp_add_~i~0#1 % 256); 38244#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; 38242#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 38240#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 38237#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 38235#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 38233#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38231#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 38229#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38227#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38225#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; 38220#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 38218#L84 assume !(0 == mp_add_~i~0#1 % 256); 38216#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 38214#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; 38210#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 38202#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 38195#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 38188#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38181#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38180#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 38176#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38175#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38173#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; 38171#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 38168#L84 assume !(0 == mp_add_~i~0#1 % 256); 38164#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 38165#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 38156#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; 38157#L83-1 [2022-07-13 03:26:32,827 INFO L754 eck$LassoCheckResult]: Loop: 38157#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 38286#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 38285#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38281#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38279#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38277#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 38179#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38274#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; 38272#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 38270#L84 assume !(0 == mp_add_~i~0#1 % 256); 38268#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 38266#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 38264#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 38041#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 38042#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 38150#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38182#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38142#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38143#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38177#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38174#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; 38172#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 38169#L84 assume !(0 == mp_add_~i~0#1 % 256); 38170#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 38162#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 38163#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; 38157#L83-1 [2022-07-13 03:26:32,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:32,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1143904857, now seen corresponding path program 1 times [2022-07-13 03:26:32,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:32,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447903697] [2022-07-13 03:26:32,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:32,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:32,873 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-13 03:26:32,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:32,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447903697] [2022-07-13 03:26:32,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447903697] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:32,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144023001] [2022-07-13 03:26:32,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:32,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:32,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:32,877 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:32,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-07-13 03:26:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:32,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:26:32,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:32,989 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-13 03:26:32,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:33,086 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-13 03:26:33,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144023001] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:33,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:33,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2022-07-13 03:26:33,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470218955] [2022-07-13 03:26:33,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:33,087 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:26:33,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:33,087 INFO L85 PathProgramCache]: Analyzing trace with hash -860927907, now seen corresponding path program 1 times [2022-07-13 03:26:33,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:33,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536909281] [2022-07-13 03:26:33,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:33,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:33,128 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-13 03:26:33,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:33,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536909281] [2022-07-13 03:26:33,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536909281] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:33,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533921356] [2022-07-13 03:26:33,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:33,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:33,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:33,141 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:33,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2022-07-13 03:26:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:33,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 03:26:33,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:33,287 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-13 03:26:33,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:26:33,328 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-13 03:26:33,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533921356] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:26:33,329 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:26:33,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-07-13 03:26:33,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852132902] [2022-07-13 03:26:33,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:26:33,329 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:26:33,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:26:33,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 03:26:33,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-07-13 03:26:33,330 INFO L87 Difference]: Start difference. First operand 403 states and 444 transitions. cyclomatic complexity: 46 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-13 03:26:33,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:26:33,692 INFO L93 Difference]: Finished difference Result 515 states and 560 transitions. [2022-07-13 03:26:33,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 03:26:33,693 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 515 states and 560 transitions. [2022-07-13 03:26:33,694 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 78 [2022-07-13 03:26:33,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 515 states to 513 states and 552 transitions. [2022-07-13 03:26:33,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 513 [2022-07-13 03:26:33,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 513 [2022-07-13 03:26:33,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 513 states and 552 transitions. [2022-07-13 03:26:33,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:26:33,696 INFO L369 hiAutomatonCegarLoop]: Abstraction has 513 states and 552 transitions. [2022-07-13 03:26:33,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states and 552 transitions. [2022-07-13 03:26:33,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 412. [2022-07-13 03:26:33,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 412 states have (on average 1.0728155339805825) internal successors, (442), 411 states have internal predecessors, (442), 0 states have call successors, (0), 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-13 03:26:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 442 transitions. [2022-07-13 03:26:33,700 INFO L392 hiAutomatonCegarLoop]: Abstraction has 412 states and 442 transitions. [2022-07-13 03:26:33,700 INFO L374 stractBuchiCegarLoop]: Abstraction has 412 states and 442 transitions. [2022-07-13 03:26:33,700 INFO L287 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2022-07-13 03:26:33,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 412 states and 442 transitions. [2022-07-13 03:26:33,701 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 50 [2022-07-13 03:26:33,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:26:33,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:26:33,702 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-13 03:26:33,702 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:26:33,702 INFO L752 eck$LassoCheckResult]: Stem: 39445#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(13, 2); 39434#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~nondet4#1, main_#t~ret5#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 := main_#t~nondet4#1;havoc main_#t~nondet4#1;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; 39422#L59 assume !(0 == mp_add_~a3~0#1 % 256); 39423#L59-1 mp_add_~nb~0#1 := 4; 39704#L69 assume !(0 == mp_add_~b3~0#1 % 256); 39701#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 39700#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; 39699#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39698#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; 39697#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39696#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39695#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39694#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 39693#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; 39692#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 39691#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 39690#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 39689#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 39688#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 39687#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39686#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39685#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39684#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39683#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; 39682#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39681#L84 assume !(0 == mp_add_~i~0#1 % 256); 39680#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; 39679#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39677#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39674#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 39669#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 39670#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39661#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 39662#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39655#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39656#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39649#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; 39650#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39642#L84 assume !(0 == mp_add_~i~0#1 % 256); 39643#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39636#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; 39637#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39632#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 39631#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 39630#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39629#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39628#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 39627#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39626#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39625#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; 39624#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39623#L84 assume !(0 == mp_add_~i~0#1 % 256); 39622#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39621#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39620#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; 39619#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 39618#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 39617#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39616#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39615#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39614#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 39613#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39612#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; 39611#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39610#L84 assume !(0 == mp_add_~i~0#1 % 256); 39609#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39608#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39607#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39606#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 39605#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 39604#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39603#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39602#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39601#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39600#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39599#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; 39598#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39597#L84 assume !(0 == mp_add_~i~0#1 % 256); 39596#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39595#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39594#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39584#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 39585#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 39823#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39821#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39819#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39817#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39815#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39813#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; 39475#L83 [2022-07-13 03:26:33,702 INFO L754 eck$LassoCheckResult]: Loop: 39475#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39476#L84 assume !(0 == mp_add_~i~0#1 % 256); 39828#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39827#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39826#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39825#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 39824#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 39822#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39820#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39818#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39816#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39814#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39812#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; 39475#L83 [2022-07-13 03:26:33,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:26:33,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1357058734, now seen corresponding path program 1 times [2022-07-13 03:26:33,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:26:33,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463421542] [2022-07-13 03:26:33,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:33,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:26:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:33,755 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-13 03:26:33,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:26:33,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463421542] [2022-07-13 03:26:33,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463421542] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:26:33,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307632131] [2022-07-13 03:26:33,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:26:33,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:26:33,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:26:33,764 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:26:33,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2022-07-13 03:26:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:26:33,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 03:26:33,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:26:34,115 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 111 proven. 20 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-07-13 03:26:34,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:27:05,541 WARN L233 SmtUtils]: Spent 30.99s on a formula simplification. DAG size of input: 6254 DAG size of output: 6192 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)