./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/byte_add-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ff03de63 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector/byte_add-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7dfc9f1e1cbceb1807370dcac22a0449d857eff9a54bdefbc84178983a910e84 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ff03de6 [2021-12-21 22:06:39,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-21 22:06:39,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-21 22:06:39,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-21 22:06:39,187 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-21 22:06:39,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-21 22:06:39,191 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-21 22:06:39,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-21 22:06:39,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-21 22:06:39,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-21 22:06:39,199 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-21 22:06:39,200 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-21 22:06:39,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-21 22:06:39,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-21 22:06:39,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-21 22:06:39,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-21 22:06:39,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-21 22:06:39,205 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-21 22:06:39,208 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-21 22:06:39,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-21 22:06:39,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-21 22:06:39,213 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-21 22:06:39,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-21 22:06:39,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-21 22:06:39,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-21 22:06:39,220 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-21 22:06:39,220 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-21 22:06:39,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-21 22:06:39,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-21 22:06:39,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-21 22:06:39,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-21 22:06:39,222 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-21 22:06:39,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-21 22:06:39,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-21 22:06:39,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-21 22:06:39,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-21 22:06:39,226 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-21 22:06:39,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-21 22:06:39,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-21 22:06:39,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-21 22:06:39,227 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-21 22:06:39,228 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-21 22:06:39,256 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-21 22:06:39,256 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-21 22:06:39,257 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-21 22:06:39,257 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-21 22:06:39,258 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-21 22:06:39,258 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-21 22:06:39,258 INFO L138 SettingsManager]: * Use SBE=true [2021-12-21 22:06:39,258 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-21 22:06:39,258 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-21 22:06:39,258 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-21 22:06:39,259 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-21 22:06:39,259 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-21 22:06:39,259 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-21 22:06:39,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-21 22:06:39,259 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-21 22:06:39,260 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-21 22:06:39,260 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-21 22:06:39,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-21 22:06:39,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-21 22:06:39,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-21 22:06:39,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-21 22:06:39,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-21 22:06:39,261 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-21 22:06:39,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-21 22:06:39,262 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-21 22:06:39,262 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-21 22:06:39,262 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-21 22:06:39,262 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-21 22:06:39,262 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-21 22:06:39,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-21 22:06:39,263 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-21 22:06:39,263 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-21 22:06:39,264 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-21 22:06:39,264 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7dfc9f1e1cbceb1807370dcac22a0449d857eff9a54bdefbc84178983a910e84 [2021-12-21 22:06:39,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-21 22:06:39,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-21 22:06:39,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-21 22:06:39,466 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-21 22:06:39,467 INFO L275 PluginConnector]: CDTParser initialized [2021-12-21 22:06:39,468 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add-1.i [2021-12-21 22:06:39,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155548dd2/fb9b932fed524d60ae056535c36a64bc/FLAGeb3dec07a [2021-12-21 22:06:39,857 INFO L306 CDTParser]: Found 1 translation units. [2021-12-21 22:06:39,857 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i [2021-12-21 22:06:39,866 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155548dd2/fb9b932fed524d60ae056535c36a64bc/FLAGeb3dec07a [2021-12-21 22:06:40,304 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/155548dd2/fb9b932fed524d60ae056535c36a64bc [2021-12-21 22:06:40,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-21 22:06:40,308 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-21 22:06:40,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-21 22:06:40,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-21 22:06:40,314 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-21 22:06:40,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:06:40" (1/1) ... [2021-12-21 22:06:40,315 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18eff02c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:06:40, skipping insertion in model container [2021-12-21 22:06:40,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 10:06:40" (1/1) ... [2021-12-21 22:06:40,320 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-21 22:06:40,340 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-21 22:06:40,436 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i[1166,1179] [2021-12-21 22:06:40,454 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:06:40,459 INFO L203 MainTranslator]: Completed pre-run [2021-12-21 22:06:40,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add-1.i[1166,1179] [2021-12-21 22:06:40,490 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-21 22:06:40,506 INFO L208 MainTranslator]: Completed translation [2021-12-21 22:06:40,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:06:40 WrapperNode [2021-12-21 22:06:40,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-21 22:06:40,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-21 22:06:40,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-21 22:06:40,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-21 22:06:40,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:06:40" (1/1) ... [2021-12-21 22:06:40,527 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:06:40" (1/1) ... [2021-12-21 22:06:40,550 INFO L137 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 124 [2021-12-21 22:06:40,550 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-21 22:06:40,551 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-21 22:06:40,551 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-21 22:06:40,551 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-21 22:06:40,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:06:40" (1/1) ... [2021-12-21 22:06:40,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:06:40" (1/1) ... [2021-12-21 22:06:40,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:06:40" (1/1) ... [2021-12-21 22:06:40,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:06:40" (1/1) ... [2021-12-21 22:06:40,576 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:06:40" (1/1) ... [2021-12-21 22:06:40,585 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:06:40" (1/1) ... [2021-12-21 22:06:40,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:06:40" (1/1) ... [2021-12-21 22:06:40,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-21 22:06:40,595 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-21 22:06:40,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-21 22:06:40,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-21 22:06:40,596 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:06:40" (1/1) ... [2021-12-21 22:06:40,602 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:06:40,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:06:40,618 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) [2021-12-21 22:06:40,620 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 [2021-12-21 22:06:40,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-21 22:06:40,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-21 22:06:40,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-21 22:06:40,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-21 22:06:40,696 INFO L234 CfgBuilder]: Building ICFG [2021-12-21 22:06:40,697 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-21 22:06:40,908 INFO L275 CfgBuilder]: Performing block encoding [2021-12-21 22:06:40,913 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-21 22:06:40,922 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-12-21 22:06:40,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:06:40 BoogieIcfgContainer [2021-12-21 22:06:40,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-21 22:06:40,925 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-21 22:06:40,925 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-21 22:06:40,927 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-21 22:06:40,928 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:06:40,928 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.12 10:06:40" (1/3) ... [2021-12-21 22:06:40,930 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d2946e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:06:40, skipping insertion in model container [2021-12-21 22:06:40,930 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:06:40,930 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 10:06:40" (2/3) ... [2021-12-21 22:06:40,930 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5d2946e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.12 10:06:40, skipping insertion in model container [2021-12-21 22:06:40,930 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-21 22:06:40,930 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 10:06:40" (3/3) ... [2021-12-21 22:06:40,931 INFO L388 chiAutomizerObserver]: Analyzing ICFG byte_add-1.i [2021-12-21 22:06:40,971 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-21 22:06:40,971 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-21 22:06:40,971 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-21 22:06:40,972 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-21 22:06:40,972 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-21 22:06:40,972 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-21 22:06:40,972 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-21 22:06:40,972 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-21 22:06:40,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 40 states have (on average 1.75) internal successors, (70), 40 states have internal predecessors, (70), 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) [2021-12-21 22:06:41,003 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2021-12-21 22:06:41,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:06:41,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:06:41,012 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-21 22:06:41,012 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:41,012 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-21 22:06:41,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 40 states have (on average 1.75) internal successors, (70), 40 states have internal predecessors, (70), 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) [2021-12-21 22:06:41,017 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2021-12-21 22:06:41,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:06:41,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:06:41,019 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-12-21 22:06:41,019 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:41,024 INFO L791 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 13#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 5#L59true assume !(0 == mp_add_~a3~0#1 % 256); 17#L59-1true mp_add_~nb~0#1 := 4; 19#L69true assume !(0 == mp_add_~b3~0#1 % 256); 36#L69-1true mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 24#L80-2true [2021-12-21 22:06:41,025 INFO L793 eck$LassoCheckResult]: Loop: 24#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; 33#L83true assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 42#L83-1true assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8#L89true assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 40#L95-1true assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 18#L99-1true assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 12#L100-1true assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 28#L101-1true assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 31#L102-1true mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 24#L80-2true [2021-12-21 22:06:41,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:41,029 INFO L85 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2021-12-21 22:06:41,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:41,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176139353] [2021-12-21 22:06:41,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:41,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:41,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:41,127 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:06:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:41,157 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:06:41,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:41,159 INFO L85 PathProgramCache]: Analyzing trace with hash 318197182, now seen corresponding path program 1 times [2021-12-21 22:06:41,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:41,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649876667] [2021-12-21 22:06:41,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:41,160 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:41,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:06:41,240 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:41,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649876667] [2021-12-21 22:06:41,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649876667] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:06:41,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:06:41,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:06:41,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880820209] [2021-12-21 22:06:41,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:41,246 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:06:41,246 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:06:41,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:06:41,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:06:41,273 INFO L87 Difference]: Start difference. First operand has 41 states, 40 states have (on average 1.75) internal successors, (70), 40 states have internal predecessors, (70), 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) [2021-12-21 22:06:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:06:41,410 INFO L93 Difference]: Finished difference Result 64 states and 94 transitions. [2021-12-21 22:06:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:06:41,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 94 transitions. [2021-12-21 22:06:41,422 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2021-12-21 22:06:41,430 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 56 states and 86 transitions. [2021-12-21 22:06:41,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-12-21 22:06:41,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-12-21 22:06:41,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 86 transitions. [2021-12-21 22:06:41,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:06:41,432 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 86 transitions. [2021-12-21 22:06:41,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 86 transitions. [2021-12-21 22:06:41,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2021-12-21 22:06:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 53 states have internal predecessors, (84), 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) [2021-12-21 22:06:41,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 84 transitions. [2021-12-21 22:06:41,450 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 84 transitions. [2021-12-21 22:06:41,450 INFO L587 BuchiCegarLoop]: Abstraction has 54 states and 84 transitions. [2021-12-21 22:06:41,450 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-21 22:06:41,450 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 84 transitions. [2021-12-21 22:06:41,451 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-12-21 22:06:41,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:06:41,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:06:41,452 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:41,452 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:41,452 INFO L791 eck$LassoCheckResult]: Stem: 136#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 127#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 114#L59 assume !(0 == mp_add_~a3~0#1 % 256); 115#L59-1 mp_add_~nb~0#1 := 4; 132#L69 assume !(0 == mp_add_~b3~0#1 % 256); 123#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 138#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 139#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 129#L83-1 [2021-12-21 22:06:41,452 INFO L793 eck$LassoCheckResult]: Loop: 129#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 118#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 119#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 133#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 125#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 126#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 144#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 147#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 159#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 160#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; 135#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 141#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 128#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 129#L83-1 [2021-12-21 22:06:41,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:41,453 INFO L85 PathProgramCache]: Analyzing trace with hash 532072804, now seen corresponding path program 1 times [2021-12-21 22:06:41,453 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:41,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765795350] [2021-12-21 22:06:41,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:41,454 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:41,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:06:41,586 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:41,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765795350] [2021-12-21 22:06:41,586 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765795350] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:06:41,586 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:06:41,586 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 22:06:41,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869624417] [2021-12-21 22:06:41,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:41,595 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:06:41,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:41,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1939143242, now seen corresponding path program 1 times [2021-12-21 22:06:41,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:41,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672767724] [2021-12-21 22:06:41,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:41,599 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:06:41,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:41,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672767724] [2021-12-21 22:06:41,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672767724] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:06:41,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:06:41,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 22:06:41,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143373226] [2021-12-21 22:06:41,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:41,694 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:06:41,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:06:41,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 22:06:41,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 22:06:41,695 INFO L87 Difference]: Start difference. First operand 54 states and 84 transitions. cyclomatic complexity: 32 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 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) [2021-12-21 22:06:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:06:41,848 INFO L93 Difference]: Finished difference Result 120 states and 177 transitions. [2021-12-21 22:06:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 22:06:41,849 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 120 states and 177 transitions. [2021-12-21 22:06:41,850 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 78 [2021-12-21 22:06:41,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 120 states to 120 states and 177 transitions. [2021-12-21 22:06:41,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2021-12-21 22:06:41,851 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2021-12-21 22:06:41,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 177 transitions. [2021-12-21 22:06:41,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:06:41,852 INFO L681 BuchiCegarLoop]: Abstraction has 120 states and 177 transitions. [2021-12-21 22:06:41,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 177 transitions. [2021-12-21 22:06:41,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 61. [2021-12-21 22:06:41,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.540983606557377) internal successors, (94), 60 states have internal predecessors, (94), 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) [2021-12-21 22:06:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 94 transitions. [2021-12-21 22:06:41,856 INFO L704 BuchiCegarLoop]: Abstraction has 61 states and 94 transitions. [2021-12-21 22:06:41,856 INFO L587 BuchiCegarLoop]: Abstraction has 61 states and 94 transitions. [2021-12-21 22:06:41,856 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-21 22:06:41,857 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 94 transitions. [2021-12-21 22:06:41,857 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-12-21 22:06:41,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:06:41,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:06:41,858 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:41,858 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:41,858 INFO L791 eck$LassoCheckResult]: Stem: 324#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 314#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 304#L59 assume !(0 == mp_add_~a3~0#1 % 256); 305#L59-1 mp_add_~nb~0#1 := 4; 319#L69 assume !(0 == mp_add_~b3~0#1 % 256); 312#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 326#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 327#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 321#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; 322#L84-2 [2021-12-21 22:06:41,858 INFO L793 eck$LassoCheckResult]: Loop: 322#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 325#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 315#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 316#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 302#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 303#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 320#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 309#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 310#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 331#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 334#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 341#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 357#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; 322#L84-2 [2021-12-21 22:06:41,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:41,859 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 1 times [2021-12-21 22:06:41,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:41,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996939328] [2021-12-21 22:06:41,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:41,859 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:41,891 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:06:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:41,907 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:06:41,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash 119486142, now seen corresponding path program 2 times [2021-12-21 22:06:41,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:41,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720073515] [2021-12-21 22:06:41,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:41,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:41,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:06:41,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:41,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720073515] [2021-12-21 22:06:41,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720073515] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:06:41,974 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:06:41,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:06:41,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598622181] [2021-12-21 22:06:41,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:41,975 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:06:41,975 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:06:41,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 22:06:41,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 22:06:41,975 INFO L87 Difference]: Start difference. First operand 61 states and 94 transitions. cyclomatic complexity: 35 Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:06:42,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:06:42,129 INFO L93 Difference]: Finished difference Result 86 states and 135 transitions. [2021-12-21 22:06:42,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 22:06:42,129 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 86 states and 135 transitions. [2021-12-21 22:06:42,130 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 64 [2021-12-21 22:06:42,131 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 86 states to 86 states and 135 transitions. [2021-12-21 22:06:42,131 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 86 [2021-12-21 22:06:42,131 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2021-12-21 22:06:42,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 135 transitions. [2021-12-21 22:06:42,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:06:42,132 INFO L681 BuchiCegarLoop]: Abstraction has 86 states and 135 transitions. [2021-12-21 22:06:42,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 135 transitions. [2021-12-21 22:06:42,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 78. [2021-12-21 22:06:42,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.5512820512820513) internal successors, (121), 77 states have internal predecessors, (121), 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) [2021-12-21 22:06:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 121 transitions. [2021-12-21 22:06:42,139 INFO L704 BuchiCegarLoop]: Abstraction has 78 states and 121 transitions. [2021-12-21 22:06:42,139 INFO L587 BuchiCegarLoop]: Abstraction has 78 states and 121 transitions. [2021-12-21 22:06:42,140 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-21 22:06:42,140 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 121 transitions. [2021-12-21 22:06:42,140 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2021-12-21 22:06:42,140 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:06:42,140 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:06:42,141 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:42,142 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:42,142 INFO L791 eck$LassoCheckResult]: Stem: 479#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 468#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 458#L59 assume !(0 == mp_add_~a3~0#1 % 256); 459#L59-1 mp_add_~nb~0#1 := 4; 524#L69 assume !(0 == mp_add_~b3~0#1 % 256); 493#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 480#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 481#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 492#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; 529#L84-2 [2021-12-21 22:06:42,142 INFO L793 eck$LassoCheckResult]: Loop: 529#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 527#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 512#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 510#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 454#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 455#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 520#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 463#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 464#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 485#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 525#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 521#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 470#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 496#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 494#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 474#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 475#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 497#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 488#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 489#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 517#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 518#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; 529#L84-2 [2021-12-21 22:06:42,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:42,143 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 2 times [2021-12-21 22:06:42,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:42,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877555505] [2021-12-21 22:06:42,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:42,144 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:42,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:42,168 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:06:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:42,196 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:06:42,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:42,196 INFO L85 PathProgramCache]: Analyzing trace with hash 522403369, now seen corresponding path program 1 times [2021-12-21 22:06:42,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:42,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145566539] [2021-12-21 22:06:42,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:42,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:42,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 22:06:42,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:42,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145566539] [2021-12-21 22:06:42,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145566539] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:06:42,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:06:42,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:06:42,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462217939] [2021-12-21 22:06:42,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:42,231 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:06:42,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:06:42,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:06:42,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:06:42,232 INFO L87 Difference]: Start difference. First operand 78 states and 121 transitions. cyclomatic complexity: 45 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:06:42,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:06:42,304 INFO L93 Difference]: Finished difference Result 103 states and 155 transitions. [2021-12-21 22:06:42,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:06:42,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 155 transitions. [2021-12-21 22:06:42,306 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 81 [2021-12-21 22:06:42,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 103 states and 155 transitions. [2021-12-21 22:06:42,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2021-12-21 22:06:42,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2021-12-21 22:06:42,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 155 transitions. [2021-12-21 22:06:42,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:06:42,307 INFO L681 BuchiCegarLoop]: Abstraction has 103 states and 155 transitions. [2021-12-21 22:06:42,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 155 transitions. [2021-12-21 22:06:42,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2021-12-21 22:06:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.5148514851485149) internal successors, (153), 100 states have internal predecessors, (153), 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) [2021-12-21 22:06:42,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 153 transitions. [2021-12-21 22:06:42,314 INFO L704 BuchiCegarLoop]: Abstraction has 101 states and 153 transitions. [2021-12-21 22:06:42,314 INFO L587 BuchiCegarLoop]: Abstraction has 101 states and 153 transitions. [2021-12-21 22:06:42,314 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-21 22:06:42,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 101 states and 153 transitions. [2021-12-21 22:06:42,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 79 [2021-12-21 22:06:42,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:06:42,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:06:42,315 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:42,323 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:42,323 INFO L791 eck$LassoCheckResult]: Stem: 665#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 655#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 641#L59 assume !(0 == mp_add_~a3~0#1 % 256); 642#L59-1 mp_add_~nb~0#1 := 4; 660#L69 assume !(0 == mp_add_~b3~0#1 % 256); 679#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 667#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 668#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 663#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; 664#L84-2 [2021-12-21 22:06:42,323 INFO L793 eck$LassoCheckResult]: Loop: 664#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 680#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 740#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 682#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 646#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 647#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 699#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 698#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 697#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 693#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 690#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 691#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 719#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 717#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 704#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 703#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 653#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 654#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 672#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 675#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 715#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 716#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; 664#L84-2 [2021-12-21 22:06:42,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:42,324 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 3 times [2021-12-21 22:06:42,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:42,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76419464] [2021-12-21 22:06:42,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:42,324 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:42,334 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:06:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:42,343 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:06:42,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:42,344 INFO L85 PathProgramCache]: Analyzing trace with hash 581508713, now seen corresponding path program 1 times [2021-12-21 22:06:42,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:42,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244211113] [2021-12-21 22:06:42,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:42,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:42,377 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:06:42,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:42,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244211113] [2021-12-21 22:06:42,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244211113] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:06:42,377 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:06:42,377 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 22:06:42,377 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882678803] [2021-12-21 22:06:42,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:42,378 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:06:42,378 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:06:42,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 22:06:42,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 22:06:42,378 INFO L87 Difference]: Start difference. First operand 101 states and 153 transitions. cyclomatic complexity: 54 Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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) [2021-12-21 22:06:42,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:06:42,419 INFO L93 Difference]: Finished difference Result 169 states and 255 transitions. [2021-12-21 22:06:42,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 22:06:42,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 169 states and 255 transitions. [2021-12-21 22:06:42,421 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 147 [2021-12-21 22:06:42,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 169 states to 169 states and 255 transitions. [2021-12-21 22:06:42,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 169 [2021-12-21 22:06:42,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 169 [2021-12-21 22:06:42,423 INFO L73 IsDeterministic]: Start isDeterministic. Operand 169 states and 255 transitions. [2021-12-21 22:06:42,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:06:42,423 INFO L681 BuchiCegarLoop]: Abstraction has 169 states and 255 transitions. [2021-12-21 22:06:42,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states and 255 transitions. [2021-12-21 22:06:42,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 141. [2021-12-21 22:06:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 140 states have internal predecessors, (217), 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) [2021-12-21 22:06:42,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 217 transitions. [2021-12-21 22:06:42,428 INFO L704 BuchiCegarLoop]: Abstraction has 141 states and 217 transitions. [2021-12-21 22:06:42,428 INFO L587 BuchiCegarLoop]: Abstraction has 141 states and 217 transitions. [2021-12-21 22:06:42,428 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-21 22:06:42,428 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 141 states and 217 transitions. [2021-12-21 22:06:42,429 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 119 [2021-12-21 22:06:42,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:06:42,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:06:42,430 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:42,430 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:42,430 INFO L791 eck$LassoCheckResult]: Stem: 947#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 935#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 925#L59 assume !(0 == mp_add_~a3~0#1 % 256); 926#L59-1 mp_add_~nb~0#1 := 4; 940#L69 assume !(0 == mp_add_~b3~0#1 % 256); 965#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 949#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 950#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 960#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; 963#L84-2 [2021-12-21 22:06:42,430 INFO L793 eck$LassoCheckResult]: Loop: 963#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 964#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1026#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1011#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1002#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 997#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 992#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 989#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 986#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 984#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; 981#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1030#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 923#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 1041#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 1039#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 930#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 931#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 954#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 957#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1050#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; 963#L84-2 [2021-12-21 22:06:42,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:42,431 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 4 times [2021-12-21 22:06:42,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:42,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814532139] [2021-12-21 22:06:42,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:42,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:42,452 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:06:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:42,462 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:06:42,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:42,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1412635993, now seen corresponding path program 1 times [2021-12-21 22:06:42,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:42,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528544466] [2021-12-21 22:06:42,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:42,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:06:42,519 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:42,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528544466] [2021-12-21 22:06:42,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528544466] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:06:42,520 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:06:42,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 22:06:42,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648804757] [2021-12-21 22:06:42,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:42,521 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:06:42,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:06:42,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 22:06:42,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-21 22:06:42,522 INFO L87 Difference]: Start difference. First operand 141 states and 217 transitions. cyclomatic complexity: 78 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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) [2021-12-21 22:06:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:06:42,673 INFO L93 Difference]: Finished difference Result 302 states and 450 transitions. [2021-12-21 22:06:42,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 22:06:42,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 302 states and 450 transitions. [2021-12-21 22:06:42,675 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 255 [2021-12-21 22:06:42,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 302 states to 302 states and 450 transitions. [2021-12-21 22:06:42,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 302 [2021-12-21 22:06:42,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 302 [2021-12-21 22:06:42,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 302 states and 450 transitions. [2021-12-21 22:06:42,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:06:42,678 INFO L681 BuchiCegarLoop]: Abstraction has 302 states and 450 transitions. [2021-12-21 22:06:42,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states and 450 transitions. [2021-12-21 22:06:42,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 225. [2021-12-21 22:06:42,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 225 states have (on average 1.5155555555555555) internal successors, (341), 224 states have internal predecessors, (341), 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) [2021-12-21 22:06:42,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 341 transitions. [2021-12-21 22:06:42,688 INFO L704 BuchiCegarLoop]: Abstraction has 225 states and 341 transitions. [2021-12-21 22:06:42,688 INFO L587 BuchiCegarLoop]: Abstraction has 225 states and 341 transitions. [2021-12-21 22:06:42,688 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-21 22:06:42,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 225 states and 341 transitions. [2021-12-21 22:06:42,689 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 198 [2021-12-21 22:06:42,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:06:42,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:06:42,690 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:42,690 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:42,690 INFO L791 eck$LassoCheckResult]: Stem: 1398#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 1388#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 1372#L59 assume !(0 == mp_add_~a3~0#1 % 256); 1373#L59-1 mp_add_~nb~0#1 := 4; 1393#L69 assume !(0 == mp_add_~b3~0#1 % 256); 1411#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1412#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1418#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1419#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; 1413#L84-2 [2021-12-21 22:06:42,690 INFO L793 eck$LassoCheckResult]: Loop: 1413#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1402#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1389#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1390#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1541#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 1540#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1483#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1484#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1539#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1479#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1478#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1475#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1477#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1377#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 1378#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 1473#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1449#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 1445#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 1433#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1430#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1431#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1508#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; 1413#L84-2 [2021-12-21 22:06:42,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:42,692 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 5 times [2021-12-21 22:06:42,692 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:42,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357578344] [2021-12-21 22:06:42,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:42,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:42,711 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:06:42,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:42,720 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:06:42,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:42,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1317498195, now seen corresponding path program 1 times [2021-12-21 22:06:42,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:42,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669915104] [2021-12-21 22:06:42,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:42,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:42,744 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-12-21 22:06:42,744 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:42,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669915104] [2021-12-21 22:06:42,744 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669915104] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:06:42,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:06:42,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:06:42,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592510258] [2021-12-21 22:06:42,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:42,745 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:06:42,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:06:42,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-21 22:06:42,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-21 22:06:42,747 INFO L87 Difference]: Start difference. First operand 225 states and 341 transitions. cyclomatic complexity: 119 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:06:42,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:06:42,807 INFO L93 Difference]: Finished difference Result 263 states and 400 transitions. [2021-12-21 22:06:42,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-21 22:06:42,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 400 transitions. [2021-12-21 22:06:42,810 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 236 [2021-12-21 22:06:42,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 263 states and 400 transitions. [2021-12-21 22:06:42,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 263 [2021-12-21 22:06:42,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 263 [2021-12-21 22:06:42,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 263 states and 400 transitions. [2021-12-21 22:06:42,813 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:06:42,813 INFO L681 BuchiCegarLoop]: Abstraction has 263 states and 400 transitions. [2021-12-21 22:06:42,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states and 400 transitions. [2021-12-21 22:06:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 257. [2021-12-21 22:06:42,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 257 states have (on average 1.5330739299610896) internal successors, (394), 256 states have internal predecessors, (394), 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) [2021-12-21 22:06:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 394 transitions. [2021-12-21 22:06:42,827 INFO L704 BuchiCegarLoop]: Abstraction has 257 states and 394 transitions. [2021-12-21 22:06:42,827 INFO L587 BuchiCegarLoop]: Abstraction has 257 states and 394 transitions. [2021-12-21 22:06:42,827 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-21 22:06:42,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 257 states and 394 transitions. [2021-12-21 22:06:42,828 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 230 [2021-12-21 22:06:42,829 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:06:42,829 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:06:42,830 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:42,830 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:42,830 INFO L791 eck$LassoCheckResult]: Stem: 1893#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 1883#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 1866#L59 assume !(0 == mp_add_~a3~0#1 % 256); 1867#L59-1 mp_add_~nb~0#1 := 4; 1888#L69 assume !(0 == mp_add_~b3~0#1 % 256); 1912#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1896#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1897#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1891#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; 1892#L84-2 [2021-12-21 22:06:42,830 INFO L793 eck$LassoCheckResult]: Loop: 1892#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1898#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1899#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 2083#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1871#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 1872#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 2078#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 2077#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 2076#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 2075#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 2074#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2070#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 2072#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2047#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 1959#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 1944#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1943#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1941#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 1938#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1936#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1937#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2104#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; 1892#L84-2 [2021-12-21 22:06:42,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:42,830 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 6 times [2021-12-21 22:06:42,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:42,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519517739] [2021-12-21 22:06:42,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:42,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:42,838 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:06:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:42,846 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:06:42,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:42,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1260239893, now seen corresponding path program 1 times [2021-12-21 22:06:42,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:42,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127405847] [2021-12-21 22:06:42,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:42,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:42,915 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:06:42,916 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:42,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127405847] [2021-12-21 22:06:42,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127405847] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:06:42,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880693582] [2021-12-21 22:06:42,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:42,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:06:42,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:06:42,918 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:06:42,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-21 22:06:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:42,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 22:06:42,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:06:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:06:43,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:06:43,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:06:43,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880693582] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:06:43,239 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:06:43,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2021-12-21 22:06:43,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424159950] [2021-12-21 22:06:43,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:06:43,241 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:06:43,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:06:43,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 22:06:43,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2021-12-21 22:06:43,242 INFO L87 Difference]: Start difference. First operand 257 states and 394 transitions. cyclomatic complexity: 140 Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 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) [2021-12-21 22:06:43,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:06:43,475 INFO L93 Difference]: Finished difference Result 411 states and 582 transitions. [2021-12-21 22:06:43,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 22:06:43,476 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 411 states and 582 transitions. [2021-12-21 22:06:43,478 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 335 [2021-12-21 22:06:43,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 411 states to 411 states and 582 transitions. [2021-12-21 22:06:43,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 411 [2021-12-21 22:06:43,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 411 [2021-12-21 22:06:43,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 411 states and 582 transitions. [2021-12-21 22:06:43,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:06:43,481 INFO L681 BuchiCegarLoop]: Abstraction has 411 states and 582 transitions. [2021-12-21 22:06:43,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states and 582 transitions. [2021-12-21 22:06:43,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 290. [2021-12-21 22:06:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 290 states have (on average 1.4896551724137932) internal successors, (432), 289 states have internal predecessors, (432), 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) [2021-12-21 22:06:43,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 432 transitions. [2021-12-21 22:06:43,485 INFO L704 BuchiCegarLoop]: Abstraction has 290 states and 432 transitions. [2021-12-21 22:06:43,485 INFO L587 BuchiCegarLoop]: Abstraction has 290 states and 432 transitions. [2021-12-21 22:06:43,485 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-21 22:06:43,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 290 states and 432 transitions. [2021-12-21 22:06:43,486 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 254 [2021-12-21 22:06:43,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:06:43,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:06:43,487 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:43,487 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:43,488 INFO L791 eck$LassoCheckResult]: Stem: 2702#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 2692#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 2677#L59 assume !(0 == mp_add_~a3~0#1 % 256); 2678#L59-1 mp_add_~nb~0#1 := 4; 2697#L69 assume !(0 == mp_add_~b3~0#1 % 256); 2688#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 2737#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2735#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2700#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; 2701#L84-2 [2021-12-21 22:06:43,488 INFO L793 eck$LassoCheckResult]: Loop: 2701#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 2719#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 2865#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 2862#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2860#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 2769#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 2768#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 2766#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 2740#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 2741#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 2736#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2734#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2731#L84 assume !(0 == mp_add_~i~0#1 % 256); 2727#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; 2728#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 2873#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 2870#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2867#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 2866#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 2853#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 2827#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 2773#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 2772#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 2749#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2750#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2799#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; 2701#L84-2 [2021-12-21 22:06:43,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:43,488 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 7 times [2021-12-21 22:06:43,488 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:43,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671507248] [2021-12-21 22:06:43,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:43,489 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:43,496 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:06:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:43,510 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:06:43,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:43,511 INFO L85 PathProgramCache]: Analyzing trace with hash -925244773, now seen corresponding path program 1 times [2021-12-21 22:06:43,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:43,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814114808] [2021-12-21 22:06:43,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:43,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:43,544 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:06:43,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:43,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814114808] [2021-12-21 22:06:43,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814114808] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:06:43,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:06:43,544 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-21 22:06:43,544 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179934397] [2021-12-21 22:06:43,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:43,545 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:06:43,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:06:43,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 22:06:43,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 22:06:43,545 INFO L87 Difference]: Start difference. First operand 290 states and 432 transitions. cyclomatic complexity: 145 Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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) [2021-12-21 22:06:43,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:06:43,666 INFO L93 Difference]: Finished difference Result 436 states and 627 transitions. [2021-12-21 22:06:43,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-21 22:06:43,667 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 436 states and 627 transitions. [2021-12-21 22:06:43,669 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 394 [2021-12-21 22:06:43,671 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 436 states to 436 states and 627 transitions. [2021-12-21 22:06:43,671 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 436 [2021-12-21 22:06:43,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 436 [2021-12-21 22:06:43,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 436 states and 627 transitions. [2021-12-21 22:06:43,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:06:43,686 INFO L681 BuchiCegarLoop]: Abstraction has 436 states and 627 transitions. [2021-12-21 22:06:43,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states and 627 transitions. [2021-12-21 22:06:43,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 328. [2021-12-21 22:06:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 328 states have (on average 1.4939024390243902) internal successors, (490), 327 states have internal predecessors, (490), 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) [2021-12-21 22:06:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 490 transitions. [2021-12-21 22:06:43,691 INFO L704 BuchiCegarLoop]: Abstraction has 328 states and 490 transitions. [2021-12-21 22:06:43,691 INFO L587 BuchiCegarLoop]: Abstraction has 328 states and 490 transitions. [2021-12-21 22:06:43,691 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-21 22:06:43,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 328 states and 490 transitions. [2021-12-21 22:06:43,692 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 304 [2021-12-21 22:06:43,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:06:43,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:06:43,693 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:43,693 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:43,693 INFO L791 eck$LassoCheckResult]: Stem: 3441#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 3428#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 3418#L59 assume !(0 == mp_add_~a3~0#1 % 256); 3419#L59-1 mp_add_~nb~0#1 := 4; 3433#L69 assume !(0 == mp_add_~b3~0#1 % 256); 3462#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 3463#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3474#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3468#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; 3461#L84-2 [2021-12-21 22:06:43,693 INFO L793 eck$LassoCheckResult]: Loop: 3461#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 3445#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 3429#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 3430#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3710#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 3715#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 3592#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 3499#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 3488#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 3489#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 3723#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3646#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 3458#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3413#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 3414#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 3465#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 3497#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 3498#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 3691#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 3689#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3660#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 3641#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3659#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 3606#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 3578#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 3569#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 3492#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 3493#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 3543#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3544#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3539#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; 3461#L84-2 [2021-12-21 22:06:43,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:43,693 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 8 times [2021-12-21 22:06:43,695 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:43,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939328478] [2021-12-21 22:06:43,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:43,696 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:43,720 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:06:43,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:43,735 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:06:43,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:43,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2071006882, now seen corresponding path program 1 times [2021-12-21 22:06:43,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:43,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624300971] [2021-12-21 22:06:43,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:43,739 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:43,799 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:06:43,799 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:43,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624300971] [2021-12-21 22:06:43,801 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624300971] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:06:43,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453438849] [2021-12-21 22:06:43,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:43,801 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:06:43,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:06:43,803 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:06:43,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-21 22:06:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:43,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 22:06:43,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:06:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2021-12-21 22:06:43,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 22:06:43,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453438849] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:06:43,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 22:06:43,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2021-12-21 22:06:43,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368629262] [2021-12-21 22:06:43,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:43,915 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:06:43,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:06:43,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 22:06:43,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-21 22:06:43,916 INFO L87 Difference]: Start difference. First operand 328 states and 490 transitions. cyclomatic complexity: 164 Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:06:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:06:44,035 INFO L93 Difference]: Finished difference Result 341 states and 457 transitions. [2021-12-21 22:06:44,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 22:06:44,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 341 states and 457 transitions. [2021-12-21 22:06:44,037 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 317 [2021-12-21 22:06:44,039 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 341 states to 341 states and 457 transitions. [2021-12-21 22:06:44,039 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 341 [2021-12-21 22:06:44,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 341 [2021-12-21 22:06:44,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 341 states and 457 transitions. [2021-12-21 22:06:44,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:06:44,039 INFO L681 BuchiCegarLoop]: Abstraction has 341 states and 457 transitions. [2021-12-21 22:06:44,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states and 457 transitions. [2021-12-21 22:06:44,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 294. [2021-12-21 22:06:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 294 states have (on average 1.370748299319728) internal successors, (403), 293 states have internal predecessors, (403), 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) [2021-12-21 22:06:44,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 403 transitions. [2021-12-21 22:06:44,044 INFO L704 BuchiCegarLoop]: Abstraction has 294 states and 403 transitions. [2021-12-21 22:06:44,044 INFO L587 BuchiCegarLoop]: Abstraction has 294 states and 403 transitions. [2021-12-21 22:06:44,044 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-21 22:06:44,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 294 states and 403 transitions. [2021-12-21 22:06:44,045 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 270 [2021-12-21 22:06:44,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:06:44,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:06:44,046 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:44,046 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:44,046 INFO L791 eck$LassoCheckResult]: Stem: 4208#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 4198#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 4188#L59 assume !(0 == mp_add_~a3~0#1 % 256); 4189#L59-1 mp_add_~nb~0#1 := 4; 4205#L69 assume !(0 == mp_add_~b3~0#1 % 256); 4196#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 4225#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4406#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4405#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; 4327#L84-2 [2021-12-21 22:06:44,046 INFO L793 eck$LassoCheckResult]: Loop: 4327#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 4404#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4402#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4400#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4396#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 4395#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 4377#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4394#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4393#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4392#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4391#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4389#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4387#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4340#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 4384#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4374#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 4371#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4370#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4369#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4368#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4301#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4302#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4291#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 4289#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4285#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4283#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4281#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4252#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4247#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4248#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4326#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; 4327#L84-2 [2021-12-21 22:06:44,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:44,047 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 9 times [2021-12-21 22:06:44,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:44,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110306687] [2021-12-21 22:06:44,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:44,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:44,065 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:06:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:44,081 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:06:44,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:44,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1750670628, now seen corresponding path program 2 times [2021-12-21 22:06:44,081 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:44,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832488879] [2021-12-21 22:06:44,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:44,082 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:44,162 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 22:06:44,162 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:44,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832488879] [2021-12-21 22:06:44,162 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832488879] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:06:44,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502550726] [2021-12-21 22:06:44,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 22:06:44,162 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:06:44,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:06:44,196 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:06:44,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-21 22:06:44,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-21 22:06:44,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 22:06:44,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-21 22:06:44,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:06:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 22:06:44,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:06:44,351 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-21 22:06:44,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502550726] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:06:44,352 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:06:44,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2021-12-21 22:06:44,353 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753042026] [2021-12-21 22:06:44,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:06:44,354 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:06:44,354 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:06:44,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 22:06:44,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-12-21 22:06:44,355 INFO L87 Difference]: Start difference. First operand 294 states and 403 transitions. cyclomatic complexity: 111 Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 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) [2021-12-21 22:06:44,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:06:44,758 INFO L93 Difference]: Finished difference Result 494 states and 631 transitions. [2021-12-21 22:06:44,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 22:06:44,759 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 494 states and 631 transitions. [2021-12-21 22:06:44,761 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 420 [2021-12-21 22:06:44,763 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 494 states to 494 states and 631 transitions. [2021-12-21 22:06:44,763 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 494 [2021-12-21 22:06:44,763 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 494 [2021-12-21 22:06:44,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 494 states and 631 transitions. [2021-12-21 22:06:44,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:06:44,764 INFO L681 BuchiCegarLoop]: Abstraction has 494 states and 631 transitions. [2021-12-21 22:06:44,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states and 631 transitions. [2021-12-21 22:06:44,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 377. [2021-12-21 22:06:44,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 377 states have (on average 1.3342175066312998) internal successors, (503), 376 states have internal predecessors, (503), 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) [2021-12-21 22:06:44,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 503 transitions. [2021-12-21 22:06:44,769 INFO L704 BuchiCegarLoop]: Abstraction has 377 states and 503 transitions. [2021-12-21 22:06:44,769 INFO L587 BuchiCegarLoop]: Abstraction has 377 states and 503 transitions. [2021-12-21 22:06:44,769 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-12-21 22:06:44,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 377 states and 503 transitions. [2021-12-21 22:06:44,771 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 344 [2021-12-21 22:06:44,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:06:44,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:06:44,771 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:44,771 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 7, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:44,772 INFO L791 eck$LassoCheckResult]: Stem: 5205#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 5194#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 5184#L59 assume !(0 == mp_add_~a3~0#1 % 256); 5185#L59-1 mp_add_~nb~0#1 := 4; 5199#L69 assume !(0 == mp_add_~b3~0#1 % 256); 5221#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 5222#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5510#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 5202#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; 5203#L84-2 [2021-12-21 22:06:44,773 INFO L793 eck$LassoCheckResult]: Loop: 5203#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 5208#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 5195#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 5196#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5536#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 5537#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 5538#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5535#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5532#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5486#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5487#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5512#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 5226#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5183#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 5542#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 5489#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 5260#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5474#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5451#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5450#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5448#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 5443#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5407#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 5405#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 5403#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5401#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 5399#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5397#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5393#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5394#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 5383#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5382#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 5377#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 5376#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5375#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5374#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 5373#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5372#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5370#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 5368#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5366#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 5365#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 5334#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5335#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5329#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5327#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5325#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5321#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 5323#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5380#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 5279#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 5458#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5452#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5268#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5267#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5265#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5266#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 5248#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5250#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 5409#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 5410#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5347#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5348#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5255#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5254#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5251#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 5252#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; 5203#L84-2 [2021-12-21 22:06:44,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:44,773 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 10 times [2021-12-21 22:06:44,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:44,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027568666] [2021-12-21 22:06:44,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:44,774 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:44,781 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:06:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:06:44,789 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:06:44,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:44,789 INFO L85 PathProgramCache]: Analyzing trace with hash 896633444, now seen corresponding path program 1 times [2021-12-21 22:06:44,789 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:44,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376682766] [2021-12-21 22:06:44,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:44,792 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 128 proven. 2 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2021-12-21 22:06:44,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:44,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376682766] [2021-12-21 22:06:44,849 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376682766] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:06:44,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068407786] [2021-12-21 22:06:44,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:44,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:06:44,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:06:44,851 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:06:44,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-21 22:06:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:44,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 22:06:44,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:06:45,003 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 146 proven. 6 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-12-21 22:06:45,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:06:45,108 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 138 proven. 3 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-12-21 22:06:45,109 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068407786] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:06:45,109 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:06:45,109 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2021-12-21 22:06:45,109 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567002256] [2021-12-21 22:06:45,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:06:45,110 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:06:45,110 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:06:45,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-21 22:06:45,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-12-21 22:06:45,111 INFO L87 Difference]: Start difference. First operand 377 states and 503 transitions. cyclomatic complexity: 128 Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 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) [2021-12-21 22:06:45,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:06:45,430 INFO L93 Difference]: Finished difference Result 549 states and 658 transitions. [2021-12-21 22:06:45,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 22:06:45,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 549 states and 658 transitions. [2021-12-21 22:06:45,434 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 450 [2021-12-21 22:06:45,435 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 549 states to 549 states and 658 transitions. [2021-12-21 22:06:45,435 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 549 [2021-12-21 22:06:45,436 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 549 [2021-12-21 22:06:45,436 INFO L73 IsDeterministic]: Start isDeterministic. Operand 549 states and 658 transitions. [2021-12-21 22:06:45,436 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:06:45,436 INFO L681 BuchiCegarLoop]: Abstraction has 549 states and 658 transitions. [2021-12-21 22:06:45,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states and 658 transitions. [2021-12-21 22:06:45,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 219. [2021-12-21 22:06:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 219 states have (on average 1.2328767123287672) internal successors, (270), 218 states have internal predecessors, (270), 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) [2021-12-21 22:06:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 270 transitions. [2021-12-21 22:06:45,440 INFO L704 BuchiCegarLoop]: Abstraction has 219 states and 270 transitions. [2021-12-21 22:06:45,440 INFO L587 BuchiCegarLoop]: Abstraction has 219 states and 270 transitions. [2021-12-21 22:06:45,440 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-12-21 22:06:45,440 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 219 states and 270 transitions. [2021-12-21 22:06:45,441 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 140 [2021-12-21 22:06:45,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:06:45,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:06:45,442 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:45,442 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 1, 1, 1] [2021-12-21 22:06:45,442 INFO L791 eck$LassoCheckResult]: Stem: 6568#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 6555#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 6545#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 6547#L61 assume !(0 == mp_add_~a2~0#1 % 256); 6548#L59-1 mp_add_~nb~0#1 := 4; 6563#L69 assume !(0 == mp_add_~b3~0#1 % 256); 6553#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 6618#L80-2 assume !((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536); 6617#L107-1 assume !!(mp_add_~i~0#1 % 256 < 4); 6616#L108 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := 0; 6615#L108-2 assume !(1 == mp_add_~i~0#1 % 256); 6614#L109-1 assume !(2 == mp_add_~i~0#1 % 256); 6613#L110-1 assume !(3 == mp_add_~i~0#1 % 256); 6610#L111-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6609#L107-1 assume !!(mp_add_~i~0#1 % 256 < 4); 6582#L108 assume !(0 == mp_add_~i~0#1 % 256); 6583#L108-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := 0; 6575#L109-1 [2021-12-21 22:06:45,442 INFO L793 eck$LassoCheckResult]: Loop: 6575#L109-1 assume !(2 == mp_add_~i~0#1 % 256); 6576#L110-1 assume !(3 == mp_add_~i~0#1 % 256); 6558#L111-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6559#L107-1 assume !!(mp_add_~i~0#1 % 256 < 4); 6606#L108 assume !(0 == mp_add_~i~0#1 % 256); 6607#L108-2 assume !(1 == mp_add_~i~0#1 % 256); 6601#L109-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := 0; 6600#L110-1 assume !(3 == mp_add_~i~0#1 % 256); 6596#L111-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6595#L107-1 assume !!(mp_add_~i~0#1 % 256 < 4); 6594#L108 assume !(0 == mp_add_~i~0#1 % 256); 6593#L108-2 assume !(1 == mp_add_~i~0#1 % 256); 6592#L109-1 assume !(2 == mp_add_~i~0#1 % 256); 6591#L110-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := 0; 6567#L111-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6573#L107-1 assume !!(mp_add_~i~0#1 % 256 < 4); 6574#L108 assume !(0 == mp_add_~i~0#1 % 256); 6603#L108-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := 0; 6575#L109-1 [2021-12-21 22:06:45,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:45,442 INFO L85 PathProgramCache]: Analyzing trace with hash -850823382, now seen corresponding path program 1 times [2021-12-21 22:06:45,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:45,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863809989] [2021-12-21 22:06:45,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:45,443 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 22:06:45,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:45,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863809989] [2021-12-21 22:06:45,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863809989] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:06:45,472 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:06:45,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-21 22:06:45,472 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955393493] [2021-12-21 22:06:45,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:45,472 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:06:45,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:45,472 INFO L85 PathProgramCache]: Analyzing trace with hash -830477736, now seen corresponding path program 1 times [2021-12-21 22:06:45,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:45,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800262324] [2021-12-21 22:06:45,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:45,473 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:45,496 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:06:45,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:45,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800262324] [2021-12-21 22:06:45,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800262324] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:06:45,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696547917] [2021-12-21 22:06:45,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:45,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:06:45,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:06:45,504 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:06:45,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-21 22:06:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:45,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 22:06:45,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:06:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-21 22:06:45,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 22:06:45,577 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696547917] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:06:45,577 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 22:06:45,577 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-12-21 22:06:45,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038417399] [2021-12-21 22:06:45,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:45,577 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:06:45,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:06:45,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 22:06:45,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-21 22:06:45,578 INFO L87 Difference]: Start difference. First operand 219 states and 270 transitions. cyclomatic complexity: 53 Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2021-12-21 22:06:45,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:06:45,672 INFO L93 Difference]: Finished difference Result 419 states and 510 transitions. [2021-12-21 22:06:45,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 22:06:45,672 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 419 states and 510 transitions. [2021-12-21 22:06:45,674 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 280 [2021-12-21 22:06:45,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 419 states to 419 states and 510 transitions. [2021-12-21 22:06:45,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 419 [2021-12-21 22:06:45,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 419 [2021-12-21 22:06:45,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 419 states and 510 transitions. [2021-12-21 22:06:45,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:06:45,676 INFO L681 BuchiCegarLoop]: Abstraction has 419 states and 510 transitions. [2021-12-21 22:06:45,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states and 510 transitions. [2021-12-21 22:06:45,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 230. [2021-12-21 22:06:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 230 states have (on average 1.2260869565217392) internal successors, (282), 229 states have internal predecessors, (282), 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) [2021-12-21 22:06:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 282 transitions. [2021-12-21 22:06:45,680 INFO L704 BuchiCegarLoop]: Abstraction has 230 states and 282 transitions. [2021-12-21 22:06:45,680 INFO L587 BuchiCegarLoop]: Abstraction has 230 states and 282 transitions. [2021-12-21 22:06:45,680 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-12-21 22:06:45,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 230 states and 282 transitions. [2021-12-21 22:06:45,680 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 140 [2021-12-21 22:06:45,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:06:45,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:06:45,681 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:45,681 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 1, 1, 1] [2021-12-21 22:06:45,681 INFO L791 eck$LassoCheckResult]: Stem: 7269#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 7259#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 7249#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 7251#L61 assume !(0 == mp_add_~a2~0#1 % 256); 7252#L59-1 mp_add_~nb~0#1 := 4; 7325#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 7324#L71 assume !(0 == mp_add_~b2~0#1 % 256); 7322#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 7320#L80-2 assume !((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536); 7319#L107-1 assume !!(mp_add_~i~0#1 % 256 < 4); 7318#L108 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := 0; 7317#L108-2 assume !(1 == mp_add_~i~0#1 % 256); 7316#L109-1 assume !(2 == mp_add_~i~0#1 % 256); 7315#L110-1 assume !(3 == mp_add_~i~0#1 % 256); 7262#L111-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7263#L107-1 assume !!(mp_add_~i~0#1 % 256 < 4); 7276#L108 assume !(0 == mp_add_~i~0#1 % 256); 7283#L108-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := 0; 7277#L109-1 [2021-12-21 22:06:45,681 INFO L793 eck$LassoCheckResult]: Loop: 7277#L109-1 assume !(2 == mp_add_~i~0#1 % 256); 7278#L110-1 assume !(3 == mp_add_~i~0#1 % 256); 7312#L111-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7309#L107-1 assume !!(mp_add_~i~0#1 % 256 < 4); 7306#L108 assume !(0 == mp_add_~i~0#1 % 256); 7303#L108-2 assume !(1 == mp_add_~i~0#1 % 256); 7300#L109-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := 0; 7298#L110-1 assume !(3 == mp_add_~i~0#1 % 256); 7295#L111-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7294#L107-1 assume !!(mp_add_~i~0#1 % 256 < 4); 7293#L108 assume !(0 == mp_add_~i~0#1 % 256); 7292#L108-2 assume !(1 == mp_add_~i~0#1 % 256); 7291#L109-1 assume !(2 == mp_add_~i~0#1 % 256); 7290#L110-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := 0; 7271#L111-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7331#L107-1 assume !!(mp_add_~i~0#1 % 256 < 4); 7330#L108 assume !(0 == mp_add_~i~0#1 % 256); 7329#L108-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := 0; 7277#L109-1 [2021-12-21 22:06:45,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:45,681 INFO L85 PathProgramCache]: Analyzing trace with hash 379711671, now seen corresponding path program 1 times [2021-12-21 22:06:45,681 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:45,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189812607] [2021-12-21 22:06:45,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:45,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:45,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 22:06:45,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:45,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189812607] [2021-12-21 22:06:45,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189812607] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:06:45,724 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:06:45,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 22:06:45,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18130603] [2021-12-21 22:06:45,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:45,725 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:06:45,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:45,725 INFO L85 PathProgramCache]: Analyzing trace with hash -830477736, now seen corresponding path program 2 times [2021-12-21 22:06:45,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:45,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932893090] [2021-12-21 22:06:45,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:45,725 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:06:45,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:45,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932893090] [2021-12-21 22:06:45,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932893090] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:06:45,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774406831] [2021-12-21 22:06:45,749 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 22:06:45,750 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:06:45,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:06:45,755 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:06:45,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 22:06:45,777 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 22:06:45,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 22:06:45,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:06:45,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-21 22:06:45,803 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-12-21 22:06:45,804 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 22:06:45,804 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774406831] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:06:45,804 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 22:06:45,804 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2021-12-21 22:06:45,804 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148873671] [2021-12-21 22:06:45,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:45,804 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:06:45,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:06:45,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-21 22:06:45,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-12-21 22:06:45,805 INFO L87 Difference]: Start difference. First operand 230 states and 282 transitions. cyclomatic complexity: 54 Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2021-12-21 22:06:45,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:06:45,898 INFO L93 Difference]: Finished difference Result 266 states and 318 transitions. [2021-12-21 22:06:45,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-21 22:06:45,899 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 266 states and 318 transitions. [2021-12-21 22:06:45,900 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 160 [2021-12-21 22:06:45,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 266 states to 241 states and 285 transitions. [2021-12-21 22:06:45,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 241 [2021-12-21 22:06:45,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 241 [2021-12-21 22:06:45,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 241 states and 285 transitions. [2021-12-21 22:06:45,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:06:45,901 INFO L681 BuchiCegarLoop]: Abstraction has 241 states and 285 transitions. [2021-12-21 22:06:45,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states and 285 transitions. [2021-12-21 22:06:45,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 218. [2021-12-21 22:06:45,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 218 states have (on average 1.1972477064220184) internal successors, (261), 217 states have internal predecessors, (261), 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) [2021-12-21 22:06:45,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 261 transitions. [2021-12-21 22:06:45,904 INFO L704 BuchiCegarLoop]: Abstraction has 218 states and 261 transitions. [2021-12-21 22:06:45,904 INFO L587 BuchiCegarLoop]: Abstraction has 218 states and 261 transitions. [2021-12-21 22:06:45,904 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-12-21 22:06:45,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 218 states and 261 transitions. [2021-12-21 22:06:45,905 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 137 [2021-12-21 22:06:45,905 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:06:45,905 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:06:45,906 INFO L842 BuchiCegarLoop]: 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] [2021-12-21 22:06:45,906 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:45,906 INFO L791 eck$LassoCheckResult]: Stem: 7833#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 7820#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 7810#L59 assume !(0 == mp_add_~a3~0#1 % 256); 7811#L59-1 mp_add_~nb~0#1 := 4; 7825#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 7817#L71 assume !(0 == mp_add_~b2~0#1 % 256); 7818#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 7999#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7995#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7993#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; 7991#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 7836#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 7837#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 7985#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7983#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 7980#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 7979#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 7978#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7977#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7976#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7975#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7946#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7945#L84 assume !(0 == mp_add_~i~0#1 % 256); 7944#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; 7882#L85-1 [2021-12-21 22:06:45,906 INFO L793 eck$LassoCheckResult]: Loop: 7882#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 7940#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 7934#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7931#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 7928#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 7925#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 7923#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7921#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7919#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7917#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7914#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 7906#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7902#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 7901#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8021#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8020#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 8019#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8018#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8017#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8016#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 7890#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 7871#L90 assume !(0 == mp_add_~i~0#1 % 256); 7884#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 7879#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 7869#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; 7868#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 7867#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 7866#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 7865#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7864#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 7863#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7862#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7860#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 7858#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7857#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 7856#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 7855#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 7854#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7853#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7852#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7850#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7851#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 7888#L84 assume !(0 == mp_add_~i~0#1 % 256); 7881#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; 7882#L85-1 [2021-12-21 22:06:45,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:45,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1132207432, now seen corresponding path program 1 times [2021-12-21 22:06:45,907 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:45,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085692984] [2021-12-21 22:06:45,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:45,907 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:06:45,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:45,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085692984] [2021-12-21 22:06:45,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085692984] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:06:45,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:06:45,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-21 22:06:45,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501286964] [2021-12-21 22:06:45,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:45,947 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:06:45,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:45,948 INFO L85 PathProgramCache]: Analyzing trace with hash 674297015, now seen corresponding path program 1 times [2021-12-21 22:06:45,948 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:45,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334089186] [2021-12-21 22:06:45,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:45,948 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:46,021 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 22:06:46,021 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:46,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334089186] [2021-12-21 22:06:46,022 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334089186] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:06:46,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339303187] [2021-12-21 22:06:46,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:46,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:06:46,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:06:46,023 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:06:46,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-21 22:06:46,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:46,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 22:06:46,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:06:46,147 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 37 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-21 22:06:46,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:06:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2021-12-21 22:06:46,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339303187] provided 1 perfect and 1 imperfect interpolant sequences [2021-12-21 22:06:46,249 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2021-12-21 22:06:46,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2021-12-21 22:06:46,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352805984] [2021-12-21 22:06:46,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:46,250 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:06:46,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:06:46,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 22:06:46,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-21 22:06:46,250 INFO L87 Difference]: Start difference. First operand 218 states and 261 transitions. cyclomatic complexity: 45 Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:06:46,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:06:46,426 INFO L93 Difference]: Finished difference Result 595 states and 701 transitions. [2021-12-21 22:06:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 22:06:46,427 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 595 states and 701 transitions. [2021-12-21 22:06:46,429 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 411 [2021-12-21 22:06:46,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 595 states to 595 states and 701 transitions. [2021-12-21 22:06:46,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 595 [2021-12-21 22:06:46,431 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 595 [2021-12-21 22:06:46,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 595 states and 701 transitions. [2021-12-21 22:06:46,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:06:46,432 INFO L681 BuchiCegarLoop]: Abstraction has 595 states and 701 transitions. [2021-12-21 22:06:46,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states and 701 transitions. [2021-12-21 22:06:46,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 218. [2021-12-21 22:06:46,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 218 states have (on average 1.1972477064220184) internal successors, (261), 217 states have internal predecessors, (261), 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) [2021-12-21 22:06:46,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 261 transitions. [2021-12-21 22:06:46,436 INFO L704 BuchiCegarLoop]: Abstraction has 218 states and 261 transitions. [2021-12-21 22:06:46,437 INFO L587 BuchiCegarLoop]: Abstraction has 218 states and 261 transitions. [2021-12-21 22:06:46,437 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-12-21 22:06:46,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 218 states and 261 transitions. [2021-12-21 22:06:46,438 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 137 [2021-12-21 22:06:46,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:06:46,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:06:46,438 INFO L842 BuchiCegarLoop]: 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] [2021-12-21 22:06:46,438 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:46,438 INFO L791 eck$LassoCheckResult]: Stem: 8923#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 8910#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 8894#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 8896#L61 assume !(0 == mp_add_~a2~0#1 % 256); 8897#L59-1 mp_add_~nb~0#1 := 4; 8918#L69 assume !(0 == mp_add_~b3~0#1 % 256); 8919#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 9095#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 9094#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 9093#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 9091#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; 9090#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 9087#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 8901#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 8902#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 8903#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 8916#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8917#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8930#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8931#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8925#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8926#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 8935#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 9092#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 9039#L95-1 [2021-12-21 22:06:46,438 INFO L793 eck$LassoCheckResult]: Loop: 9039#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 9089#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 9074#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 9071#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 9069#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 9067#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 9065#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 9017#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 9007#L90 assume !(0 == mp_add_~i~0#1 % 256); 9058#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 9009#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; 9005#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 9003#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 9001#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8999#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8989#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 8990#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8982#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8983#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8973#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8972#L84 assume !(0 == mp_add_~i~0#1 % 256); 8970#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 8969#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 8967#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; 8964#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8961#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 8960#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8959#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8958#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8957#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 8956#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8955#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8953#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 8950#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8949#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 8948#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8947#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8946#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8945#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8944#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8942#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8943#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 8988#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 9061#L90 assume !(0 == mp_add_~i~0#1 % 256); 9059#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; 9048#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 9042#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 9038#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 9039#L95-1 [2021-12-21 22:06:46,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:46,439 INFO L85 PathProgramCache]: Analyzing trace with hash -157875573, now seen corresponding path program 1 times [2021-12-21 22:06:46,439 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:46,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725782279] [2021-12-21 22:06:46,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:46,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:06:46,496 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:46,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725782279] [2021-12-21 22:06:46,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725782279] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:06:46,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5753782] [2021-12-21 22:06:46,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:46,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:06:46,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:06:46,499 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:06:46,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-21 22:06:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:46,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-21 22:06:46,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:06:46,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:06:46,746 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 22:06:46,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5753782] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:06:46,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 22:06:46,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2021-12-21 22:06:46,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46944280] [2021-12-21 22:06:46,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:46,747 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:06:46,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:46,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1053030511, now seen corresponding path program 1 times [2021-12-21 22:06:46,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:46,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033246743] [2021-12-21 22:06:46,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:46,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 22:06:46,792 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:46,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033246743] [2021-12-21 22:06:46,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033246743] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:06:46,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107975129] [2021-12-21 22:06:46,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:46,792 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:06:46,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:06:46,793 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:06:46,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-12-21 22:06:46,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:46,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-21 22:06:46,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:06:59,205 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-12-21 22:06:59,205 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 22:06:59,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107975129] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:06:59,206 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 22:06:59,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2021-12-21 22:06:59,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560296932] [2021-12-21 22:06:59,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:59,206 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:06:59,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:06:59,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 22:06:59,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-12-21 22:06:59,207 INFO L87 Difference]: Start difference. First operand 218 states and 261 transitions. cyclomatic complexity: 45 Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:06:59,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:06:59,466 INFO L93 Difference]: Finished difference Result 471 states and 547 transitions. [2021-12-21 22:06:59,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-21 22:06:59,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 471 states and 547 transitions. [2021-12-21 22:06:59,468 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 290 [2021-12-21 22:06:59,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 471 states to 471 states and 547 transitions. [2021-12-21 22:06:59,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 471 [2021-12-21 22:06:59,470 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 471 [2021-12-21 22:06:59,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 547 transitions. [2021-12-21 22:06:59,470 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:06:59,470 INFO L681 BuchiCegarLoop]: Abstraction has 471 states and 547 transitions. [2021-12-21 22:06:59,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 547 transitions. [2021-12-21 22:06:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 399. [2021-12-21 22:06:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 399 states have (on average 1.1804511278195489) internal successors, (471), 398 states have internal predecessors, (471), 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) [2021-12-21 22:06:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 471 transitions. [2021-12-21 22:06:59,475 INFO L704 BuchiCegarLoop]: Abstraction has 399 states and 471 transitions. [2021-12-21 22:06:59,475 INFO L587 BuchiCegarLoop]: Abstraction has 399 states and 471 transitions. [2021-12-21 22:06:59,475 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-12-21 22:06:59,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 399 states and 471 transitions. [2021-12-21 22:06:59,476 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 266 [2021-12-21 22:06:59,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:06:59,477 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:06:59,477 INFO L842 BuchiCegarLoop]: 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] [2021-12-21 22:06:59,477 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:06:59,477 INFO L791 eck$LassoCheckResult]: Stem: 9840#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 9828#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 9812#L59 assume !(0 == mp_add_~a3~0#1 % 256); 9813#L59-1 mp_add_~nb~0#1 := 4; 9833#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 9823#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 9825#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 9856#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 10087#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 10083#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 10078#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; 10075#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 10073#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 10070#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 10066#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 10062#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 10060#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 10058#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 10057#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 10056#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 10055#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 10054#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 9976#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 9974#L84 assume !(0 == mp_add_~i~0#1 % 256); 9968#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; 9965#L85-1 [2021-12-21 22:06:59,477 INFO L793 eck$LassoCheckResult]: Loop: 9965#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 9962#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 9958#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 9953#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 9951#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 9949#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 9947#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 9942#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 9943#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 9932#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 9933#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 9926#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 9922#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 9918#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 9919#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 9914#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 9915#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 9907#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 9908#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 9899#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 9898#L84 assume !(0 == mp_add_~i~0#1 % 256); 9897#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 9896#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 9895#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; 9893#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 9888#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 9889#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 9884#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 9885#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 9880#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 9881#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 9876#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 9877#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 10004#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 9999#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 10000#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 9988#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 9985#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 9986#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 9981#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 9979#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 9973#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 9939#L84 assume !(0 == mp_add_~i~0#1 % 256); 9940#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; 9965#L85-1 [2021-12-21 22:06:59,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:59,478 INFO L85 PathProgramCache]: Analyzing trace with hash 81994750, now seen corresponding path program 1 times [2021-12-21 22:06:59,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:59,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638725599] [2021-12-21 22:06:59,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:59,478 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:59,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:59,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:06:59,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:59,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638725599] [2021-12-21 22:06:59,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638725599] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:06:59,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:06:59,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 22:06:59,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583469500] [2021-12-21 22:06:59,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:59,583 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:06:59,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:06:59,583 INFO L85 PathProgramCache]: Analyzing trace with hash -862809449, now seen corresponding path program 1 times [2021-12-21 22:06:59,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:06:59,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719125968] [2021-12-21 22:06:59,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:06:59,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:06:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:06:59,657 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 22:06:59,657 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:06:59,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719125968] [2021-12-21 22:06:59,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719125968] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:06:59,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:06:59,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 22:06:59,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427122741] [2021-12-21 22:06:59,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:06:59,658 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:06:59,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:06:59,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 22:06:59,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 22:06:59,658 INFO L87 Difference]: Start difference. First operand 399 states and 471 transitions. cyclomatic complexity: 75 Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:07:00,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:07:00,386 INFO L93 Difference]: Finished difference Result 782 states and 916 transitions. [2021-12-21 22:07:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 22:07:00,387 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 782 states and 916 transitions. [2021-12-21 22:07:00,390 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 546 [2021-12-21 22:07:00,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 782 states to 782 states and 916 transitions. [2021-12-21 22:07:00,393 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 782 [2021-12-21 22:07:00,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 782 [2021-12-21 22:07:00,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 782 states and 916 transitions. [2021-12-21 22:07:00,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:07:00,394 INFO L681 BuchiCegarLoop]: Abstraction has 782 states and 916 transitions. [2021-12-21 22:07:00,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states and 916 transitions. [2021-12-21 22:07:00,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 388. [2021-12-21 22:07:00,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 388 states have (on average 1.1804123711340206) internal successors, (458), 387 states have internal predecessors, (458), 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) [2021-12-21 22:07:00,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 458 transitions. [2021-12-21 22:07:00,399 INFO L704 BuchiCegarLoop]: Abstraction has 388 states and 458 transitions. [2021-12-21 22:07:00,399 INFO L587 BuchiCegarLoop]: Abstraction has 388 states and 458 transitions. [2021-12-21 22:07:00,399 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-12-21 22:07:00,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 388 states and 458 transitions. [2021-12-21 22:07:00,400 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 266 [2021-12-21 22:07:00,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:07:00,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:07:00,401 INFO L842 BuchiCegarLoop]: 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] [2021-12-21 22:07:00,401 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:07:00,401 INFO L791 eck$LassoCheckResult]: Stem: 11043#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 11031#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 11021#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 11023#L61 assume !(0 == mp_add_~a2~0#1 % 256); 11024#L59-1 mp_add_~nb~0#1 := 4; 11036#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 11345#L71 assume !(0 == mp_add_~b2~0#1 % 256); 11402#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 11401#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 11400#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 11399#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 11387#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; 11056#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 11016#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 11017#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 11018#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 11383#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 11398#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 11377#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 11373#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 11369#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 11365#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 11361#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 11162#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 11356#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 11130#L95-1 [2021-12-21 22:07:00,401 INFO L793 eck$LassoCheckResult]: Loop: 11130#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 11159#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 11156#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 11154#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 11153#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 11152#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 11151#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 11118#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 11102#L90 assume !(0 == mp_add_~i~0#1 % 256); 11108#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 11104#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; 11100#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 11097#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 11096#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 11095#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 11094#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 11093#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 11092#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 11091#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 11087#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 11088#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 11082#L90 assume !(0 == mp_add_~i~0#1 % 256); 11090#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 11089#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 11080#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; 11079#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 11078#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 11077#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 11076#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 11075#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 11074#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 11073#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 11072#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 11069#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 11070#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 11353#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 11064#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 11063#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 11062#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 11060#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 11061#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 11150#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 11147#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 11112#L90 assume !(0 == mp_add_~i~0#1 % 256); 11113#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; 11135#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 11132#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 11129#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 11130#L95-1 [2021-12-21 22:07:00,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:00,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1619386274, now seen corresponding path program 1 times [2021-12-21 22:07:00,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:00,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635573236] [2021-12-21 22:07:00,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:00,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:00,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:07:00,487 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:07:00,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635573236] [2021-12-21 22:07:00,487 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635573236] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:07:00,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545729201] [2021-12-21 22:07:00,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:00,488 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:07:00,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:00,489 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:07:00,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-12-21 22:07:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:00,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-21 22:07:00,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:07:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:07:00,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 22:07:00,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545729201] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:07:00,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 22:07:00,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2021-12-21 22:07:00,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170182692] [2021-12-21 22:07:00,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:07:00,589 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:07:00,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:00,589 INFO L85 PathProgramCache]: Analyzing trace with hash -358433971, now seen corresponding path program 1 times [2021-12-21 22:07:00,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:00,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892027171] [2021-12-21 22:07:00,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:00,589 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:00,650 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 36 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:07:00,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:07:00,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892027171] [2021-12-21 22:07:00,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892027171] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:07:00,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751409859] [2021-12-21 22:07:00,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:00,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:07:00,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:00,652 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:07:00,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-12-21 22:07:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:00,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 22:07:00,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:07:00,895 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 47 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-21 22:07:00,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:07:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 47 proven. 11 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-21 22:07:01,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751409859] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:07:01,083 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:07:01,083 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2021-12-21 22:07:01,083 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296006792] [2021-12-21 22:07:01,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:07:01,084 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:07:01,084 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:07:01,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-21 22:07:01,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-21 22:07:01,085 INFO L87 Difference]: Start difference. First operand 388 states and 458 transitions. cyclomatic complexity: 73 Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 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) [2021-12-21 22:07:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:07:01,341 INFO L93 Difference]: Finished difference Result 1091 states and 1250 transitions. [2021-12-21 22:07:01,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 22:07:01,342 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1091 states and 1250 transitions. [2021-12-21 22:07:01,351 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 781 [2021-12-21 22:07:01,354 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1091 states to 1031 states and 1184 transitions. [2021-12-21 22:07:01,354 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1031 [2021-12-21 22:07:01,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1031 [2021-12-21 22:07:01,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1031 states and 1184 transitions. [2021-12-21 22:07:01,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:07:01,356 INFO L681 BuchiCegarLoop]: Abstraction has 1031 states and 1184 transitions. [2021-12-21 22:07:01,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states and 1184 transitions. [2021-12-21 22:07:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 617. [2021-12-21 22:07:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 617 states have (on average 1.173419773095624) internal successors, (724), 616 states have internal predecessors, (724), 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) [2021-12-21 22:07:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 724 transitions. [2021-12-21 22:07:01,364 INFO L704 BuchiCegarLoop]: Abstraction has 617 states and 724 transitions. [2021-12-21 22:07:01,364 INFO L587 BuchiCegarLoop]: Abstraction has 617 states and 724 transitions. [2021-12-21 22:07:01,364 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-12-21 22:07:01,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 617 states and 724 transitions. [2021-12-21 22:07:01,365 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 457 [2021-12-21 22:07:01,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:07:01,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:07:01,368 INFO L842 BuchiCegarLoop]: 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] [2021-12-21 22:07:01,368 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:07:01,368 INFO L791 eck$LassoCheckResult]: Stem: 12903#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 12892#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 12882#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 12884#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 12885#L63 assume !(0 == mp_add_~a1~0#1 % 256); 12886#L59-1 mp_add_~nb~0#1 := 4; 13029#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 13028#L71 assume !(0 == mp_add_~b2~0#1 % 256); 13026#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 13025#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 13023#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 13024#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 13150#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; 13149#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 13148#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 13147#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 13145#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 13144#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 13143#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 13142#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 13141#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 13140#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 13139#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 13132#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 13130#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 13129#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 12980#L95-1 [2021-12-21 22:07:01,368 INFO L793 eck$LassoCheckResult]: Loop: 12980#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 13126#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 13124#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 13123#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 13122#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 13121#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 13120#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 13097#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 12965#L90 assume !(0 == mp_add_~i~0#1 % 256); 13116#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 13092#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; 13090#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 13089#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 13088#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 13087#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 13085#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 13083#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 13078#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 13079#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 13058#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 13057#L84 assume !(0 == mp_add_~i~0#1 % 256); 13056#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 13055#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 13054#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; 13052#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 13049#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 13048#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 13047#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 13046#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 13045#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 13044#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 13043#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 13041#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 13037#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 13035#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 13033#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 13006#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 13005#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 13004#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 13003#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 13000#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 13001#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 13069#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 13119#L90 assume !(0 == mp_add_~i~0#1 % 256); 13118#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; 12988#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 12989#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 12979#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 12980#L95-1 [2021-12-21 22:07:01,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:01,368 INFO L85 PathProgramCache]: Analyzing trace with hash 509264005, now seen corresponding path program 1 times [2021-12-21 22:07:01,368 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:01,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943604508] [2021-12-21 22:07:01,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:01,369 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:01,463 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:07:01,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:07:01,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943604508] [2021-12-21 22:07:01,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943604508] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:07:01,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093614191] [2021-12-21 22:07:01,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:01,463 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:07:01,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:01,465 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:07:01,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-12-21 22:07:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:01,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-21 22:07:01,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:07:01,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:07:01,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 22:07:01,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093614191] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:07:01,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 22:07:01,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 10 [2021-12-21 22:07:01,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581471066] [2021-12-21 22:07:01,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:07:01,938 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:07:01,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:01,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1053030511, now seen corresponding path program 2 times [2021-12-21 22:07:01,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:01,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553916411] [2021-12-21 22:07:01,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:01,938 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:02,005 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 40 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-12-21 22:07:02,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:07:02,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553916411] [2021-12-21 22:07:02,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553916411] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:07:02,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924785236] [2021-12-21 22:07:02,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 22:07:02,005 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:07:02,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:02,007 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:07:02,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-12-21 22:07:02,029 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 22:07:02,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 22:07:02,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 22:07:02,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:07:02,260 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-12-21 22:07:02,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 22:07:02,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924785236] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:07:02,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 22:07:02,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 10 [2021-12-21 22:07:02,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82218160] [2021-12-21 22:07:02,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:07:02,261 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:07:02,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:07:02,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 22:07:02,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-12-21 22:07:02,262 INFO L87 Difference]: Start difference. First operand 617 states and 724 transitions. cyclomatic complexity: 112 Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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) [2021-12-21 22:07:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:07:02,544 INFO L93 Difference]: Finished difference Result 1014 states and 1173 transitions. [2021-12-21 22:07:02,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 22:07:02,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1014 states and 1173 transitions. [2021-12-21 22:07:02,548 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 707 [2021-12-21 22:07:02,551 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1014 states to 1004 states and 1159 transitions. [2021-12-21 22:07:02,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1004 [2021-12-21 22:07:02,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1004 [2021-12-21 22:07:02,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1004 states and 1159 transitions. [2021-12-21 22:07:02,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:07:02,552 INFO L681 BuchiCegarLoop]: Abstraction has 1004 states and 1159 transitions. [2021-12-21 22:07:02,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states and 1159 transitions. [2021-12-21 22:07:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 904. [2021-12-21 22:07:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 904 states have (on average 1.1648230088495575) internal successors, (1053), 903 states have internal predecessors, (1053), 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) [2021-12-21 22:07:02,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1053 transitions. [2021-12-21 22:07:02,573 INFO L704 BuchiCegarLoop]: Abstraction has 904 states and 1053 transitions. [2021-12-21 22:07:02,573 INFO L587 BuchiCegarLoop]: Abstraction has 904 states and 1053 transitions. [2021-12-21 22:07:02,573 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-12-21 22:07:02,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 904 states and 1053 transitions. [2021-12-21 22:07:02,575 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 673 [2021-12-21 22:07:02,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:07:02,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:07:02,576 INFO L842 BuchiCegarLoop]: 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] [2021-12-21 22:07:02,576 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 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] [2021-12-21 22:07:02,576 INFO L791 eck$LassoCheckResult]: Stem: 14774#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 14761#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 14751#L59 assume !(0 == mp_add_~a3~0#1 % 256); 14752#L59-1 mp_add_~nb~0#1 := 4; 14768#L69 assume !(0 == mp_add_~b3~0#1 % 256); 14769#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 15442#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 15441#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 15440#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; 15439#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 15438#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 15437#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 15436#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 15434#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; 15432#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 15430#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 15428#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 15427#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 15426#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 15425#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 15424#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 15422#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 15421#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 15420#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 15419#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 15418#L84 assume !(0 == mp_add_~i~0#1 % 256); 15340#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; 15328#L85-1 [2021-12-21 22:07:02,576 INFO L793 eck$LassoCheckResult]: Loop: 15328#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 15337#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 15335#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 15333#L90 assume !(0 == mp_add_~i~0#1 % 256); 15324#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; 15317#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 15310#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 15307#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 15304#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 15301#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 15299#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 15297#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 15295#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 15292#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 15290#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 15291#L84 assume !(0 == mp_add_~i~0#1 % 256); 15287#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 15286#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; 15232#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 15233#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 15219#L90 assume !(0 == mp_add_~i~0#1 % 256); 15220#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 15191#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; 15192#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 15181#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 15179#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 15180#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 15176#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 15174#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 15175#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 15170#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 15171#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 14845#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 14846#L90 assume !(0 == mp_add_~i~0#1 % 256); 14834#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 14835#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 14826#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; 14827#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 15416#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 15435#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 15433#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 15431#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 15429#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 15341#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 15322#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 15315#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 15309#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 15306#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 15303#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 15300#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 15298#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 15296#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 15293#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 15294#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 15288#L84 assume !(0 == mp_add_~i~0#1 % 256); 15289#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; 15328#L85-1 [2021-12-21 22:07:02,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:02,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1153533403, now seen corresponding path program 1 times [2021-12-21 22:07:02,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:02,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022957331] [2021-12-21 22:07:02,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:02,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:02,583 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:07:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:02,590 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:07:02,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:02,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1302824967, now seen corresponding path program 1 times [2021-12-21 22:07:02,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:02,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472797545] [2021-12-21 22:07:02,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:02,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:07:02,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:07:02,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472797545] [2021-12-21 22:07:02,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472797545] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:07:02,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520100613] [2021-12-21 22:07:02,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:02,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:07:02,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:02,650 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:07:02,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-12-21 22:07:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:02,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 22:07:02,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:07:02,878 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-21 22:07:02,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:07:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 45 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-21 22:07:03,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520100613] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:07:03,059 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:07:03,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2021-12-21 22:07:03,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144578032] [2021-12-21 22:07:03,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:07:03,059 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:07:03,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:07:03,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 22:07:03,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-21 22:07:03,060 INFO L87 Difference]: Start difference. First operand 904 states and 1053 transitions. cyclomatic complexity: 156 Second operand has 14 states, 13 states have (on average 9.538461538461538) internal successors, (124), 14 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) [2021-12-21 22:07:05,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:07:05,255 INFO L93 Difference]: Finished difference Result 2241 states and 2551 transitions. [2021-12-21 22:07:05,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-12-21 22:07:05,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2241 states and 2551 transitions. [2021-12-21 22:07:05,263 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1731 [2021-12-21 22:07:05,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2241 states to 2114 states and 2418 transitions. [2021-12-21 22:07:05,269 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2114 [2021-12-21 22:07:05,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2114 [2021-12-21 22:07:05,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2114 states and 2418 transitions. [2021-12-21 22:07:05,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:07:05,271 INFO L681 BuchiCegarLoop]: Abstraction has 2114 states and 2418 transitions. [2021-12-21 22:07:05,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states and 2418 transitions. [2021-12-21 22:07:05,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 1231. [2021-12-21 22:07:05,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1231 states have (on average 1.1689683184402924) internal successors, (1439), 1230 states have internal predecessors, (1439), 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) [2021-12-21 22:07:05,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1439 transitions. [2021-12-21 22:07:05,294 INFO L704 BuchiCegarLoop]: Abstraction has 1231 states and 1439 transitions. [2021-12-21 22:07:05,294 INFO L587 BuchiCegarLoop]: Abstraction has 1231 states and 1439 transitions. [2021-12-21 22:07:05,294 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-12-21 22:07:05,294 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1231 states and 1439 transitions. [2021-12-21 22:07:05,297 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 960 [2021-12-21 22:07:05,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:07:05,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:07:05,297 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:07:05,298 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:07:05,298 INFO L791 eck$LassoCheckResult]: Stem: 18373#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 18360#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 18350#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 18352#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 18353#L63 assume !(0 == mp_add_~a1~0#1 % 256); 18354#L59-1 mp_add_~nb~0#1 := 4; 18367#L69 assume !(0 == mp_add_~b3~0#1 % 256); 18368#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 19459#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 19460#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 19514#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 19512#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; 19513#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 19523#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 19522#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 19521#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 19520#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 19518#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 19519#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 19554#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 19553#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 19552#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 19536#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 19533#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 19531#L90 assume !(0 == mp_add_~i~0#1 % 256); 19528#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; 19527#L91-1 [2021-12-21 22:07:05,298 INFO L793 eck$LassoCheckResult]: Loop: 19527#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 19526#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 19525#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 19524#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 19517#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 19516#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 19515#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18381#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18374#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18375#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 18362#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 18392#L90 assume !(0 == mp_add_~i~0#1 % 256); 18389#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 18390#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; 18346#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 18347#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 18345#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 18366#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 18355#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 18356#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18380#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 19509#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 19447#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 19395#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 19249#L90 assume !(0 == mp_add_~i~0#1 % 256); 19394#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 18424#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 18425#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; 19167#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 19166#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 19164#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 19165#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 19376#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 19160#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 19158#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 19159#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 19366#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 19358#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 19356#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 19354#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 19331#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 19328#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 19329#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 19312#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 19313#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 19534#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 19532#L90 assume !(0 == mp_add_~i~0#1 % 256); 19529#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; 19527#L91-1 [2021-12-21 22:07:05,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:05,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2064453638, now seen corresponding path program 1 times [2021-12-21 22:07:05,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:05,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648510611] [2021-12-21 22:07:05,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:05,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 22:07:05,365 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:07:05,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648510611] [2021-12-21 22:07:05,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648510611] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:07:05,365 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:07:05,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 22:07:05,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616429604] [2021-12-21 22:07:05,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:07:05,366 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:07:05,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:05,366 INFO L85 PathProgramCache]: Analyzing trace with hash -887189259, now seen corresponding path program 2 times [2021-12-21 22:07:05,366 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:05,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114506427] [2021-12-21 22:07:05,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:05,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:05,416 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 35 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:07:05,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:07:05,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114506427] [2021-12-21 22:07:05,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114506427] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:07:05,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1125200584] [2021-12-21 22:07:05,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 22:07:05,416 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:07:05,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:05,420 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:07:05,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-12-21 22:07:05,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 22:07:05,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 22:07:05,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 22:07:05,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:07:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-12-21 22:07:05,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 22:07:05,620 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1125200584] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:07:05,620 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 22:07:05,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2021-12-21 22:07:05,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318280645] [2021-12-21 22:07:05,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:07:05,621 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:07:05,621 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:07:05,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 22:07:05,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-21 22:07:05,621 INFO L87 Difference]: Start difference. First operand 1231 states and 1439 transitions. cyclomatic complexity: 215 Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 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) [2021-12-21 22:07:06,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:07:06,078 INFO L93 Difference]: Finished difference Result 2423 states and 2830 transitions. [2021-12-21 22:07:06,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-21 22:07:06,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2423 states and 2830 transitions. [2021-12-21 22:07:06,092 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 1932 [2021-12-21 22:07:06,102 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2423 states to 2423 states and 2830 transitions. [2021-12-21 22:07:06,102 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2423 [2021-12-21 22:07:06,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2423 [2021-12-21 22:07:06,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2423 states and 2830 transitions. [2021-12-21 22:07:06,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:07:06,106 INFO L681 BuchiCegarLoop]: Abstraction has 2423 states and 2830 transitions. [2021-12-21 22:07:06,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states and 2830 transitions. [2021-12-21 22:07:06,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 1244. [2021-12-21 22:07:06,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 1244 states have (on average 1.1696141479099678) internal successors, (1455), 1243 states have internal predecessors, (1455), 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) [2021-12-21 22:07:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 1455 transitions. [2021-12-21 22:07:06,127 INFO L704 BuchiCegarLoop]: Abstraction has 1244 states and 1455 transitions. [2021-12-21 22:07:06,128 INFO L587 BuchiCegarLoop]: Abstraction has 1244 states and 1455 transitions. [2021-12-21 22:07:06,128 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-12-21 22:07:06,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1244 states and 1455 transitions. [2021-12-21 22:07:06,140 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 960 [2021-12-21 22:07:06,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:07:06,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:07:06,142 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:07:06,142 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:07:06,142 INFO L791 eck$LassoCheckResult]: Stem: 22188#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 22177#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 22166#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 22168#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 22169#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 22170#L59-1 mp_add_~nb~0#1 := 4; 22472#L69 assume !(0 == mp_add_~b3~0#1 % 256); 22473#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 23308#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23306#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23305#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23304#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; 23303#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 23302#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 23301#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 23300#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 23299#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 23298#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23297#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23296#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23295#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23294#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23287#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23284#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23281#L90 assume !(0 == mp_add_~i~0#1 % 256); 23278#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; 23276#L91-1 [2021-12-21 22:07:06,142 INFO L793 eck$LassoCheckResult]: Loop: 23276#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 23274#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 23272#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 23270#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23268#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 23266#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23264#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23262#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23259#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23254#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23253#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23252#L90 assume !(0 == mp_add_~i~0#1 % 256); 23251#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 23249#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; 23247#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 23246#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 23091#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23245#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23244#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 23243#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23242#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23241#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23240#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23239#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 22245#L90 assume !(0 == mp_add_~i~0#1 % 256); 22246#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 22241#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 22242#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; 22234#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 22235#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 22230#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 22231#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 22226#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 22227#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 22222#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 22223#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23214#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 23206#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 23207#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 23202#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 23203#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 23198#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 23199#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23194#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23195#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 23285#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 23282#L90 assume !(0 == mp_add_~i~0#1 % 256); 23279#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; 23276#L91-1 [2021-12-21 22:07:06,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:06,144 INFO L85 PathProgramCache]: Analyzing trace with hash 2011658940, now seen corresponding path program 1 times [2021-12-21 22:07:06,144 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:06,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277264109] [2021-12-21 22:07:06,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:06,145 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-21 22:07:06,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:07:06,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277264109] [2021-12-21 22:07:06,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277264109] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:07:06,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:07:06,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-21 22:07:06,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262437774] [2021-12-21 22:07:06,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:07:06,231 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:07:06,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:06,232 INFO L85 PathProgramCache]: Analyzing trace with hash -887189259, now seen corresponding path program 3 times [2021-12-21 22:07:06,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:06,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207279697] [2021-12-21 22:07:06,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:06,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 35 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:07:06,286 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:07:06,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207279697] [2021-12-21 22:07:06,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207279697] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:07:06,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620129359] [2021-12-21 22:07:06,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-21 22:07:06,286 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:07:06,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:06,287 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:07:06,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-21 22:07:06,316 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-12-21 22:07:06,316 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 22:07:06,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 22:07:06,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:07:06,541 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2021-12-21 22:07:06,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-21 22:07:06,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620129359] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:07:06,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-21 22:07:06,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2021-12-21 22:07:06,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036760757] [2021-12-21 22:07:06,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:07:06,542 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:07:06,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:07:06,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-21 22:07:06,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-21 22:07:06,542 INFO L87 Difference]: Start difference. First operand 1244 states and 1455 transitions. cyclomatic complexity: 218 Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-21 22:07:07,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:07:07,134 INFO L93 Difference]: Finished difference Result 2377 states and 2778 transitions. [2021-12-21 22:07:07,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-21 22:07:07,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2377 states and 2778 transitions. [2021-12-21 22:07:07,146 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 1932 [2021-12-21 22:07:07,152 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2377 states to 2377 states and 2778 transitions. [2021-12-21 22:07:07,153 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2377 [2021-12-21 22:07:07,153 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2377 [2021-12-21 22:07:07,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2377 states and 2778 transitions. [2021-12-21 22:07:07,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:07:07,155 INFO L681 BuchiCegarLoop]: Abstraction has 2377 states and 2778 transitions. [2021-12-21 22:07:07,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states and 2778 transitions. [2021-12-21 22:07:07,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1185. [2021-12-21 22:07:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1185 states, 1185 states have (on average 1.1704641350210971) internal successors, (1387), 1184 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) [2021-12-21 22:07:07,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1387 transitions. [2021-12-21 22:07:07,172 INFO L704 BuchiCegarLoop]: Abstraction has 1185 states and 1387 transitions. [2021-12-21 22:07:07,172 INFO L587 BuchiCegarLoop]: Abstraction has 1185 states and 1387 transitions. [2021-12-21 22:07:07,172 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-12-21 22:07:07,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1185 states and 1387 transitions. [2021-12-21 22:07:07,174 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 960 [2021-12-21 22:07:07,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:07:07,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:07:07,175 INFO L842 BuchiCegarLoop]: 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, 1, 1, 1] [2021-12-21 22:07:07,175 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:07:07,175 INFO L791 eck$LassoCheckResult]: Stem: 25977#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 25964#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 25954#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 25956#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 25957#L63 assume !(0 == mp_add_~a1~0#1 % 256); 25958#L59-1 mp_add_~nb~0#1 := 4; 25971#L69 assume !(0 == mp_add_~b3~0#1 % 256); 25972#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 27060#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 27059#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 27058#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; 27057#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 27056#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 27055#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 27054#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 27053#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; 27052#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 27051#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 27050#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 27049#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 27048#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 27047#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 27046#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 27044#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 27042#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 27040#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 27037#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 27035#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 27033#L90 assume !(0 == mp_add_~i~0#1 % 256); 27031#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; 27029#L91-1 [2021-12-21 22:07:07,175 INFO L793 eck$LassoCheckResult]: Loop: 27029#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 27027#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 27025#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 27023#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 27021#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 27017#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 27018#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 27012#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 27010#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 27008#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 27007#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 27005#L90 assume !(0 == mp_add_~i~0#1 % 256); 27002#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26999#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; 26998#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 26997#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 26841#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26996#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26995#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 26994#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26993#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26992#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 26991#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26990#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 26040#L90 assume !(0 == mp_add_~i~0#1 % 256); 26041#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 26036#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 26037#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; 26029#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 26030#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26025#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26026#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26021#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 26022#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26017#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 26018#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26964#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 26959#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 26954#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 26955#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 26950#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 26951#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 26946#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 26947#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 26882#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 26883#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 27003#L90 assume !(0 == mp_add_~i~0#1 % 256); 27004#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; 27029#L91-1 [2021-12-21 22:07:07,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:07,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1835553810, now seen corresponding path program 1 times [2021-12-21 22:07:07,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:07,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354891975] [2021-12-21 22:07:07,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:07,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:07,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:07:07,306 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:07:07,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354891975] [2021-12-21 22:07:07,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354891975] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:07:07,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223251912] [2021-12-21 22:07:07,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:07,306 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:07:07,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:07,308 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:07:07,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-12-21 22:07:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:07,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-21 22:07:07,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:07:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-21 22:07:08,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:07:08,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:07:08,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223251912] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:07:08,590 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:07:08,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 14 [2021-12-21 22:07:08,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878791645] [2021-12-21 22:07:08,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:07:08,590 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:07:08,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:08,590 INFO L85 PathProgramCache]: Analyzing trace with hash -887189259, now seen corresponding path program 4 times [2021-12-21 22:07:08,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:08,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328947986] [2021-12-21 22:07:08,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:08,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:08,648 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 35 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:07:08,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:07:08,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328947986] [2021-12-21 22:07:08,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328947986] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:07:08,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227569786] [2021-12-21 22:07:08,648 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-21 22:07:08,648 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:07:08,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:08,650 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:07:08,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-12-21 22:07:08,691 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-21 22:07:08,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 22:07:08,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 22:07:08,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:07:08,879 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 22:07:08,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:07:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 22:07:09,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227569786] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:07:09,041 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:07:09,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2021-12-21 22:07:09,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080766615] [2021-12-21 22:07:09,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:07:09,041 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:07:09,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:07:09,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-21 22:07:09,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2021-12-21 22:07:09,042 INFO L87 Difference]: Start difference. First operand 1185 states and 1387 transitions. cyclomatic complexity: 209 Second operand has 15 states, 14 states have (on average 5.571428571428571) internal successors, (78), 15 states have internal predecessors, (78), 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) [2021-12-21 22:07:09,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:07:09,954 INFO L93 Difference]: Finished difference Result 2024 states and 2318 transitions. [2021-12-21 22:07:09,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-21 22:07:09,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2024 states and 2318 transitions. [2021-12-21 22:07:09,959 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 1507 [2021-12-21 22:07:09,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2024 states to 2002 states and 2294 transitions. [2021-12-21 22:07:09,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2002 [2021-12-21 22:07:09,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2002 [2021-12-21 22:07:09,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2002 states and 2294 transitions. [2021-12-21 22:07:09,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:07:09,967 INFO L681 BuchiCegarLoop]: Abstraction has 2002 states and 2294 transitions. [2021-12-21 22:07:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states and 2294 transitions. [2021-12-21 22:07:09,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1291. [2021-12-21 22:07:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1291 states, 1291 states have (on average 1.1642137877614251) internal successors, (1503), 1290 states have internal predecessors, (1503), 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) [2021-12-21 22:07:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1503 transitions. [2021-12-21 22:07:09,985 INFO L704 BuchiCegarLoop]: Abstraction has 1291 states and 1503 transitions. [2021-12-21 22:07:09,985 INFO L587 BuchiCegarLoop]: Abstraction has 1291 states and 1503 transitions. [2021-12-21 22:07:09,985 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-12-21 22:07:09,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1503 transitions. [2021-12-21 22:07:09,987 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 960 [2021-12-21 22:07:09,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:07:09,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:07:09,991 INFO L842 BuchiCegarLoop]: 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, 1, 1, 1] [2021-12-21 22:07:09,991 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:07:09,991 INFO L791 eck$LassoCheckResult]: Stem: 29686#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 29675#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 29664#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 29666#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 29667#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 29668#L59-1 mp_add_~nb~0#1 := 4; 29945#L69 assume !(0 == mp_add_~b3~0#1 % 256); 29946#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 30835#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 30834#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 30833#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; 30832#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 30831#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 30830#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 30829#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 30828#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; 30827#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 30826#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 30825#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 30824#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 30823#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 30822#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 30821#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 30820#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 30819#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 30818#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 30816#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 30817#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 30847#L90 assume !(0 == mp_add_~i~0#1 % 256); 30845#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; 30844#L91-1 [2021-12-21 22:07:09,991 INFO L793 eck$LassoCheckResult]: Loop: 30844#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 30843#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 30842#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 30841#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 30840#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 30839#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 30838#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 30837#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 30836#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 30795#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 30794#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 30793#L90 assume !(0 == mp_add_~i~0#1 % 256); 30792#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 30785#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; 30784#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 30783#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 30612#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 30782#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 30781#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 30780#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 30779#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 30777#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 30775#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 30773#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 30674#L90 assume !(0 == mp_add_~i~0#1 % 256); 30772#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 30771#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 30758#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; 30755#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 30756#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 30770#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 30769#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 30768#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 30767#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 30765#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 30763#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 30736#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 30729#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 30727#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 30728#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 30713#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 30714#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 30703#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 30704#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 30653#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 30654#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 30788#L90 assume !(0 == mp_add_~i~0#1 % 256); 30789#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; 30844#L91-1 [2021-12-21 22:07:09,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:09,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1897593424, now seen corresponding path program 1 times [2021-12-21 22:07:09,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:09,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000112622] [2021-12-21 22:07:09,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:09,992 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:10,000 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:07:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:10,009 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:07:10,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:10,009 INFO L85 PathProgramCache]: Analyzing trace with hash -887189259, now seen corresponding path program 5 times [2021-12-21 22:07:10,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:10,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546778572] [2021-12-21 22:07:10,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:10,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:10,065 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 35 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-12-21 22:07:10,065 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:07:10,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546778572] [2021-12-21 22:07:10,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546778572] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:07:10,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267636511] [2021-12-21 22:07:10,065 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2021-12-21 22:07:10,066 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:07:10,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:10,067 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:07:10,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-21 22:07:10,112 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2021-12-21 22:07:10,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 22:07:10,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-21 22:07:10,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:07:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 22:07:10,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:07:10,512 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2021-12-21 22:07:10,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267636511] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:07:10,513 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:07:10,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2021-12-21 22:07:10,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659013641] [2021-12-21 22:07:10,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:07:10,514 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-21 22:07:10,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:07:10,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 22:07:10,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2021-12-21 22:07:10,514 INFO L87 Difference]: Start difference. First operand 1291 states and 1503 transitions. cyclomatic complexity: 219 Second operand has 14 states, 13 states have (on average 7.769230769230769) internal successors, (101), 14 states have internal predecessors, (101), 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) [2021-12-21 22:07:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:07:12,368 INFO L93 Difference]: Finished difference Result 1307 states and 1482 transitions. [2021-12-21 22:07:12,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-21 22:07:12,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1307 states and 1482 transitions. [2021-12-21 22:07:12,371 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 313 [2021-12-21 22:07:12,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1307 states to 1305 states and 1453 transitions. [2021-12-21 22:07:12,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1305 [2021-12-21 22:07:12,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1305 [2021-12-21 22:07:12,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1305 states and 1453 transitions. [2021-12-21 22:07:12,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:07:12,375 INFO L681 BuchiCegarLoop]: Abstraction has 1305 states and 1453 transitions. [2021-12-21 22:07:12,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states and 1453 transitions. [2021-12-21 22:07:12,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 523. [2021-12-21 22:07:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 523 states have (on average 1.1147227533460804) internal successors, (583), 522 states have internal predecessors, (583), 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) [2021-12-21 22:07:12,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 583 transitions. [2021-12-21 22:07:12,383 INFO L704 BuchiCegarLoop]: Abstraction has 523 states and 583 transitions. [2021-12-21 22:07:12,383 INFO L587 BuchiCegarLoop]: Abstraction has 523 states and 583 transitions. [2021-12-21 22:07:12,383 INFO L425 BuchiCegarLoop]: ======== Iteration 25============ [2021-12-21 22:07:12,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 523 states and 583 transitions. [2021-12-21 22:07:12,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2021-12-21 22:07:12,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:07:12,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:07:12,385 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2021-12-21 22:07:12,385 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:07:12,385 INFO L791 eck$LassoCheckResult]: Stem: 32658#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 32648#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 32633#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 32635#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 32636#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 32637#L59-1 mp_add_~nb~0#1 := 4; 32651#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 32643#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 32645#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 32837#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 32836#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32835#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 32834#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; 32833#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 32832#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 32831#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 32830#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 32829#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; 32828#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 32827#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 32826#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 32824#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 32825#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 32820#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 32821#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32816#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32817#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32812#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32813#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 32903#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 32901#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 32898#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32897#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 32896#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32894#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32895#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32790#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32791#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 33094#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 32677#L90 assume !(0 == mp_add_~i~0#1 % 256); 32678#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 32673#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; 32674#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 33142#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 33141#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 33124#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 33122#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 33120#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 33116#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 33114#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33111#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 33108#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 32672#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 33152#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 33155#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 33154#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 33153#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 32662#L102-1 [2021-12-21 22:07:12,385 INFO L793 eck$LassoCheckResult]: Loop: 32662#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 32665#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 32992#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 32656#L84 assume !(0 == mp_add_~i~0#1 % 256); 32657#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 32661#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 32649#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 32650#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 32641#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 32642#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 32652#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 32646#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 32647#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 32662#L102-1 [2021-12-21 22:07:12,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:12,386 INFO L85 PathProgramCache]: Analyzing trace with hash -216901249, now seen corresponding path program 1 times [2021-12-21 22:07:12,386 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:12,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342596008] [2021-12-21 22:07:12,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:12,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:12,437 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-12-21 22:07:12,437 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:07:12,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342596008] [2021-12-21 22:07:12,437 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342596008] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:07:12,437 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:07:12,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-21 22:07:12,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569335154] [2021-12-21 22:07:12,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:07:12,438 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:07:12,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:12,438 INFO L85 PathProgramCache]: Analyzing trace with hash 672830572, now seen corresponding path program 1 times [2021-12-21 22:07:12,438 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:12,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007328532] [2021-12-21 22:07:12,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:12,439 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:12,441 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:07:12,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:12,443 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:07:12,546 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:07:12,546 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:07:12,547 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:07:12,547 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:07:12,547 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 22:07:12,547 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:12,547 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:07:12,547 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:07:12,547 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration25_Loop [2021-12-21 22:07:12,547 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:07:12,547 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:07:12,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:12,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:12,784 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:07:12,784 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 22:07:12,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:12,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:12,787 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) [2021-12-21 22:07:12,787 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 [2021-12-21 22:07:12,789 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:07:12,789 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:07:12,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2021-12-21 22:07:12,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:12,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:12,831 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) [2021-12-21 22:07:12,836 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 [2021-12-21 22:07:12,837 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 22:07:12,837 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:07:13,275 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 22:07:13,283 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 [2021-12-21 22:07:13,283 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:07:13,284 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:07:13,284 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:07:13,284 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:07:13,284 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:07:13,284 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:13,284 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:07:13,284 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:07:13,284 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration25_Loop [2021-12-21 22:07:13,284 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:07:13,284 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:07:13,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:13,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:13,569 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:07:13,572 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:07:13,573 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:13,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:13,574 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) [2021-12-21 22:07:13,577 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 [2021-12-21 22:07:13,591 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 [2021-12-21 22:07:13,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:13,598 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:13,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:13,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:13,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:07:13,602 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:07:13,602 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:13,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:13,631 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 [2021-12-21 22:07:13,632 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:13,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:13,633 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) [2021-12-21 22:07:13,633 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 [2021-12-21 22:07:13,634 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 [2021-12-21 22:07:13,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:13,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:13,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:13,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:13,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:07:13,647 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:07:13,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:13,663 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:13,692 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 [2021-12-21 22:07:13,693 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-12-21 22:07:13,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:13,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:13,694 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) [2021-12-21 22:07:13,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:07:13,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:13,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:13,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:13,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:13,710 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:13,712 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 [2021-12-21 22:07:13,714 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:13,714 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:13,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:13,737 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 [2021-12-21 22:07:13,738 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:13,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:13,739 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) [2021-12-21 22:07:13,739 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 [2021-12-21 22:07:13,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 [2021-12-21 22:07:13,755 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:13,755 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:13,755 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:13,755 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:13,755 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:13,757 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:13,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:13,760 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:13,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:13,787 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-12-21 22:07:13,787 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:13,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:13,788 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) [2021-12-21 22:07:13,789 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 [2021-12-21 22:07:13,790 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 [2021-12-21 22:07:13,797 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:13,797 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:13,797 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:13,797 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:13,798 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:13,801 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:13,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:13,823 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:13,839 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 [2021-12-21 22:07:13,839 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:13,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:13,840 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) [2021-12-21 22:07:13,841 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 [2021-12-21 22:07:13,842 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 [2021-12-21 22:07:13,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:13,848 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:13,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:13,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:13,849 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:13,851 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:13,851 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:13,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:13,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:13,875 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-12-21 22:07:13,875 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:13,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:13,876 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) [2021-12-21 22:07:13,877 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 [2021-12-21 22:07:13,878 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 [2021-12-21 22:07:13,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:13,884 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:13,885 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:13,885 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:13,885 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:13,890 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:13,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:13,895 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:13,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:13,911 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:13,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:13,912 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) [2021-12-21 22:07:13,913 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 [2021-12-21 22:07:13,914 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 [2021-12-21 22:07:13,920 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:13,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:13,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:13,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:13,921 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:13,923 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:13,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:13,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:13,943 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 [2021-12-21 22:07:13,943 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-12-21 22:07:13,944 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:13,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:13,944 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) [2021-12-21 22:07:13,946 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 [2021-12-21 22:07:13,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:07:13,953 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:13,953 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:13,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:13,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:13,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:13,953 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:13,956 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:13,966 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:13,987 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:14,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2021-12-21 22:07:14,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:14,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:14,005 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) [2021-12-21 22:07:14,016 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 [2021-12-21 22:07:14,022 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:14,022 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:14,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:14,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:14,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:14,023 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:14,024 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:14,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:14,028 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 [2021-12-21 22:07:14,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:14,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:14,055 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-12-21 22:07:14,055 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:14,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:14,056 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) [2021-12-21 22:07:14,057 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 [2021-12-21 22:07:14,058 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 [2021-12-21 22:07:14,065 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:14,065 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-21 22:07:14,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:14,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:14,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:14,065 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:14,070 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:14,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:14,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:14,106 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 [2021-12-21 22:07:14,107 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:14,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:14,108 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) [2021-12-21 22:07:14,109 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 [2021-12-21 22:07:14,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 [2021-12-21 22:07:14,116 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:14,116 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-21 22:07:14,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:14,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:14,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:14,116 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:14,119 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:14,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:14,135 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:14,154 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 [2021-12-21 22:07:14,155 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-12-21 22:07:14,155 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:14,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:14,159 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) [2021-12-21 22:07:14,160 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 [2021-12-21 22:07:14,161 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 [2021-12-21 22:07:14,168 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:14,169 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:14,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:14,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:14,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:14,169 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:14,176 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:14,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:14,195 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:14,219 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 [2021-12-21 22:07:14,220 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:14,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:14,221 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) [2021-12-21 22:07:14,224 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 [2021-12-21 22:07:14,230 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:14,230 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:14,230 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:14,230 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:14,230 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:14,230 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:14,235 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:14,235 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:14,242 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 [2021-12-21 22:07:14,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:14,266 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 [2021-12-21 22:07:14,266 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-12-21 22:07:14,266 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:14,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:14,267 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) [2021-12-21 22:07:14,268 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 [2021-12-21 22:07:14,269 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 [2021-12-21 22:07:14,276 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:14,276 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:14,276 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:14,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:14,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:14,277 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:14,280 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:14,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:14,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:14,316 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 [2021-12-21 22:07:14,316 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:14,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:14,317 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) [2021-12-21 22:07:14,318 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 [2021-12-21 22:07:14,319 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 [2021-12-21 22:07:14,325 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:14,325 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:14,325 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:14,325 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:14,325 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:14,325 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:14,327 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:14,327 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:14,357 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:14,376 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 [2021-12-21 22:07:14,376 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-12-21 22:07:14,376 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:14,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:14,389 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) [2021-12-21 22:07:14,390 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 [2021-12-21 22:07:14,391 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 [2021-12-21 22:07:14,398 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:14,399 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:14,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:14,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:14,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:14,399 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-21 22:07:14,405 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:07:14,405 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:14,422 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:14,439 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 [2021-12-21 22:07:14,439 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:14,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:14,449 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) [2021-12-21 22:07:14,451 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 [2021-12-21 22:07:14,451 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 [2021-12-21 22:07:14,458 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:14,458 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:14,458 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:14,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:14,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:14,458 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-21 22:07:14,461 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:07:14,461 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:14,467 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:14,483 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 [2021-12-21 22:07:14,484 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:07:14,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-21 22:07:14,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-21 22:07:14,484 INFO L87 Difference]: Start difference. First operand 523 states and 583 transitions. cyclomatic complexity: 61 Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 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) [2021-12-21 22:07:14,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:07:14,692 INFO L93 Difference]: Finished difference Result 658 states and 732 transitions. [2021-12-21 22:07:14,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-21 22:07:14,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 658 states and 732 transitions. [2021-12-21 22:07:14,694 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 37 [2021-12-21 22:07:14,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 658 states to 626 states and 692 transitions. [2021-12-21 22:07:14,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 626 [2021-12-21 22:07:14,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 626 [2021-12-21 22:07:14,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 626 states and 692 transitions. [2021-12-21 22:07:14,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:07:14,696 INFO L681 BuchiCegarLoop]: Abstraction has 626 states and 692 transitions. [2021-12-21 22:07:14,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states and 692 transitions. [2021-12-21 22:07:14,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 576. [2021-12-21 22:07:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 576 states have (on average 1.109375) internal successors, (639), 575 states have internal predecessors, (639), 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) [2021-12-21 22:07:14,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 639 transitions. [2021-12-21 22:07:14,702 INFO L704 BuchiCegarLoop]: Abstraction has 576 states and 639 transitions. [2021-12-21 22:07:14,702 INFO L587 BuchiCegarLoop]: Abstraction has 576 states and 639 transitions. [2021-12-21 22:07:14,702 INFO L425 BuchiCegarLoop]: ======== Iteration 26============ [2021-12-21 22:07:14,703 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 576 states and 639 transitions. [2021-12-21 22:07:14,703 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2021-12-21 22:07:14,704 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:07:14,704 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:07:14,704 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:07:14,704 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:07:14,704 INFO L791 eck$LassoCheckResult]: Stem: 33853#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 33844#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 33833#L59 assume !(0 == mp_add_~a3~0#1 % 256); 33834#L59-1 mp_add_~nb~0#1 := 4; 33972#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 33970#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 33969#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 33967#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 33968#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33963#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 33964#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; 33959#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 33960#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34240#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34238#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34236#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; 33949#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 33950#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 33945#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 33946#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 33941#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 33942#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34222#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34220#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34218#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 33931#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 33932#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34213#L84 assume !(0 == mp_add_~i~0#1 % 256); 34210#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; 33925#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 33926#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34189#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 34190#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 34362#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34361#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 34360#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34359#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34358#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34357#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34356#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34355#L84 assume !(0 == mp_add_~i~0#1 % 256); 34354#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34352#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; 34353#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 34385#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 34383#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 34382#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34381#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34380#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 34379#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 34377#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34374#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34373#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 34371#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 34369#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 34368#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 34403#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 34402#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 34401#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 33857#L102-1 [2021-12-21 22:07:14,704 INFO L793 eck$LassoCheckResult]: Loop: 33857#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 34400#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34378#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34376#L84 assume !(0 == mp_add_~i~0#1 % 256); 34375#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 33856#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 33845#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 33846#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 33828#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 33829#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 33848#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 33839#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 33840#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 33857#L102-1 [2021-12-21 22:07:14,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:14,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1768542192, now seen corresponding path program 1 times [2021-12-21 22:07:14,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:14,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607740737] [2021-12-21 22:07:14,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:14,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:14,816 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:07:14,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:07:14,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607740737] [2021-12-21 22:07:14,817 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607740737] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:07:14,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432144691] [2021-12-21 22:07:14,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:14,817 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:07:14,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:14,844 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:07:14,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2021-12-21 22:07:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:14,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-21 22:07:14,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:07:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-21 22:07:15,213 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:07:15,405 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-21 22:07:15,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432144691] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:07:15,405 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:07:15,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 3, 3] total 12 [2021-12-21 22:07:15,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121994881] [2021-12-21 22:07:15,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:07:15,405 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:07:15,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:15,405 INFO L85 PathProgramCache]: Analyzing trace with hash 672830572, now seen corresponding path program 2 times [2021-12-21 22:07:15,406 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:15,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892267205] [2021-12-21 22:07:15,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:15,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:15,410 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:07:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:15,413 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:07:15,519 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:07:15,519 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:07:15,519 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:07:15,519 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:07:15,519 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 22:07:15,519 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:15,519 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:07:15,519 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:07:15,519 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration26_Loop [2021-12-21 22:07:15,519 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:07:15,519 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:07:15,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:15,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:15,780 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:07:15,780 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 22:07:15,780 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:15,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:15,782 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:15,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2021-12-21 22:07:15,783 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:07:15,783 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:07:15,798 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 22:07:15,798 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Honda state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 22:07:15,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:15,822 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:15,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:15,823 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:15,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2021-12-21 22:07:15,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:07:15,828 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:07:15,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:15,886 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:15,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:15,888 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:15,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2021-12-21 22:07:15,889 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 22:07:15,889 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:07:17,960 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 22:07:17,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2021-12-21 22:07:17,965 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:07:17,965 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:07:17,965 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:07:17,966 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:07:17,966 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:07:17,966 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:17,966 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:07:17,966 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:07:17,966 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration26_Loop [2021-12-21 22:07:17,966 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:07:17,966 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:07:17,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:17,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:18,212 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:07:18,212 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:07:18,213 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:18,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:18,214 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:18,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2021-12-21 22:07:18,216 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 [2021-12-21 22:07:18,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:18,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:18,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:18,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:18,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:07:18,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:07:18,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:18,231 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:18,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:18,250 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:18,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:18,251 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:18,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2021-12-21 22:07:18,254 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 [2021-12-21 22:07:18,260 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:18,260 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:18,260 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:18,260 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:18,260 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:07:18,262 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:07:18,262 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:18,264 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:18,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2021-12-21 22:07:18,280 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-12-21 22:07:18,280 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:18,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:18,281 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:18,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2021-12-21 22:07:18,283 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 [2021-12-21 22:07:18,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:18,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:18,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:18,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:18,289 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:18,290 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:18,290 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:18,292 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:18,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2021-12-21 22:07:18,311 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:18,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:18,312 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:18,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2021-12-21 22:07:18,314 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 [2021-12-21 22:07:18,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:18,320 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:18,320 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:18,320 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:18,320 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:18,323 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:18,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:18,326 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:18,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2021-12-21 22:07:18,342 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-12-21 22:07:18,342 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:18,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:18,343 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:18,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2021-12-21 22:07:18,345 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 [2021-12-21 22:07:18,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:18,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:18,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:18,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:18,352 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:18,354 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:18,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:18,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:18,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2021-12-21 22:07:18,375 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:18,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:18,376 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:18,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2021-12-21 22:07:18,378 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 [2021-12-21 22:07:18,385 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:18,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:18,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:18,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:18,385 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:18,388 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:18,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:18,392 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:18,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2021-12-21 22:07:18,408 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-12-21 22:07:18,408 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:18,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:18,409 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:18,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2021-12-21 22:07:18,411 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 [2021-12-21 22:07:18,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:18,418 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:18,418 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:18,418 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:18,418 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:18,420 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:18,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:18,430 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:18,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2021-12-21 22:07:18,445 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:18,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:18,446 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) [2021-12-21 22:07:18,446 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 [2021-12-21 22:07:18,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:07:18,454 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:18,454 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:18,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:18,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:18,455 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:18,459 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:18,459 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:18,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:18,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2021-12-21 22:07:18,485 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-12-21 22:07:18,485 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:18,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:18,486 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) [2021-12-21 22:07:18,487 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 [2021-12-21 22:07:18,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 [2021-12-21 22:07:18,495 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:18,495 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:18,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:18,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:18,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:18,495 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:18,498 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:18,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:18,509 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:18,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:18,525 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:18,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:18,526 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) [2021-12-21 22:07:18,531 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 [2021-12-21 22:07:18,538 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:18,538 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:18,538 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:18,539 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:18,539 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:18,539 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:18,542 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:18,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:18,550 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:18,551 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 [2021-12-21 22:07:18,567 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 [2021-12-21 22:07:18,567 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-12-21 22:07:18,567 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:18,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:18,568 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) [2021-12-21 22:07:18,569 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 [2021-12-21 22:07:18,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:07:18,578 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:18,578 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-21 22:07:18,578 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:18,578 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:18,578 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:18,578 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:18,581 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:18,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:18,592 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:18,609 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 [2021-12-21 22:07:18,609 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:18,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:18,616 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) [2021-12-21 22:07:18,619 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 [2021-12-21 22:07:18,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 [2021-12-21 22:07:18,628 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:18,628 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-21 22:07:18,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:18,628 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:18,628 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:18,628 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:18,632 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:18,632 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:18,651 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:18,669 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 [2021-12-21 22:07:18,669 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-12-21 22:07:18,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:18,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:18,670 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) [2021-12-21 22:07:18,677 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 [2021-12-21 22:07:18,683 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:18,683 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:18,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:18,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:18,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:18,684 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:18,687 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:18,687 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:18,695 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 [2021-12-21 22:07:18,699 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:18,716 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 [2021-12-21 22:07:18,716 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:18,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:18,720 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) [2021-12-21 22:07:18,722 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 [2021-12-21 22:07:18,723 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 [2021-12-21 22:07:18,731 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:18,731 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:18,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:18,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:18,731 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:18,731 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:18,736 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:18,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:18,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:18,769 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 [2021-12-21 22:07:18,770 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-12-21 22:07:18,770 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:18,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:18,776 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) [2021-12-21 22:07:18,784 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 [2021-12-21 22:07:18,791 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:18,791 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:18,791 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:18,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:18,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:18,791 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:18,793 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:18,793 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:18,795 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 [2021-12-21 22:07:18,807 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:18,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:18,824 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:18,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:18,826 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) [2021-12-21 22:07:18,827 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 [2021-12-21 22:07:18,828 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:07:18,835 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:18,835 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:18,835 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:18,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:18,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:18,835 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:18,837 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:18,838 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:18,851 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:18,866 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 [2021-12-21 22:07:18,867 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-12-21 22:07:18,867 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:18,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:18,868 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) [2021-12-21 22:07:18,869 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 [2021-12-21 22:07:18,869 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 [2021-12-21 22:07:18,876 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:18,876 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:18,876 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:18,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:18,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:18,876 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-21 22:07:18,879 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:07:18,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:18,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:18,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:18,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:18,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:18,936 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) [2021-12-21 22:07:18,937 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 [2021-12-21 22:07:18,939 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 [2021-12-21 22:07:18,946 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:18,946 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:18,946 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:18,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:18,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:18,946 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-21 22:07:18,952 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:07:18,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:18,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:18,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:18,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:07:18,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-21 22:07:18,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-12-21 22:07:18,984 INFO L87 Difference]: Start difference. First operand 576 states and 639 transitions. cyclomatic complexity: 65 Second operand has 12 states, 12 states have (on average 10.916666666666666) internal successors, (131), 12 states have internal predecessors, (131), 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) [2021-12-21 22:07:20,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:07:20,069 INFO L93 Difference]: Finished difference Result 1067 states and 1162 transitions. [2021-12-21 22:07:20,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-12-21 22:07:20,070 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1067 states and 1162 transitions. [2021-12-21 22:07:20,072 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 101 [2021-12-21 22:07:20,075 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1067 states to 983 states and 1074 transitions. [2021-12-21 22:07:20,075 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 983 [2021-12-21 22:07:20,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 983 [2021-12-21 22:07:20,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 983 states and 1074 transitions. [2021-12-21 22:07:20,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:07:20,077 INFO L681 BuchiCegarLoop]: Abstraction has 983 states and 1074 transitions. [2021-12-21 22:07:20,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states and 1074 transitions. [2021-12-21 22:07:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 787. [2021-12-21 22:07:20,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 787 states have (on average 1.1003811944091486) internal successors, (866), 786 states have internal predecessors, (866), 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) [2021-12-21 22:07:20,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 866 transitions. [2021-12-21 22:07:20,086 INFO L704 BuchiCegarLoop]: Abstraction has 787 states and 866 transitions. [2021-12-21 22:07:20,086 INFO L587 BuchiCegarLoop]: Abstraction has 787 states and 866 transitions. [2021-12-21 22:07:20,086 INFO L425 BuchiCegarLoop]: ======== Iteration 27============ [2021-12-21 22:07:20,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 787 states and 866 transitions. [2021-12-21 22:07:20,087 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 44 [2021-12-21 22:07:20,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:07:20,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:07:20,088 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2021-12-21 22:07:20,088 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:07:20,088 INFO L791 eck$LassoCheckResult]: Stem: 35885#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 35875#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 35863#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 35865#L61 assume !(0 == mp_add_~a2~0#1 % 256); 35866#L59-1 mp_add_~nb~0#1 := 4; 35880#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 35882#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 35894#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 35895#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 36404#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 36402#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 36400#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; 36398#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 36396#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 36394#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 36392#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 36390#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; 36388#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 36386#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 36384#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 36382#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 36380#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 36378#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 36376#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 36374#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 36372#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 36370#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 36367#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 36365#L84 assume !(0 == mp_add_~i~0#1 % 256); 36363#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; 36361#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 36359#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 36354#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 36356#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 36353#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 36613#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 36612#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 36611#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 36609#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 36608#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 36344#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 36343#L84 assume !(0 == mp_add_~i~0#1 % 256); 36342#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 36340#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; 36341#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 36636#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 36634#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 36631#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 36629#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 36627#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 36625#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 36622#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 36619#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 36615#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 36616#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 36644#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 36633#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 36643#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 36642#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 36641#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 35889#L102-1 [2021-12-21 22:07:20,088 INFO L793 eck$LassoCheckResult]: Loop: 35889#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35886#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35887#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35883#L84 assume !(0 == mp_add_~i~0#1 % 256); 35884#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35888#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35876#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35877#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 35861#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 35862#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35879#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35870#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35871#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35889#L102-1 [2021-12-21 22:07:20,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:20,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1568749298, now seen corresponding path program 1 times [2021-12-21 22:07:20,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:20,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87618538] [2021-12-21 22:07:20,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:20,089 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:20,098 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:07:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:20,115 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:07:20,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:20,115 INFO L85 PathProgramCache]: Analyzing trace with hash 672830572, now seen corresponding path program 3 times [2021-12-21 22:07:20,115 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:20,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923725994] [2021-12-21 22:07:20,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:20,116 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:20,119 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:07:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:20,121 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:07:20,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:20,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1645369217, now seen corresponding path program 2 times [2021-12-21 22:07:20,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:20,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970128907] [2021-12-21 22:07:20,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:20,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-21 22:07:20,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:07:20,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970128907] [2021-12-21 22:07:20,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970128907] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:07:20,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:07:20,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 22:07:20,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630700630] [2021-12-21 22:07:20,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:07:20,337 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:07:20,337 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:07:20,337 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:07:20,337 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:07:20,337 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 22:07:20,338 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:20,338 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:07:20,338 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:07:20,338 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration27_Loop [2021-12-21 22:07:20,338 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:07:20,338 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:07:20,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:20,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:20,581 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:07:20,581 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 22:07:20,581 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:20,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:20,582 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:20,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2021-12-21 22:07:20,585 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:07:20,585 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:07:20,599 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 22:07:20,599 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Honda state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 22:07:20,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:20,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:20,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:20,615 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) [2021-12-21 22:07:20,615 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 [2021-12-21 22:07:20,617 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:07:20,617 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:07:20,679 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 [2021-12-21 22:07:20,679 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:20,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:20,693 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) [2021-12-21 22:07:20,694 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 [2021-12-21 22:07:20,695 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 22:07:20,695 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:07:21,206 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 22:07:21,211 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 [2021-12-21 22:07:21,212 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:07:21,212 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:07:21,212 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:07:21,212 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:07:21,212 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:07:21,212 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:21,212 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:07:21,212 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:07:21,212 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration27_Loop [2021-12-21 22:07:21,212 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:07:21,212 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:07:21,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:21,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:21,466 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:07:21,466 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:07:21,468 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:21,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:21,469 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) [2021-12-21 22:07:21,469 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 [2021-12-21 22:07:21,471 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 [2021-12-21 22:07:21,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:21,478 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:21,478 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:21,478 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:21,478 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:07:21,479 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:07:21,479 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:21,489 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:21,504 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 [2021-12-21 22:07:21,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:21,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:21,505 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) [2021-12-21 22:07:21,506 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 [2021-12-21 22:07:21,507 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 [2021-12-21 22:07:21,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:21,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:21,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:21,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:21,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:07:21,514 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:07:21,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:21,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:21,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:21,532 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-12-21 22:07:21,533 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:21,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:21,533 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) [2021-12-21 22:07:21,535 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 [2021-12-21 22:07:21,537 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 [2021-12-21 22:07:21,543 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:21,544 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:21,544 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:21,544 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:21,544 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:21,545 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:21,545 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:21,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:21,562 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 [2021-12-21 22:07:21,562 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:21,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:21,563 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) [2021-12-21 22:07:21,569 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 [2021-12-21 22:07:21,570 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 [2021-12-21 22:07:21,576 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:21,576 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:21,576 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:21,577 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:21,577 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:21,579 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:21,579 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:21,589 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:21,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Ended with exit code 0 [2021-12-21 22:07:21,604 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-12-21 22:07:21,604 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:21,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:21,605 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) [2021-12-21 22:07:21,607 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 [2021-12-21 22:07:21,607 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 [2021-12-21 22:07:21,614 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:21,614 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:21,615 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:21,615 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:21,615 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:21,617 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:21,617 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:21,628 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:21,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:21,644 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:21,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:21,645 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) [2021-12-21 22:07:21,646 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 [2021-12-21 22:07:21,647 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 [2021-12-21 22:07:21,654 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:21,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:21,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:21,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:21,654 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:21,658 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:21,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:21,672 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:21,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:21,696 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-12-21 22:07:21,696 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:21,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:21,697 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) [2021-12-21 22:07:21,698 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 [2021-12-21 22:07:21,699 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 [2021-12-21 22:07:21,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:21,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:21,706 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:21,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:21,706 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:21,708 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:21,708 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:21,718 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:21,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:21,735 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:21,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:21,736 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) [2021-12-21 22:07:21,738 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 [2021-12-21 22:07:21,739 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 [2021-12-21 22:07:21,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:21,746 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:21,747 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:21,747 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:21,747 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:21,751 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:21,751 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:21,765 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:21,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:21,783 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-12-21 22:07:21,783 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:21,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:21,784 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) [2021-12-21 22:07:21,785 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 [2021-12-21 22:07:21,813 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 [2021-12-21 22:07:21,820 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:21,820 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:21,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:21,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:21,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:21,820 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:21,823 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:21,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:21,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:21,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:21,860 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:21,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:21,861 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:21,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2021-12-21 22:07:21,863 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 [2021-12-21 22:07:21,870 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:21,870 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:21,870 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:21,870 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:21,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:21,870 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:21,873 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:21,873 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:21,888 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:21,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Ended with exit code 0 [2021-12-21 22:07:21,920 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-12-21 22:07:21,920 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:21,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:21,921 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) [2021-12-21 22:07:21,922 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 [2021-12-21 22:07:21,923 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 [2021-12-21 22:07:21,930 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:21,930 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-21 22:07:21,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:21,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:21,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:21,930 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:21,932 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:21,932 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:21,936 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:21,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Ended with exit code 0 [2021-12-21 22:07:21,952 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:21,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:21,953 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:21,953 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 [2021-12-21 22:07:21,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:07:21,961 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:21,961 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-21 22:07:21,961 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:21,961 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:21,961 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:21,961 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:21,965 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:21,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:21,972 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:21,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Ended with exit code 0 [2021-12-21 22:07:21,988 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-12-21 22:07:21,988 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:21,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:21,989 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) [2021-12-21 22:07:21,989 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 [2021-12-21 22:07:21,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:07:21,997 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:21,997 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:21,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:21,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:21,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:21,998 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:22,000 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:22,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:22,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:22,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Ended with exit code 0 [2021-12-21 22:07:22,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:22,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:22,023 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) [2021-12-21 22:07:22,024 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 [2021-12-21 22:07:22,025 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 [2021-12-21 22:07:22,032 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:22,032 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:22,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:22,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:22,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:22,033 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:22,037 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:22,037 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:22,052 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:22,069 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 [2021-12-21 22:07:22,069 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-12-21 22:07:22,069 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:22,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:22,070 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) [2021-12-21 22:07:22,071 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 [2021-12-21 22:07:22,072 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 [2021-12-21 22:07:22,079 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:22,079 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:22,079 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:22,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:22,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:22,079 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:22,088 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:22,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:22,099 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:22,122 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 [2021-12-21 22:07:22,122 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:22,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:22,123 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) [2021-12-21 22:07:22,124 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 [2021-12-21 22:07:22,125 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 [2021-12-21 22:07:22,132 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:22,132 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:22,132 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:22,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:22,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:22,132 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:22,135 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:22,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:22,141 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:22,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (81)] Ended with exit code 0 [2021-12-21 22:07:22,163 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-12-21 22:07:22,164 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:22,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:22,165 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) [2021-12-21 22:07:22,165 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 [2021-12-21 22:07:22,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:07:22,174 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:22,174 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:22,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:22,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:22,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:22,175 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-21 22:07:22,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:07:22,178 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:22,184 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:22,202 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 [2021-12-21 22:07:22,202 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:22,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:22,203 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) [2021-12-21 22:07:22,204 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 [2021-12-21 22:07:22,205 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 [2021-12-21 22:07:22,213 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:22,213 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:22,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:22,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:22,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:22,213 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-21 22:07:22,218 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:07:22,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:22,227 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:22,242 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 [2021-12-21 22:07:22,243 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:07:22,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 22:07:22,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-21 22:07:22,243 INFO L87 Difference]: Start difference. First operand 787 states and 866 transitions. cyclomatic complexity: 82 Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 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) [2021-12-21 22:07:22,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:07:22,567 INFO L93 Difference]: Finished difference Result 974 states and 1061 transitions. [2021-12-21 22:07:22,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 22:07:22,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 974 states and 1061 transitions. [2021-12-21 22:07:22,569 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 67 [2021-12-21 22:07:22,571 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 974 states to 943 states and 1029 transitions. [2021-12-21 22:07:22,571 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 943 [2021-12-21 22:07:22,572 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 943 [2021-12-21 22:07:22,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 943 states and 1029 transitions. [2021-12-21 22:07:22,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:07:22,572 INFO L681 BuchiCegarLoop]: Abstraction has 943 states and 1029 transitions. [2021-12-21 22:07:22,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states and 1029 transitions. [2021-12-21 22:07:22,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 784. [2021-12-21 22:07:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 784 states have (on average 1.096938775510204) internal successors, (860), 783 states have internal predecessors, (860), 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) [2021-12-21 22:07:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 860 transitions. [2021-12-21 22:07:22,581 INFO L704 BuchiCegarLoop]: Abstraction has 784 states and 860 transitions. [2021-12-21 22:07:22,581 INFO L587 BuchiCegarLoop]: Abstraction has 784 states and 860 transitions. [2021-12-21 22:07:22,581 INFO L425 BuchiCegarLoop]: ======== Iteration 28============ [2021-12-21 22:07:22,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 784 states and 860 transitions. [2021-12-21 22:07:22,583 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 44 [2021-12-21 22:07:22,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:07:22,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:07:22,583 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2021-12-21 22:07:22,583 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:07:22,583 INFO L791 eck$LassoCheckResult]: Stem: 37676#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 37665#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 37653#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 37655#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 37657#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 37658#L59-1 mp_add_~nb~0#1 := 4; 38252#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 38251#L71 assume !(0 == mp_add_~b2~0#1 % 256); 38250#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 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#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; 38246#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 38245#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 38244#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 38243#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38242#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; 38241#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 38240#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 38239#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38238#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 38237#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 38236#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38235#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38234#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38233#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38232#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38230#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 38231#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38354#L90 assume !(0 == mp_add_~i~0#1 % 256); 38353#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; 38352#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 38351#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38350#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 38349#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38348#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 38347#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38346#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38345#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38344#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38343#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 38212#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38342#L90 assume !(0 == mp_add_~i~0#1 % 256); 38341#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 38334#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; 38332#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38330#L89 assume mp_add_~partial_sum~0#1 % 65536 > 254;mp_add_~partial_sum~0#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1 % 65536, 255);mp_add_~carry~0#1 := 1; 38328#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38326#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38324#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 38322#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 38320#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38318#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 38311#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 37690#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 37691#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 38381#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38380#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 38379#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 38378#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 37681#L102-1 [2021-12-21 22:07:22,583 INFO L793 eck$LassoCheckResult]: Loop: 37681#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 37677#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 37678#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 37684#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 38410#L90 assume !(0 == mp_add_~i~0#1 % 256); 38409#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 38407#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 38408#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 38417#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 38416#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 38415#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 37660#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 37661#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 37681#L102-1 [2021-12-21 22:07:22,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:22,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1102177341, now seen corresponding path program 1 times [2021-12-21 22:07:22,584 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:22,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498986781] [2021-12-21 22:07:22,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:22,584 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:22,594 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:07:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:22,607 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:07:22,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:22,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1233229496, now seen corresponding path program 1 times [2021-12-21 22:07:22,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:22,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140986961] [2021-12-21 22:07:22,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:22,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:22,610 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:07:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:22,612 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:07:22,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:22,612 INFO L85 PathProgramCache]: Analyzing trace with hash -201701748, now seen corresponding path program 2 times [2021-12-21 22:07:22,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:22,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131642530] [2021-12-21 22:07:22,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:22,613 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2021-12-21 22:07:22,700 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:07:22,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131642530] [2021-12-21 22:07:22,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131642530] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-21 22:07:22,701 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-21 22:07:22,701 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-21 22:07:22,701 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507954424] [2021-12-21 22:07:22,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-21 22:07:22,813 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:07:22,813 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:07:22,813 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:07:22,813 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:07:22,813 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 22:07:22,813 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:22,813 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:07:22,813 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:07:22,813 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration28_Loop [2021-12-21 22:07:22,813 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:07:22,813 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:07:22,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:22,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:23,034 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:07:23,034 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 22:07:23,034 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:23,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:23,035 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) [2021-12-21 22:07:23,035 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 [2021-12-21 22:07:23,037 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:07:23,037 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:07:23,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:23,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:23,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:23,089 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) [2021-12-21 22:07:23,090 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 [2021-12-21 22:07:23,091 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 22:07:23,091 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:07:23,897 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 22:07:23,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (85)] Ended with exit code 0 [2021-12-21 22:07:23,903 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:07:23,903 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:07:23,903 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:07:23,903 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:07:23,903 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:07:23,903 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:23,903 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:07:23,903 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:07:23,903 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration28_Loop [2021-12-21 22:07:23,903 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:07:23,903 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:07:23,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:23,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:24,146 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:07:24,146 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:07:24,146 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:24,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:24,147 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) [2021-12-21 22:07:24,148 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 [2021-12-21 22:07:24,150 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 [2021-12-21 22:07:24,156 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:24,156 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:24,156 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:24,156 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:24,156 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:07:24,158 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:07:24,158 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:24,160 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:24,174 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 [2021-12-21 22:07:24,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:24,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:24,176 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) [2021-12-21 22:07:24,176 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 [2021-12-21 22:07:24,177 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 [2021-12-21 22:07:24,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:24,184 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:24,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:24,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:24,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:07:24,185 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:07:24,185 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:24,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:24,207 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 [2021-12-21 22:07:24,208 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-12-21 22:07:24,208 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:24,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:24,208 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) [2021-12-21 22:07:24,209 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 [2021-12-21 22:07:24,251 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 [2021-12-21 22:07:24,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:24,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:24,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:24,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:24,258 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:24,260 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:24,260 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:24,269 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:24,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:24,285 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:24,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:24,286 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) [2021-12-21 22:07:24,287 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 [2021-12-21 22:07:24,288 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 [2021-12-21 22:07:24,294 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:24,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:24,295 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:24,295 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:24,295 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:24,296 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:24,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:24,307 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:24,322 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 [2021-12-21 22:07:24,322 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-12-21 22:07:24,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:24,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:24,323 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) [2021-12-21 22:07:24,323 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 [2021-12-21 22:07:24,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:07:24,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:24,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:24,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:24,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:24,332 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:24,338 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:24,338 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:24,357 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:24,373 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 [2021-12-21 22:07:24,373 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:24,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:24,374 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) [2021-12-21 22:07:24,375 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 [2021-12-21 22:07:24,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:07:24,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:24,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:24,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:24,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:24,382 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:24,384 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:24,384 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:24,386 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:24,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:24,402 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-12-21 22:07:24,402 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:24,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:24,403 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) [2021-12-21 22:07:24,403 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 [2021-12-21 22:07:24,404 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 [2021-12-21 22:07:24,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:24,411 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:24,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:24,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:24,411 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:24,414 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:24,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:24,419 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:24,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:24,435 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:24,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:24,436 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) [2021-12-21 22:07:24,436 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 [2021-12-21 22:07:24,437 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 [2021-12-21 22:07:24,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:24,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:24,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:24,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:24,444 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:24,446 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:24,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:24,449 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:24,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (93)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:24,464 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-12-21 22:07:24,464 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:24,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:24,465 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) [2021-12-21 22:07:24,465 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 [2021-12-21 22:07:24,467 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 [2021-12-21 22:07:24,473 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:24,474 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:24,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:24,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:24,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:24,474 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:24,476 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:24,476 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:24,482 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:24,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:24,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:24,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:24,498 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) [2021-12-21 22:07:24,499 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 [2021-12-21 22:07:24,500 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 [2021-12-21 22:07:24,506 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:24,507 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:24,507 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:24,507 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:24,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:24,507 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:24,508 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:24,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:24,511 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:24,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (95)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:24,527 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-12-21 22:07:24,527 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:24,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:24,528 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:24,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Waiting until timeout for monitored process [2021-12-21 22:07:24,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 [2021-12-21 22:07:24,536 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:24,536 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-21 22:07:24,536 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:24,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:24,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:24,536 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:24,539 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:24,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:24,547 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:24,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (96)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:24,563 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:24,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:24,563 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) [2021-12-21 22:07:24,564 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 [2021-12-21 22:07:24,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 [2021-12-21 22:07:24,571 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:24,571 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-21 22:07:24,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:24,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:24,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:24,572 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:24,573 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:24,573 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:24,578 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:24,593 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 [2021-12-21 22:07:24,593 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-12-21 22:07:24,593 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:24,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:24,594 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) [2021-12-21 22:07:24,595 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 [2021-12-21 22:07:24,596 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 [2021-12-21 22:07:24,603 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:24,603 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:24,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:24,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:24,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:24,603 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:24,607 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:24,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:24,620 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:24,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Ended with exit code 0 [2021-12-21 22:07:24,636 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:24,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:24,637 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) [2021-12-21 22:07:24,637 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 [2021-12-21 22:07:24,638 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 [2021-12-21 22:07:24,645 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:24,645 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:24,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:24,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:24,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:24,645 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:24,647 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:24,647 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:24,654 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:24,669 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 [2021-12-21 22:07:24,669 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-12-21 22:07:24,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:24,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:24,670 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) [2021-12-21 22:07:24,670 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 [2021-12-21 22:07:24,672 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 [2021-12-21 22:07:24,678 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:24,678 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:24,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:24,678 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:24,678 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:24,678 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:24,681 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:24,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:24,686 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:24,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (100)] Ended with exit code 0 [2021-12-21 22:07:24,701 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:24,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:24,702 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) [2021-12-21 22:07:24,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Waiting until timeout for monitored process [2021-12-21 22:07:24,704 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 [2021-12-21 22:07:24,710 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:24,710 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:24,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:24,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:24,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:24,710 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:24,720 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:24,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:24,731 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:24,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (101)] Ended with exit code 0 [2021-12-21 22:07:24,748 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-12-21 22:07:24,748 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:24,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:24,749 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) [2021-12-21 22:07:24,750 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 [2021-12-21 22:07:24,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 [2021-12-21 22:07:24,757 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:24,758 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:24,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:24,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:24,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:24,758 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-21 22:07:24,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:07:24,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:24,770 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:24,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Ended with exit code 0 [2021-12-21 22:07:24,786 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:24,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:24,787 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) [2021-12-21 22:07:24,788 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 [2021-12-21 22:07:24,789 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:07:24,795 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:24,795 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:24,795 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:24,795 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:24,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:24,796 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-21 22:07:24,798 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:07:24,798 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:24,803 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:24,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:24,818 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:07:24,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-21 22:07:24,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-21 22:07:24,819 INFO L87 Difference]: Start difference. First operand 784 states and 860 transitions. cyclomatic complexity: 79 Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 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) [2021-12-21 22:07:25,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:07:25,169 INFO L93 Difference]: Finished difference Result 920 states and 1005 transitions. [2021-12-21 22:07:25,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-21 22:07:25,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 920 states and 1005 transitions. [2021-12-21 22:07:25,172 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 63 [2021-12-21 22:07:25,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 920 states to 744 states and 810 transitions. [2021-12-21 22:07:25,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 744 [2021-12-21 22:07:25,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 744 [2021-12-21 22:07:25,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 744 states and 810 transitions. [2021-12-21 22:07:25,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:07:25,175 INFO L681 BuchiCegarLoop]: Abstraction has 744 states and 810 transitions. [2021-12-21 22:07:25,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states and 810 transitions. [2021-12-21 22:07:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 483. [2021-12-21 22:07:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 483 states have (on average 1.1055900621118013) internal successors, (534), 482 states have internal predecessors, (534), 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) [2021-12-21 22:07:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 534 transitions. [2021-12-21 22:07:25,180 INFO L704 BuchiCegarLoop]: Abstraction has 483 states and 534 transitions. [2021-12-21 22:07:25,180 INFO L587 BuchiCegarLoop]: Abstraction has 483 states and 534 transitions. [2021-12-21 22:07:25,180 INFO L425 BuchiCegarLoop]: ======== Iteration 29============ [2021-12-21 22:07:25,180 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 483 states and 534 transitions. [2021-12-21 22:07:25,181 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 44 [2021-12-21 22:07:25,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:07:25,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:07:25,182 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:07:25,182 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:07:25,182 INFO L791 eck$LassoCheckResult]: Stem: 39405#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 39395#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 39384#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 39386#L61 assume 0 == mp_add_~a2~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 39388#L63 assume 0 == mp_add_~a1~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 39389#L59-1 mp_add_~nb~0#1 := 4; 39420#L69 assume !(0 == mp_add_~b3~0#1 % 256); 39483#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 39482#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39481#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 39480#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; 39479#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 39478#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 39477#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 39476#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 39475#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; 39474#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 39473#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 39472#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 39471#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 39470#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 39469#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39468#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39467#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39466#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39465#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39463#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 39464#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 39487#L90 assume !(0 == mp_add_~i~0#1 % 256); 39450#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; 39449#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 39448#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 39447#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 39445#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39443#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 39441#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39439#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39437#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39435#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 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); 39425#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 39424#L90 assume !(0 == mp_add_~i~0#1 % 256); 39423#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 39421#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; 39422#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 39760#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 39758#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39756#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39754#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 39752#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39733#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39734#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39556#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 39550#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 39551#L90 assume !(0 == mp_add_~i~0#1 % 256); 39546#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 39547#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 39746#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; 39744#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 39745#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39740#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39741#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39735#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 39736#L102-1 [2021-12-21 22:07:25,182 INFO L793 eck$LassoCheckResult]: Loop: 39736#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 39731#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 39732#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 39747#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 39548#L90 assume !(0 == mp_add_~i~0#1 % 256); 39549#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 39379#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 39380#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 39759#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 39757#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 39755#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 39753#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 39737#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 39736#L102-1 [2021-12-21 22:07:25,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:25,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1520812614, now seen corresponding path program 1 times [2021-12-21 22:07:25,183 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:25,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540324781] [2021-12-21 22:07:25,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:25,183 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:25,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:25,196 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:07:25,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:25,211 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:07:25,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:25,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1233229496, now seen corresponding path program 2 times [2021-12-21 22:07:25,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:25,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087655500] [2021-12-21 22:07:25,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:25,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:25,214 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:07:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:25,216 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:07:25,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:25,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2088026333, now seen corresponding path program 2 times [2021-12-21 22:07:25,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:25,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214794897] [2021-12-21 22:07:25,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:25,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:25,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 36 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:07:25,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:07:25,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214794897] [2021-12-21 22:07:25,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214794897] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:07:25,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [951017602] [2021-12-21 22:07:25,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-21 22:07:25,341 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:07:25,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:25,342 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:07:25,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2021-12-21 22:07:25,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-12-21 22:07:25,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-21 22:07:25,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-21 22:07:25,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:07:25,808 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-12-21 22:07:25,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:07:26,076 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2021-12-21 22:07:26,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [951017602] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:07:26,077 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:07:26,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2021-12-21 22:07:26,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021741860] [2021-12-21 22:07:26,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:07:26,182 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:07:26,182 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:07:26,182 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:07:26,182 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:07:26,182 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 22:07:26,182 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:26,182 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:07:26,182 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:07:26,182 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration29_Loop [2021-12-21 22:07:26,182 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:07:26,182 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:07:26,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:26,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:26,421 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:07:26,422 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 22:07:26,422 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:26,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:26,423 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) [2021-12-21 22:07:26,424 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 [2021-12-21 22:07:26,425 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:07:26,425 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:07:26,442 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-12-21 22:07:26,442 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Honda state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-12-21 22:07:26,458 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 [2021-12-21 22:07:26,458 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:26,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:26,459 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) [2021-12-21 22:07:26,461 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 [2021-12-21 22:07:26,461 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:07:26,461 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:07:26,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (106)] Ended with exit code 0 [2021-12-21 22:07:26,512 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:26,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:26,513 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) [2021-12-21 22:07:26,514 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 [2021-12-21 22:07:26,515 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 22:07:26,515 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:07:27,201 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 22:07:27,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (107)] Ended with exit code 0 [2021-12-21 22:07:27,206 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:07:27,206 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:07:27,206 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:07:27,206 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:07:27,207 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:07:27,207 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:27,207 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:07:27,207 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:07:27,207 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration29_Loop [2021-12-21 22:07:27,207 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:07:27,207 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:07:27,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:27,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:27,431 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:07:27,431 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:07:27,431 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:27,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:27,433 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) [2021-12-21 22:07:27,433 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 [2021-12-21 22:07:27,434 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 [2021-12-21 22:07:27,441 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:27,441 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:27,441 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:27,441 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:27,441 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:07:27,443 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:07:27,443 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:27,445 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:27,462 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 [2021-12-21 22:07:27,462 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:27,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:27,463 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) [2021-12-21 22:07:27,464 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 [2021-12-21 22:07:27,465 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 [2021-12-21 22:07:27,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:27,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:27,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:27,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:27,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:07:27,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:07:27,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:27,474 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:27,490 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 [2021-12-21 22:07:27,490 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-12-21 22:07:27,490 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:27,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:27,491 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) [2021-12-21 22:07:27,491 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 [2021-12-21 22:07:27,493 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 [2021-12-21 22:07:27,499 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:27,500 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:27,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:27,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:27,500 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:27,502 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:27,502 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:27,505 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:27,520 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 [2021-12-21 22:07:27,520 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:27,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:27,521 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) [2021-12-21 22:07:27,523 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 [2021-12-21 22:07:27,523 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 [2021-12-21 22:07:27,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:27,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:27,530 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:27,530 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:27,530 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:27,531 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:27,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:27,533 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:27,548 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 [2021-12-21 22:07:27,548 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-12-21 22:07:27,549 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:27,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:27,549 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) [2021-12-21 22:07:27,550 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 [2021-12-21 22:07:27,551 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 [2021-12-21 22:07:27,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:27,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:27,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:27,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:27,558 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:27,561 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:27,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:27,565 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:27,580 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 [2021-12-21 22:07:27,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:27,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:27,581 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) [2021-12-21 22:07:27,582 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 [2021-12-21 22:07:27,583 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 [2021-12-21 22:07:27,590 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:27,590 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:27,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:27,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:27,590 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:27,592 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:27,592 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:27,595 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:27,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (113)] Ended with exit code 0 [2021-12-21 22:07:27,610 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-12-21 22:07:27,610 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:27,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:27,611 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) [2021-12-21 22:07:27,612 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 [2021-12-21 22:07:27,613 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 [2021-12-21 22:07:27,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:27,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:27,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:27,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:27,620 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:27,624 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:27,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:27,635 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:27,650 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 [2021-12-21 22:07:27,651 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:27,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:27,652 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) [2021-12-21 22:07:27,652 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 [2021-12-21 22:07:27,654 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 [2021-12-21 22:07:27,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:27,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:27,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:27,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:27,660 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:27,662 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:27,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:27,665 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:27,680 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 [2021-12-21 22:07:27,680 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-12-21 22:07:27,681 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:27,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:27,681 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) [2021-12-21 22:07:27,682 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 [2021-12-21 22:07:27,683 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 [2021-12-21 22:07:27,689 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:27,689 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:27,689 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:27,689 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:27,690 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:27,690 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:27,692 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:27,692 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:27,697 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:27,712 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 [2021-12-21 22:07:27,713 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:27,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:27,714 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:27,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Waiting until timeout for monitored process [2021-12-21 22:07:27,715 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 [2021-12-21 22:07:27,721 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:27,722 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:27,722 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:27,722 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:27,722 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:27,722 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:27,723 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:27,723 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:27,726 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:27,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (117)] Ended with exit code 0 [2021-12-21 22:07:27,742 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-12-21 22:07:27,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:27,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:27,743 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:27,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Waiting until timeout for monitored process [2021-12-21 22:07:27,744 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:07:27,751 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:27,751 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-21 22:07:27,751 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:27,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:27,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:27,751 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:27,754 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:27,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:27,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:27,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (118)] Ended with exit code 0 [2021-12-21 22:07:27,779 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:27,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:27,780 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:27,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Waiting until timeout for monitored process [2021-12-21 22:07:27,782 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 [2021-12-21 22:07:27,788 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:27,788 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-21 22:07:27,788 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:27,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:27,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:27,789 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:27,791 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:27,791 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:27,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:27,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:27,832 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-12-21 22:07:27,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:27,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:27,840 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:27,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Waiting until timeout for monitored process [2021-12-21 22:07:27,842 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 [2021-12-21 22:07:27,849 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:27,849 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:27,849 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:27,849 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:27,849 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:27,849 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:27,855 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:27,855 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:27,865 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:27,881 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (120)] Ended with exit code 0 [2021-12-21 22:07:27,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:27,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:27,882 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:27,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Waiting until timeout for monitored process [2021-12-21 22:07:27,884 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 [2021-12-21 22:07:27,890 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:27,891 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:27,891 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:27,891 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:27,891 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:27,891 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:27,893 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:27,893 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:27,900 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:27,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (121)] Ended with exit code 0 [2021-12-21 22:07:27,916 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-12-21 22:07:27,916 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:27,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:27,917 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:27,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Waiting until timeout for monitored process [2021-12-21 22:07:27,919 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 [2021-12-21 22:07:27,926 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:27,926 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:27,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:27,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:27,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:27,926 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:27,929 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:27,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:27,934 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:27,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Ended with exit code 0 [2021-12-21 22:07:27,950 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:27,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:27,951 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:27,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Waiting until timeout for monitored process [2021-12-21 22:07:27,953 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 [2021-12-21 22:07:27,959 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:27,959 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:27,959 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:27,959 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:27,959 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:27,959 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:27,961 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:27,961 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:27,964 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:27,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Ended with exit code 0 [2021-12-21 22:07:27,979 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-12-21 22:07:27,979 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:27,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:27,980 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:27,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Waiting until timeout for monitored process [2021-12-21 22:07:27,982 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 [2021-12-21 22:07:27,989 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:27,989 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:27,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:27,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:27,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:27,989 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-21 22:07:27,994 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:07:27,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:28,003 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:28,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (124)] Ended with exit code 0 [2021-12-21 22:07:28,019 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:28,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:28,020 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:28,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Waiting until timeout for monitored process [2021-12-21 22:07:28,022 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 [2021-12-21 22:07:28,028 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:28,028 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:28,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:28,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:28,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:28,028 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-21 22:07:28,031 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:07:28,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:28,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:28,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (125)] Ended with exit code 0 [2021-12-21 22:07:28,051 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:07:28,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 22:07:28,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2021-12-21 22:07:28,052 INFO L87 Difference]: Start difference. First operand 483 states and 534 transitions. cyclomatic complexity: 54 Second operand has 14 states, 14 states have (on average 9.857142857142858) internal successors, (138), 14 states have internal predecessors, (138), 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) [2021-12-21 22:07:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-21 22:07:30,022 INFO L93 Difference]: Finished difference Result 749 states and 808 transitions. [2021-12-21 22:07:30,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-12-21 22:07:30,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 749 states and 808 transitions. [2021-12-21 22:07:30,024 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 63 [2021-12-21 22:07:30,026 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 749 states to 605 states and 654 transitions. [2021-12-21 22:07:30,026 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 605 [2021-12-21 22:07:30,026 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 605 [2021-12-21 22:07:30,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 605 states and 654 transitions. [2021-12-21 22:07:30,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-21 22:07:30,026 INFO L681 BuchiCegarLoop]: Abstraction has 605 states and 654 transitions. [2021-12-21 22:07:30,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states and 654 transitions. [2021-12-21 22:07:30,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 450. [2021-12-21 22:07:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 450 states have (on average 1.0977777777777777) internal successors, (494), 449 states have internal predecessors, (494), 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) [2021-12-21 22:07:30,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 494 transitions. [2021-12-21 22:07:30,035 INFO L704 BuchiCegarLoop]: Abstraction has 450 states and 494 transitions. [2021-12-21 22:07:30,035 INFO L587 BuchiCegarLoop]: Abstraction has 450 states and 494 transitions. [2021-12-21 22:07:30,035 INFO L425 BuchiCegarLoop]: ======== Iteration 30============ [2021-12-21 22:07:30,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 450 states and 494 transitions. [2021-12-21 22:07:30,036 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 44 [2021-12-21 22:07:30,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-21 22:07:30,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-21 22:07:30,038 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:07:30,038 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-21 22:07:30,038 INFO L791 eck$LassoCheckResult]: Stem: 41151#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); 41143#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet2#1, main_#t~ret3#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~nondet1#1;havoc main_#t~nondet1#1;main_~b~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_~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_~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; 41132#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 41134#L61 assume !(0 == mp_add_~a2~0#1 % 256); 41135#L59-1 mp_add_~nb~0#1 := 4; 41146#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 41163#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 41165#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 41303#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 41302#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 41301#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 41300#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; 41299#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 41298#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 41297#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 41296#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 41295#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; 41294#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 41293#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 41292#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 41291#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 41290#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 41289#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 41288#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 41287#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 41286#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 41285#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 41284#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 41283#L84 assume !(0 == mp_add_~i~0#1 % 256); 41282#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; 41280#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 41278#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 41276#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 41275#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 41551#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 41550#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 41549#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 41548#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 41547#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 41546#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 41545#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 41544#L84 assume !(0 == mp_add_~i~0#1 % 256); 41543#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 41541#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; 41542#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 41572#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 41131#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 41571#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 41570#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 41569#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 41567#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 41565#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 41563#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 41561#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 41559#L84 assume !(0 == mp_add_~i~0#1 % 256); 41557#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 41555#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 41552#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; 41553#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 41444#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 41568#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 41575#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 41574#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 41573#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 41155#L102-1 [2021-12-21 22:07:30,038 INFO L793 eck$LassoCheckResult]: Loop: 41155#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 41153#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 41154#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 41149#L84 assume !(0 == mp_add_~i~0#1 % 256); 41150#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 41152#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 41144#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 41145#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 41128#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 254); 41129#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 41147#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 41139#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 41140#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 41155#L102-1 [2021-12-21 22:07:30,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:30,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1427802756, now seen corresponding path program 1 times [2021-12-21 22:07:30,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:30,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102121681] [2021-12-21 22:07:30,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:30,039 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:30,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:30,152 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 30 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-21 22:07:30,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-21 22:07:30,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102121681] [2021-12-21 22:07:30,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102121681] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-21 22:07:30,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496521770] [2021-12-21 22:07:30,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:30,153 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-21 22:07:30,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:30,154 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-21 22:07:30,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2021-12-21 22:07:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-21 22:07:30,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-21 22:07:30,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-21 22:07:43,053 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-21 22:07:43,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-21 22:07:43,238 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2021-12-21 22:07:43,239 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496521770] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-21 22:07:43,239 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-21 22:07:43,239 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2021-12-21 22:07:43,239 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686308174] [2021-12-21 22:07:43,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-21 22:07:43,239 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-21 22:07:43,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-21 22:07:43,239 INFO L85 PathProgramCache]: Analyzing trace with hash 672830572, now seen corresponding path program 4 times [2021-12-21 22:07:43,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-21 22:07:43,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376416313] [2021-12-21 22:07:43,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-21 22:07:43,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-21 22:07:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:43,242 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-21 22:07:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-21 22:07:43,244 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-21 22:07:43,352 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:07:43,352 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:07:43,352 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:07:43,352 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:07:43,352 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-21 22:07:43,352 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:43,352 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:07:43,352 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:07:43,352 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration30_Loop [2021-12-21 22:07:43,352 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:07:43,352 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:07:43,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:43,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:43,582 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:07:43,583 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-21 22:07:43,583 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:43,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:43,584 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:43,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Waiting until timeout for monitored process [2021-12-21 22:07:43,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-21 22:07:43,586 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:07:43,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (127)] Ended with exit code 0 [2021-12-21 22:07:43,626 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:43,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:43,627 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:43,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Waiting until timeout for monitored process [2021-12-21 22:07:43,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-21 22:07:43,630 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-21 22:07:44,338 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-21 22:07:44,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (128)] Ended with exit code 0 [2021-12-21 22:07:44,343 INFO L210 LassoAnalysis]: Preferences: [2021-12-21 22:07:44,343 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-21 22:07:44,343 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-21 22:07:44,343 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-21 22:07:44,343 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-21 22:07:44,343 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:44,343 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-21 22:07:44,344 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-21 22:07:44,344 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration30_Loop [2021-12-21 22:07:44,344 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-21 22:07:44,344 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-21 22:07:44,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:44,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-21 22:07:44,614 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-21 22:07:44,614 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-21 22:07:44,614 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:44,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:44,615 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:44,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Waiting until timeout for monitored process [2021-12-21 22:07:44,617 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 [2021-12-21 22:07:44,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:44,623 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:44,623 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:44,623 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:44,623 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:07:44,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:07:44,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:44,627 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:44,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:44,642 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:44,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:44,643 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:44,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Waiting until timeout for monitored process [2021-12-21 22:07:44,645 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 [2021-12-21 22:07:44,650 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:44,650 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:44,650 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:44,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:44,651 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-21 22:07:44,651 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-21 22:07:44,651 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:44,653 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:44,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Ended with exit code 0 [2021-12-21 22:07:44,669 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-12-21 22:07:44,669 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:44,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:44,670 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:44,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Waiting until timeout for monitored process [2021-12-21 22:07:44,672 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 [2021-12-21 22:07:44,678 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:44,678 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:44,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:44,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:44,679 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:44,681 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:44,681 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:44,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:44,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Ended with exit code 0 [2021-12-21 22:07:44,700 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:44,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:44,701 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:44,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Waiting until timeout for monitored process [2021-12-21 22:07:44,702 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 [2021-12-21 22:07:44,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:44,709 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:44,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:44,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:44,709 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:44,710 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:44,710 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:44,719 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:44,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (132)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:44,735 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-12-21 22:07:44,735 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:44,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:44,736 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:44,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Waiting until timeout for monitored process [2021-12-21 22:07:44,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 [2021-12-21 22:07:44,745 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:44,745 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:44,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:44,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:44,745 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:44,748 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:44,748 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:44,752 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:44,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Ended with exit code 0 [2021-12-21 22:07:44,768 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:44,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:44,769 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:44,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Waiting until timeout for monitored process [2021-12-21 22:07:44,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:07:44,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:44,777 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:44,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:44,777 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:44,777 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:44,778 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:44,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:44,781 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:44,796 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Ended with exit code 0 [2021-12-21 22:07:44,796 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-12-21 22:07:44,796 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:44,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:44,797 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:44,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Waiting until timeout for monitored process [2021-12-21 22:07:44,799 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 [2021-12-21 22:07:44,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:44,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:44,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:44,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:44,805 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:44,810 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:44,810 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:44,815 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:44,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (135)] Ended with exit code 0 [2021-12-21 22:07:44,830 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:44,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:44,831 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:44,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Waiting until timeout for monitored process [2021-12-21 22:07:44,833 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 [2021-12-21 22:07:44,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-21 22:07:44,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:44,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:44,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:44,839 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:44,841 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:44,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:44,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:44,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (136)] Ended with exit code 0 [2021-12-21 22:07:44,859 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-12-21 22:07:44,859 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:44,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:44,860 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:44,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Waiting until timeout for monitored process [2021-12-21 22:07:44,862 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 [2021-12-21 22:07:44,868 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:44,868 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:44,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:44,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:44,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:44,868 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:44,870 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:44,871 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:44,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:44,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:44,891 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:44,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:44,892 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:44,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Waiting until timeout for monitored process [2021-12-21 22:07:44,894 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 [2021-12-21 22:07:44,900 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:44,900 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:44,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:44,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:44,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:44,900 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-12-21 22:07:44,901 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-12-21 22:07:44,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:44,904 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:44,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (138)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:44,919 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-12-21 22:07:44,919 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:44,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:44,920 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:44,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Waiting until timeout for monitored process [2021-12-21 22:07:44,922 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 [2021-12-21 22:07:44,928 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:44,928 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-21 22:07:44,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:44,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:44,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:44,928 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:44,931 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:44,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:44,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:44,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Ended with exit code 0 [2021-12-21 22:07:44,954 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:44,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:44,955 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:44,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Waiting until timeout for monitored process [2021-12-21 22:07:44,957 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 [2021-12-21 22:07:44,963 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:44,963 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-12-21 22:07:44,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:44,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:44,964 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:44,964 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:44,965 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:44,965 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:44,970 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:44,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (140)] Ended with exit code 0 [2021-12-21 22:07:44,986 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-12-21 22:07:44,986 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:44,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:44,987 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:44,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Waiting until timeout for monitored process [2021-12-21 22:07:44,989 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 [2021-12-21 22:07:44,995 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:44,995 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:44,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:44,995 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:44,995 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:44,995 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:45,000 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:45,000 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:45,013 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:45,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Ended with exit code 0 [2021-12-21 22:07:45,030 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:45,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:45,030 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:45,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Waiting until timeout for monitored process [2021-12-21 22:07:45,033 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 [2021-12-21 22:07:45,039 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:45,039 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:45,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:45,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:45,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:45,039 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-12-21 22:07:45,042 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-12-21 22:07:45,042 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:45,051 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:45,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Ended with exit code 0 [2021-12-21 22:07:45,073 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-12-21 22:07:45,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:45,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:45,074 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:45,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Waiting until timeout for monitored process [2021-12-21 22:07:45,077 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 [2021-12-21 22:07:45,083 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:45,083 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:45,083 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:45,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:45,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:45,083 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:45,086 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:45,086 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:45,102 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:45,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:45,121 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:45,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:45,122 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:45,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Waiting until timeout for monitored process [2021-12-21 22:07:45,126 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:07:45,133 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:45,133 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-12-21 22:07:45,133 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:45,133 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:45,133 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:45,133 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-12-21 22:07:45,135 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-21 22:07:45,135 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:45,148 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:45,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:45,164 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-12-21 22:07:45,164 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:45,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:45,165 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:45,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Waiting until timeout for monitored process [2021-12-21 22:07:45,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-21 22:07:45,173 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:45,173 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:45,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:45,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:45,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:45,173 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-21 22:07:45,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:07:45,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:45,185 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:45,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (145)] Ended with exit code 0 [2021-12-21 22:07:45,201 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-21 22:07:45,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-21 22:07:45,201 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-21 22:07:45,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Waiting until timeout for monitored process [2021-12-21 22:07:45,203 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 [2021-12-21 22:07:45,209 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-12-21 22:07:45,210 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-12-21 22:07:45,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-21 22:07:45,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-21 22:07:45,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-21 22:07:45,210 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-12-21 22:07:45,212 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-12-21 22:07:45,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-21 22:07:45,217 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-21 22:07:45,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (146)] Forceful destruction successful, exit code 0 [2021-12-21 22:07:45,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-21 22:07:45,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-21 22:07:45,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=140, Unknown=1, NotChecked=0, Total=182 [2021-12-21 22:07:45,233 INFO L87 Difference]: Start difference. First operand 450 states and 494 transitions. cyclomatic complexity: 47 Second operand has 14 states, 14 states have (on average 9.785714285714286) internal successors, (137), 14 states have internal predecessors, (137), 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)