./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/byte_add_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/byte_add_2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 14:34:58,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 14:34:58,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 14:34:58,879 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 14:34:58,880 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 14:34:58,881 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 14:34:58,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 14:34:58,885 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 14:34:58,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 14:34:58,891 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 14:34:58,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 14:34:58,894 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 14:34:58,894 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 14:34:58,896 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 14:34:58,897 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 14:34:58,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 14:34:58,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 14:34:58,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 14:34:58,903 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 14:34:58,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 14:34:58,910 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 14:34:58,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 14:34:58,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 14:34:58,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 14:34:58,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 14:34:58,921 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 14:34:58,921 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 14:34:58,921 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 14:34:58,923 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 14:34:58,923 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 14:34:58,924 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 14:34:58,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 14:34:58,926 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 14:34:58,926 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 14:34:58,927 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 14:34:58,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 14:34:58,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 14:34:58,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 14:34:58,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 14:34:58,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 14:34:58,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 14:34:58,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 14:34:58,934 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 14:34:58,963 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 14:34:58,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 14:34:58,964 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 14:34:58,964 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 14:34:58,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 14:34:58,966 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 14:34:58,966 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 14:34:58,966 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 14:34:58,966 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 14:34:58,967 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 14:34:58,967 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 14:34:58,967 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 14:34:58,968 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 14:34:58,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 14:34:58,968 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 14:34:58,968 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 14:34:58,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 14:34:58,969 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 14:34:58,969 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 14:34:58,969 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 14:34:58,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 14:34:58,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 14:34:58,969 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 14:34:58,970 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 14:34:58,970 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 14:34:58,970 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 14:34:58,970 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 14:34:58,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 14:34:58,971 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 14:34:58,971 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 14:34:58,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 14:34:58,972 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 14:34:58,972 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de6decccd91c37b79cf607a5f07869bb0707e08de203e3ce6759a25f4e6e01ba [2022-07-23 14:34:59,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 14:34:59,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 14:34:59,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 14:34:59,241 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 14:34:59,241 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 14:34:59,243 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_2-2.i [2022-07-23 14:34:59,316 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ff4e85e9/809c35a9825d4b5dafc4b2a36ffef981/FLAGea2c1d74d [2022-07-23 14:34:59,706 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 14:34:59,707 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i [2022-07-23 14:34:59,714 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ff4e85e9/809c35a9825d4b5dafc4b2a36ffef981/FLAGea2c1d74d [2022-07-23 14:35:00,116 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ff4e85e9/809c35a9825d4b5dafc4b2a36ffef981 [2022-07-23 14:35:00,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 14:35:00,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 14:35:00,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 14:35:00,124 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 14:35:00,128 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 14:35:00,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:35:00" (1/1) ... [2022-07-23 14:35:00,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a8d5f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:00, skipping insertion in model container [2022-07-23 14:35:00,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 02:35:00" (1/1) ... [2022-07-23 14:35:00,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 14:35:00,169 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 14:35:00,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2022-07-23 14:35:00,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:35:00,345 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 14:35:00,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_2-2.i[1168,1181] [2022-07-23 14:35:00,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 14:35:00,387 INFO L208 MainTranslator]: Completed translation [2022-07-23 14:35:00,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:00 WrapperNode [2022-07-23 14:35:00,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 14:35:00,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 14:35:00,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 14:35:00,389 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 14:35:00,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:00" (1/1) ... [2022-07-23 14:35:00,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:00" (1/1) ... [2022-07-23 14:35:00,454 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 145 [2022-07-23 14:35:00,454 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 14:35:00,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 14:35:00,455 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 14:35:00,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 14:35:00,463 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:00" (1/1) ... [2022-07-23 14:35:00,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:00" (1/1) ... [2022-07-23 14:35:00,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:00" (1/1) ... [2022-07-23 14:35:00,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:00" (1/1) ... [2022-07-23 14:35:00,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:00" (1/1) ... [2022-07-23 14:35:00,517 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:00" (1/1) ... [2022-07-23 14:35:00,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:00" (1/1) ... [2022-07-23 14:35:00,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 14:35:00,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 14:35:00,545 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 14:35:00,546 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 14:35:00,547 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:00" (1/1) ... [2022-07-23 14:35:00,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:00,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:00,585 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:00,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-23 14:35:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 14:35:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 14:35:00,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 14:35:00,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 14:35:00,691 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 14:35:00,692 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 14:35:01,199 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 14:35:01,204 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 14:35:01,205 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-23 14:35:01,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:35:01 BoogieIcfgContainer [2022-07-23 14:35:01,207 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 14:35:01,208 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 14:35:01,209 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 14:35:01,212 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 14:35:01,213 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:35:01,213 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 02:35:00" (1/3) ... [2022-07-23 14:35:01,215 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e30cded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:35:01, skipping insertion in model container [2022-07-23 14:35:01,215 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:35:01,215 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 02:35:00" (2/3) ... [2022-07-23 14:35:01,215 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e30cded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 02:35:01, skipping insertion in model container [2022-07-23 14:35:01,215 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 14:35:01,216 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:35:01" (3/3) ... [2022-07-23 14:35:01,218 INFO L354 chiAutomizerObserver]: Analyzing ICFG byte_add_2-2.i [2022-07-23 14:35:01,280 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 14:35:01,280 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 14:35:01,280 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 14:35:01,281 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 14:35:01,281 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 14:35:01,281 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 14:35:01,281 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 14:35:01,281 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 14:35:01,287 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-23 14:35:01,319 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-07-23 14:35:01,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:01,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:01,326 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-23 14:35:01,327 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:01,327 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 14:35:01,327 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-23 14:35:01,336 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2022-07-23 14:35:01,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:01,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:01,337 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-23 14:35:01,337 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:01,343 INFO L752 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 34#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 29#L59true assume !(0 == mp_add_~a3~0#1 % 256); 11#L59-1true mp_add_~nb~0#1 := 4; 12#L69true assume !(0 == mp_add_~b3~0#1 % 256); 48#L69-1true mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 14#L80-2true [2022-07-23 14:35:01,345 INFO L754 eck$LassoCheckResult]: Loop: 14#L80-2true assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 21#L83true assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 50#L83-1true assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6#L89true assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 28#L95-1true assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 38#L99-1true assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 8#L100-1true assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 15#L101-1true assume !(3 == mp_add_~i~0#1 % 256); 16#L102-1true mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14#L80-2true [2022-07-23 14:35:01,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:01,350 INFO L85 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2022-07-23 14:35:01,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:01,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131468060] [2022-07-23 14:35:01,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:01,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:01,496 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:01,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:01,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:01,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1026291578, now seen corresponding path program 1 times [2022-07-23 14:35:01,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:01,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857895660] [2022-07-23 14:35:01,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:01,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:01,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:01,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:01,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:01,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857895660] [2022-07-23 14:35:01,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857895660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:01,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:01,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:35:01,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748827614] [2022-07-23 14:35:01,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:01,689 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:01,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:01,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:35:01,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:35:01,718 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-23 14:35:01,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:01,866 INFO L93 Difference]: Finished difference Result 78 states and 114 transitions. [2022-07-23 14:35:01,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:35:01,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 114 transitions. [2022-07-23 14:35:01,874 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 51 [2022-07-23 14:35:01,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 66 states and 98 transitions. [2022-07-23 14:35:01,879 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2022-07-23 14:35:01,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2022-07-23 14:35:01,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 98 transitions. [2022-07-23 14:35:01,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:01,880 INFO L369 hiAutomatonCegarLoop]: Abstraction has 66 states and 98 transitions. [2022-07-23 14:35:01,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 98 transitions. [2022-07-23 14:35:01,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-07-23 14:35:01,905 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-23 14:35:01,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2022-07-23 14:35:01,907 INFO L392 hiAutomatonCegarLoop]: Abstraction has 64 states and 96 transitions. [2022-07-23 14:35:01,907 INFO L374 stractBuchiCegarLoop]: Abstraction has 64 states and 96 transitions. [2022-07-23 14:35:01,908 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 14:35:01,908 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 96 transitions. [2022-07-23 14:35:01,909 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2022-07-23 14:35:01,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:01,909 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:01,910 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:01,910 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:01,910 INFO L752 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 139#L59 assume !(0 == mp_add_~a3~0#1 % 256); 140#L59-1 mp_add_~nb~0#1 := 4; 159#L69 assume !(0 == mp_add_~b3~0#1 % 256); 149#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 165#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 166#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 194#L83-1 [2022-07-23 14:35:01,911 INFO L754 eck$LassoCheckResult]: Loop: 194#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 138#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 144#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 181#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 184#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 172#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 173#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 174#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 179#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 180#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 162#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 168#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 169#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 194#L83-1 [2022-07-23 14:35:01,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:01,911 INFO L85 PathProgramCache]: Analyzing trace with hash 532072804, now seen corresponding path program 1 times [2022-07-23 14:35:01,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:01,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845239964] [2022-07-23 14:35:01,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:01,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:01,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:02,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:02,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845239964] [2022-07-23 14:35:02,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845239964] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:02,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:02,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 14:35:02,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769714244] [2022-07-23 14:35:02,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:02,067 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:35:02,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:02,068 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 1 times [2022-07-23 14:35:02,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:02,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245431555] [2022-07-23 14:35:02,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:02,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:02,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:02,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245431555] [2022-07-23 14:35:02,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245431555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:02,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:02,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:35:02,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110968602] [2022-07-23 14:35:02,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:02,118 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:02,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:02,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 14:35:02,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-23 14:35:02,119 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-23 14:35:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:02,543 INFO L93 Difference]: Finished difference Result 217 states and 305 transitions. [2022-07-23 14:35:02,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 14:35:02,544 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 217 states and 305 transitions. [2022-07-23 14:35:02,547 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 147 [2022-07-23 14:35:02,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 217 states to 217 states and 305 transitions. [2022-07-23 14:35:02,549 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 217 [2022-07-23 14:35:02,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 217 [2022-07-23 14:35:02,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 217 states and 305 transitions. [2022-07-23 14:35:02,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:02,551 INFO L369 hiAutomatonCegarLoop]: Abstraction has 217 states and 305 transitions. [2022-07-23 14:35:02,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states and 305 transitions. [2022-07-23 14:35:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 79. [2022-07-23 14:35:02,558 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-23 14:35:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 114 transitions. [2022-07-23 14:35:02,559 INFO L392 hiAutomatonCegarLoop]: Abstraction has 79 states and 114 transitions. [2022-07-23 14:35:02,559 INFO L374 stractBuchiCegarLoop]: Abstraction has 79 states and 114 transitions. [2022-07-23 14:35:02,559 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 14:35:02,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 114 transitions. [2022-07-23 14:35:02,560 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 49 [2022-07-23 14:35:02,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:02,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:02,561 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:02,561 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:02,561 INFO L752 eck$LassoCheckResult]: Stem: 463#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 451#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 435#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 437#L61 assume !(0 == mp_add_~a2~0#1 % 256); 438#L59-1 mp_add_~nb~0#1 := 4; 488#L69 assume !(0 == mp_add_~b3~0#1 % 256); 483#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 484#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 489#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 453#L83-1 [2022-07-23 14:35:02,561 INFO L754 eck$LassoCheckResult]: Loop: 453#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 440#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 442#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 459#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 448#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 449#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 470#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 473#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 482#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 505#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 462#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 467#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 452#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 453#L83-1 [2022-07-23 14:35:02,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:02,562 INFO L85 PathProgramCache]: Analyzing trace with hash -384676570, now seen corresponding path program 1 times [2022-07-23 14:35:02,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:02,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953185201] [2022-07-23 14:35:02,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:02,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:02,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:02,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:02,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953185201] [2022-07-23 14:35:02,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953185201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:02,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:02,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 14:35:02,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821821454] [2022-07-23 14:35:02,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:02,671 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:35:02,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:02,672 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 2 times [2022-07-23 14:35:02,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:02,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532722734] [2022-07-23 14:35:02,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:02,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:02,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:02,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:02,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532722734] [2022-07-23 14:35:02,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532722734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:02,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:02,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:35:02,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101716008] [2022-07-23 14:35:02,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:02,722 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:02,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:02,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 14:35:02,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 14:35:02,723 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-23 14:35:03,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:03,460 INFO L93 Difference]: Finished difference Result 387 states and 549 transitions. [2022-07-23 14:35:03,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 14:35:03,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 387 states and 549 transitions. [2022-07-23 14:35:03,465 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 279 [2022-07-23 14:35:03,468 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 387 states to 387 states and 549 transitions. [2022-07-23 14:35:03,468 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 387 [2022-07-23 14:35:03,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 387 [2022-07-23 14:35:03,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 387 states and 549 transitions. [2022-07-23 14:35:03,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:03,471 INFO L369 hiAutomatonCegarLoop]: Abstraction has 387 states and 549 transitions. [2022-07-23 14:35:03,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states and 549 transitions. [2022-07-23 14:35:03,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 184. [2022-07-23 14:35:03,481 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-23 14:35:03,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 259 transitions. [2022-07-23 14:35:03,482 INFO L392 hiAutomatonCegarLoop]: Abstraction has 184 states and 259 transitions. [2022-07-23 14:35:03,483 INFO L374 stractBuchiCegarLoop]: Abstraction has 184 states and 259 transitions. [2022-07-23 14:35:03,483 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 14:35:03,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 259 transitions. [2022-07-23 14:35:03,484 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 113 [2022-07-23 14:35:03,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:03,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:03,485 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:03,485 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:03,485 INFO L752 eck$LassoCheckResult]: Stem: 960#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 945#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 927#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 929#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 931#L63 assume !(0 == mp_add_~a1~0#1 % 256); 932#L59-1 mp_add_~nb~0#1 := 4; 985#L69 assume !(0 == mp_add_~b3~0#1 % 256); 981#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 982#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1021#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1044#L83-1 [2022-07-23 14:35:03,486 INFO L754 eck$LassoCheckResult]: Loop: 1044#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1041#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 1036#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1032#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1030#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1026#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 979#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 980#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1023#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1051#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1049#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1048#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1046#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1044#L83-1 [2022-07-23 14:35:03,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:03,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2089936051, now seen corresponding path program 1 times [2022-07-23 14:35:03,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:03,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417684689] [2022-07-23 14:35:03,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:03,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:03,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:03,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:03,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417684689] [2022-07-23 14:35:03,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417684689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:03,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:03,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 14:35:03,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768856528] [2022-07-23 14:35:03,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:03,610 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:35:03,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:03,610 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 3 times [2022-07-23 14:35:03,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:03,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554491569] [2022-07-23 14:35:03,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:03,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:03,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:03,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:03,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554491569] [2022-07-23 14:35:03,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554491569] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:03,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:03,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:35:03,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141008142] [2022-07-23 14:35:03,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:03,685 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:03,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:03,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 14:35:03,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-23 14:35:03,687 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-23 14:35:04,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:04,631 INFO L93 Difference]: Finished difference Result 482 states and 675 transitions. [2022-07-23 14:35:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 14:35:04,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 482 states and 675 transitions. [2022-07-23 14:35:04,643 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 345 [2022-07-23 14:35:04,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 482 states to 482 states and 675 transitions. [2022-07-23 14:35:04,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 482 [2022-07-23 14:35:04,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 482 [2022-07-23 14:35:04,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 482 states and 675 transitions. [2022-07-23 14:35:04,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:04,648 INFO L369 hiAutomatonCegarLoop]: Abstraction has 482 states and 675 transitions. [2022-07-23 14:35:04,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states and 675 transitions. [2022-07-23 14:35:04,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 270. [2022-07-23 14:35:04,663 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-23 14:35:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 379 transitions. [2022-07-23 14:35:04,664 INFO L392 hiAutomatonCegarLoop]: Abstraction has 270 states and 379 transitions. [2022-07-23 14:35:04,665 INFO L374 stractBuchiCegarLoop]: Abstraction has 270 states and 379 transitions. [2022-07-23 14:35:04,665 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 14:35:04,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 379 transitions. [2022-07-23 14:35:04,666 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 175 [2022-07-23 14:35:04,667 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:04,667 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:04,667 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:04,675 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:04,676 INFO L752 eck$LassoCheckResult]: Stem: 1655#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 1643#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 1624#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1626#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1628#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 1629#L59-1 mp_add_~nb~0#1 := 4; 1684#L69 assume !(0 == mp_add_~b3~0#1 % 256); 1681#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1678#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1679#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1645#L83-1 [2022-07-23 14:35:04,676 INFO L754 eck$LassoCheckResult]: Loop: 1645#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1631#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 1633#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1677#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1879#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1663#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1664#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1680#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1737#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1673#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1654#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1659#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1644#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1645#L83-1 [2022-07-23 14:35:04,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:04,676 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194353, now seen corresponding path program 1 times [2022-07-23 14:35:04,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:04,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274217435] [2022-07-23 14:35:04,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:04,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:04,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:04,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:04,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274217435] [2022-07-23 14:35:04,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274217435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:04,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:04,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 14:35:04,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089474085] [2022-07-23 14:35:04,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:04,762 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:35:04,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:04,762 INFO L85 PathProgramCache]: Analyzing trace with hash 758648136, now seen corresponding path program 4 times [2022-07-23 14:35:04,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:04,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153435835] [2022-07-23 14:35:04,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:04,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:04,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:04,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:04,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:04,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153435835] [2022-07-23 14:35:04,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153435835] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:04,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:04,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:35:04,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649532954] [2022-07-23 14:35:04,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:04,796 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:04,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:04,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 14:35:04,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-23 14:35:04,797 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-23 14:35:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:05,616 INFO L93 Difference]: Finished difference Result 370 states and 514 transitions. [2022-07-23 14:35:05,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 14:35:05,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 370 states and 514 transitions. [2022-07-23 14:35:05,620 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 243 [2022-07-23 14:35:05,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 370 states to 370 states and 514 transitions. [2022-07-23 14:35:05,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 370 [2022-07-23 14:35:05,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 370 [2022-07-23 14:35:05,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 370 states and 514 transitions. [2022-07-23 14:35:05,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:05,623 INFO L369 hiAutomatonCegarLoop]: Abstraction has 370 states and 514 transitions. [2022-07-23 14:35:05,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states and 514 transitions. [2022-07-23 14:35:05,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 304. [2022-07-23 14:35:05,629 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-23 14:35:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 427 transitions. [2022-07-23 14:35:05,630 INFO L392 hiAutomatonCegarLoop]: Abstraction has 304 states and 427 transitions. [2022-07-23 14:35:05,630 INFO L374 stractBuchiCegarLoop]: Abstraction has 304 states and 427 transitions. [2022-07-23 14:35:05,630 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-23 14:35:05,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 304 states and 427 transitions. [2022-07-23 14:35:05,632 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 212 [2022-07-23 14:35:05,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:05,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:05,633 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:05,633 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:05,633 INFO L752 eck$LassoCheckResult]: Stem: 2326#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 2311#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 2298#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 2300#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 2302#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 2303#L59-1 mp_add_~nb~0#1 := 4; 2318#L69 assume !(0 == mp_add_~b3~0#1 % 256); 2341#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 2342#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2340#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2323#L84 [2022-07-23 14:35:05,633 INFO L754 eck$LassoCheckResult]: Loop: 2323#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 2324#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 2329#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 2312#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 2313#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2293#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 2295#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 2319#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 2305#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 2306#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 2333#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 2345#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2549#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2323#L84 [2022-07-23 14:35:05,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:05,634 INFO L85 PathProgramCache]: Analyzing trace with hash -2147194379, now seen corresponding path program 1 times [2022-07-23 14:35:05,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:05,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314611751] [2022-07-23 14:35:05,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:05,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:05,648 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:05,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:05,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:05,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1738393452, now seen corresponding path program 5 times [2022-07-23 14:35:05,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:05,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569785089] [2022-07-23 14:35:05,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:05,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:05,668 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:05,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:05,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:05,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:05,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1295002104, now seen corresponding path program 1 times [2022-07-23 14:35:05,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:05,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390750332] [2022-07-23 14:35:05,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:05,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:05,780 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-23 14:35:05,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:05,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390750332] [2022-07-23 14:35:05,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390750332] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:05,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:05,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:35:05,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212459770] [2022-07-23 14:35:05,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:05,880 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:35:05,881 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:35:05,881 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:35:05,881 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:35:05,881 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-23 14:35:05,881 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:05,881 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:35:05,882 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:35:05,882 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration6_Loop [2022-07-23 14:35:05,882 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:35:05,882 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:35:05,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:05,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:06,152 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:35:06,153 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-23 14:35:06,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:06,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:06,160 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-23 14:35:06,170 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 14:35:06,170 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 14:35:06,195 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-23 14:35:06,238 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-23 14:35:06,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:06,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:06,240 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:06,246 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-23 14:35:06,246 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 14:35:06,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-23 14:35:06,927 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-23 14:35:06,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:06,932 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:35:06,932 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:35:06,932 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:35:06,932 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:35:06,932 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:35:06,932 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:06,932 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:35:06,932 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:35:06,932 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration6_Loop [2022-07-23 14:35:06,932 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:35:06,932 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:35:06,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:06,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:07,219 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:35:07,227 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:35:07,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:07,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:07,229 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:07,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-23 14:35:07,232 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:07,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:07,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:07,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:07,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:07,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:35:07,247 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:35:07,247 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:07,266 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:07,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:07,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:07,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:07,294 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-23 14:35:07,295 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-23 14:35:07,296 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:07,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:07,303 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:07,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:07,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:07,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:35:07,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:35:07,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:07,323 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:07,349 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-23 14:35:07,350 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-23 14:35:07,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:07,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:07,352 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-23 14:35:07,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-23 14:35:07,365 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:07,365 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:07,366 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:07,366 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:07,366 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:07,371 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:07,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:07,377 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-23 14:35:07,389 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:07,415 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-23 14:35:07,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:07,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:07,418 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-23 14:35:07,426 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:07,433 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:07,433 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:07,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:07,434 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:07,434 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:07,442 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:07,442 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:07,455 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-23 14:35:07,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:07,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:07,482 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-23 14:35:07,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:07,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:07,485 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-23 14:35:07,486 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-23 14:35:07,488 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:07,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:07,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:07,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:07,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:07,496 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:07,507 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:07,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:07,526 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:07,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:07,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:07,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:07,555 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-23 14:35:07,562 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:07,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:07,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:07,570 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:07,570 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:07,570 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:07,571 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-23 14:35:07,577 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:07,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:07,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:07,617 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-23 14:35:07,617 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-23 14:35:07,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:07,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:07,620 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-23 14:35:07,621 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-23 14:35:07,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-23 14:35:07,631 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:07,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:07,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:07,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:07,631 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:07,637 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:07,637 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:07,659 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:07,683 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-23 14:35:07,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:07,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:07,684 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-23 14:35:07,691 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-23 14:35:07,692 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:07,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:07,700 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:07,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:07,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:07,701 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:07,710 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:07,711 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:07,727 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:07,745 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-23 14:35:07,745 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-23 14:35:07,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:07,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:07,746 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-23 14:35:07,748 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-23 14:35:07,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:07,754 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:07,754 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:07,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:07,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:07,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:07,755 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:07,762 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:07,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:07,783 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:07,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:07,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:07,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:07,812 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-23 14:35:07,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:07,825 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:07,825 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:07,825 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:07,825 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:07,825 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:07,825 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:07,830 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:07,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:07,838 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-23 14:35:07,847 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:07,871 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-23 14:35:07,872 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-23 14:35:07,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:07,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:07,874 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-23 14:35:07,875 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-23 14:35:07,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:07,884 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:07,884 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-23 14:35:07,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:07,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:07,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:07,884 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:07,894 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:07,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:07,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:07,931 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-23 14:35:07,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:07,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:07,933 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-23 14:35:07,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:07,949 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:07,949 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-23 14:35:07,949 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:07,950 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:07,950 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:07,950 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:07,957 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:07,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:07,968 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-23 14:35:07,975 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:07,999 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-23 14:35:08,000 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-23 14:35:08,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:08,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:08,001 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-23 14:35:08,003 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-23 14:35:08,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:08,011 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:08,012 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:08,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:08,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:08,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:08,012 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:08,025 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:08,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:08,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:08,075 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-23 14:35:08,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:08,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:08,077 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-23 14:35:08,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:08,095 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:08,095 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:08,095 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:08,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:08,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:08,096 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:08,108 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:08,109 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:08,115 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-23 14:35:08,127 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:08,153 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-23 14:35:08,154 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-23 14:35:08,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:08,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:08,155 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-23 14:35:08,186 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:08,195 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:08,195 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:08,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:08,196 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:08,196 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:08,196 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:08,202 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:08,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:08,209 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-23 14:35:08,219 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:08,246 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-23 14:35:08,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:08,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:08,247 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-23 14:35:08,249 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-23 14:35:08,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:08,260 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:08,260 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:08,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:08,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:08,261 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:08,261 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:08,267 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:08,267 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:08,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:08,307 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-23 14:35:08,308 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-23 14:35:08,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:08,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:08,309 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-23 14:35:08,317 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-23 14:35:08,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:08,325 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:08,325 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:08,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:08,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:08,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:08,325 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-23 14:35:08,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:35:08,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:08,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:08,377 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-23 14:35:08,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:08,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:08,379 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-23 14:35:08,384 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-23 14:35:08,384 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:08,392 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:08,392 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:08,392 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:08,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:08,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:08,393 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-23 14:35:08,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:35:08,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:08,415 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:08,443 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-23 14:35:08,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:08,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:35:08,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 14:35:08,444 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-23 14:35:08,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:08,579 INFO L93 Difference]: Finished difference Result 621 states and 854 transitions. [2022-07-23 14:35:08,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 14:35:08,580 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 621 states and 854 transitions. [2022-07-23 14:35:08,584 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 424 [2022-07-23 14:35:08,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 621 states to 621 states and 854 transitions. [2022-07-23 14:35:08,588 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 621 [2022-07-23 14:35:08,588 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 621 [2022-07-23 14:35:08,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 621 states and 854 transitions. [2022-07-23 14:35:08,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:08,589 INFO L369 hiAutomatonCegarLoop]: Abstraction has 621 states and 854 transitions. [2022-07-23 14:35:08,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states and 854 transitions. [2022-07-23 14:35:08,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 328. [2022-07-23 14:35:08,595 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-23 14:35:08,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 451 transitions. [2022-07-23 14:35:08,596 INFO L392 hiAutomatonCegarLoop]: Abstraction has 328 states and 451 transitions. [2022-07-23 14:35:08,596 INFO L374 stractBuchiCegarLoop]: Abstraction has 328 states and 451 transitions. [2022-07-23 14:35:08,596 INFO L287 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-07-23 14:35:08,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 328 states and 451 transitions. [2022-07-23 14:35:08,598 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 212 [2022-07-23 14:35:08,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:08,598 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:08,599 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:08,599 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:08,599 INFO L752 eck$LassoCheckResult]: Stem: 3262#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 3247#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 3234#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 3236#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 3238#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 3239#L59-1 mp_add_~nb~0#1 := 4; 3254#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 3243#L71 assume !(0 == mp_add_~b2~0#1 % 256); 3244#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 3556#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3281#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3259#L84 [2022-07-23 14:35:08,599 INFO L754 eck$LassoCheckResult]: Loop: 3259#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 3260#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 3285#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 3553#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 3552#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3231#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 3233#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 3255#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 3241#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 3242#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 3531#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 3301#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3302#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3259#L84 [2022-07-23 14:35:08,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:08,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2143364048, now seen corresponding path program 1 times [2022-07-23 14:35:08,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:08,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559537047] [2022-07-23 14:35:08,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:08,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:08,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:08,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559537047] [2022-07-23 14:35:08,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559537047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:08,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:08,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:35:08,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435658806] [2022-07-23 14:35:08,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:08,629 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:35:08,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:08,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1738393452, now seen corresponding path program 6 times [2022-07-23 14:35:08,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:08,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940196847] [2022-07-23 14:35:08,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:08,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:08,636 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:08,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:08,721 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:35:08,721 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:35:08,721 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:35:08,722 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:35:08,722 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-23 14:35:08,722 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:08,722 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:35:08,722 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:35:08,722 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration7_Loop [2022-07-23 14:35:08,722 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:35:08,722 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:35:08,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:08,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:08,974 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:35:08,974 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-23 14:35:08,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:08,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:08,980 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-23 14:35:08,989 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 14:35:08,989 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 14:35:09,024 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-23 14:35:09,081 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-23 14:35:09,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:09,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:09,083 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-23 14:35:09,088 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-23 14:35:09,088 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 14:35:09,110 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-23 14:35:10,845 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-23 14:35:10,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-23 14:35:10,851 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:35:10,851 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:35:10,851 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:35:10,851 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:35:10,851 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:35:10,851 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:10,851 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:35:10,851 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:35:10,851 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration7_Loop [2022-07-23 14:35:10,852 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:35:10,852 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:35:10,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:10,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:11,129 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:35:11,129 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:35:11,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:11,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,132 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-23 14:35:11,140 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:11,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:11,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:11,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:11,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:11,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:35:11,150 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:35:11,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:11,154 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-23 14:35:11,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:11,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:11,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:11,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,195 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-23 14:35:11,200 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:11,202 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-23 14:35:11,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:11,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:11,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:11,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:11,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:35:11,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:35:11,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:11,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:11,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:11,227 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-23 14:35:11,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:11,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,228 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-23 14:35:11,229 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-23 14:35:11,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:11,236 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:11,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:11,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:11,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:11,237 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:11,240 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:11,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:11,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:11,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-07-23 14:35:11,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:11,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,260 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-23 14:35:11,261 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-23 14:35:11,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:11,267 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:11,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:11,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:11,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:11,268 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:11,271 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:11,271 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:11,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:11,298 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-23 14:35:11,298 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-23 14:35:11,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:11,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,299 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-23 14:35:11,300 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-23 14:35:11,302 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:11,309 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:11,309 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:11,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:11,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:11,309 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:11,312 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:11,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:11,317 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:11,332 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-23 14:35:11,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:11,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,334 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-23 14:35:11,335 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-23 14:35:11,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:11,342 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:11,342 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:11,342 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:11,342 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:11,342 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:11,346 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:11,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:11,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:11,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-07-23 14:35:11,378 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-23 14:35:11,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:11,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,379 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-23 14:35:11,380 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-23 14:35:11,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:11,387 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:11,387 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:11,388 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:11,388 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:11,388 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:11,392 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:11,392 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:11,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:11,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:11,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:11,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,414 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-23 14:35:11,415 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-23 14:35:11,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:11,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:11,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:11,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:11,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:11,423 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:11,428 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:11,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:11,447 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:11,471 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-23 14:35:11,471 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-23 14:35:11,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:11,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,473 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-23 14:35:11,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:11,483 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:11,483 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:11,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:11,483 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:11,483 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:11,483 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:11,487 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:11,487 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:11,494 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-23 14:35:11,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:11,526 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-23 14:35:11,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:11,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,527 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-23 14:35:11,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:11,539 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:11,539 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:11,539 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:11,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:11,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:11,539 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:11,543 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:11,543 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:11,551 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-23 14:35:11,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:11,585 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-23 14:35:11,586 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-23 14:35:11,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:11,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,587 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-23 14:35:11,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:11,599 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:11,599 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-23 14:35:11,599 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:11,599 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:11,599 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:11,599 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:11,604 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:11,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:11,615 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-23 14:35:11,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:11,655 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-23 14:35:11,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:11,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,657 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-23 14:35:11,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:11,671 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:11,671 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-23 14:35:11,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:11,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:11,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:11,672 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:11,678 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:11,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:11,694 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:11,695 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-23 14:35:11,718 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-23 14:35:11,718 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-23 14:35:11,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:11,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,720 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-23 14:35:11,721 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-23 14:35:11,722 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:11,729 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:11,730 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:11,730 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:11,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:11,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:11,730 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:11,737 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:11,737 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:11,754 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:11,780 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-23 14:35:11,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:11,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,781 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-23 14:35:11,788 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:11,796 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:11,796 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:11,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:11,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:11,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:11,797 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:11,804 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:11,804 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:11,818 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-23 14:35:11,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:11,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:11,847 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-23 14:35:11,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:11,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,848 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-23 14:35:11,849 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-23 14:35:11,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:11,858 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:11,858 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:11,858 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:11,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:11,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:11,858 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:11,863 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:11,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:11,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:11,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:11,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:11,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,905 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-23 14:35:11,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:11,914 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:11,914 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:11,914 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:11,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:11,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:11,914 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:11,919 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:11,919 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:11,927 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-23 14:35:11,935 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:11,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:11,961 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-23 14:35:11,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:11,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:11,963 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-23 14:35:11,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:11,978 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:11,979 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:11,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:11,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:11,979 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:11,979 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-23 14:35:11,985 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:35:11,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:11,999 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-23 14:35:11,999 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:12,025 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-23 14:35:12,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:12,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:12,027 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-23 14:35:12,028 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-23 14:35:12,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:12,037 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:12,037 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:12,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:12,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:12,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:12,038 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-23 14:35:12,045 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:35:12,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:12,067 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:12,092 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-23 14:35:12,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:12,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:35:12,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:35:12,093 INFO L87 Difference]: Start difference. First operand 328 states and 451 transitions. cyclomatic complexity: 130 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:12,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:12,098 INFO L93 Difference]: Finished difference Result 293 states and 401 transitions. [2022-07-23 14:35:12,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:35:12,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 293 states and 401 transitions. [2022-07-23 14:35:12,101 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 212 [2022-07-23 14:35:12,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 293 states to 293 states and 401 transitions. [2022-07-23 14:35:12,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 293 [2022-07-23 14:35:12,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 293 [2022-07-23 14:35:12,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 293 states and 401 transitions. [2022-07-23 14:35:12,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:12,103 INFO L369 hiAutomatonCegarLoop]: Abstraction has 293 states and 401 transitions. [2022-07-23 14:35:12,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states and 401 transitions. [2022-07-23 14:35:12,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2022-07-23 14:35:12,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 293 states have (on average 1.3686006825938566) internal successors, (401), 292 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 401 transitions. [2022-07-23 14:35:12,125 INFO L392 hiAutomatonCegarLoop]: Abstraction has 293 states and 401 transitions. [2022-07-23 14:35:12,125 INFO L374 stractBuchiCegarLoop]: Abstraction has 293 states and 401 transitions. [2022-07-23 14:35:12,125 INFO L287 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-07-23 14:35:12,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 293 states and 401 transitions. [2022-07-23 14:35:12,127 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 212 [2022-07-23 14:35:12,127 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:12,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:12,128 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:12,128 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-23 14:35:12,128 INFO L752 eck$LassoCheckResult]: Stem: 3887#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 3872#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 3861#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 3863#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 3865#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 3866#L59-1 mp_add_~nb~0#1 := 4; 4148#L69 assume !(0 == mp_add_~b3~0#1 % 256); 4147#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 4146#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4145#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4144#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 4143#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 4141#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4139#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4138#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 4129#L90 [2022-07-23 14:35:12,128 INFO L754 eck$LassoCheckResult]: Loop: 4129#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 4124#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 4135#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 4128#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 4086#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 3871#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 4082#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4076#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4077#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4109#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4108#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4105#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4103#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 4101#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 4099#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4097#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4098#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 4129#L90 [2022-07-23 14:35:12,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:12,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 1 times [2022-07-23 14:35:12,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:12,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118265305] [2022-07-23 14:35:12,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:12,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:12,149 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:12,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:12,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:12,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1188749690, now seen corresponding path program 1 times [2022-07-23 14:35:12,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:12,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111134843] [2022-07-23 14:35:12,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:12,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 14:35:12,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:12,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111134843] [2022-07-23 14:35:12,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111134843] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:12,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:12,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:35:12,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047644898] [2022-07-23 14:35:12,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:12,212 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:12,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:12,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:35:12,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 14:35:12,213 INFO L87 Difference]: Start difference. First operand 293 states and 401 transitions. cyclomatic complexity: 115 Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:12,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:12,330 INFO L93 Difference]: Finished difference Result 443 states and 622 transitions. [2022-07-23 14:35:12,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 14:35:12,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 443 states and 622 transitions. [2022-07-23 14:35:12,335 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 361 [2022-07-23 14:35:12,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 443 states to 442 states and 621 transitions. [2022-07-23 14:35:12,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 442 [2022-07-23 14:35:12,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 442 [2022-07-23 14:35:12,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 442 states and 621 transitions. [2022-07-23 14:35:12,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:12,339 INFO L369 hiAutomatonCegarLoop]: Abstraction has 442 states and 621 transitions. [2022-07-23 14:35:12,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states and 621 transitions. [2022-07-23 14:35:12,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 404. [2022-07-23 14:35:12,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 404 states have (on average 1.381188118811881) internal successors, (558), 403 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:12,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 558 transitions. [2022-07-23 14:35:12,346 INFO L392 hiAutomatonCegarLoop]: Abstraction has 404 states and 558 transitions. [2022-07-23 14:35:12,346 INFO L374 stractBuchiCegarLoop]: Abstraction has 404 states and 558 transitions. [2022-07-23 14:35:12,346 INFO L287 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-07-23 14:35:12,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 404 states and 558 transitions. [2022-07-23 14:35:12,349 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 323 [2022-07-23 14:35:12,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:12,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:12,350 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:12,350 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-23 14:35:12,350 INFO L752 eck$LassoCheckResult]: Stem: 4629#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 4614#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 4599#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 4601#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 4603#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 4604#L59-1 mp_add_~nb~0#1 := 4; 4703#L69 assume !(0 == mp_add_~b3~0#1 % 256); 4650#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 4632#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4633#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4627#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 4628#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 4634#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4615#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4616#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 4639#L90 [2022-07-23 14:35:12,350 INFO L754 eck$LassoCheckResult]: Loop: 4639#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 4640#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 5002#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 4994#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 4990#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 4758#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 4759#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4751#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4752#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4655#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4656#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4945#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4939#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4938#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 4652#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4624#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 4611#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 4612#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4638#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4723#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4724#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4999#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 5001#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 5000#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4998#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4995#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 4639#L90 [2022-07-23 14:35:12,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:12,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 2 times [2022-07-23 14:35:12,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:12,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978666778] [2022-07-23 14:35:12,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:12,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:12,367 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:12,381 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:12,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:12,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1293860767, now seen corresponding path program 1 times [2022-07-23 14:35:12,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:12,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152605923] [2022-07-23 14:35:12,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:12,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:12,401 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-23 14:35:12,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:12,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152605923] [2022-07-23 14:35:12,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152605923] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:12,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:12,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:35:12,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627747958] [2022-07-23 14:35:12,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:12,402 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:12,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:12,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:35:12,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:35:12,403 INFO L87 Difference]: Start difference. First operand 404 states and 558 transitions. cyclomatic complexity: 161 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:12,474 INFO L93 Difference]: Finished difference Result 528 states and 720 transitions. [2022-07-23 14:35:12,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:35:12,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 528 states and 720 transitions. [2022-07-23 14:35:12,478 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 447 [2022-07-23 14:35:12,481 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 528 states to 528 states and 720 transitions. [2022-07-23 14:35:12,481 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 528 [2022-07-23 14:35:12,482 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 528 [2022-07-23 14:35:12,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 528 states and 720 transitions. [2022-07-23 14:35:12,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:12,483 INFO L369 hiAutomatonCegarLoop]: Abstraction has 528 states and 720 transitions. [2022-07-23 14:35:12,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states and 720 transitions. [2022-07-23 14:35:12,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 474. [2022-07-23 14:35:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 474 states have (on average 1.3734177215189873) internal successors, (651), 473 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:12,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 651 transitions. [2022-07-23 14:35:12,491 INFO L392 hiAutomatonCegarLoop]: Abstraction has 474 states and 651 transitions. [2022-07-23 14:35:12,491 INFO L374 stractBuchiCegarLoop]: Abstraction has 474 states and 651 transitions. [2022-07-23 14:35:12,491 INFO L287 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-07-23 14:35:12,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 474 states and 651 transitions. [2022-07-23 14:35:12,493 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 393 [2022-07-23 14:35:12,493 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:12,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:12,494 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:12,494 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-23 14:35:12,495 INFO L752 eck$LassoCheckResult]: Stem: 5570#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 5554#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 5544#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 5546#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 5548#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 5549#L59-1 mp_add_~nb~0#1 := 4; 5793#L69 assume !(0 == mp_add_~b3~0#1 % 256); 5588#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 5589#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6006#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 6005#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 6004#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6003#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6002#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6001#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 5957#L90 [2022-07-23 14:35:12,495 INFO L754 eck$LassoCheckResult]: Loop: 5957#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 5938#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 5998#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 5954#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 5955#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 5799#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 5800#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5758#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5759#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5752#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5753#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5826#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 5827#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5817#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 5801#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 5802#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 5958#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5756#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5750#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5751#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5933#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 5934#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 6009#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6008#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6007#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 5956#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 5957#L90 [2022-07-23 14:35:12,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:12,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 3 times [2022-07-23 14:35:12,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:12,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405316884] [2022-07-23 14:35:12,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:12,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:12,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:12,512 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:12,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:12,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:12,524 INFO L85 PathProgramCache]: Analyzing trace with hash 900833757, now seen corresponding path program 1 times [2022-07-23 14:35:12,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:12,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751834107] [2022-07-23 14:35:12,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:12,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:12,571 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-23 14:35:12,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:12,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751834107] [2022-07-23 14:35:12,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751834107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:12,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:12,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:35:12,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177077069] [2022-07-23 14:35:12,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:12,573 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:12,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:12,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 14:35:12,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 14:35:12,574 INFO L87 Difference]: Start difference. First operand 474 states and 651 transitions. cyclomatic complexity: 183 Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:12,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:12,749 INFO L93 Difference]: Finished difference Result 957 states and 1290 transitions. [2022-07-23 14:35:12,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 14:35:12,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 957 states and 1290 transitions. [2022-07-23 14:35:12,756 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 833 [2022-07-23 14:35:12,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 957 states to 956 states and 1289 transitions. [2022-07-23 14:35:12,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 956 [2022-07-23 14:35:12,761 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 956 [2022-07-23 14:35:12,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 956 states and 1289 transitions. [2022-07-23 14:35:12,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:12,762 INFO L369 hiAutomatonCegarLoop]: Abstraction has 956 states and 1289 transitions. [2022-07-23 14:35:12,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states and 1289 transitions. [2022-07-23 14:35:12,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 715. [2022-07-23 14:35:12,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 715 states have (on average 1.358041958041958) internal successors, (971), 714 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 971 transitions. [2022-07-23 14:35:12,798 INFO L392 hiAutomatonCegarLoop]: Abstraction has 715 states and 971 transitions. [2022-07-23 14:35:12,798 INFO L374 stractBuchiCegarLoop]: Abstraction has 715 states and 971 transitions. [2022-07-23 14:35:12,798 INFO L287 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-07-23 14:35:12,798 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 715 states and 971 transitions. [2022-07-23 14:35:12,801 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 628 [2022-07-23 14:35:12,801 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:12,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:12,802 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:12,802 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-23 14:35:12,802 INFO L752 eck$LassoCheckResult]: Stem: 7010#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 6996#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 6986#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 6988#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 6990#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 6991#L59-1 mp_add_~nb~0#1 := 4; 7328#L69 assume !(0 == mp_add_~b3~0#1 % 256); 7030#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 7031#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7436#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7435#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 7434#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 7433#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 7431#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 7429#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 7421#L90 [2022-07-23 14:35:12,803 INFO L754 eck$LassoCheckResult]: Loop: 7421#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 7371#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 7426#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 7424#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 7416#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 7344#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 7345#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 7410#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7408#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7405#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7404#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7403#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 7400#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7401#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 7343#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 7340#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 7341#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 7372#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7363#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7362#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7360#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7361#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 7432#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 7430#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 7428#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 7420#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 7421#L90 [2022-07-23 14:35:12,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:12,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 4 times [2022-07-23 14:35:12,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:12,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115337794] [2022-07-23 14:35:12,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:12,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:12,813 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:12,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:12,823 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:12,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:12,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1994925345, now seen corresponding path program 1 times [2022-07-23 14:35:12,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:12,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214685183] [2022-07-23 14:35:12,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:12,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:12,901 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-23 14:35:12,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:12,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214685183] [2022-07-23 14:35:12,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214685183] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:12,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357935522] [2022-07-23 14:35:12,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:12,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:12,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:12,903 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:12,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-07-23 14:35:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:12,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 14:35:12,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:13,113 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-23 14:35:13,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:35:13,150 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-23 14:35:13,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357935522] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:35:13,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:35:13,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-07-23 14:35:13,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029267507] [2022-07-23 14:35:13,151 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:35:13,152 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:13,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:13,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 14:35:13,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-23 14:35:13,152 INFO L87 Difference]: Start difference. First operand 715 states and 971 transitions. cyclomatic complexity: 264 Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 7 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:13,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:13,500 INFO L93 Difference]: Finished difference Result 1221 states and 1613 transitions. [2022-07-23 14:35:13,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 14:35:13,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1221 states and 1613 transitions. [2022-07-23 14:35:13,508 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1055 [2022-07-23 14:35:13,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1221 states to 1221 states and 1613 transitions. [2022-07-23 14:35:13,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1221 [2022-07-23 14:35:13,514 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1221 [2022-07-23 14:35:13,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1221 states and 1613 transitions. [2022-07-23 14:35:13,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:13,516 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1221 states and 1613 transitions. [2022-07-23 14:35:13,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states and 1613 transitions. [2022-07-23 14:35:13,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1080. [2022-07-23 14:35:13,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1080 states have (on average 1.336111111111111) internal successors, (1443), 1079 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:13,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1443 transitions. [2022-07-23 14:35:13,534 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1080 states and 1443 transitions. [2022-07-23 14:35:13,534 INFO L374 stractBuchiCegarLoop]: Abstraction has 1080 states and 1443 transitions. [2022-07-23 14:35:13,534 INFO L287 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-07-23 14:35:13,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1080 states and 1443 transitions. [2022-07-23 14:35:13,539 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 961 [2022-07-23 14:35:13,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:13,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:13,540 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:13,540 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-23 14:35:13,540 INFO L752 eck$LassoCheckResult]: Stem: 9113#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 9097#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 9087#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 9089#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 9091#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 9092#L59-1 mp_add_~nb~0#1 := 4; 9625#L69 assume !(0 == mp_add_~b3~0#1 % 256); 9133#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 9114#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 9115#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 9815#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 9814#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 9813#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 9812#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 9811#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 9776#L90 [2022-07-23 14:35:13,540 INFO L754 eck$LassoCheckResult]: Loop: 9776#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 9665#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 9810#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 9808#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 9804#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 9651#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 9650#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 9649#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 9646#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 9641#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 9640#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 9629#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 9630#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 9730#L90 assume !(0 == mp_add_~i~0#1 % 256); 9729#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 9728#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 9726#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 9722#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 9720#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 9719#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 9718#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 9717#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 9716#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 9715#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 9714#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 9670#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 9783#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 9781#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 9780#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 9775#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 9776#L90 [2022-07-23 14:35:13,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:13,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 5 times [2022-07-23 14:35:13,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:13,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968225346] [2022-07-23 14:35:13,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:13,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:13,550 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:13,572 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:13,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:13,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1196420781, now seen corresponding path program 1 times [2022-07-23 14:35:13,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:13,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103469753] [2022-07-23 14:35:13,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:13,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:13,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:13,620 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-23 14:35:13,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:13,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103469753] [2022-07-23 14:35:13,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103469753] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:13,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:13,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:35:13,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272122543] [2022-07-23 14:35:13,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:13,623 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:13,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:13,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:35:13,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 14:35:13,624 INFO L87 Difference]: Start difference. First operand 1080 states and 1443 transitions. cyclomatic complexity: 371 Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:13,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:13,761 INFO L93 Difference]: Finished difference Result 1442 states and 1866 transitions. [2022-07-23 14:35:13,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 14:35:13,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1442 states and 1866 transitions. [2022-07-23 14:35:13,768 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1308 [2022-07-23 14:35:13,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1442 states to 1441 states and 1863 transitions. [2022-07-23 14:35:13,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1441 [2022-07-23 14:35:13,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1441 [2022-07-23 14:35:13,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1441 states and 1863 transitions. [2022-07-23 14:35:13,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:13,777 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1441 states and 1863 transitions. [2022-07-23 14:35:13,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states and 1863 transitions. [2022-07-23 14:35:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 1128. [2022-07-23 14:35:13,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1128 states have (on average 1.3111702127659575) internal successors, (1479), 1127 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:13,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1479 transitions. [2022-07-23 14:35:13,795 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1128 states and 1479 transitions. [2022-07-23 14:35:13,796 INFO L374 stractBuchiCegarLoop]: Abstraction has 1128 states and 1479 transitions. [2022-07-23 14:35:13,796 INFO L287 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-07-23 14:35:13,796 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1128 states and 1479 transitions. [2022-07-23 14:35:13,800 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1043 [2022-07-23 14:35:13,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:13,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:13,801 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:13,801 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-23 14:35:13,801 INFO L752 eck$LassoCheckResult]: Stem: 11643#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 11628#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 11618#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 11620#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 11622#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 11623#L59-1 mp_add_~nb~0#1 := 4; 12063#L69 assume !(0 == mp_add_~b3~0#1 % 256); 11661#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 11662#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 12556#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 12557#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 12574#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 12542#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 12543#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 12538#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 12537#L90 [2022-07-23 14:35:13,801 INFO L754 eck$LassoCheckResult]: Loop: 12537#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 12438#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 12535#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 12533#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 12529#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 12527#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 12481#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 12526#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 12525#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 12524#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 12523#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 12522#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 12520#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 12521#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 11665#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 11666#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 12071#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 12064#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 12065#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 11710#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 11658#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 11659#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 11612#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 11614#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 12403#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 12401#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 12393#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 12392#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 11699#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 11700#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 12418#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 12554#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 12555#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 12540#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 12541#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 12537#L90 [2022-07-23 14:35:13,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:13,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 6 times [2022-07-23 14:35:13,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:13,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932097380] [2022-07-23 14:35:13,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:13,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:13,809 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:13,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:13,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:13,819 INFO L85 PathProgramCache]: Analyzing trace with hash -239832150, now seen corresponding path program 2 times [2022-07-23 14:35:13,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:13,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095018094] [2022-07-23 14:35:13,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:13,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:13,860 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-23 14:35:13,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:13,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095018094] [2022-07-23 14:35:13,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095018094] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:13,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470696708] [2022-07-23 14:35:13,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 14:35:13,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:13,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:13,863 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:13,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-07-23 14:35:13,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 14:35:13,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:35:13,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 14:35:13,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:13,937 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-23 14:35:13,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 14:35:13,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470696708] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:13,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 14:35:13,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2022-07-23 14:35:13,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129306760] [2022-07-23 14:35:13,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:13,938 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:13,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:13,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:35:13,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-23 14:35:13,939 INFO L87 Difference]: Start difference. First operand 1128 states and 1479 transitions. cyclomatic complexity: 357 Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:14,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:14,074 INFO L93 Difference]: Finished difference Result 1310 states and 1689 transitions. [2022-07-23 14:35:14,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 14:35:14,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1310 states and 1689 transitions. [2022-07-23 14:35:14,082 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1216 [2022-07-23 14:35:14,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1310 states to 1301 states and 1680 transitions. [2022-07-23 14:35:14,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1301 [2022-07-23 14:35:14,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1301 [2022-07-23 14:35:14,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1301 states and 1680 transitions. [2022-07-23 14:35:14,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:14,091 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1301 states and 1680 transitions. [2022-07-23 14:35:14,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states and 1680 transitions. [2022-07-23 14:35:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 1218. [2022-07-23 14:35:14,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1218 states have (on average 1.2980295566502462) internal successors, (1581), 1217 states have internal predecessors, (1581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1581 transitions. [2022-07-23 14:35:14,110 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1218 states and 1581 transitions. [2022-07-23 14:35:14,111 INFO L374 stractBuchiCegarLoop]: Abstraction has 1218 states and 1581 transitions. [2022-07-23 14:35:14,111 INFO L287 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-07-23 14:35:14,111 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1218 states and 1581 transitions. [2022-07-23 14:35:14,116 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1135 [2022-07-23 14:35:14,116 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:14,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:14,117 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:14,117 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-23 14:35:14,117 INFO L752 eck$LassoCheckResult]: Stem: 14190#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 14177#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 14162#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 14164#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 14166#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 14167#L59-1 mp_add_~nb~0#1 := 4; 15185#L69 assume !(0 == mp_add_~b3~0#1 % 256); 15184#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 15183#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 15182#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 15181#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 15180#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 15179#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 15177#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 15176#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 15174#L90 [2022-07-23 14:35:14,117 INFO L754 eck$LassoCheckResult]: Loop: 15174#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 14642#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 15173#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 15172#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 15169#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 15162#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 14630#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 15161#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 15160#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 15159#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 15158#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 15157#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 15155#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 15145#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 15135#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 15136#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 15129#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 15130#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14264#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14265#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 15335#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 15272#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 15270#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 14513#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 14514#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 14393#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 14395#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 14382#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 14383#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 14645#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 14646#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 15244#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 15243#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 15242#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 15241#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 15174#L90 [2022-07-23 14:35:14,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:14,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 7 times [2022-07-23 14:35:14,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:14,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683893327] [2022-07-23 14:35:14,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:14,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:14,126 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:14,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:14,135 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:14,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:14,136 INFO L85 PathProgramCache]: Analyzing trace with hash -632859160, now seen corresponding path program 2 times [2022-07-23 14:35:14,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:14,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465538394] [2022-07-23 14:35:14,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:14,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:14,179 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-23 14:35:14,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:14,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465538394] [2022-07-23 14:35:14,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465538394] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:14,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157604066] [2022-07-23 14:35:14,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 14:35:14,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:14,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:14,216 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:14,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-07-23 14:35:14,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 14:35:14,257 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:35:14,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 14:35:14,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:14,302 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-23 14:35:14,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:35:14,369 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-23 14:35:14,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157604066] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:35:14,369 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:35:14,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-07-23 14:35:14,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103903923] [2022-07-23 14:35:14,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:35:14,371 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:14,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:14,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 14:35:14,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-23 14:35:14,373 INFO L87 Difference]: Start difference. First operand 1218 states and 1581 transitions. cyclomatic complexity: 368 Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:15,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:15,640 INFO L93 Difference]: Finished difference Result 2021 states and 2495 transitions. [2022-07-23 14:35:15,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-23 14:35:15,641 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2021 states and 2495 transitions. [2022-07-23 14:35:15,653 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 1839 [2022-07-23 14:35:15,661 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2021 states to 1992 states and 2457 transitions. [2022-07-23 14:35:15,662 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1992 [2022-07-23 14:35:15,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1992 [2022-07-23 14:35:15,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1992 states and 2457 transitions. [2022-07-23 14:35:15,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:15,666 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1992 states and 2457 transitions. [2022-07-23 14:35:15,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states and 2457 transitions. [2022-07-23 14:35:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1219. [2022-07-23 14:35:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1219 states have (on average 1.2748154224774406) internal successors, (1554), 1218 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 1554 transitions. [2022-07-23 14:35:15,699 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1219 states and 1554 transitions. [2022-07-23 14:35:15,700 INFO L374 stractBuchiCegarLoop]: Abstraction has 1219 states and 1554 transitions. [2022-07-23 14:35:15,700 INFO L287 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-07-23 14:35:15,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1219 states and 1554 transitions. [2022-07-23 14:35:15,704 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1117 [2022-07-23 14:35:15,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:15,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:15,706 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:15,706 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-23 14:35:15,706 INFO L752 eck$LassoCheckResult]: Stem: 17761#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 17745#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 17734#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 17736#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 17738#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 17739#L59-1 mp_add_~nb~0#1 := 4; 18130#L69 assume !(0 == mp_add_~b3~0#1 % 256); 18129#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 18128#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18127#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 18114#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 18115#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 18108#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 18109#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 18102#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 18101#L90 [2022-07-23 14:35:15,707 INFO L754 eck$LassoCheckResult]: Loop: 18101#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 18100#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 18099#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 18097#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 18093#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 18094#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 18092#L96-8 mp_add_~carry~0#1 := 1; 18090#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 18088#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 18086#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 18084#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18071#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18072#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18062#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 18063#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 18057#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 18054#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 18053#L96-8 mp_add_~carry~0#1 := 1; 18047#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 18046#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 17910#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 18041#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18038#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18035#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18032#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 18024#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 18020#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 18021#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 18022#L96-8 mp_add_~carry~0#1 := 1; 18019#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 18013#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 18011#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 18009#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18003#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18002#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18000#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 17997#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 17992#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 17993#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 17991#L96-8 mp_add_~carry~0#1 := 1; 17989#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 17987#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 17976#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 17972#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 17967#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 17965#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 17963#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 17955#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 17943#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 17944#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 18050#L96-8 mp_add_~carry~0#1 := 1; 17928#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 17929#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 17916#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 17912#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 17901#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 17900#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 17883#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 17884#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 17970#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 17940#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 17936#L96-8 mp_add_~carry~0#1 := 1; 17930#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 17931#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 17917#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 17913#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 17905#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 17902#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 17841#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 17842#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 18103#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 17986#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 17985#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 17984#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 17982#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 17981#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 17978#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 17979#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 18104#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 18111#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 18112#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 18105#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 18106#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 18101#L90 [2022-07-23 14:35:15,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:15,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 8 times [2022-07-23 14:35:15,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:15,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719969744] [2022-07-23 14:35:15,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:15,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:15,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:15,719 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:15,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:15,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:15,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1271323788, now seen corresponding path program 1 times [2022-07-23 14:35:15,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:15,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144638793] [2022-07-23 14:35:15,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:15,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:15,776 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-23 14:35:15,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:15,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144638793] [2022-07-23 14:35:15,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144638793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:15,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:15,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 14:35:15,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243574673] [2022-07-23 14:35:15,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:15,778 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:15,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:15,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:35:15,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 14:35:15,778 INFO L87 Difference]: Start difference. First operand 1219 states and 1554 transitions. cyclomatic complexity: 340 Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:15,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:15,829 INFO L93 Difference]: Finished difference Result 1534 states and 1856 transitions. [2022-07-23 14:35:15,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 14:35:15,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1534 states and 1856 transitions. [2022-07-23 14:35:15,837 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1259 [2022-07-23 14:35:15,843 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1534 states to 1390 states and 1712 transitions. [2022-07-23 14:35:15,844 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1390 [2022-07-23 14:35:15,845 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1390 [2022-07-23 14:35:15,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1390 states and 1712 transitions. [2022-07-23 14:35:15,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:15,846 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1390 states and 1712 transitions. [2022-07-23 14:35:15,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states and 1712 transitions. [2022-07-23 14:35:15,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1113. [2022-07-23 14:35:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 1113 states have (on average 1.2461814914645104) internal successors, (1387), 1112 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:15,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1387 transitions. [2022-07-23 14:35:15,866 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1113 states and 1387 transitions. [2022-07-23 14:35:15,866 INFO L374 stractBuchiCegarLoop]: Abstraction has 1113 states and 1387 transitions. [2022-07-23 14:35:15,866 INFO L287 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-07-23 14:35:15,866 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1113 states and 1387 transitions. [2022-07-23 14:35:15,869 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 996 [2022-07-23 14:35:15,869 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:15,869 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:15,870 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:15,870 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-23 14:35:15,870 INFO L752 eck$LassoCheckResult]: Stem: 20520#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 20505#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 20487#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 20489#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 20491#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 20492#L59-1 mp_add_~nb~0#1 := 4; 20816#L69 assume !(0 == mp_add_~b3~0#1 % 256); 20815#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 20814#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 20813#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 20811#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 20812#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 20807#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 20808#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 20803#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 20802#L90 [2022-07-23 14:35:15,871 INFO L754 eck$LassoCheckResult]: Loop: 20802#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 20801#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 20800#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 20798#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 20793#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 20795#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 20788#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20789#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20784#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20785#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20780#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 20781#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20777#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 20776#L90 assume !(0 == mp_add_~i~0#1 % 256); 20775#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 20671#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 20771#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 20768#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 20769#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 20770#L96-8 mp_add_~carry~0#1 := 1; 20767#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20765#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 20763#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20761#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20759#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20757#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 20752#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20753#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 20756#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 20741#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20751#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20749#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 20747#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20745#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20727#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 20728#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20723#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 20721#L90 assume !(0 == mp_add_~i~0#1 % 256); 20719#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 20716#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 20708#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 20704#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 20700#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 20696#L96-8 mp_add_~carry~0#1 := 1; 20694#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20692#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20690#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20688#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 20656#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20686#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 20685#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20683#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 20684#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 21336#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 21334#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20679#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20678#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20644#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20677#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 20675#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20676#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 20672#L90 assume !(0 == mp_add_~i~0#1 % 256); 20670#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 20669#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 20667#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 20664#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 20661#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 20660#L96-8 mp_add_~carry~0#1 := 1; 20659#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20658#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20657#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20655#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20654#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20653#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 20652#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 20650#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 20649#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 20648#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 20646#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 20645#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 20643#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 20642#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20564#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 20565#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 20804#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 20809#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 20810#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 20805#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 20806#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 20802#L90 [2022-07-23 14:35:15,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:15,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 9 times [2022-07-23 14:35:15,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:15,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652556562] [2022-07-23 14:35:15,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:15,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:15,879 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:15,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:15,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:15,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1286195251, now seen corresponding path program 1 times [2022-07-23 14:35:15,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:15,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421834186] [2022-07-23 14:35:15,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:15,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:15,962 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-23 14:35:15,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:15,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421834186] [2022-07-23 14:35:15,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421834186] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:15,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:15,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 14:35:15,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710351185] [2022-07-23 14:35:15,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:15,964 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:15,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:15,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 14:35:15,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 14:35:15,966 INFO L87 Difference]: Start difference. First operand 1113 states and 1387 transitions. cyclomatic complexity: 279 Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:16,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:16,299 INFO L93 Difference]: Finished difference Result 1733 states and 2133 transitions. [2022-07-23 14:35:16,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 14:35:16,299 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1733 states and 2133 transitions. [2022-07-23 14:35:16,307 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1451 [2022-07-23 14:35:16,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1733 states to 1704 states and 2102 transitions. [2022-07-23 14:35:16,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1704 [2022-07-23 14:35:16,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1704 [2022-07-23 14:35:16,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1704 states and 2102 transitions. [2022-07-23 14:35:16,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:16,319 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1704 states and 2102 transitions. [2022-07-23 14:35:16,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states and 2102 transitions. [2022-07-23 14:35:16,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1392. [2022-07-23 14:35:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1392 states have (on average 1.2564655172413792) internal successors, (1749), 1391 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1749 transitions. [2022-07-23 14:35:16,343 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1392 states and 1749 transitions. [2022-07-23 14:35:16,343 INFO L374 stractBuchiCegarLoop]: Abstraction has 1392 states and 1749 transitions. [2022-07-23 14:35:16,343 INFO L287 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-07-23 14:35:16,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1392 states and 1749 transitions. [2022-07-23 14:35:16,359 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1229 [2022-07-23 14:35:16,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:16,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:16,360 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:16,360 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-23 14:35:16,360 INFO L752 eck$LassoCheckResult]: Stem: 23390#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 23375#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 23358#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 23360#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 23362#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 23363#L59-1 mp_add_~nb~0#1 := 4; 23665#L69 assume !(0 == mp_add_~b3~0#1 % 256); 23664#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 23663#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23662#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 23660#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 23661#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 23656#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 23657#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 23652#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23651#L90 [2022-07-23 14:35:16,361 INFO L754 eck$LassoCheckResult]: Loop: 23651#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 23650#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 23649#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 23647#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 23642#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 23644#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 24670#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 24669#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 24668#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 24667#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 24666#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 24665#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23632#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23631#L90 assume !(0 == mp_add_~i~0#1 % 256); 23630#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 23532#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 23628#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 23624#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 23621#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23620#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 23619#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23618#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23617#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23616#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23615#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23614#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23613#L90 assume !(0 == mp_add_~i~0#1 % 256); 23612#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 23611#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 23609#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 23605#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 23603#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23601#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23599#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 23594#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23595#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23588#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23589#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23581#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23579#L90 assume !(0 == mp_add_~i~0#1 % 256); 23577#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 23574#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 23571#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 23567#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 23563#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 23559#L96-8 mp_add_~carry~0#1 := 1; 23557#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23555#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23553#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23551#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 23517#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23549#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23548#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23546#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 23547#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 23542#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23543#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23540#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23539#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23505#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23538#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23536#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23537#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23533#L90 assume !(0 == mp_add_~i~0#1 % 256); 23531#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 23530#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 23528#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 23525#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 23522#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_~partial_sum~0#1 := 0; 23521#L96-8 mp_add_~carry~0#1 := 1; 23520#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23519#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23518#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23516#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23515#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23514#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23513#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23511#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 23510#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 23509#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23507#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23506#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23504#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23503#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23432#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23433#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 23653#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 23658#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 23659#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 23654#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 23655#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23651#L90 [2022-07-23 14:35:16,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:16,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 10 times [2022-07-23 14:35:16,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:16,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505724147] [2022-07-23 14:35:16,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:16,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:16,370 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:16,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:16,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:16,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1983601108, now seen corresponding path program 1 times [2022-07-23 14:35:16,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:16,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419812832] [2022-07-23 14:35:16,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:16,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:16,413 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-23 14:35:16,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:16,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419812832] [2022-07-23 14:35:16,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419812832] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:16,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:16,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:35:16,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963146519] [2022-07-23 14:35:16,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:16,414 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:16,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:16,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:35:16,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:35:16,415 INFO L87 Difference]: Start difference. First operand 1392 states and 1749 transitions. cyclomatic complexity: 364 Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:16,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:16,438 INFO L93 Difference]: Finished difference Result 1392 states and 1705 transitions. [2022-07-23 14:35:16,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:35:16,439 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1392 states and 1705 transitions. [2022-07-23 14:35:16,444 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1229 [2022-07-23 14:35:16,450 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1392 states to 1392 states and 1705 transitions. [2022-07-23 14:35:16,450 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1392 [2022-07-23 14:35:16,451 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1392 [2022-07-23 14:35:16,451 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1392 states and 1705 transitions. [2022-07-23 14:35:16,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:16,453 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1392 states and 1705 transitions. [2022-07-23 14:35:16,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states and 1705 transitions. [2022-07-23 14:35:16,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 1392. [2022-07-23 14:35:16,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1392 states have (on average 1.2248563218390804) internal successors, (1705), 1391 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1705 transitions. [2022-07-23 14:35:16,474 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1392 states and 1705 transitions. [2022-07-23 14:35:16,474 INFO L374 stractBuchiCegarLoop]: Abstraction has 1392 states and 1705 transitions. [2022-07-23 14:35:16,474 INFO L287 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-07-23 14:35:16,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1392 states and 1705 transitions. [2022-07-23 14:35:16,478 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1229 [2022-07-23 14:35:16,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:16,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:16,479 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:16,479 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-23 14:35:16,479 INFO L752 eck$LassoCheckResult]: Stem: 26180#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 26166#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 26148#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 26150#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 26152#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 26153#L59-1 mp_add_~nb~0#1 := 4; 26467#L69 assume !(0 == mp_add_~b3~0#1 % 256); 26466#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 26465#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 26463#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 26464#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 27508#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 27507#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 27506#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 26457#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26456#L90 [2022-07-23 14:35:16,480 INFO L754 eck$LassoCheckResult]: Loop: 26456#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 26455#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26453#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 26451#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 26447#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 26449#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 26442#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26443#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26438#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26439#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26434#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 26435#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26431#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26430#L90 assume !(0 == mp_add_~i~0#1 % 256); 26429#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 26329#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 26426#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 26422#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 26424#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 27402#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 26417#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26416#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26414#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26415#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 27391#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26410#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26409#L90 assume !(0 == mp_add_~i~0#1 % 256); 26407#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26405#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 26403#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 26400#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 26398#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26396#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26394#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 26392#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26390#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26388#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 26386#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26377#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26375#L90 assume !(0 == mp_add_~i~0#1 % 256); 26373#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26370#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 26367#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 26364#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 26365#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26383#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26382#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26381#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 26380#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26379#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 26378#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26376#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26374#L90 assume !(0 == mp_add_~i~0#1 % 256); 26372#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26369#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 26366#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 26326#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 26324#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26338#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26337#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26336#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26302#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26335#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 26333#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26334#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26330#L90 assume !(0 == mp_add_~i~0#1 % 256); 26328#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26327#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 26325#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 26323#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 26322#L96 assume !(0 == mp_add_~partial_sum~0#1); 26321#L96-2 assume !false; 26320#L96-4 assume !false; 26319#L96-6 assume !(mp_add_~partial_sum~0#1 >= 0);mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1; 26318#L96-8 mp_add_~carry~0#1 := 1; 26317#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26316#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26315#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26313#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26312#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26311#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 26310#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26308#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 26307#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 26306#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26304#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26303#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26301#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26300#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26228#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 26229#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 26458#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 26462#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 26461#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 26459#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 26460#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26456#L90 [2022-07-23 14:35:16,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:16,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 11 times [2022-07-23 14:35:16,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:16,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613814018] [2022-07-23 14:35:16,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:16,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:16,488 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:16,497 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:16,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:16,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1164629126, now seen corresponding path program 1 times [2022-07-23 14:35:16,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:16,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128928348] [2022-07-23 14:35:16,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:16,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:16,522 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-23 14:35:16,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:16,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128928348] [2022-07-23 14:35:16,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128928348] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:16,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 14:35:16,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 14:35:16,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590855321] [2022-07-23 14:35:16,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:16,524 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:16,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:16,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 14:35:16,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 14:35:16,525 INFO L87 Difference]: Start difference. First operand 1392 states and 1705 transitions. cyclomatic complexity: 320 Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:16,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:16,585 INFO L93 Difference]: Finished difference Result 1504 states and 1823 transitions. [2022-07-23 14:35:16,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 14:35:16,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1504 states and 1823 transitions. [2022-07-23 14:35:16,591 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1341 [2022-07-23 14:35:16,597 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1504 states to 1504 states and 1823 transitions. [2022-07-23 14:35:16,598 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1504 [2022-07-23 14:35:16,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1504 [2022-07-23 14:35:16,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1504 states and 1823 transitions. [2022-07-23 14:35:16,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:16,601 INFO L369 hiAutomatonCegarLoop]: Abstraction has 1504 states and 1823 transitions. [2022-07-23 14:35:16,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1504 states and 1823 transitions. [2022-07-23 14:35:16,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1504 to 1423. [2022-07-23 14:35:16,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 1423 states have (on average 1.2241742796907942) internal successors, (1742), 1422 states have internal predecessors, (1742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:16,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1742 transitions. [2022-07-23 14:35:16,622 INFO L392 hiAutomatonCegarLoop]: Abstraction has 1423 states and 1742 transitions. [2022-07-23 14:35:16,623 INFO L374 stractBuchiCegarLoop]: Abstraction has 1423 states and 1742 transitions. [2022-07-23 14:35:16,623 INFO L287 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-07-23 14:35:16,623 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1423 states and 1742 transitions. [2022-07-23 14:35:16,626 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1260 [2022-07-23 14:35:16,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:16,627 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:16,627 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:16,627 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-23 14:35:16,628 INFO L752 eck$LassoCheckResult]: Stem: 29082#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 29066#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 29055#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 29057#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 29059#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 29060#L59-1 mp_add_~nb~0#1 := 4; 29363#L69 assume !(0 == mp_add_~b3~0#1 % 256); 29362#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 29361#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29360#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 29359#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 29358#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 29357#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 29356#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 29354#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29353#L90 [2022-07-23 14:35:16,628 INFO L754 eck$LassoCheckResult]: Loop: 29353#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 29352#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29350#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29348#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29345#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29341#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 29342#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29337#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29338#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29334#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29333#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29332#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 29331#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29330#L90 assume !(0 == mp_add_~i~0#1 % 256); 29329#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 29222#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29326#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29322#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29324#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29317#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 29318#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29313#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29314#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29309#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29307#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 29305#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29304#L90 assume !(0 == mp_add_~i~0#1 % 256); 29303#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29302#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 29301#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29299#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29297#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29295#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29293#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 29291#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29289#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29287#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29285#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 29283#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29277#L90 assume !(0 == mp_add_~i~0#1 % 256); 29280#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29278#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29274#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 29275#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29270#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29268#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29266#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29254#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 29253#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29250#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29251#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 29247#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29245#L90 assume !(0 == mp_add_~i~0#1 % 256); 29246#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29239#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29240#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29265#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29217#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29233#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29231#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29229#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29196#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29228#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29226#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 29227#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29223#L90 assume !(0 == mp_add_~i~0#1 % 256); 29221#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29220#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29218#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29216#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 29215#L96 assume !(0 == mp_add_~partial_sum~0#1); 29214#L96-2 assume !false; 29213#L96-4 assume !false; 29212#L96-6 assume !(mp_add_~partial_sum~0#1 >= 0);mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1; 29211#L96-8 mp_add_~carry~0#1 := 1; 29210#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29209#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29208#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29206#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29205#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29204#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29203#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 29201#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 29200#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29199#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29198#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29197#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29195#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29194#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29121#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29122#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 29355#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 30411#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 30410#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 30409#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 30408#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29353#L90 [2022-07-23 14:35:16,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:16,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1265810513, now seen corresponding path program 12 times [2022-07-23 14:35:16,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:16,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129492010] [2022-07-23 14:35:16,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:16,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:16,636 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:16,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:16,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:16,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1588275848, now seen corresponding path program 2 times [2022-07-23 14:35:16,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:16,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205040445] [2022-07-23 14:35:16,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:16,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:16,675 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-23 14:35:16,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:16,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205040445] [2022-07-23 14:35:16,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205040445] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:16,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019872366] [2022-07-23 14:35:16,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 14:35:16,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:16,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:16,678 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:16,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-07-23 14:35:16,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 14:35:16,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:35:16,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 14:35:16,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:16,782 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-23 14:35:16,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:35:16,814 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-23 14:35:16,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019872366] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:35:16,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:35:16,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-07-23 14:35:16,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724631913] [2022-07-23 14:35:16,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:35:16,816 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:16,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:16,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:35:16,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 14:35:16,816 INFO L87 Difference]: Start difference. First operand 1423 states and 1742 transitions. cyclomatic complexity: 326 Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:16,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:16,870 INFO L93 Difference]: Finished difference Result 700 states and 790 transitions. [2022-07-23 14:35:16,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 14:35:16,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 700 states and 790 transitions. [2022-07-23 14:35:16,873 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 424 [2022-07-23 14:35:16,875 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 700 states to 556 states and 641 transitions. [2022-07-23 14:35:16,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 556 [2022-07-23 14:35:16,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 556 [2022-07-23 14:35:16,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 556 states and 641 transitions. [2022-07-23 14:35:16,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:16,877 INFO L369 hiAutomatonCegarLoop]: Abstraction has 556 states and 641 transitions. [2022-07-23 14:35:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states and 641 transitions. [2022-07-23 14:35:16,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 453. [2022-07-23 14:35:16,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 453 states have (on average 1.1280353200883002) internal successors, (511), 452 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:16,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 511 transitions. [2022-07-23 14:35:16,885 INFO L392 hiAutomatonCegarLoop]: Abstraction has 453 states and 511 transitions. [2022-07-23 14:35:16,885 INFO L374 stractBuchiCegarLoop]: Abstraction has 453 states and 511 transitions. [2022-07-23 14:35:16,886 INFO L287 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2022-07-23 14:35:16,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 453 states and 511 transitions. [2022-07-23 14:35:16,887 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 321 [2022-07-23 14:35:16,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:16,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:16,889 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-23 14:35:16,889 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-23 14:35:16,890 INFO L752 eck$LassoCheckResult]: Stem: 31777#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 31766#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 31755#L59 assume !(0 == mp_add_~a3~0#1 % 256); 31756#L59-1 mp_add_~nb~0#1 := 4; 31992#L69 assume !(0 == mp_add_~b3~0#1 % 256); 31991#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 31990#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 31989#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 31988#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 31987#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 31986#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 31985#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 31984#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31983#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 31982#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 31981#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 31980#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 31979#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 31978#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 31977#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 31976#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 31975#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 31974#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31972#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 31973#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 32014#L84 assume !(0 == mp_add_~i~0#1 % 256); 31960#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 31958#L85-1 [2022-07-23 14:35:16,894 INFO L754 eck$LassoCheckResult]: Loop: 31958#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 31957#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 31907#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31908#L90 assume !(0 == mp_add_~i~0#1 % 256); 31923#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 31924#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 31903#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 31904#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 31895#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 31896#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 31887#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 31888#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 31879#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31880#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 31870#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 31872#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 31955#L90 assume !(0 == mp_add_~i~0#1 % 256); 32033#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 32032#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 32031#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 32030#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32029#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32028#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 32027#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 32026#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32025#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32024#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32022#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 32021#L84 assume !(0 == mp_add_~i~0#1 % 256); 32020#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 32019#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 32018#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 32008#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 32002#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 32009#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32005#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 32000#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 31995#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 31993#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 31971#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 31967#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 31963#L84 assume !(0 == mp_add_~i~0#1 % 256); 31964#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 31958#L85-1 [2022-07-23 14:35:16,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:16,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1596563941, now seen corresponding path program 1 times [2022-07-23 14:35:16,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:16,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522691937] [2022-07-23 14:35:16,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:16,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:16,919 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:16,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:16,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:16,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1729137940, now seen corresponding path program 1 times [2022-07-23 14:35:16,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:16,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098886836] [2022-07-23 14:35:16,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:16,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:17,026 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-23 14:35:17,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:17,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098886836] [2022-07-23 14:35:17,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098886836] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:17,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986506053] [2022-07-23 14:35:17,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:17,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:17,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:17,029 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:17,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-07-23 14:35:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:17,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 14:35:17,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:17,184 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-23 14:35:17,184 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 14:35:17,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986506053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:17,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 14:35:17,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-07-23 14:35:17,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181646977] [2022-07-23 14:35:17,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:17,185 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:17,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:17,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 14:35:17,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-23 14:35:17,186 INFO L87 Difference]: Start difference. First operand 453 states and 511 transitions. cyclomatic complexity: 64 Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:17,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:17,432 INFO L93 Difference]: Finished difference Result 763 states and 854 transitions. [2022-07-23 14:35:17,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 14:35:17,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 763 states and 854 transitions. [2022-07-23 14:35:17,436 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 520 [2022-07-23 14:35:17,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 763 states to 744 states and 835 transitions. [2022-07-23 14:35:17,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 744 [2022-07-23 14:35:17,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 744 [2022-07-23 14:35:17,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 744 states and 835 transitions. [2022-07-23 14:35:17,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:17,439 INFO L369 hiAutomatonCegarLoop]: Abstraction has 744 states and 835 transitions. [2022-07-23 14:35:17,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states and 835 transitions. [2022-07-23 14:35:17,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 455. [2022-07-23 14:35:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 455 states have (on average 1.1274725274725275) internal successors, (513), 454 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 513 transitions. [2022-07-23 14:35:17,447 INFO L392 hiAutomatonCegarLoop]: Abstraction has 455 states and 513 transitions. [2022-07-23 14:35:17,447 INFO L374 stractBuchiCegarLoop]: Abstraction has 455 states and 513 transitions. [2022-07-23 14:35:17,447 INFO L287 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2022-07-23 14:35:17,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 455 states and 513 transitions. [2022-07-23 14:35:17,448 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 318 [2022-07-23 14:35:17,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:17,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:17,449 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-23 14:35:17,449 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-23 14:35:17,449 INFO L752 eck$LassoCheckResult]: Stem: 33143#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 33131#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 33122#L59 assume !(0 == mp_add_~a3~0#1 % 256); 33123#L59-1 mp_add_~nb~0#1 := 4; 33136#L69 assume !(0 == mp_add_~b3~0#1 % 256); 33295#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 33296#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33291#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 33292#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 33287#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 33288#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 33283#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 33284#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 33279#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 33280#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 33275#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 33276#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 33271#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33272#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 33267#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 33268#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 33263#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 33264#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 33259#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33260#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 33412#L84 assume !(0 == mp_add_~i~0#1 % 256); 33253#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 33249#L85-1 [2022-07-23 14:35:17,449 INFO L754 eck$LassoCheckResult]: Loop: 33249#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 33250#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 33241#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 33242#L90 assume !(0 == mp_add_~i~0#1 % 256); 33247#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 33248#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 33239#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 33240#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33235#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 33236#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 33231#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 33232#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 33227#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 33228#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33223#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 33224#L84 assume !(0 == mp_add_~i~0#1 % 256); 33219#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 33220#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 33215#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 33216#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 33472#L90 assume !(0 == mp_add_~i~0#1 % 256); 33471#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 33470#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 33469#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 33468#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33467#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 33466#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 33465#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 33464#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 33463#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 33462#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33460#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 33459#L84 assume !(0 == mp_add_~i~0#1 % 256); 33458#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 33457#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 33456#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 33404#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 33399#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 33453#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 33397#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 33378#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 33302#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 33298#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 33299#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33415#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 33254#L84 assume !(0 == mp_add_~i~0#1 % 256); 33255#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 33249#L85-1 [2022-07-23 14:35:17,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:17,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1596563941, now seen corresponding path program 2 times [2022-07-23 14:35:17,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:17,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697604001] [2022-07-23 14:35:17,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:17,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:17,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:17,461 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:17,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:17,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:17,473 INFO L85 PathProgramCache]: Analyzing trace with hash -2031036704, now seen corresponding path program 1 times [2022-07-23 14:35:17,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:17,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502118675] [2022-07-23 14:35:17,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:17,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:17,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:17,520 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-23 14:35:17,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:17,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502118675] [2022-07-23 14:35:17,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502118675] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:17,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142347860] [2022-07-23 14:35:17,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:17,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:17,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:17,523 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:17,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-07-23 14:35:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:17,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 14:35:17,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:17,619 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-23 14:35:17,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 14:35:17,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142347860] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:17,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 14:35:17,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-07-23 14:35:17,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830481765] [2022-07-23 14:35:17,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:17,620 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:17,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:17,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:35:17,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-23 14:35:17,621 INFO L87 Difference]: Start difference. First operand 455 states and 513 transitions. cyclomatic complexity: 64 Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:17,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:17,747 INFO L93 Difference]: Finished difference Result 569 states and 637 transitions. [2022-07-23 14:35:17,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 14:35:17,748 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 569 states and 637 transitions. [2022-07-23 14:35:17,749 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 413 [2022-07-23 14:35:17,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 569 states to 515 states and 561 transitions. [2022-07-23 14:35:17,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 515 [2022-07-23 14:35:17,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 515 [2022-07-23 14:35:17,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 515 states and 561 transitions. [2022-07-23 14:35:17,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:17,752 INFO L369 hiAutomatonCegarLoop]: Abstraction has 515 states and 561 transitions. [2022-07-23 14:35:17,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states and 561 transitions. [2022-07-23 14:35:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 462. [2022-07-23 14:35:17,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 462 states have (on average 1.0952380952380953) internal successors, (506), 461 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:17,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 506 transitions. [2022-07-23 14:35:17,758 INFO L392 hiAutomatonCegarLoop]: Abstraction has 462 states and 506 transitions. [2022-07-23 14:35:17,758 INFO L374 stractBuchiCegarLoop]: Abstraction has 462 states and 506 transitions. [2022-07-23 14:35:17,758 INFO L287 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2022-07-23 14:35:17,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 462 states and 506 transitions. [2022-07-23 14:35:17,759 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 360 [2022-07-23 14:35:17,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:17,760 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:17,760 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-23 14:35:17,760 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-23 14:35:17,760 INFO L752 eck$LassoCheckResult]: Stem: 34317#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 34305#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 34296#L59 assume !(0 == mp_add_~a3~0#1 % 256); 34297#L59-1 mp_add_~nb~0#1 := 4; 34572#L69 assume !(0 == mp_add_~b3~0#1 % 256); 34571#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 34570#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34569#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34568#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 34567#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34566#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34565#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34564#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34563#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 34562#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 34561#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 34560#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34559#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34558#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 34557#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34556#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34555#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34554#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34552#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34551#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34549#L84 assume !(0 == mp_add_~i~0#1 % 256); 34548#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 34547#L85-1 [2022-07-23 14:35:17,760 INFO L754 eck$LassoCheckResult]: Loop: 34547#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34545#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34536#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34537#L90 assume !(0 == mp_add_~i~0#1 % 256); 34542#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 34540#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 34538#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34534#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34532#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34530#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 34528#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34526#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34524#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34522#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34519#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34517#L84 assume !(0 == mp_add_~i~0#1 % 256); 34515#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34513#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 34511#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34509#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34508#L90 assume !(0 == mp_add_~i~0#1 % 256); 34507#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 34506#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 34503#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 34504#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34499#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34500#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34495#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 34496#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34489#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34490#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34480#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34481#L84 assume !(0 == mp_add_~i~0#1 % 256); 34471#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34472#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34463#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 34464#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 34585#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34605#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34604#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34603#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34602#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 34574#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34601#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34599#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34598#L84 assume !(0 == mp_add_~i~0#1 % 256); 34597#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34596#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34593#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34589#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 34583#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 34581#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34579#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34577#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34575#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34553#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34487#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34488#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34478#L84 assume !(0 == mp_add_~i~0#1 % 256); 34479#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 34547#L85-1 [2022-07-23 14:35:17,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:17,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1596563941, now seen corresponding path program 3 times [2022-07-23 14:35:17,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:17,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101694831] [2022-07-23 14:35:17,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:17,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:17,770 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:17,781 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:17,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:17,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1710168569, now seen corresponding path program 2 times [2022-07-23 14:35:17,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:17,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66005744] [2022-07-23 14:35:17,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:17,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:17,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:17,853 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-23 14:35:17,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:17,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66005744] [2022-07-23 14:35:17,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66005744] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:17,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427183319] [2022-07-23 14:35:17,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 14:35:17,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:17,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:17,857 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:17,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-07-23 14:35:17,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 14:35:17,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 14:35:17,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 14:35:17,894 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:17,961 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-23 14:35:17,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 14:35:17,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427183319] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 14:35:17,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 14:35:17,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2022-07-23 14:35:17,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327947122] [2022-07-23 14:35:17,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 14:35:17,962 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:17,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:17,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 14:35:17,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-23 14:35:17,963 INFO L87 Difference]: Start difference. First operand 462 states and 506 transitions. cyclomatic complexity: 50 Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:18,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:18,079 INFO L93 Difference]: Finished difference Result 459 states and 494 transitions. [2022-07-23 14:35:18,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 14:35:18,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 459 states and 494 transitions. [2022-07-23 14:35:18,081 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 196 [2022-07-23 14:35:18,082 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 459 states to 459 states and 494 transitions. [2022-07-23 14:35:18,082 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 459 [2022-07-23 14:35:18,083 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 459 [2022-07-23 14:35:18,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 459 states and 494 transitions. [2022-07-23 14:35:18,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:18,083 INFO L369 hiAutomatonCegarLoop]: Abstraction has 459 states and 494 transitions. [2022-07-23 14:35:18,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states and 494 transitions. [2022-07-23 14:35:18,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 395. [2022-07-23 14:35:18,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 395 states have (on average 1.0734177215189873) internal successors, (424), 394 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:18,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 424 transitions. [2022-07-23 14:35:18,089 INFO L392 hiAutomatonCegarLoop]: Abstraction has 395 states and 424 transitions. [2022-07-23 14:35:18,089 INFO L374 stractBuchiCegarLoop]: Abstraction has 395 states and 424 transitions. [2022-07-23 14:35:18,089 INFO L287 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2022-07-23 14:35:18,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 395 states and 424 transitions. [2022-07-23 14:35:18,091 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 151 [2022-07-23 14:35:18,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:18,091 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:18,093 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-23 14:35:18,093 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-23 14:35:18,093 INFO L752 eck$LassoCheckResult]: Stem: 35427#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 35417#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 35404#L59 assume !(0 == mp_add_~a3~0#1 % 256); 35405#L59-1 mp_add_~nb~0#1 := 4; 35683#L69 assume !(0 == mp_add_~b3~0#1 % 256); 35682#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 35681#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35680#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35679#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 35678#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35677#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35676#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35675#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35674#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 35673#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 35672#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 35671#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 35670#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35669#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 35668#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35667#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35666#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35665#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35664#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35663#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35662#L84 assume !(0 == mp_add_~i~0#1 % 256); 35661#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 35659#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35657#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35654#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 35652#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35650#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35648#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 35646#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35644#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35642#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35640#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35637#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35635#L84 assume !(0 == mp_add_~i~0#1 % 256); 35633#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35631#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 35628#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35615#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 35611#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35612#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35606#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35607#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 35599#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35600#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35591#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35592#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35583#L84 assume !(0 == mp_add_~i~0#1 % 256); 35584#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35575#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35576#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 35569#L83-1 [2022-07-23 14:35:18,094 INFO L754 eck$LassoCheckResult]: Loop: 35569#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 35570#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35716#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35715#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35713#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35711#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 35691#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35708#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35707#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35705#L84 assume !(0 == mp_add_~i~0#1 % 256); 35702#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35700#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35688#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35458#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 35459#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35452#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35453#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35561#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35605#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35597#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35598#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35590#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35585#L84 assume !(0 == mp_add_~i~0#1 % 256); 35586#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35577#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35578#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 35569#L83-1 [2022-07-23 14:35:18,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:18,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1143904857, now seen corresponding path program 1 times [2022-07-23 14:35:18,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:18,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758227779] [2022-07-23 14:35:18,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:18,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:18,174 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-23 14:35:18,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:18,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758227779] [2022-07-23 14:35:18,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758227779] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:18,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508310337] [2022-07-23 14:35:18,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:18,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:18,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:18,179 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:18,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-07-23 14:35:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:18,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-23 14:35:18,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:18,355 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-23 14:35:18,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:35:18,474 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-23 14:35:18,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508310337] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:35:18,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:35:18,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2022-07-23 14:35:18,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416174199] [2022-07-23 14:35:18,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:35:18,475 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:35:18,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:18,476 INFO L85 PathProgramCache]: Analyzing trace with hash -860927907, now seen corresponding path program 1 times [2022-07-23 14:35:18,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:18,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027218151] [2022-07-23 14:35:18,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:18,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:18,521 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-23 14:35:18,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:18,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027218151] [2022-07-23 14:35:18,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027218151] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:18,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815890375] [2022-07-23 14:35:18,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:18,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:18,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:18,527 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:18,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-07-23 14:35:18,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:18,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 14:35:18,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:18,603 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-23 14:35:18,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:35:18,649 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-23 14:35:18,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815890375] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:35:18,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:35:18,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-07-23 14:35:18,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083127702] [2022-07-23 14:35:18,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:35:18,650 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 14:35:18,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:18,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 14:35:18,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-07-23 14:35:18,650 INFO L87 Difference]: Start difference. First operand 395 states and 424 transitions. cyclomatic complexity: 34 Second operand has 13 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:19,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:19,063 INFO L93 Difference]: Finished difference Result 507 states and 540 transitions. [2022-07-23 14:35:19,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 14:35:19,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 507 states and 540 transitions. [2022-07-23 14:35:19,066 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 78 [2022-07-23 14:35:19,068 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 507 states to 505 states and 532 transitions. [2022-07-23 14:35:19,068 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 505 [2022-07-23 14:35:19,068 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 505 [2022-07-23 14:35:19,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 505 states and 532 transitions. [2022-07-23 14:35:19,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:19,069 INFO L369 hiAutomatonCegarLoop]: Abstraction has 505 states and 532 transitions. [2022-07-23 14:35:19,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states and 532 transitions. [2022-07-23 14:35:19,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 404. [2022-07-23 14:35:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 404 states have (on average 1.0445544554455446) internal successors, (422), 403 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 422 transitions. [2022-07-23 14:35:19,074 INFO L392 hiAutomatonCegarLoop]: Abstraction has 404 states and 422 transitions. [2022-07-23 14:35:19,074 INFO L374 stractBuchiCegarLoop]: Abstraction has 404 states and 422 transitions. [2022-07-23 14:35:19,074 INFO L287 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2022-07-23 14:35:19,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 404 states and 422 transitions. [2022-07-23 14:35:19,076 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 50 [2022-07-23 14:35:19,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:19,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:19,079 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-23 14:35:19,080 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:19,080 INFO L752 eck$LassoCheckResult]: Stem: 36848#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 36838#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 36824#L59 assume !(0 == mp_add_~a3~0#1 % 256); 36825#L59-1 mp_add_~nb~0#1 := 4; 37105#L69 assume !(0 == mp_add_~b3~0#1 % 256); 37104#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 37103#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 37102#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37101#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 37100#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 37099#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 37098#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 37097#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 37096#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 37095#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 37094#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 37093#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 37092#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 37091#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 37090#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37089#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37088#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37087#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37086#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 37085#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37084#L84 assume !(0 == mp_add_~i~0#1 % 256); 37083#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 37082#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 37080#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 37077#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 37072#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 37073#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37064#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 37065#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37058#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37059#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37052#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 37053#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37045#L84 assume !(0 == mp_add_~i~0#1 % 256); 37046#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 37039#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 37040#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 37035#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 37034#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 37033#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37032#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37031#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 37030#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37029#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37028#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 37027#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37026#L84 assume !(0 == mp_add_~i~0#1 % 256); 37025#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 37024#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 37023#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 37022#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 37021#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 37020#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37019#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37018#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37017#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 37016#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37015#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 37014#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37013#L84 assume !(0 == mp_add_~i~0#1 % 256); 37012#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 37011#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 37010#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 37009#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 37008#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 37007#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37006#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37005#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37004#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37003#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37002#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 37001#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 37000#L84 assume !(0 == mp_add_~i~0#1 % 256); 36999#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 36998#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 36997#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 36987#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 36988#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 37222#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37220#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37218#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37216#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37214#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37212#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 36880#L83 [2022-07-23 14:35:19,080 INFO L754 eck$LassoCheckResult]: Loop: 36880#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 36881#L84 assume !(0 == mp_add_~i~0#1 % 256); 37227#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 37226#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 37225#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 37224#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 37223#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 37221#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 37219#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37217#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37215#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37213#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37211#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 36880#L83 [2022-07-23 14:35:19,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:19,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1357058734, now seen corresponding path program 1 times [2022-07-23 14:35:19,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:19,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143202693] [2022-07-23 14:35:19,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:19,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:19,169 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-23 14:35:19,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:19,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143202693] [2022-07-23 14:35:19,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143202693] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:19,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703405313] [2022-07-23 14:35:19,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:19,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:19,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:19,177 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:19,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-07-23 14:35:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:19,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 14:35:19,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:19,411 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 88 proven. 4 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-23 14:35:19,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:35:19,542 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 92 proven. 3 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2022-07-23 14:35:19,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703405313] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:35:19,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:35:19,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 12 [2022-07-23 14:35:19,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566246434] [2022-07-23 14:35:19,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:35:19,543 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:35:19,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:19,544 INFO L85 PathProgramCache]: Analyzing trace with hash -550141162, now seen corresponding path program 1 times [2022-07-23 14:35:19,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:19,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562613954] [2022-07-23 14:35:19,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:19,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:19,548 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:19,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:19,663 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:35:19,663 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:35:19,663 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:35:19,663 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:35:19,663 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-23 14:35:19,663 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:19,663 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:35:19,663 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:35:19,663 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration24_Loop [2022-07-23 14:35:19,663 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:35:19,663 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:35:19,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:20,217 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:35:20,217 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-23 14:35:20,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:20,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:20,224 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-23 14:35:20,232 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 14:35:20,232 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 14:35:20,250 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-23 14:35:20,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:20,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:20,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:20,435 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-23 14:35:20,436 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-23 14:35:20,437 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-23 14:35:20,437 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 14:35:20,541 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-23 14:35:20,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Ended with exit code 0 [2022-07-23 14:35:20,545 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:35:20,545 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:35:20,546 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:35:20,546 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:35:20,546 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:35:20,546 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:20,546 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:35:20,546 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:35:20,546 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration24_Loop [2022-07-23 14:35:20,546 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:35:20,546 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:35:20,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:21,104 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:35:21,105 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:35:21,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:21,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:21,107 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-23 14:35:21,108 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-23 14:35:21,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:21,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:21,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:21,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:21,115 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:35:21,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:35:21,125 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:21,126 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:21,143 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:21,167 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-23 14:35:21,167 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-23 14:35:21,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:21,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:21,169 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-23 14:35:21,176 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:21,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:21,183 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:21,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:21,183 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:35:21,183 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:21,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:35:21,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:21,207 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-23 14:35:21,209 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:21,232 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-23 14:35:21,232 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-23 14:35:21,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:21,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:21,233 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-23 14:35:21,240 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:21,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:21,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:21,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:21,247 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:35:21,247 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:21,261 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-23 14:35:21,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:21,268 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-23 14:35:21,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:21,314 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-23 14:35:21,315 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-23 14:35:21,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:21,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:21,316 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-23 14:35:21,319 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-23 14:35:21,320 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:21,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:21,327 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:21,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:21,328 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:35:21,328 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:21,344 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2022-07-23 14:35:21,344 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:21,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:21,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:21,397 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-23 14:35:21,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:21,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:21,400 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-23 14:35:21,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:21,410 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:21,410 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:21,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:21,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:21,411 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:35:21,411 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:21,422 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:35:21,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:21,431 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-23 14:35:21,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:21,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (58)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:21,470 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-23 14:35:21,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:21,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:21,471 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-23 14:35:21,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:21,483 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:21,483 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-23 14:35:21,483 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:21,484 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:21,484 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:35:21,484 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:21,496 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-23 14:35:21,501 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-23 14:35:21,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:21,538 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:21,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Ended with exit code 0 [2022-07-23 14:35:21,557 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-23 14:35:21,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:21,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:21,558 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-23 14:35:21,559 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-23 14:35:21,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:21,566 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:21,567 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:21,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:21,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:21,567 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:35:21,567 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:21,585 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2022-07-23 14:35:21,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:21,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:21,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-07-23 14:35:21,639 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-23 14:35:21,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:21,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:21,640 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-23 14:35:21,641 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-23 14:35:21,642 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:21,648 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:21,648 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:21,648 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:21,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:21,648 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:35:21,648 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:21,659 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-23 14:35:21,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:21,675 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:21,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Ended with exit code 0 [2022-07-23 14:35:21,691 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-23 14:35:21,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:21,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:21,693 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:21,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-07-23 14:35:21,696 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:21,704 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:21,704 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:21,704 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:21,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:21,704 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:35:21,704 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-23 14:35:21,725 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-23 14:35:21,725 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:21,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:21,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Ended with exit code 0 [2022-07-23 14:35:21,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:21,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 14:35:21,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2022-07-23 14:35:21,780 INFO L87 Difference]: Start difference. First operand 404 states and 422 transitions. cyclomatic complexity: 22 Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:21,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:21,897 INFO L93 Difference]: Finished difference Result 350 states and 364 transitions. [2022-07-23 14:35:21,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 14:35:21,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 350 states and 364 transitions. [2022-07-23 14:35:21,930 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 43 [2022-07-23 14:35:21,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 350 states to 350 states and 364 transitions. [2022-07-23 14:35:21,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350 [2022-07-23 14:35:21,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 350 [2022-07-23 14:35:21,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 350 states and 364 transitions. [2022-07-23 14:35:21,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:21,932 INFO L369 hiAutomatonCegarLoop]: Abstraction has 350 states and 364 transitions. [2022-07-23 14:35:21,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states and 364 transitions. [2022-07-23 14:35:21,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 331. [2022-07-23 14:35:21,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 331 states have (on average 1.042296072507553) internal successors, (345), 330 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 345 transitions. [2022-07-23 14:35:21,939 INFO L392 hiAutomatonCegarLoop]: Abstraction has 331 states and 345 transitions. [2022-07-23 14:35:21,939 INFO L374 stractBuchiCegarLoop]: Abstraction has 331 states and 345 transitions. [2022-07-23 14:35:21,939 INFO L287 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2022-07-23 14:35:21,939 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 331 states and 345 transitions. [2022-07-23 14:35:21,940 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2022-07-23 14:35:21,940 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:21,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:21,941 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:21,941 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:21,942 INFO L752 eck$LassoCheckResult]: Stem: 38149#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 38137#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 38128#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 38130#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 38132#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 38133#L59-1 mp_add_~nb~0#1 := 4; 38281#L69 assume !(0 == mp_add_~b3~0#1 % 256); 38280#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 38279#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38278#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 38277#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 38276#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 38275#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 38274#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 38273#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38272#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 38271#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 38270#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 38269#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38268#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 38267#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 38266#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38265#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38264#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38263#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38262#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38261#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 38260#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38259#L90 assume !(0 == mp_add_~i~0#1 % 256); 38258#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 38257#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 38256#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38255#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 38254#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38253#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 38252#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38251#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38250#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38249#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38248#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 38247#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38246#L90 assume !(0 == mp_add_~i~0#1 % 256); 38245#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 38244#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 38243#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38242#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 38241#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38240#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38239#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 38238#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38237#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38236#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38235#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 38234#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38233#L90 assume !(0 == mp_add_~i~0#1 % 256); 38232#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 38231#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 38230#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 38229#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 38228#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38227#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38226#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38225#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 38224#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38223#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38222#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 38221#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38220#L90 assume !(0 == mp_add_~i~0#1 % 256); 38219#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 38218#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 38217#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38216#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 38215#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38214#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38213#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38212#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38211#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38210#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38209#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 38208#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38207#L90 assume !(0 == mp_add_~i~0#1 % 256); 38206#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 38205#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 38204#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38203#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 38202#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38201#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38200#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38199#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38198#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38197#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38164#L83 [2022-07-23 14:35:21,942 INFO L754 eck$LassoCheckResult]: Loop: 38164#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 38196#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38195#L90 assume !(0 == mp_add_~i~0#1 % 256); 38194#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 38192#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 38189#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38188#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 38187#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38186#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38185#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38184#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38183#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38163#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38164#L83 [2022-07-23 14:35:21,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:21,943 INFO L85 PathProgramCache]: Analyzing trace with hash 346319115, now seen corresponding path program 1 times [2022-07-23 14:35:21,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:21,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23132521] [2022-07-23 14:35:21,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:21,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:21,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:22,074 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 100 proven. 90 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-23 14:35:22,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:22,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23132521] [2022-07-23 14:35:22,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23132521] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:22,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32470352] [2022-07-23 14:35:22,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:22,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:22,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:22,080 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-23 14:35:22,081 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-23 14:35:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:22,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 14:35:22,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:22,785 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 96 proven. 20 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-23 14:35:22,786 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:35:26,993 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 88 proven. 28 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-23 14:35:26,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32470352] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:35:26,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:35:26,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2022-07-23 14:35:26,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414332098] [2022-07-23 14:35:26,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:35:26,994 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:35:26,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:26,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1677168882, now seen corresponding path program 1 times [2022-07-23 14:35:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:26,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269881218] [2022-07-23 14:35:26,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:26,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:27,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:27,000 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:27,005 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:27,116 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:35:27,116 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:35:27,116 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:35:27,116 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:35:27,116 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-23 14:35:27,116 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:27,116 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:35:27,116 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:35:27,116 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration25_Loop [2022-07-23 14:35:27,116 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:35:27,116 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:35:27,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-23 14:35:27,580 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:35:27,580 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-23 14:35:27,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:27,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:27,588 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:27,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-07-23 14:35:27,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 14:35:27,590 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 14:35:27,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:27,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:27,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:27,778 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:27,784 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-23 14:35:27,784 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 14:35:27,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-07-23 14:35:27,873 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-23 14:35:27,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Ended with exit code 0 [2022-07-23 14:35:27,877 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:35:27,878 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:35:27,878 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:35:27,878 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:35:27,878 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:35:27,878 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:27,878 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:35:27,878 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:35:27,878 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration25_Loop [2022-07-23 14:35:27,878 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:35:27,878 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:35:27,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:28,446 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:35:28,446 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:35:28,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:28,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:28,452 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:28,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-07-23 14:35:28,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-23 14:35:28,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:28,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:28,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:28,461 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:35:28,461 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:35:28,468 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:28,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:28,487 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:28,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:28,512 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-23 14:35:28,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:28,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:28,513 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:28,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-07-23 14:35:28,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:28,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:28,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:28,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:28,523 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:35:28,523 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:28,531 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:35:28,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:28,545 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:28,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Ended with exit code 0 [2022-07-23 14:35:28,562 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-23 14:35:28,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:28,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:28,563 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:28,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-07-23 14:35:28,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:28,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:28,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:28,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:28,572 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:35:28,572 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:28,583 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-23 14:35:28,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:28,594 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:28,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-07-23 14:35:28,611 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-23 14:35:28,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:28,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:28,612 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:28,620 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:28,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-07-23 14:35:28,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:28,627 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:28,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:28,628 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:35:28,628 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:28,640 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2022-07-23 14:35:28,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:28,655 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:28,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:28,671 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-23 14:35:28,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:28,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:28,672 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:28,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-07-23 14:35:28,680 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:28,688 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:28,688 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:28,688 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:28,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:28,688 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:35:28,688 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:28,707 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:35:28,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:28,729 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:28,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Ended with exit code 0 [2022-07-23 14:35:28,745 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-23 14:35:28,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:28,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:28,746 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:28,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-07-23 14:35:28,748 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:28,756 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:28,756 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-23 14:35:28,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:28,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:28,757 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:35:28,757 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:28,769 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-23 14:35:28,769 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:28,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:28,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2022-07-23 14:35:28,817 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-23 14:35:28,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:28,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:28,818 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:28,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-07-23 14:35:28,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:28,827 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:28,828 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:28,828 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:28,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:28,828 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:35:28,828 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:28,844 INFO L401 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2022-07-23 14:35:28,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:28,879 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:28,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2022-07-23 14:35:28,896 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-23 14:35:28,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:28,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:28,897 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:28,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-07-23 14:35:28,899 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:28,905 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:28,905 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:28,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:28,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:28,905 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:35:28,906 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:28,916 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2022-07-23 14:35:28,916 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:28,932 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:28,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Ended with exit code 0 [2022-07-23 14:35:28,948 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-23 14:35:28,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:28,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:28,949 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:28,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-07-23 14:35:28,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:28,958 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:28,958 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:28,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:28,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:28,959 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 14:35:28,959 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-23 14:35:28,978 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2022-07-23 14:35:28,979 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:29,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:29,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2022-07-23 14:35:29,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:29,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-23 14:35:29,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-07-23 14:35:29,024 INFO L87 Difference]: Start difference. First operand 331 states and 345 transitions. cyclomatic complexity: 17 Second operand has 17 states, 17 states have (on average 8.588235294117647) internal successors, (146), 17 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:29,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:29,793 INFO L93 Difference]: Finished difference Result 281 states and 286 transitions. [2022-07-23 14:35:29,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 14:35:29,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 281 states and 286 transitions. [2022-07-23 14:35:29,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-23 14:35:29,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 281 states to 214 states and 219 transitions. [2022-07-23 14:35:29,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2022-07-23 14:35:29,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2022-07-23 14:35:29,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 219 transitions. [2022-07-23 14:35:29,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:29,796 INFO L369 hiAutomatonCegarLoop]: Abstraction has 214 states and 219 transitions. [2022-07-23 14:35:29,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states and 219 transitions. [2022-07-23 14:35:29,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 183. [2022-07-23 14:35:29,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 183 states have (on average 1.0273224043715847) internal successors, (188), 182 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:29,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 188 transitions. [2022-07-23 14:35:29,799 INFO L392 hiAutomatonCegarLoop]: Abstraction has 183 states and 188 transitions. [2022-07-23 14:35:29,799 INFO L374 stractBuchiCegarLoop]: Abstraction has 183 states and 188 transitions. [2022-07-23 14:35:29,800 INFO L287 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2022-07-23 14:35:29,800 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 183 states and 188 transitions. [2022-07-23 14:35:29,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-23 14:35:29,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:29,800 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:29,801 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:29,801 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:29,801 INFO L752 eck$LassoCheckResult]: Stem: 39337#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 39328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 39315#L59 assume !(0 == mp_add_~a3~0#1 % 256); 39316#L59-1 mp_add_~nb~0#1 := 4; 39333#L69 assume !(0 == mp_add_~b3~0#1 % 256); 39334#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 39398#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39399#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39394#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 39395#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39390#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39391#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39386#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 39387#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 39382#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 39383#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 39378#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 39379#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 39374#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 39375#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39370#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39371#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39366#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39367#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39362#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39363#L84 assume !(0 == mp_add_~i~0#1 % 256); 39358#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 39359#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39354#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39355#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 39350#L90 assume !(0 == mp_add_~i~0#1 % 256); 39351#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 39446#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 39444#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 39442#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 39440#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39438#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 39436#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39434#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39432#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39430#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39428#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 39402#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 39491#L90 assume !(0 == mp_add_~i~0#1 % 256); 39490#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 39489#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 39487#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 39485#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 39483#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39481#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39478#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 39477#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39476#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39475#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39403#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 39384#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 39385#L90 assume !(0 == mp_add_~i~0#1 % 256); 39347#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 39321#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 39322#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 39323#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 39497#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39496#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39495#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39341#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 39342#L102-1 [2022-07-23 14:35:29,801 INFO L754 eck$LassoCheckResult]: Loop: 39342#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39338#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39339#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39335#L84 assume !(0 == mp_add_~i~0#1 % 256); 39336#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39340#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39329#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39330#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 39324#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 39325#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39332#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39326#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39327#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39342#L102-1 [2022-07-23 14:35:29,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:29,802 INFO L85 PathProgramCache]: Analyzing trace with hash -511302633, now seen corresponding path program 1 times [2022-07-23 14:35:29,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:29,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186412920] [2022-07-23 14:35:29,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:29,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:29,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 45 proven. 28 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-23 14:35:29,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:29,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186412920] [2022-07-23 14:35:29,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186412920] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:29,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470837711] [2022-07-23 14:35:29,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:29,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:29,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:29,876 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:29,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2022-07-23 14:35:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:30,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 14:35:30,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-23 14:35:30,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:35:30,389 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 61 proven. 10 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-23 14:35:30,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470837711] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:35:30,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:35:30,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 6] total 12 [2022-07-23 14:35:30,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358251116] [2022-07-23 14:35:30,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:35:30,391 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 14:35:30,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:30,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1466073576, now seen corresponding path program 2 times [2022-07-23 14:35:30,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:30,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044067622] [2022-07-23 14:35:30,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:30,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:30,400 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:30,404 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:30,488 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:35:30,488 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:35:30,488 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:35:30,488 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:35:30,488 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-23 14:35:30,488 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:30,488 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:35:30,488 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:35:30,488 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration26_Loop [2022-07-23 14:35:30,488 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:35:30,488 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:35:30,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:30,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:30,649 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:35:30,649 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-23 14:35:30,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:30,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:30,652 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:30,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-07-23 14:35:30,653 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 14:35:30,654 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 14:35:30,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2022-07-23 14:35:30,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:30,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:30,703 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:30,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-07-23 14:35:30,705 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-23 14:35:30,705 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 14:35:31,249 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-23 14:35:31,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:31,254 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:35:31,254 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:35:31,254 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:35:31,254 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:35:31,254 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:35:31,254 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:31,254 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:35:31,254 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:35:31,254 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration26_Loop [2022-07-23 14:35:31,254 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:35:31,254 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:35:31,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:31,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:31,440 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:35:31,441 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:35:31,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:31,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:31,442 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:31,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-07-23 14:35:31,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:31,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:31,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:31,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:31,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:31,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:35:31,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:35:31,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:31,454 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:31,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:31,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:31,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:31,470 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:31,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Waiting until timeout for monitored process [2022-07-23 14:35:31,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:31,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:31,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:31,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:31,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:31,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:35:31,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:35:31,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:31,480 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:31,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (79)] Ended with exit code 0 [2022-07-23 14:35:31,497 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-23 14:35:31,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:31,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:31,498 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:31,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Waiting until timeout for monitored process [2022-07-23 14:35:31,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:31,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:31,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:31,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:31,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:31,505 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:31,507 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:31,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:31,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:31,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (80)] Ended with exit code 0 [2022-07-23 14:35:31,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:31,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:31,527 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:31,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Waiting until timeout for monitored process [2022-07-23 14:35:31,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:31,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:31,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:31,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:31,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:31,535 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:31,537 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:31,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:31,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:31,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:31,575 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-23 14:35:31,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:31,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:31,576 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:31,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:31,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:31,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:31,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:31,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:31,586 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:31,590 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:31,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:31,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Waiting until timeout for monitored process [2022-07-23 14:35:31,602 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:31,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (82)] Ended with exit code 0 [2022-07-23 14:35:31,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:31,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:31,621 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:31,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Waiting until timeout for monitored process [2022-07-23 14:35:31,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-23 14:35:31,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:31,631 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:31,631 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:31,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:31,631 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:31,632 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:31,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:31,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:31,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (83)] Ended with exit code 0 [2022-07-23 14:35:31,650 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-23 14:35:31,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:31,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:31,651 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:31,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Waiting until timeout for monitored process [2022-07-23 14:35:31,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:31,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:31,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:31,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:31,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:31,660 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:31,664 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:31,664 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:31,669 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:31,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2022-07-23 14:35:31,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:31,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:31,686 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:31,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Waiting until timeout for monitored process [2022-07-23 14:35:31,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:31,693 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:31,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:31,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:31,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:31,694 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:31,696 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:31,696 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:31,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:31,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:31,715 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-23 14:35:31,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:31,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:31,716 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:31,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Waiting until timeout for monitored process [2022-07-23 14:35:31,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:31,724 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:31,724 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:31,724 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:31,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:31,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:31,724 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:31,727 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:31,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:31,732 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:31,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (86)] Ended with exit code 0 [2022-07-23 14:35:31,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:31,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:31,749 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:31,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Waiting until timeout for monitored process [2022-07-23 14:35:31,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:31,756 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:31,757 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:31,757 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:31,757 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:31,757 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:31,757 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:31,759 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:31,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:31,765 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:31,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:31,780 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-23 14:35:31,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:31,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:31,781 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:31,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Waiting until timeout for monitored process [2022-07-23 14:35:31,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:31,790 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:31,790 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-23 14:35:31,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:31,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:31,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:31,790 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:31,794 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:31,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:31,804 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:31,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2022-07-23 14:35:31,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:31,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:31,821 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:31,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Waiting until timeout for monitored process [2022-07-23 14:35:31,823 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:31,828 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:31,829 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-23 14:35:31,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:31,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:31,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:31,829 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:31,831 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:31,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:31,835 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:31,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Ended with exit code 0 [2022-07-23 14:35:31,851 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-23 14:35:31,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:31,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:31,853 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:31,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Waiting until timeout for monitored process [2022-07-23 14:35:31,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:31,861 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:31,861 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:31,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:31,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:31,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:31,861 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:31,866 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:31,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:31,884 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:31,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:31,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:31,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:31,901 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:31,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Waiting until timeout for monitored process [2022-07-23 14:35:31,903 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:31,909 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:31,909 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:31,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:31,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:31,910 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:31,910 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:31,912 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:31,912 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:31,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:31,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2022-07-23 14:35:31,934 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-23 14:35:31,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:31,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:31,935 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:31,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Waiting until timeout for monitored process [2022-07-23 14:35:31,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:31,942 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:31,942 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:31,942 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:31,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:31,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:31,943 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:31,946 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:31,946 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:31,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:31,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2022-07-23 14:35:31,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:31,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:31,969 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:31,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Waiting until timeout for monitored process [2022-07-23 14:35:31,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:31,976 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:31,976 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:31,976 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:31,976 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:31,976 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:31,976 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:31,978 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:31,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:31,981 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:31,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Ended with exit code 0 [2022-07-23 14:35:31,997 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-23 14:35:31,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:31,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:31,998 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:31,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Waiting until timeout for monitored process [2022-07-23 14:35:32,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:32,006 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:32,006 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:32,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:32,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:32,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:32,006 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-23 14:35:32,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:35:32,011 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:32,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:32,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2022-07-23 14:35:32,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:32,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:32,036 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:32,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Waiting until timeout for monitored process [2022-07-23 14:35:32,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-23 14:35:32,043 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:32,043 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:32,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:32,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:32,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:32,044 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-23 14:35:32,046 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:35:32,046 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:32,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:32,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Ended with exit code 0 [2022-07-23 14:35:32,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:32,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 14:35:32,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-23 14:35:32,068 INFO L87 Difference]: Start difference. First operand 183 states and 188 transitions. cyclomatic complexity: 6 Second operand has 12 states, 12 states have (on average 9.75) internal successors, (117), 12 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:32,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:32,368 INFO L93 Difference]: Finished difference Result 247 states and 248 transitions. [2022-07-23 14:35:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-23 14:35:32,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 247 states and 248 transitions. [2022-07-23 14:35:32,369 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2022-07-23 14:35:32,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 247 states to 165 states and 166 transitions. [2022-07-23 14:35:32,370 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 165 [2022-07-23 14:35:32,370 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 165 [2022-07-23 14:35:32,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 165 states and 166 transitions. [2022-07-23 14:35:32,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:32,371 INFO L369 hiAutomatonCegarLoop]: Abstraction has 165 states and 166 transitions. [2022-07-23 14:35:32,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states and 166 transitions. [2022-07-23 14:35:32,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 123. [2022-07-23 14:35:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.008130081300813) internal successors, (124), 122 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:32,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2022-07-23 14:35:32,373 INFO L392 hiAutomatonCegarLoop]: Abstraction has 123 states and 124 transitions. [2022-07-23 14:35:32,374 INFO L374 stractBuchiCegarLoop]: Abstraction has 123 states and 124 transitions. [2022-07-23 14:35:32,374 INFO L287 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2022-07-23 14:35:32,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 124 transitions. [2022-07-23 14:35:32,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-07-23 14:35:32,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 14:35:32,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 14:35:32,396 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:32,396 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 14:35:32,397 INFO L752 eck$LassoCheckResult]: Stem: 40175#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 40166#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~a~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~b~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1, mp_add_#t~nondet2#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 40159#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 40160#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 40162#L63 assume !(0 == mp_add_~a1~0#1 % 256); 40163#L59-1 mp_add_~nb~0#1 := 4; 40171#L69 assume !(0 == mp_add_~b3~0#1 % 256); 40172#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 40228#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40229#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 40224#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 40225#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 40220#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 40221#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 40216#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 40217#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 40212#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 40213#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 40208#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 40209#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 40204#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 40205#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 40200#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 40201#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 40196#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 40197#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40192#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 40193#L84 assume !(0 == mp_add_~i~0#1 % 256); 40188#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 40189#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 40263#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 40262#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 40261#L90 assume !(0 == mp_add_~i~0#1 % 256); 40260#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 40259#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 40258#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 40257#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 40256#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 40255#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 40253#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 40254#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 40273#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 40272#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40184#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 40185#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 40270#L90 assume !(0 == mp_add_~i~0#1 % 256); 40269#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 40268#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 40267#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 40266#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 40265#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 40264#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 40252#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 40251#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 40183#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 40176#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40177#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 40271#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 40181#L90 assume !(0 == mp_add_~i~0#1 % 256); 40182#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 40154#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 40155#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 40156#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 40276#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 40275#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 40274#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 40179#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 40180#L102-1 [2022-07-23 14:35:32,397 INFO L754 eck$LassoCheckResult]: Loop: 40180#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 40231#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40230#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 40173#L84 assume !(0 == mp_add_~i~0#1 % 256); 40174#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 40178#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 40167#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 40168#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 40157#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 40158#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 40170#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 40164#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 40165#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 40180#L102-1 [2022-07-23 14:35:32,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:32,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1379271090, now seen corresponding path program 1 times [2022-07-23 14:35:32,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:32,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529677818] [2022-07-23 14:35:32,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:32,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:32,428 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:32,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:32,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:32,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1466073576, now seen corresponding path program 3 times [2022-07-23 14:35:32,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:32,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352734033] [2022-07-23 14:35:32,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:32,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:32,470 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 14:35:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 14:35:32,473 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 14:35:32,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 14:35:32,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1731585259, now seen corresponding path program 1 times [2022-07-23 14:35:32,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 14:35:32,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42164956] [2022-07-23 14:35:32,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:32,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 14:35:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:32,571 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 86 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-23 14:35:32,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 14:35:32,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42164956] [2022-07-23 14:35:32,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42164956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 14:35:32,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201758645] [2022-07-23 14:35:32,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 14:35:32,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 14:35:32,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:32,573 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 14:35:32,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2022-07-23 14:35:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 14:35:32,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 14:35:32,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 14:35:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 95 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-23 14:35:32,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 14:35:32,978 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 87 proven. 14 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-23 14:35:32,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201758645] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 14:35:32,978 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 14:35:32,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-07-23 14:35:32,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930113409] [2022-07-23 14:35:32,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 14:35:33,059 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:35:33,059 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:35:33,059 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:35:33,059 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:35:33,059 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-23 14:35:33,059 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:33,059 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:35:33,059 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:35:33,059 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration27_Loop [2022-07-23 14:35:33,059 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:35:33,059 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:35:33,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:33,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:33,259 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:35:33,259 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-23 14:35:33,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:33,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:33,260 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:33,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Waiting until timeout for monitored process [2022-07-23 14:35:33,262 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 14:35:33,262 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 14:35:33,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Ended with exit code 0 [2022-07-23 14:35:33,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:33,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:33,302 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:33,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Waiting until timeout for monitored process [2022-07-23 14:35:33,304 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-23 14:35:33,304 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 14:35:34,208 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-23 14:35:34,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:34,212 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 14:35:34,212 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 14:35:34,212 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 14:35:34,212 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 14:35:34,212 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 14:35:34,212 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:34,212 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 14:35:34,212 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 14:35:34,212 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_2-2.i_Iteration27_Loop [2022-07-23 14:35:34,212 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 14:35:34,213 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 14:35:34,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:34,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 14:35:34,408 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 14:35:34,408 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 14:35:34,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:34,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:34,410 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:34,420 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:34,426 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:34,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:34,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:34,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:34,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:35:34,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Waiting until timeout for monitored process [2022-07-23 14:35:34,429 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:35:34,429 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:34,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:34,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:34,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:34,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:34,447 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:34,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Waiting until timeout for monitored process [2022-07-23 14:35:34,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:34,463 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:34,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:34,463 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:34,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:34,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 14:35:34,464 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 14:35:34,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:34,465 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:34,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:34,483 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-07-23 14:35:34,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:34,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:34,484 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:34,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2022-07-23 14:35:34,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:34,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:34,492 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:34,492 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:34,492 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:34,492 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:34,494 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:34,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:34,497 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:34,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:34,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:34,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:34,514 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:34,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Waiting until timeout for monitored process [2022-07-23 14:35:34,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-23 14:35:34,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:34,522 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:34,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:34,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:34,523 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:34,524 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:34,524 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:34,526 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:34,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:34,542 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-07-23 14:35:34,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:34,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:34,543 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:34,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Waiting until timeout for monitored process [2022-07-23 14:35:34,545 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:34,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:34,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:34,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:34,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:34,551 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:34,554 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:34,554 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:34,558 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:34,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2022-07-23 14:35:34,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:34,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:34,575 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:34,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2022-07-23 14:35:34,577 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:34,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:34,583 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:34,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:34,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:34,583 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:34,584 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:34,585 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:34,587 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:34,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2022-07-23 14:35:34,602 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-07-23 14:35:34,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:34,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:34,603 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:34,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Waiting until timeout for monitored process [2022-07-23 14:35:34,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:34,612 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:34,612 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:34,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:34,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:34,612 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:34,617 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:34,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:34,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:34,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (105)] Ended with exit code 0 [2022-07-23 14:35:34,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:34,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:34,640 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:34,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Waiting until timeout for monitored process [2022-07-23 14:35:34,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:34,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 14:35:34,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:34,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:34,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:34,652 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:34,654 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:34,654 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:34,657 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:34,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:34,673 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-07-23 14:35:34,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:34,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:34,674 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:34,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Waiting until timeout for monitored process [2022-07-23 14:35:34,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:34,682 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:34,682 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:34,682 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:34,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:34,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:34,682 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:34,685 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:34,685 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:34,690 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:34,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:34,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:34,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:34,707 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:34,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Waiting until timeout for monitored process [2022-07-23 14:35:34,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:34,714 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:34,714 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:34,715 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:34,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:34,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:34,715 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-07-23 14:35:34,716 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-07-23 14:35:34,716 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:34,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:34,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (108)] Ended with exit code 0 [2022-07-23 14:35:34,735 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-07-23 14:35:34,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:34,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:34,736 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:34,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Waiting until timeout for monitored process [2022-07-23 14:35:34,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:34,744 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:34,744 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-23 14:35:34,744 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:34,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:34,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:34,745 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:34,748 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:34,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:34,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:34,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Ended with exit code 0 [2022-07-23 14:35:34,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:34,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:34,773 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:34,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Waiting until timeout for monitored process [2022-07-23 14:35:34,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:34,781 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:34,781 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-07-23 14:35:34,781 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:34,781 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:34,781 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:34,781 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:34,783 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:34,783 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:34,788 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:34,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (110)] Ended with exit code 0 [2022-07-23 14:35:34,803 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-07-23 14:35:34,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:34,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:34,805 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:34,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Waiting until timeout for monitored process [2022-07-23 14:35:34,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:34,813 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:34,813 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:34,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:34,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:34,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:34,814 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:34,819 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:34,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:34,831 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:34,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Ended with exit code 0 [2022-07-23 14:35:34,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:34,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:34,848 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:34,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Waiting until timeout for monitored process [2022-07-23 14:35:34,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:34,857 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:34,857 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:34,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:34,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:34,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:34,857 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-07-23 14:35:34,860 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-07-23 14:35:34,860 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:34,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:34,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (112)] Ended with exit code 0 [2022-07-23 14:35:34,883 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-07-23 14:35:34,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:34,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:34,884 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:34,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Waiting until timeout for monitored process [2022-07-23 14:35:34,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:34,892 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:34,892 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:34,892 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:34,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:34,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:34,893 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:34,896 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:34,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:34,901 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:34,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:34,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:34,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:34,918 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:34,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Waiting until timeout for monitored process [2022-07-23 14:35:34,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:34,926 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:34,926 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-07-23 14:35:34,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:34,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:34,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:34,926 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-07-23 14:35:34,928 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 14:35:34,928 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:34,931 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:34,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Ended with exit code 0 [2022-07-23 14:35:34,947 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-07-23 14:35:34,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:34,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:34,948 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:34,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Waiting until timeout for monitored process [2022-07-23 14:35:34,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:34,957 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:34,957 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:34,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:34,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:34,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:34,957 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-23 14:35:34,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:35:34,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:34,983 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:35,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Ended with exit code 0 [2022-07-23 14:35:35,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 14:35:35,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 14:35:35,003 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-23 14:35:35,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Waiting until timeout for monitored process [2022-07-23 14:35:35,005 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-23 14:35:35,011 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-07-23 14:35:35,011 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-07-23 14:35:35,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 14:35:35,011 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 14:35:35,011 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 14:35:35,011 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-07-23 14:35:35,014 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-23 14:35:35,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 14:35:35,019 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 14:35:35,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Ended with exit code 0 [2022-07-23 14:35:35,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 14:35:35,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 14:35:35,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-07-23 14:35:35,036 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. cyclomatic complexity: 2 Second operand has 15 states, 15 states have (on average 7.6) internal successors, (114), 15 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 14:35:35,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 14:35:35,419 INFO L93 Difference]: Finished difference Result 139 states and 138 transitions. [2022-07-23 14:35:35,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-23 14:35:35,419 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 138 transitions. [2022-07-23 14:35:35,420 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 14:35:35,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 0 states and 0 transitions. [2022-07-23 14:35:35,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-23 14:35:35,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-23 14:35:35,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-23 14:35:35,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 14:35:35,421 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:35:35,421 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:35:35,421 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 14:35:35,421 INFO L287 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2022-07-23 14:35:35,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-23 14:35:35,421 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 14:35:35,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-23 14:35:35,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.07 02:35:35 BoogieIcfgContainer [2022-07-23 14:35:35,428 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-23 14:35:35,428 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 14:35:35,428 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 14:35:35,429 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 14:35:35,429 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 02:35:01" (3/4) ... [2022-07-23 14:35:35,431 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 14:35:35,431 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 14:35:35,432 INFO L158 Benchmark]: Toolchain (without parser) took 35312.08ms. Allocated memory was 94.4MB in the beginning and 211.8MB in the end (delta: 117.4MB). Free memory was 66.1MB in the beginning and 93.4MB in the end (delta: -27.2MB). Peak memory consumption was 89.1MB. Max. memory is 16.1GB. [2022-07-23 14:35:35,432 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 75.5MB. Free memory is still 36.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:35:35,432 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.72ms. Allocated memory is still 94.4MB. Free memory was 65.9MB in the beginning and 68.4MB in the end (delta: -2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 14:35:35,433 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.00ms. Allocated memory is still 94.4MB. Free memory was 68.4MB in the beginning and 60.4MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-23 14:35:35,433 INFO L158 Benchmark]: Boogie Preprocessor took 88.32ms. Allocated memory is still 94.4MB. Free memory was 60.4MB in the beginning and 55.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-23 14:35:35,433 INFO L158 Benchmark]: RCFGBuilder took 662.61ms. Allocated memory is still 94.4MB. Free memory was 55.8MB in the beginning and 51.1MB in the end (delta: 4.6MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2022-07-23 14:35:35,434 INFO L158 Benchmark]: BuchiAutomizer took 34219.50ms. Allocated memory was 94.4MB in the beginning and 211.8MB in the end (delta: 117.4MB). Free memory was 51.1MB in the beginning and 93.4MB in the end (delta: -42.3MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. [2022-07-23 14:35:35,434 INFO L158 Benchmark]: Witness Printer took 3.13ms. Allocated memory is still 211.8MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 14:35:35,435 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 75.5MB. Free memory is still 36.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.72ms. Allocated memory is still 94.4MB. Free memory was 65.9MB in the beginning and 68.4MB in the end (delta: -2.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.00ms. Allocated memory is still 94.4MB. Free memory was 68.4MB in the beginning and 60.4MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 88.32ms. Allocated memory is still 94.4MB. Free memory was 60.4MB in the beginning and 55.8MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 662.61ms. Allocated memory is still 94.4MB. Free memory was 55.8MB in the beginning and 51.1MB in the end (delta: 4.6MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 34219.50ms. Allocated memory was 94.4MB in the beginning and 211.8MB in the end (delta: 117.4MB). Free memory was 51.1MB in the beginning and 93.4MB in the end (delta: -42.3MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. * Witness Printer took 3.13ms. Allocated memory is still 211.8MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 27 terminating modules (27 trivial, 0 deterministic, 0 nondeterministic). 27 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.1s and 28 iterations. TraceHistogramMax:7. Analysis of lassos took 24.7s. Construction of modules took 5.2s. Büchi inclusion checks took 3.3s. Highest rank in rank-based complementation 0. Minimization of det autom 27. Minimization of nondet autom 0. Automata minimization 0.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 3929 StatesRemovedByMinimization, 24 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5015 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5015 mSDsluCounter, 4327 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2839 mSDsCounter, 681 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7168 IncrementalHoareTripleChecker+Invalid, 7849 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 681 mSolverCounterUnsat, 1488 mSDtfsCounter, 7168 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI16 SFLT0 conc2 concLT0 SILN0 SILU4 SILI5 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital62 mio100 ax100 hnf100 lsp78 ukn100 mio100 lsp100 div455 bol100 ite100 ukn100 eq145 hnf96 smp36 dnf131 smp99 tf101 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 69ms VariablesStem: 0 VariablesLoop: 20 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 6 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 4.8s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-23 14:35:35,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:35,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:35,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:36,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-07-23 14:35:36,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2022-07-23 14:35:36,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2022-07-23 14:35:36,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-07-23 14:35:36,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-07-23 14:35:37,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-07-23 14:35:37,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-07-23 14:35:37,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-07-23 14:35:37,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-07-23 14:35:37,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-07-23 14:35:38,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE