./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/byte_add_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec 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-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 a92d749021b3b94f4ecd59f60bbcb6b80102c08a ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 14:36:22,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 14:36:22,448 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 14:36:22,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 14:36:22,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 14:36:22,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 14:36:22,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 14:36:22,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 14:36:22,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 14:36:22,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 14:36:22,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 14:36:22,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 14:36:22,513 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 14:36:22,515 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 14:36:22,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 14:36:22,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 14:36:22,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 14:36:22,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 14:36:22,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 14:36:22,529 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 14:36:22,530 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 14:36:22,531 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 14:36:22,532 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 14:36:22,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 14:36:22,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 14:36:22,540 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 14:36:22,540 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 14:36:22,541 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 14:36:22,542 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 14:36:22,542 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 14:36:22,543 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 14:36:22,543 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 14:36:22,545 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 14:36:22,545 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 14:36:22,546 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 14:36:22,547 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 14:36:22,547 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 14:36:22,547 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 14:36:22,548 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 14:36:22,549 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 14:36:22,550 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 14:36:22,550 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 14:36:22,586 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 14:36:22,586 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 14:36:22,587 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 14:36:22,588 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 14:36:22,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 14:36:22,590 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 14:36:22,590 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 14:36:22,590 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 14:36:22,591 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 14:36:22,591 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 14:36:22,592 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 14:36:22,592 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 14:36:22,592 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 14:36:22,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 14:36:22,592 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 14:36:22,593 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 14:36:22,593 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 14:36:22,593 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 14:36:22,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 14:36:22,594 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 14:36:22,594 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 14:36:22,594 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 14:36:22,594 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 14:36:22,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 14:36:22,595 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 14:36:22,595 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 14:36:22,595 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 14:36:22,595 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 14:36:22,595 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 14:36:22,596 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 14:36:22,596 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 14:36:22,596 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 14:36:22,597 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 14:36:22,597 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 -> a92d749021b3b94f4ecd59f60bbcb6b80102c08a [2021-08-27 14:36:22,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 14:36:22,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 14:36:22,924 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 14:36:22,925 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 14:36:22,926 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 14:36:22,927 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/byte_add_1-1.i [2021-08-27 14:36:22,983 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16d9d15ef/f1852021236d4d089fe6fd61b36f0470/FLAG3d23fe67f [2021-08-27 14:36:23,389 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 14:36:23,392 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/byte_add_1-1.i [2021-08-27 14:36:23,402 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16d9d15ef/f1852021236d4d089fe6fd61b36f0470/FLAG3d23fe67f [2021-08-27 14:36:23,777 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16d9d15ef/f1852021236d4d089fe6fd61b36f0470 [2021-08-27 14:36:23,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 14:36:23,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 14:36:23,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 14:36:23,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 14:36:23,786 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 14:36:23,787 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:36:23" (1/1) ... [2021-08-27 14:36:23,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b09dff1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:36:23, skipping insertion in model container [2021-08-27 14:36:23,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:36:23" (1/1) ... [2021-08-27 14:36:23,793 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 14:36:23,819 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 14:36:23,922 WARN L228 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-1.i[863,876] [2021-08-27 14:36:23,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:36:23,956 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 14:36:24,015 WARN L228 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-1.i[863,876] [2021-08-27 14:36:24,033 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:36:24,044 INFO L208 MainTranslator]: Completed translation [2021-08-27 14:36:24,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:36:24 WrapperNode [2021-08-27 14:36:24,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 14:36:24,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 14:36:24,045 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 14:36:24,045 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 14:36:24,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:36:24" (1/1) ... [2021-08-27 14:36:24,058 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:36:24" (1/1) ... [2021-08-27 14:36:24,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 14:36:24,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 14:36:24,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 14:36:24,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 14:36:24,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:36:24" (1/1) ... [2021-08-27 14:36:24,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:36:24" (1/1) ... [2021-08-27 14:36:24,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:36:24" (1/1) ... [2021-08-27 14:36:24,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:36:24" (1/1) ... [2021-08-27 14:36:24,120 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:36:24" (1/1) ... [2021-08-27 14:36:24,124 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:36:24" (1/1) ... [2021-08-27 14:36:24,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:36:24" (1/1) ... [2021-08-27 14:36:24,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 14:36:24,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 14:36:24,138 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 14:36:24,138 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 14:36:24,139 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:36:24" (1/1) ... [2021-08-27 14:36:24,147 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:36:24,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:36:24,166 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-08-27 14:36:24,193 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-08-27 14:36:24,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 14:36:24,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 14:36:24,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 14:36:24,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 14:36:24,632 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 14:36:24,632 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-27 14:36:24,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:36:24 BoogieIcfgContainer [2021-08-27 14:36:24,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 14:36:24,635 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 14:36:24,635 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 14:36:24,644 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 14:36:24,645 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:36:24,645 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 02:36:23" (1/3) ... [2021-08-27 14:36:24,646 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ff776fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:36:24, skipping insertion in model container [2021-08-27 14:36:24,646 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:36:24,646 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:36:24" (2/3) ... [2021-08-27 14:36:24,647 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ff776fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:36:24, skipping insertion in model container [2021-08-27 14:36:24,647 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:36:24,647 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:36:24" (3/3) ... [2021-08-27 14:36:24,648 INFO L389 chiAutomizerObserver]: Analyzing ICFG byte_add_1-1.i [2021-08-27 14:36:24,690 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 14:36:24,690 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 14:36:24,690 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 14:36:24,691 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 14:36:24,691 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 14:36:24,691 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 14:36:24,691 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 14:36:24,691 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 14:36:24,703 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-08-27 14:36:24,720 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2021-08-27 14:36:24,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:24,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:24,726 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-27 14:36:24,726 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:24,727 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 14:36:24,727 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-08-27 14:36:24,730 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2021-08-27 14:36:24,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:24,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:24,731 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2021-08-27 14:36:24,731 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:24,737 INFO L791 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 12#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 7#L51true assume !(0 == mp_add_~a3~0 % 256); 15#L51-1true mp_add_~nb~0 := 4; 8#L61true assume !(0 == mp_add_~b3~0 % 256); 18#L61-1true mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 13#L72-2true [2021-08-27 14:36:24,737 INFO L793 eck$LassoCheckResult]: Loop: 13#L72-2true assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34#L75true assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 36#L75-1true assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 27#L81true assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 14#L87-1true assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 10#L91-1true assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 11#L92-1true assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 20#L93-1true assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 17#L94-1true mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 13#L72-2true [2021-08-27 14:36:24,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:24,742 INFO L82 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2021-08-27 14:36:24,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:24,750 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089016527] [2021-08-27 14:36:24,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:24,751 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:24,841 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:36:24,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:24,891 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:36:24,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:24,893 INFO L82 PathProgramCache]: Analyzing trace with hash 318197182, now seen corresponding path program 1 times [2021-08-27 14:36:24,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:24,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750102050] [2021-08-27 14:36:24,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:24,895 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:24,996 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:24,996 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750102050] [2021-08-27 14:36:24,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750102050] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:24,997 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:24,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:36:24,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038707213] [2021-08-27 14:36:25,001 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:25,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:25,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:36:25,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:36:25,014 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-08-27 14:36:25,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:25,261 INFO L93 Difference]: Finished difference Result 64 states and 94 transitions. [2021-08-27 14:36:25,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:36:25,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 94 transitions. [2021-08-27 14:36:25,272 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2021-08-27 14:36:25,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 56 states and 86 transitions. [2021-08-27 14:36:25,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-08-27 14:36:25,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-08-27 14:36:25,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 86 transitions. [2021-08-27 14:36:25,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:25,282 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 86 transitions. [2021-08-27 14:36:25,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 86 transitions. [2021-08-27 14:36:25,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2021-08-27 14:36:25,312 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-08-27 14:36:25,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 84 transitions. [2021-08-27 14:36:25,313 INFO L704 BuchiCegarLoop]: Abstraction has 54 states and 84 transitions. [2021-08-27 14:36:25,313 INFO L587 BuchiCegarLoop]: Abstraction has 54 states and 84 transitions. [2021-08-27 14:36:25,314 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 14:36:25,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 84 transitions. [2021-08-27 14:36:25,316 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-08-27 14:36:25,317 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:25,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:25,318 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:25,319 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:25,320 INFO L791 eck$LassoCheckResult]: Stem: 134#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 124#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 114#L51 assume !(0 == mp_add_~a3~0 % 256); 115#L51-1 mp_add_~nb~0 := 4; 117#L61 assume !(0 == mp_add_~b3~0 % 256); 118#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 125#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 126#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 146#L75-1 [2021-08-27 14:36:25,320 INFO L793 eck$LassoCheckResult]: Loop: 146#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 140#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 128#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 121#L91-1 assume !(1 == mp_add_~i~0 % 256); 122#L92-1 assume !(2 == mp_add_~i~0 % 256); 123#L93-1 assume !(3 == mp_add_~i~0 % 256); 131#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 132#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 158#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 159#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 151#L76-2 assume !(1 == mp_add_~i~0 % 256); 160#L77-1 assume !(2 == mp_add_~i~0 % 256); 145#L78-1 assume !(3 == mp_add_~i~0 % 256); 146#L75-1 [2021-08-27 14:36:25,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:25,321 INFO L82 PathProgramCache]: Analyzing trace with hash 532072804, now seen corresponding path program 1 times [2021-08-27 14:36:25,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:25,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414330915] [2021-08-27 14:36:25,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:25,322 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:25,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:25,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:25,607 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:25,607 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414330915] [2021-08-27 14:36:25,607 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414330915] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:25,607 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:25,607 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 14:36:25,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704100037] [2021-08-27 14:36:25,607 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:36:25,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:25,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1939143242, now seen corresponding path program 1 times [2021-08-27 14:36:25,608 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:25,608 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544566661] [2021-08-27 14:36:25,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:25,608 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:25,682 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:25,682 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544566661] [2021-08-27 14:36:25,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544566661] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:25,683 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:25,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 14:36:25,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522527245] [2021-08-27 14:36:25,683 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:25,683 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:25,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 14:36:25,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 14:36:25,684 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-08-27 14:36:26,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:26,122 INFO L93 Difference]: Finished difference Result 149 states and 228 transitions. [2021-08-27 14:36:26,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 14:36:26,123 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 228 transitions. [2021-08-27 14:36:26,131 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 108 [2021-08-27 14:36:26,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 149 states and 228 transitions. [2021-08-27 14:36:26,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 149 [2021-08-27 14:36:26,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 149 [2021-08-27 14:36:26,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 149 states and 228 transitions. [2021-08-27 14:36:26,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:26,134 INFO L681 BuchiCegarLoop]: Abstraction has 149 states and 228 transitions. [2021-08-27 14:36:26,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states and 228 transitions. [2021-08-27 14:36:26,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 78. [2021-08-27 14:36:26,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 77 states have internal predecessors, (113), 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-08-27 14:36:26,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 113 transitions. [2021-08-27 14:36:26,140 INFO L704 BuchiCegarLoop]: Abstraction has 78 states and 113 transitions. [2021-08-27 14:36:26,140 INFO L587 BuchiCegarLoop]: Abstraction has 78 states and 113 transitions. [2021-08-27 14:36:26,140 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 14:36:26,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 113 transitions. [2021-08-27 14:36:26,141 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-08-27 14:36:26,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:26,141 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:26,142 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:26,142 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:26,142 INFO L791 eck$LassoCheckResult]: Stem: 351#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 341#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 332#L51 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 334#L53 assume !(0 == mp_add_~a2~0 % 256); 368#L51-1 mp_add_~nb~0 := 4; 335#L61 assume !(0 == mp_add_~b3~0 % 256); 336#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 378#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 379#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 400#L75-1 [2021-08-27 14:36:26,142 INFO L793 eck$LassoCheckResult]: Loop: 400#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 366#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 342#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 329#L91-1 assume !(1 == mp_add_~i~0 % 256); 330#L92-1 assume !(2 == mp_add_~i~0 % 256); 331#L93-1 assume !(3 == mp_add_~i~0 % 256); 346#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 347#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 376#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 369#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 352#L76-2 assume !(1 == mp_add_~i~0 % 256); 353#L77-1 assume !(2 == mp_add_~i~0 % 256); 354#L78-1 assume !(3 == mp_add_~i~0 % 256); 400#L75-1 [2021-08-27 14:36:26,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:26,143 INFO L82 PathProgramCache]: Analyzing trace with hash -384676570, now seen corresponding path program 1 times [2021-08-27 14:36:26,143 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:26,143 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887564271] [2021-08-27 14:36:26,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:26,143 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:26,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:26,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887564271] [2021-08-27 14:36:26,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887564271] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:26,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:26,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:36:26,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205414183] [2021-08-27 14:36:26,191 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:36:26,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:26,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1939143242, now seen corresponding path program 2 times [2021-08-27 14:36:26,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:26,192 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118171479] [2021-08-27 14:36:26,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:26,193 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:26,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:26,261 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:26,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118171479] [2021-08-27 14:36:26,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118171479] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:26,261 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:26,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 14:36:26,261 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618340673] [2021-08-27 14:36:26,262 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:26,262 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:26,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:36:26,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:36:26,263 INFO L87 Difference]: Start difference. First operand 78 states and 113 transitions. cyclomatic complexity: 37 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-08-27 14:36:26,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:26,268 INFO L93 Difference]: Finished difference Result 66 states and 93 transitions. [2021-08-27 14:36:26,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:36:26,269 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 93 transitions. [2021-08-27 14:36:26,270 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-08-27 14:36:26,270 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 66 states and 93 transitions. [2021-08-27 14:36:26,271 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2021-08-27 14:36:26,271 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 66 [2021-08-27 14:36:26,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 66 states and 93 transitions. [2021-08-27 14:36:26,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:26,271 INFO L681 BuchiCegarLoop]: Abstraction has 66 states and 93 transitions. [2021-08-27 14:36:26,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states and 93 transitions. [2021-08-27 14:36:26,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-08-27 14:36:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 65 states have internal predecessors, (93), 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-08-27 14:36:26,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 93 transitions. [2021-08-27 14:36:26,275 INFO L704 BuchiCegarLoop]: Abstraction has 66 states and 93 transitions. [2021-08-27 14:36:26,275 INFO L587 BuchiCegarLoop]: Abstraction has 66 states and 93 transitions. [2021-08-27 14:36:26,275 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 14:36:26,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 66 states and 93 transitions. [2021-08-27 14:36:26,276 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2021-08-27 14:36:26,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:26,276 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:26,276 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:26,276 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:26,277 INFO L791 eck$LassoCheckResult]: Stem: 500#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 490#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 481#L51 assume !(0 == mp_add_~a3~0 % 256); 482#L51-1 mp_add_~nb~0 := 4; 483#L61 assume !(0 == mp_add_~b3~0 % 256); 484#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 497#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 545#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 544#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 543#L76-2 assume !(1 == mp_add_~i~0 % 256); 541#L77-1 assume !(2 == mp_add_~i~0 % 256); 538#L78-1 assume !(3 == mp_add_~i~0 % 256); 533#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 531#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 493#L87-1 [2021-08-27 14:36:26,277 INFO L793 eck$LassoCheckResult]: Loop: 493#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 487#L91-1 assume !(1 == mp_add_~i~0 % 256); 488#L92-1 assume !(2 == mp_add_~i~0 % 256); 489#L93-1 assume !(3 == mp_add_~i~0 % 256); 498#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 522#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 523#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 514#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 517#L76-2 assume !(1 == mp_add_~i~0 % 256); 540#L77-1 assume !(2 == mp_add_~i~0 % 256); 537#L78-1 assume !(3 == mp_add_~i~0 % 256); 536#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 532#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 493#L87-1 [2021-08-27 14:36:26,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:26,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1874592092, now seen corresponding path program 1 times [2021-08-27 14:36:26,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:26,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958070594] [2021-08-27 14:36:26,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:26,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:26,407 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:26,408 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958070594] [2021-08-27 14:36:26,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958070594] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:26,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:26,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 14:36:26,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327685097] [2021-08-27 14:36:26,408 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:36:26,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:26,409 INFO L82 PathProgramCache]: Analyzing trace with hash 686981138, now seen corresponding path program 3 times [2021-08-27 14:36:26,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:26,409 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577263896] [2021-08-27 14:36:26,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:26,409 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:26,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:26,475 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:26,475 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577263896] [2021-08-27 14:36:26,476 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577263896] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:26,476 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:26,476 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:36:26,476 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744691959] [2021-08-27 14:36:26,476 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:26,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:26,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 14:36:26,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 14:36:26,477 INFO L87 Difference]: Start difference. First operand 66 states and 93 transitions. cyclomatic complexity: 29 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 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-08-27 14:36:26,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:26,723 INFO L93 Difference]: Finished difference Result 91 states and 134 transitions. [2021-08-27 14:36:26,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 14:36:26,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 134 transitions. [2021-08-27 14:36:26,726 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 64 [2021-08-27 14:36:26,726 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 134 transitions. [2021-08-27 14:36:26,726 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2021-08-27 14:36:26,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 91 [2021-08-27 14:36:26,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 134 transitions. [2021-08-27 14:36:26,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:26,728 INFO L681 BuchiCegarLoop]: Abstraction has 91 states and 134 transitions. [2021-08-27 14:36:26,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 134 transitions. [2021-08-27 14:36:26,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2021-08-27 14:36:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 82 states have internal predecessors, (120), 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-08-27 14:36:26,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2021-08-27 14:36:26,732 INFO L704 BuchiCegarLoop]: Abstraction has 83 states and 120 transitions. [2021-08-27 14:36:26,732 INFO L587 BuchiCegarLoop]: Abstraction has 83 states and 120 transitions. [2021-08-27 14:36:26,732 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 14:36:26,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 120 transitions. [2021-08-27 14:36:26,734 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2021-08-27 14:36:26,735 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:26,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:26,735 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:26,736 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-08-27 14:36:26,736 INFO L791 eck$LassoCheckResult]: Stem: 667#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 656#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 649#L51 assume !(0 == mp_add_~a3~0 % 256); 650#L51-1 mp_add_~nb~0 := 4; 651#L61 assume !(0 == mp_add_~b3~0 % 256); 652#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 663#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 711#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 710#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 709#L76-2 assume !(1 == mp_add_~i~0 % 256); 708#L77-1 assume !(2 == mp_add_~i~0 % 256); 706#L78-1 assume !(3 == mp_add_~i~0 % 256); 703#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 701#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 697#L87-1 [2021-08-27 14:36:26,741 INFO L793 eck$LassoCheckResult]: Loop: 697#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 696#L91-1 assume !(1 == mp_add_~i~0 % 256); 694#L92-1 assume !(2 == mp_add_~i~0 % 256); 691#L93-1 assume !(3 == mp_add_~i~0 % 256); 692#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 687#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 688#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 677#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 674#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 659#L87-1 assume !(0 == mp_add_~i~0 % 256); 655#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 647#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 648#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 689#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 690#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 695#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 715#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 716#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 676#L82-2 assume !(1 == mp_add_~i~0 % 256); 682#L83-1 assume !(2 == mp_add_~i~0 % 256); 684#L84-1 assume !(3 == mp_add_~i~0 % 256); 719#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 697#L87-1 [2021-08-27 14:36:26,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:26,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1874592092, now seen corresponding path program 2 times [2021-08-27 14:36:26,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:26,743 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031511814] [2021-08-27 14:36:26,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:26,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:26,895 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:26,895 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031511814] [2021-08-27 14:36:26,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031511814] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:26,895 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:26,895 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 14:36:26,895 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237314441] [2021-08-27 14:36:26,896 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:36:26,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:26,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1043280079, now seen corresponding path program 1 times [2021-08-27 14:36:26,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:26,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164987855] [2021-08-27 14:36:26,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:26,897 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 14:36:26,930 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:26,930 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164987855] [2021-08-27 14:36:26,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164987855] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:26,930 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:26,931 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:36:26,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083347643] [2021-08-27 14:36:26,931 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:26,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:26,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 14:36:26,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 14:36:26,933 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. cyclomatic complexity: 39 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:36:27,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:27,167 INFO L93 Difference]: Finished difference Result 164 states and 234 transitions. [2021-08-27 14:36:27,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 14:36:27,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 234 transitions. [2021-08-27 14:36:27,170 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 112 [2021-08-27 14:36:27,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 164 states and 234 transitions. [2021-08-27 14:36:27,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 164 [2021-08-27 14:36:27,172 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 164 [2021-08-27 14:36:27,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 164 states and 234 transitions. [2021-08-27 14:36:27,173 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:27,173 INFO L681 BuchiCegarLoop]: Abstraction has 164 states and 234 transitions. [2021-08-27 14:36:27,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states and 234 transitions. [2021-08-27 14:36:27,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 91. [2021-08-27 14:36:27,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 90 states have internal predecessors, (128), 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-08-27 14:36:27,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2021-08-27 14:36:27,177 INFO L704 BuchiCegarLoop]: Abstraction has 91 states and 128 transitions. [2021-08-27 14:36:27,178 INFO L587 BuchiCegarLoop]: Abstraction has 91 states and 128 transitions. [2021-08-27 14:36:27,178 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 14:36:27,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 128 transitions. [2021-08-27 14:36:27,179 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2021-08-27 14:36:27,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:27,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:27,179 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:27,180 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-08-27 14:36:27,180 INFO L791 eck$LassoCheckResult]: Stem: 927#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 917#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 908#L51 assume !(0 == mp_add_~a3~0 % 256); 909#L51-1 mp_add_~nb~0 := 4; 910#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 912#L63 assume !(0 == mp_add_~b2~0 % 256); 913#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 970#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 969#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 968#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 967#L76-2 assume !(1 == mp_add_~i~0 % 256); 966#L77-1 assume !(2 == mp_add_~i~0 % 256); 965#L78-1 assume !(3 == mp_add_~i~0 % 256); 963#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 960#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 961#L87-1 [2021-08-27 14:36:27,180 INFO L793 eck$LassoCheckResult]: Loop: 961#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 904#L91-1 assume !(1 == mp_add_~i~0 % 256); 905#L92-1 assume !(2 == mp_add_~i~0 % 256); 955#L93-1 assume !(3 == mp_add_~i~0 % 256); 954#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 950#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 951#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 943#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 934#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 918#L87-1 assume !(0 == mp_add_~i~0 % 256); 919#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 906#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 907#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 924#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 952#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 953#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 982#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 983#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 938#L82-2 assume !(1 == mp_add_~i~0 % 256); 941#L83-1 assume !(2 == mp_add_~i~0 % 256); 991#L84-1 assume !(3 == mp_add_~i~0 % 256); 990#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 961#L87-1 [2021-08-27 14:36:27,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:27,181 INFO L82 PathProgramCache]: Analyzing trace with hash -2095675795, now seen corresponding path program 1 times [2021-08-27 14:36:27,181 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:27,181 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475666466] [2021-08-27 14:36:27,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:27,181 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:27,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:27,329 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:27,329 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475666466] [2021-08-27 14:36:27,329 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475666466] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:27,330 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:27,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 14:36:27,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236425402] [2021-08-27 14:36:27,330 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:36:27,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:27,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1043280079, now seen corresponding path program 2 times [2021-08-27 14:36:27,331 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:27,331 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777836247] [2021-08-27 14:36:27,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:27,331 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 14:36:27,354 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:27,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777836247] [2021-08-27 14:36:27,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777836247] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:27,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:27,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:36:27,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882568514] [2021-08-27 14:36:27,355 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:27,355 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:27,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 14:36:27,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-27 14:36:27,356 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. cyclomatic complexity: 39 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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-08-27 14:36:27,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:27,774 INFO L93 Difference]: Finished difference Result 245 states and 348 transitions. [2021-08-27 14:36:27,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 14:36:27,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 245 states and 348 transitions. [2021-08-27 14:36:27,779 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 168 [2021-08-27 14:36:27,780 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 245 states to 245 states and 348 transitions. [2021-08-27 14:36:27,780 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 245 [2021-08-27 14:36:27,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 245 [2021-08-27 14:36:27,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 245 states and 348 transitions. [2021-08-27 14:36:27,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:27,782 INFO L681 BuchiCegarLoop]: Abstraction has 245 states and 348 transitions. [2021-08-27 14:36:27,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states and 348 transitions. [2021-08-27 14:36:27,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 91. [2021-08-27 14:36:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 91 states have (on average 1.4065934065934067) internal successors, (128), 90 states have internal predecessors, (128), 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-08-27 14:36:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 128 transitions. [2021-08-27 14:36:27,787 INFO L704 BuchiCegarLoop]: Abstraction has 91 states and 128 transitions. [2021-08-27 14:36:27,787 INFO L587 BuchiCegarLoop]: Abstraction has 91 states and 128 transitions. [2021-08-27 14:36:27,787 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 14:36:27,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 91 states and 128 transitions. [2021-08-27 14:36:27,788 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 56 [2021-08-27 14:36:27,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:27,788 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:27,788 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:27,788 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-08-27 14:36:27,789 INFO L791 eck$LassoCheckResult]: Stem: 1273#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 1264#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 1256#L51 assume !(0 == mp_add_~a3~0 % 256); 1257#L51-1 mp_add_~nb~0 := 4; 1258#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1260#L63 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1261#L65 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 1295#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1319#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1318#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1317#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1316#L76-2 assume !(1 == mp_add_~i~0 % 256); 1315#L77-1 assume !(2 == mp_add_~i~0 % 256); 1314#L78-1 assume !(3 == mp_add_~i~0 % 256); 1312#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1310#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1265#L87-1 [2021-08-27 14:36:27,789 INFO L793 eck$LassoCheckResult]: Loop: 1265#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1253#L91-1 assume !(1 == mp_add_~i~0 % 256); 1254#L92-1 assume !(2 == mp_add_~i~0 % 256); 1255#L93-1 assume !(3 == mp_add_~i~0 % 256); 1270#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1299#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1300#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 1334#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1332#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1308#L87-1 assume !(0 == mp_add_~i~0 % 256); 1306#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 1304#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 1302#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 1301#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1297#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1298#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 1281#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 1330#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 1283#L82-2 assume !(1 == mp_add_~i~0 % 256); 1343#L83-1 assume !(2 == mp_add_~i~0 % 256); 1286#L84-1 assume !(3 == mp_add_~i~0 % 256); 1280#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1265#L87-1 [2021-08-27 14:36:27,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:27,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1829134745, now seen corresponding path program 1 times [2021-08-27 14:36:27,790 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:27,790 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226455106] [2021-08-27 14:36:27,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:27,790 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:27,860 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:27,860 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226455106] [2021-08-27 14:36:27,860 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226455106] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:27,860 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:27,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 14:36:27,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227491434] [2021-08-27 14:36:27,861 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:36:27,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:27,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1043280079, now seen corresponding path program 3 times [2021-08-27 14:36:27,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:27,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798808189] [2021-08-27 14:36:27,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:27,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:27,886 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 14:36:27,886 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:27,886 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798808189] [2021-08-27 14:36:27,886 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798808189] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:27,886 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:27,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:36:27,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763344557] [2021-08-27 14:36:27,887 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:27,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:27,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 14:36:27,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-27 14:36:27,888 INFO L87 Difference]: Start difference. First operand 91 states and 128 transitions. cyclomatic complexity: 39 Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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-08-27 14:36:28,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:28,043 INFO L93 Difference]: Finished difference Result 219 states and 318 transitions. [2021-08-27 14:36:28,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 14:36:28,044 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 219 states and 318 transitions. [2021-08-27 14:36:28,046 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 177 [2021-08-27 14:36:28,047 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 219 states to 219 states and 318 transitions. [2021-08-27 14:36:28,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 219 [2021-08-27 14:36:28,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 219 [2021-08-27 14:36:28,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 318 transitions. [2021-08-27 14:36:28,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:28,048 INFO L681 BuchiCegarLoop]: Abstraction has 219 states and 318 transitions. [2021-08-27 14:36:28,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 318 transitions. [2021-08-27 14:36:28,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 149. [2021-08-27 14:36:28,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 149 states have (on average 1.5033557046979866) internal successors, (224), 148 states have internal predecessors, (224), 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-08-27 14:36:28,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 224 transitions. [2021-08-27 14:36:28,054 INFO L704 BuchiCegarLoop]: Abstraction has 149 states and 224 transitions. [2021-08-27 14:36:28,054 INFO L587 BuchiCegarLoop]: Abstraction has 149 states and 224 transitions. [2021-08-27 14:36:28,054 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-08-27 14:36:28,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 224 transitions. [2021-08-27 14:36:28,055 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 113 [2021-08-27 14:36:28,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:28,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:28,056 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:28,060 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-08-27 14:36:28,060 INFO L791 eck$LassoCheckResult]: Stem: 1595#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 1587#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 1579#L51 assume !(0 == mp_add_~a3~0 % 256); 1580#L51-1 mp_add_~nb~0 := 4; 1581#L61 assume !(0 == mp_add_~b3~0 % 256); 1582#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1585#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1586#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1625#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1626#L76-2 assume !(1 == mp_add_~i~0 % 256); 1653#L77-1 assume !(2 == mp_add_~i~0 % 256); 1652#L78-1 assume !(3 == mp_add_~i~0 % 256); 1651#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 1645#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 1648#L82-2 assume !(1 == mp_add_~i~0 % 256); 1646#L83-1 assume !(2 == mp_add_~i~0 % 256); 1642#L84-1 assume !(3 == mp_add_~i~0 % 256); 1643#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1692#L87-1 [2021-08-27 14:36:28,061 INFO L793 eck$LassoCheckResult]: Loop: 1692#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1689#L91-1 assume !(1 == mp_add_~i~0 % 256); 1688#L92-1 assume !(2 == mp_add_~i~0 % 256); 1686#L93-1 assume !(3 == mp_add_~i~0 % 256); 1682#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1633#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1634#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 1665#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1660#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1661#L87-1 assume !(0 == mp_add_~i~0 % 256); 1691#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 1722#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 1721#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 1720#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1621#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1610#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1611#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1717#L76-2 assume !(1 == mp_add_~i~0 % 256); 1701#L77-1 assume !(2 == mp_add_~i~0 % 256); 1700#L78-1 assume !(3 == mp_add_~i~0 % 256); 1699#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 1694#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1692#L87-1 [2021-08-27 14:36:28,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:28,061 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 1 times [2021-08-27 14:36:28,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:28,061 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009850645] [2021-08-27 14:36:28,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:28,062 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:28,105 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:36:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:28,136 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:36:28,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:28,137 INFO L82 PathProgramCache]: Analyzing trace with hash 857385497, now seen corresponding path program 1 times [2021-08-27 14:36:28,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:28,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962086707] [2021-08-27 14:36:28,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:28,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:28,179 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 14:36:28,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:28,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962086707] [2021-08-27 14:36:28,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962086707] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:28,180 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:28,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:36:28,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220271523] [2021-08-27 14:36:28,182 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:28,182 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:28,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:36:28,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:36:28,183 INFO L87 Difference]: Start difference. First operand 149 states and 224 transitions. cyclomatic complexity: 77 Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 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-08-27 14:36:28,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:28,309 INFO L93 Difference]: Finished difference Result 194 states and 283 transitions. [2021-08-27 14:36:28,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:36:28,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 283 transitions. [2021-08-27 14:36:28,311 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 158 [2021-08-27 14:36:28,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 194 states and 283 transitions. [2021-08-27 14:36:28,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2021-08-27 14:36:28,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2021-08-27 14:36:28,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 283 transitions. [2021-08-27 14:36:28,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:28,313 INFO L681 BuchiCegarLoop]: Abstraction has 194 states and 283 transitions. [2021-08-27 14:36:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 283 transitions. [2021-08-27 14:36:28,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2021-08-27 14:36:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 191 states have (on average 1.4659685863874345) internal successors, (280), 190 states have internal predecessors, (280), 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-08-27 14:36:28,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 280 transitions. [2021-08-27 14:36:28,319 INFO L704 BuchiCegarLoop]: Abstraction has 191 states and 280 transitions. [2021-08-27 14:36:28,319 INFO L587 BuchiCegarLoop]: Abstraction has 191 states and 280 transitions. [2021-08-27 14:36:28,319 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-08-27 14:36:28,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 191 states and 280 transitions. [2021-08-27 14:36:28,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 155 [2021-08-27 14:36:28,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:28,320 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:28,321 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:28,321 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:28,321 INFO L791 eck$LassoCheckResult]: Stem: 1946#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 1935#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 1925#L51 assume !(0 == mp_add_~a3~0 % 256); 1926#L51-1 mp_add_~nb~0 := 4; 1927#L61 assume !(0 == mp_add_~b3~0 % 256); 1928#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1942#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2010#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2009#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2008#L76-2 assume !(1 == mp_add_~i~0 % 256); 2006#L77-1 assume !(2 == mp_add_~i~0 % 256); 2004#L78-1 assume !(3 == mp_add_~i~0 % 256); 2002#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 1996#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 1999#L82-2 assume !(1 == mp_add_~i~0 % 256); 1997#L83-1 assume !(2 == mp_add_~i~0 % 256); 1993#L84-1 assume !(3 == mp_add_~i~0 % 256); 1994#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2052#L87-1 [2021-08-27 14:36:28,321 INFO L793 eck$LassoCheckResult]: Loop: 2052#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 2050#L91-1 assume !(1 == mp_add_~i~0 % 256); 2049#L92-1 assume !(2 == mp_add_~i~0 % 256); 2048#L93-1 assume !(3 == mp_add_~i~0 % 256); 2047#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1975#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1976#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 2024#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2019#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 1938#L87-1 assume !(0 == mp_add_~i~0 % 256); 1931#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 1932#L92-1 assume !(2 == mp_add_~i~0 % 256); 1934#L93-1 assume !(3 == mp_add_~i~0 % 256); 1943#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2071#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2068#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2069#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2072#L76-2 assume !(1 == mp_add_~i~0 % 256); 2070#L77-1 assume !(2 == mp_add_~i~0 % 256); 2064#L78-1 assume !(3 == mp_add_~i~0 % 256); 2057#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2054#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2052#L87-1 [2021-08-27 14:36:28,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:28,322 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 2 times [2021-08-27 14:36:28,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:28,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496089960] [2021-08-27 14:36:28,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:28,323 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:28,337 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:36:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:28,363 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:36:28,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:28,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1165423065, now seen corresponding path program 1 times [2021-08-27 14:36:28,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:28,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374567467] [2021-08-27 14:36:28,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:28,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:28,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:28,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:28,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374567467] [2021-08-27 14:36:28,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374567467] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:28,458 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:28,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-27 14:36:28,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706287318] [2021-08-27 14:36:28,458 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:28,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:28,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 14:36:28,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-27 14:36:28,462 INFO L87 Difference]: Start difference. First operand 191 states and 280 transitions. cyclomatic complexity: 91 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-08-27 14:36:28,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:28,791 INFO L93 Difference]: Finished difference Result 367 states and 532 transitions. [2021-08-27 14:36:28,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 14:36:28,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 367 states and 532 transitions. [2021-08-27 14:36:28,794 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 311 [2021-08-27 14:36:28,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 367 states to 367 states and 532 transitions. [2021-08-27 14:36:28,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 367 [2021-08-27 14:36:28,796 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 367 [2021-08-27 14:36:28,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 367 states and 532 transitions. [2021-08-27 14:36:28,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:28,797 INFO L681 BuchiCegarLoop]: Abstraction has 367 states and 532 transitions. [2021-08-27 14:36:28,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states and 532 transitions. [2021-08-27 14:36:28,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 288. [2021-08-27 14:36:28,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 288 states have (on average 1.4548611111111112) internal successors, (419), 287 states have internal predecessors, (419), 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-08-27 14:36:28,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 419 transitions. [2021-08-27 14:36:28,804 INFO L704 BuchiCegarLoop]: Abstraction has 288 states and 419 transitions. [2021-08-27 14:36:28,804 INFO L587 BuchiCegarLoop]: Abstraction has 288 states and 419 transitions. [2021-08-27 14:36:28,804 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-08-27 14:36:28,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 288 states and 419 transitions. [2021-08-27 14:36:28,805 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 249 [2021-08-27 14:36:28,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:28,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:28,806 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:28,806 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:28,807 INFO L791 eck$LassoCheckResult]: Stem: 2517#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 2504#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 2494#L51 assume !(0 == mp_add_~a3~0 % 256); 2495#L51-1 mp_add_~nb~0 := 4; 2496#L61 assume !(0 == mp_add_~b3~0 % 256); 2497#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2513#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2587#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2586#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2585#L76-2 assume !(1 == mp_add_~i~0 % 256); 2583#L77-1 assume !(2 == mp_add_~i~0 % 256); 2581#L78-1 assume !(3 == mp_add_~i~0 % 256); 2579#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 2573#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 2576#L82-2 assume !(1 == mp_add_~i~0 % 256); 2574#L83-1 assume !(2 == mp_add_~i~0 % 256); 2570#L84-1 assume !(3 == mp_add_~i~0 % 256); 2571#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2601#L87-1 [2021-08-27 14:36:28,807 INFO L793 eck$LassoCheckResult]: Loop: 2601#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 2602#L91-1 assume !(1 == mp_add_~i~0 % 256); 2597#L92-1 assume !(2 == mp_add_~i~0 % 256); 2598#L93-1 assume !(3 == mp_add_~i~0 % 256); 2593#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2594#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2607#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 2608#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2531#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2723#L87-1 assume !(0 == mp_add_~i~0 % 256); 2722#L91-1 assume !(1 == mp_add_~i~0 % 256); 2502#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 2503#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 2515#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2546#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2547#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2604#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2605#L76-2 assume !(1 == mp_add_~i~0 % 256); 2655#L77-1 assume !(2 == mp_add_~i~0 % 256); 2649#L78-1 assume !(3 == mp_add_~i~0 % 256); 2650#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 2617#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 2601#L87-1 [2021-08-27 14:36:28,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:28,807 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 3 times [2021-08-27 14:36:28,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:28,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844926305] [2021-08-27 14:36:28,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:28,808 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:28,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:28,821 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:36:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:28,837 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:36:28,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:28,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1115550935, now seen corresponding path program 1 times [2021-08-27 14:36:28,838 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:28,838 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103670176] [2021-08-27 14:36:28,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:28,838 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:28,859 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-08-27 14:36:28,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:28,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103670176] [2021-08-27 14:36:28,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103670176] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:28,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:28,859 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:36:28,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140425656] [2021-08-27 14:36:28,860 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:28,860 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:28,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:36:28,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:36:28,861 INFO L87 Difference]: Start difference. First operand 288 states and 419 transitions. cyclomatic complexity: 134 Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 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-08-27 14:36:28,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:28,978 INFO L93 Difference]: Finished difference Result 340 states and 495 transitions. [2021-08-27 14:36:28,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:36:28,983 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 340 states and 495 transitions. [2021-08-27 14:36:28,985 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 301 [2021-08-27 14:36:28,987 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 340 states to 340 states and 495 transitions. [2021-08-27 14:36:28,987 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 340 [2021-08-27 14:36:28,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 340 [2021-08-27 14:36:28,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 340 states and 495 transitions. [2021-08-27 14:36:28,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:28,988 INFO L681 BuchiCegarLoop]: Abstraction has 340 states and 495 transitions. [2021-08-27 14:36:28,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states and 495 transitions. [2021-08-27 14:36:28,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 334. [2021-08-27 14:36:28,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 334 states have (on average 1.464071856287425) internal successors, (489), 333 states have internal predecessors, (489), 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-08-27 14:36:28,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 489 transitions. [2021-08-27 14:36:28,994 INFO L704 BuchiCegarLoop]: Abstraction has 334 states and 489 transitions. [2021-08-27 14:36:28,994 INFO L587 BuchiCegarLoop]: Abstraction has 334 states and 489 transitions. [2021-08-27 14:36:28,994 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-08-27 14:36:28,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 334 states and 489 transitions. [2021-08-27 14:36:28,996 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 295 [2021-08-27 14:36:28,996 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:28,996 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:28,997 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:28,997 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:28,997 INFO L791 eck$LassoCheckResult]: Stem: 3150#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 3139#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 3131#L51 assume !(0 == mp_add_~a3~0 % 256); 3132#L51-1 mp_add_~nb~0 := 4; 3133#L61 assume !(0 == mp_add_~b3~0 % 256); 3134#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3145#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3219#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3218#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3217#L76-2 assume !(1 == mp_add_~i~0 % 256); 3215#L77-1 assume !(2 == mp_add_~i~0 % 256); 3213#L78-1 assume !(3 == mp_add_~i~0 % 256); 3211#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 3205#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 3208#L82-2 assume !(1 == mp_add_~i~0 % 256); 3206#L83-1 assume !(2 == mp_add_~i~0 % 256); 3202#L84-1 assume !(3 == mp_add_~i~0 % 256); 3203#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 3236#L87-1 [2021-08-27 14:36:28,997 INFO L793 eck$LassoCheckResult]: Loop: 3236#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3237#L91-1 assume !(1 == mp_add_~i~0 % 256); 3228#L92-1 assume !(2 == mp_add_~i~0 % 256); 3229#L93-1 assume !(3 == mp_add_~i~0 % 256); 3224#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3225#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3260#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 3256#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3257#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 3329#L87-1 assume !(0 == mp_add_~i~0 % 256); 3289#L91-1 assume !(1 == mp_add_~i~0 % 256); 3288#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 3146#L93-1 assume !(3 == mp_add_~i~0 % 256); 3147#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3191#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3283#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3284#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3319#L76-2 assume !(1 == mp_add_~i~0 % 256); 3448#L77-1 assume !(2 == mp_add_~i~0 % 256); 3447#L78-1 assume !(3 == mp_add_~i~0 % 256); 3446#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 3442#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 3236#L87-1 [2021-08-27 14:36:28,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:28,998 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 4 times [2021-08-27 14:36:28,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:28,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080936587] [2021-08-27 14:36:28,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:28,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:29,011 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:36:29,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:29,025 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:36:29,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:29,026 INFO L82 PathProgramCache]: Analyzing trace with hash 722523925, now seen corresponding path program 1 times [2021-08-27 14:36:29,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:29,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612155552] [2021-08-27 14:36:29,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:29,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:29,188 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:29,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612155552] [2021-08-27 14:36:29,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612155552] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:36:29,188 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420487359] [2021-08-27 14:36:29,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:29,189 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:36:29,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:36:29,192 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-08-27 14:36:29,232 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-08-27 14:36:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:29,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 14:36:29,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:36:29,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:29,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420487359] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:36:29,761 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:36:29,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 5 [2021-08-27 14:36:29,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999712166] [2021-08-27 14:36:29,762 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:29,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:29,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 14:36:29,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-27 14:36:29,763 INFO L87 Difference]: Start difference. First operand 334 states and 489 transitions. cyclomatic complexity: 158 Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:36:30,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:30,048 INFO L93 Difference]: Finished difference Result 359 states and 490 transitions. [2021-08-27 14:36:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 14:36:30,049 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 359 states and 490 transitions. [2021-08-27 14:36:30,053 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 306 [2021-08-27 14:36:30,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 359 states to 359 states and 490 transitions. [2021-08-27 14:36:30,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 359 [2021-08-27 14:36:30,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 359 [2021-08-27 14:36:30,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 359 states and 490 transitions. [2021-08-27 14:36:30,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:30,056 INFO L681 BuchiCegarLoop]: Abstraction has 359 states and 490 transitions. [2021-08-27 14:36:30,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states and 490 transitions. [2021-08-27 14:36:30,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 302. [2021-08-27 14:36:30,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 302 states have (on average 1.4172185430463575) internal successors, (428), 301 states have internal predecessors, (428), 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-08-27 14:36:30,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 428 transitions. [2021-08-27 14:36:30,062 INFO L704 BuchiCegarLoop]: Abstraction has 302 states and 428 transitions. [2021-08-27 14:36:30,062 INFO L587 BuchiCegarLoop]: Abstraction has 302 states and 428 transitions. [2021-08-27 14:36:30,062 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2021-08-27 14:36:30,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 302 states and 428 transitions. [2021-08-27 14:36:30,063 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 257 [2021-08-27 14:36:30,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:30,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:30,066 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:30,066 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:30,066 INFO L791 eck$LassoCheckResult]: Stem: 3916#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 3906#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 3898#L51 assume !(0 == mp_add_~a3~0 % 256); 3899#L51-1 mp_add_~nb~0 := 4; 3900#L61 assume !(0 == mp_add_~b3~0 % 256); 3901#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3913#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3984#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3983#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3982#L76-2 assume !(1 == mp_add_~i~0 % 256); 3980#L77-1 assume !(2 == mp_add_~i~0 % 256); 3978#L78-1 assume !(3 == mp_add_~i~0 % 256); 3976#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 3970#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 3973#L82-2 assume !(1 == mp_add_~i~0 % 256); 3971#L83-1 assume !(2 == mp_add_~i~0 % 256); 3967#L84-1 assume !(3 == mp_add_~i~0 % 256); 3968#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4145#L87-1 [2021-08-27 14:36:30,068 INFO L793 eck$LassoCheckResult]: Loop: 4145#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4069#L91-1 assume !(1 == mp_add_~i~0 % 256); 4131#L92-1 assume !(2 == mp_add_~i~0 % 256); 4113#L93-1 assume !(3 == mp_add_~i~0 % 256); 4110#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4109#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3993#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3994#L76 assume !(0 == mp_add_~i~0 % 256); 4108#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 4106#L77-1 assume !(2 == mp_add_~i~0 % 256); 4103#L78-1 assume !(3 == mp_add_~i~0 % 256); 4097#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4093#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4094#L87-1 assume !(0 == mp_add_~i~0 % 256); 4014#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 4006#L92-1 assume !(2 == mp_add_~i~0 % 256); 3997#L93-1 assume !(3 == mp_add_~i~0 % 256); 3996#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4062#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4056#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4049#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4050#L76-2 assume !(1 == mp_add_~i~0 % 256); 4154#L77-1 assume !(2 == mp_add_~i~0 % 256); 4152#L78-1 assume !(3 == mp_add_~i~0 % 256); 4150#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4148#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4145#L87-1 [2021-08-27 14:36:30,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:30,069 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 5 times [2021-08-27 14:36:30,069 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:30,070 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49091485] [2021-08-27 14:36:30,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:30,071 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:30,099 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:36:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:30,126 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:36:30,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:30,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1570645289, now seen corresponding path program 1 times [2021-08-27 14:36:30,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:30,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053674938] [2021-08-27 14:36:30,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:30,128 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:30,204 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:30,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:30,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053674938] [2021-08-27 14:36:30,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053674938] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:30,204 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:30,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 14:36:30,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17669783] [2021-08-27 14:36:30,205 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:30,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:30,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 14:36:30,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 14:36:30,206 INFO L87 Difference]: Start difference. First operand 302 states and 428 transitions. cyclomatic complexity: 129 Second operand has 4 states, 4 states have (on average 6.5) 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-08-27 14:36:30,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:30,461 INFO L93 Difference]: Finished difference Result 457 states and 646 transitions. [2021-08-27 14:36:30,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 14:36:30,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 457 states and 646 transitions. [2021-08-27 14:36:30,464 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 406 [2021-08-27 14:36:30,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 457 states to 457 states and 646 transitions. [2021-08-27 14:36:30,467 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 457 [2021-08-27 14:36:30,467 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 457 [2021-08-27 14:36:30,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 457 states and 646 transitions. [2021-08-27 14:36:30,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:30,468 INFO L681 BuchiCegarLoop]: Abstraction has 457 states and 646 transitions. [2021-08-27 14:36:30,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states and 646 transitions. [2021-08-27 14:36:30,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 344. [2021-08-27 14:36:30,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 344 states have (on average 1.447674418604651) internal successors, (498), 343 states have internal predecessors, (498), 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-08-27 14:36:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 498 transitions. [2021-08-27 14:36:30,474 INFO L704 BuchiCegarLoop]: Abstraction has 344 states and 498 transitions. [2021-08-27 14:36:30,474 INFO L587 BuchiCegarLoop]: Abstraction has 344 states and 498 transitions. [2021-08-27 14:36:30,474 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2021-08-27 14:36:30,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 344 states and 498 transitions. [2021-08-27 14:36:30,476 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 308 [2021-08-27 14:36:30,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:30,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:30,477 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:30,477 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:30,477 INFO L791 eck$LassoCheckResult]: Stem: 4687#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 4674#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 4664#L51 assume !(0 == mp_add_~a3~0 % 256); 4665#L51-1 mp_add_~nb~0 := 4; 4666#L61 assume !(0 == mp_add_~b3~0 % 256); 4667#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 4683#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4747#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4746#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4745#L76-2 assume !(1 == mp_add_~i~0 % 256); 4743#L77-1 assume !(2 == mp_add_~i~0 % 256); 4741#L78-1 assume !(3 == mp_add_~i~0 % 256); 4739#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4733#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4736#L82-2 assume !(1 == mp_add_~i~0 % 256); 4734#L83-1 assume !(2 == mp_add_~i~0 % 256); 4730#L84-1 assume !(3 == mp_add_~i~0 % 256); 4731#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4909#L87-1 [2021-08-27 14:36:30,478 INFO L793 eck$LassoCheckResult]: Loop: 4909#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4787#L91-1 assume !(1 == mp_add_~i~0 % 256); 4672#L92-1 assume !(2 == mp_add_~i~0 % 256); 4673#L93-1 assume !(3 == mp_add_~i~0 % 256); 4681#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4682#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4998#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 4701#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5001#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4677#L87-1 assume !(0 == mp_add_~i~0 % 256); 4678#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 4775#L92-1 assume !(2 == mp_add_~i~0 % 256); 4776#L93-1 assume !(3 == mp_add_~i~0 % 256); 4959#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4958#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4956#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 4954#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4955#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4889#L87-1 assume !(0 == mp_add_~i~0 % 256); 4885#L91-1 assume !(1 == mp_add_~i~0 % 256); 4833#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 4832#L93-1 assume !(3 == mp_add_~i~0 % 256); 4829#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4717#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4718#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4822#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4823#L76-2 assume !(1 == mp_add_~i~0 % 256); 4972#L77-1 assume !(2 == mp_add_~i~0 % 256); 4969#L78-1 assume !(3 == mp_add_~i~0 % 256); 4964#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 4960#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 4909#L87-1 [2021-08-27 14:36:30,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:30,478 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 6 times [2021-08-27 14:36:30,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:30,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614003881] [2021-08-27 14:36:30,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:30,479 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:30,489 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:36:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:30,517 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:36:30,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:30,517 INFO L82 PathProgramCache]: Analyzing trace with hash 856847662, now seen corresponding path program 1 times [2021-08-27 14:36:30,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:30,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541890031] [2021-08-27 14:36:30,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:30,518 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:30,578 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:30,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541890031] [2021-08-27 14:36:30,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541890031] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:30,578 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:30,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-27 14:36:30,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636345302] [2021-08-27 14:36:30,579 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:30,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:30,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 14:36:30,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-27 14:36:30,580 INFO L87 Difference]: Start difference. First operand 344 states and 498 transitions. cyclomatic complexity: 156 Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 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-08-27 14:36:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:30,672 INFO L93 Difference]: Finished difference Result 409 states and 582 transitions. [2021-08-27 14:36:30,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 14:36:30,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 582 transitions. [2021-08-27 14:36:30,674 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 373 [2021-08-27 14:36:30,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 409 states and 582 transitions. [2021-08-27 14:36:30,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2021-08-27 14:36:30,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 409 [2021-08-27 14:36:30,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 409 states and 582 transitions. [2021-08-27 14:36:30,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:30,677 INFO L681 BuchiCegarLoop]: Abstraction has 409 states and 582 transitions. [2021-08-27 14:36:30,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states and 582 transitions. [2021-08-27 14:36:30,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 344. [2021-08-27 14:36:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 344 states have (on average 1.433139534883721) internal successors, (493), 343 states have internal predecessors, (493), 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-08-27 14:36:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 493 transitions. [2021-08-27 14:36:30,684 INFO L704 BuchiCegarLoop]: Abstraction has 344 states and 493 transitions. [2021-08-27 14:36:30,684 INFO L587 BuchiCegarLoop]: Abstraction has 344 states and 493 transitions. [2021-08-27 14:36:30,684 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2021-08-27 14:36:30,684 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 344 states and 493 transitions. [2021-08-27 14:36:30,686 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 308 [2021-08-27 14:36:30,686 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:30,686 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:30,686 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:30,687 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:30,687 INFO L791 eck$LassoCheckResult]: Stem: 5445#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 5435#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 5427#L51 assume !(0 == mp_add_~a3~0 % 256); 5428#L51-1 mp_add_~nb~0 := 4; 5429#L61 assume !(0 == mp_add_~b3~0 % 256); 5430#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 5749#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5747#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5746#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 5448#L76-2 assume !(1 == mp_add_~i~0 % 256); 5449#L77-1 assume !(2 == mp_add_~i~0 % 256); 5750#L78-1 assume !(3 == mp_add_~i~0 % 256); 5694#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5693#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 5692#L82-2 assume !(1 == mp_add_~i~0 % 256); 5691#L83-1 assume !(2 == mp_add_~i~0 % 256); 5689#L84-1 assume !(3 == mp_add_~i~0 % 256); 5687#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 5681#L87-1 [2021-08-27 14:36:30,687 INFO L793 eck$LassoCheckResult]: Loop: 5681#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 5678#L91-1 assume !(1 == mp_add_~i~0 % 256); 5675#L92-1 assume !(2 == mp_add_~i~0 % 256); 5672#L93-1 assume !(3 == mp_add_~i~0 % 256); 5670#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5669#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5666#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 5667#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5454#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 5436#L87-1 assume !(0 == mp_add_~i~0 % 256); 5437#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 5491#L92-1 assume !(2 == mp_add_~i~0 % 256); 5504#L93-1 assume !(3 == mp_add_~i~0 % 256); 5502#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5481#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5482#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 5580#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 5554#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 5548#L87-1 assume !(0 == mp_add_~i~0 % 256); 5492#L91-1 assume !(1 == mp_add_~i~0 % 256); 5488#L92-1 assume !(2 == mp_add_~i~0 % 256); 5486#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 5485#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5479#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5480#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5530#L76 assume !(0 == mp_add_~i~0 % 256); 5566#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 5450#L77-1 assume !(2 == mp_add_~i~0 % 256); 5451#L78-1 assume !(3 == mp_add_~i~0 % 256); 5459#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5466#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 5643#L82-2 assume !(1 == mp_add_~i~0 % 256); 5698#L83-1 assume !(2 == mp_add_~i~0 % 256); 5690#L84-1 assume !(3 == mp_add_~i~0 % 256); 5686#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 5681#L87-1 [2021-08-27 14:36:30,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:30,687 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 7 times [2021-08-27 14:36:30,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:30,688 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098124850] [2021-08-27 14:36:30,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:30,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:30,698 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:36:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:30,710 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:36:30,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:30,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1265935866, now seen corresponding path program 1 times [2021-08-27 14:36:30,711 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:30,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676276077] [2021-08-27 14:36:30,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:30,712 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:30,734 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-08-27 14:36:30,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:30,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676276077] [2021-08-27 14:36:30,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676276077] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:30,735 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:30,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:36:30,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842469755] [2021-08-27 14:36:30,735 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:30,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:30,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:36:30,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:36:30,736 INFO L87 Difference]: Start difference. First operand 344 states and 493 transitions. cyclomatic complexity: 151 Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:36:30,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:30,842 INFO L93 Difference]: Finished difference Result 347 states and 478 transitions. [2021-08-27 14:36:30,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:36:30,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 347 states and 478 transitions. [2021-08-27 14:36:30,844 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 311 [2021-08-27 14:36:30,845 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 347 states to 347 states and 478 transitions. [2021-08-27 14:36:30,845 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 347 [2021-08-27 14:36:30,846 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 347 [2021-08-27 14:36:30,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 347 states and 478 transitions. [2021-08-27 14:36:30,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:30,846 INFO L681 BuchiCegarLoop]: Abstraction has 347 states and 478 transitions. [2021-08-27 14:36:30,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states and 478 transitions. [2021-08-27 14:36:30,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 311. [2021-08-27 14:36:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 311 states have (on average 1.369774919614148) internal successors, (426), 310 states have internal predecessors, (426), 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-08-27 14:36:30,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 426 transitions. [2021-08-27 14:36:30,853 INFO L704 BuchiCegarLoop]: Abstraction has 311 states and 426 transitions. [2021-08-27 14:36:30,853 INFO L587 BuchiCegarLoop]: Abstraction has 311 states and 426 transitions. [2021-08-27 14:36:30,853 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2021-08-27 14:36:30,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 311 states and 426 transitions. [2021-08-27 14:36:30,854 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 275 [2021-08-27 14:36:30,854 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:30,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:30,855 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:30,855 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:30,856 INFO L791 eck$LassoCheckResult]: Stem: 6140#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 6130#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 6121#L51 assume !(0 == mp_add_~a3~0 % 256); 6122#L51-1 mp_add_~nb~0 := 4; 6123#L61 assume !(0 == mp_add_~b3~0 % 256); 6124#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 6419#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6418#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6417#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 6416#L76-2 assume !(1 == mp_add_~i~0 % 256); 6415#L77-1 assume !(2 == mp_add_~i~0 % 256); 6413#L78-1 assume !(3 == mp_add_~i~0 % 256); 6324#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6323#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 6321#L82-2 assume !(1 == mp_add_~i~0 % 256); 6319#L83-1 assume !(2 == mp_add_~i~0 % 256); 6317#L84-1 assume !(3 == mp_add_~i~0 % 256); 6315#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 6314#L87-1 [2021-08-27 14:36:30,856 INFO L793 eck$LassoCheckResult]: Loop: 6314#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 6313#L91-1 assume !(1 == mp_add_~i~0 % 256); 6312#L92-1 assume !(2 == mp_add_~i~0 % 256); 6311#L93-1 assume !(3 == mp_add_~i~0 % 256); 6310#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6309#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6307#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 6308#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 6163#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 6234#L87-1 assume !(0 == mp_add_~i~0 % 256); 6206#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 6183#L92-1 assume !(2 == mp_add_~i~0 % 256); 6197#L93-1 assume !(3 == mp_add_~i~0 % 256); 6194#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6189#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6157#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 6158#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 6147#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 6148#L87-1 assume !(0 == mp_add_~i~0 % 256); 6182#L91-1 assume !(1 == mp_add_~i~0 % 256); 6180#L92-1 assume !(2 == mp_add_~i~0 % 256); 6177#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 6175#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6171#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6172#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6210#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 6278#L76-2 assume !(1 == mp_add_~i~0 % 256); 6244#L77-1 assume !(2 == mp_add_~i~0 % 256); 6245#L78-1 assume !(3 == mp_add_~i~0 % 256); 6240#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6241#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 6322#L82-2 assume !(1 == mp_add_~i~0 % 256); 6320#L83-1 assume !(2 == mp_add_~i~0 % 256); 6318#L84-1 assume !(3 == mp_add_~i~0 % 256); 6316#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 6314#L87-1 [2021-08-27 14:36:30,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:30,856 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 8 times [2021-08-27 14:36:30,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:30,857 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192380649] [2021-08-27 14:36:30,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:30,857 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:30,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:30,867 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:36:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:30,878 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:36:30,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:30,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1955946050, now seen corresponding path program 1 times [2021-08-27 14:36:30,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:30,886 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566904268] [2021-08-27 14:36:30,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:30,887 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:30,962 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-08-27 14:36:30,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:30,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566904268] [2021-08-27 14:36:30,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566904268] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:36:30,963 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162462326] [2021-08-27 14:36:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:30,963 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:36:30,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:36:30,977 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-08-27 14:36:31,025 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-08-27 14:36:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:31,114 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 14:36:31,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:36:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 23 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-08-27 14:36:31,314 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162462326] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:36:31,316 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:36:31,317 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2021-08-27 14:36:31,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062553546] [2021-08-27 14:36:31,317 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:31,317 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:31,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 14:36:31,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-27 14:36:31,318 INFO L87 Difference]: Start difference. First operand 311 states and 426 transitions. cyclomatic complexity: 117 Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:36:32,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:32,092 INFO L93 Difference]: Finished difference Result 414 states and 525 transitions. [2021-08-27 14:36:32,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 14:36:32,093 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 414 states and 525 transitions. [2021-08-27 14:36:32,095 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 373 [2021-08-27 14:36:32,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 414 states to 414 states and 525 transitions. [2021-08-27 14:36:32,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 414 [2021-08-27 14:36:32,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 414 [2021-08-27 14:36:32,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 414 states and 525 transitions. [2021-08-27 14:36:32,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:32,099 INFO L681 BuchiCegarLoop]: Abstraction has 414 states and 525 transitions. [2021-08-27 14:36:32,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states and 525 transitions. [2021-08-27 14:36:32,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 279. [2021-08-27 14:36:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 279 states have (on average 1.3082437275985663) internal successors, (365), 278 states have internal predecessors, (365), 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-08-27 14:36:32,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 365 transitions. [2021-08-27 14:36:32,104 INFO L704 BuchiCegarLoop]: Abstraction has 279 states and 365 transitions. [2021-08-27 14:36:32,104 INFO L587 BuchiCegarLoop]: Abstraction has 279 states and 365 transitions. [2021-08-27 14:36:32,104 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2021-08-27 14:36:32,104 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 279 states and 365 transitions. [2021-08-27 14:36:32,105 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 243 [2021-08-27 14:36:32,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:32,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:32,106 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:32,106 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:32,106 INFO L791 eck$LassoCheckResult]: Stem: 7015#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 7003#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 6994#L51 assume !(0 == mp_add_~a3~0 % 256); 6995#L51-1 mp_add_~nb~0 := 4; 6996#L61 assume !(0 == mp_add_~b3~0 % 256); 6997#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 7011#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7233#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7232#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7231#L76-2 assume !(1 == mp_add_~i~0 % 256); 7229#L77-1 assume !(2 == mp_add_~i~0 % 256); 7227#L78-1 assume !(3 == mp_add_~i~0 % 256); 7225#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7219#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 7222#L82-2 assume !(1 == mp_add_~i~0 % 256); 7220#L83-1 assume !(2 == mp_add_~i~0 % 256); 7216#L84-1 assume !(3 == mp_add_~i~0 % 256); 7217#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7244#L87-1 [2021-08-27 14:36:32,107 INFO L793 eck$LassoCheckResult]: Loop: 7244#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 7242#L91-1 assume !(1 == mp_add_~i~0 % 256); 7211#L92-1 assume !(2 == mp_add_~i~0 % 256); 7209#L93-1 assume !(3 == mp_add_~i~0 % 256); 7210#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7205#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7206#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 7202#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7201#L82 assume !(0 == mp_add_~i~0 % 256); 7200#L82-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 7181#L83-1 assume !(2 == mp_add_~i~0 % 256); 7198#L84-1 assume !(3 == mp_add_~i~0 % 256); 7196#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7195#L87-1 assume !(0 == mp_add_~i~0 % 256); 7194#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 7094#L92-1 assume !(2 == mp_add_~i~0 % 256); 7191#L93-1 assume !(3 == mp_add_~i~0 % 256); 7189#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7187#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7185#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 7167#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 7183#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 7158#L87-1 assume !(0 == mp_add_~i~0 % 256); 7000#L91-1 assume !(1 == mp_add_~i~0 % 256); 7001#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 7002#L93-1 assume !(3 == mp_add_~i~0 % 256); 7048#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7046#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7047#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7129#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7130#L76-2 assume !(1 == mp_add_~i~0 % 256); 7252#L77-1 assume !(2 == mp_add_~i~0 % 256); 7251#L78-1 assume !(3 == mp_add_~i~0 % 256); 7248#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7249#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 7258#L82-2 assume !(1 == mp_add_~i~0 % 256); 7256#L83-1 assume !(2 == mp_add_~i~0 % 256); 7254#L84-1 assume !(3 == mp_add_~i~0 % 256); 7245#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7244#L87-1 [2021-08-27 14:36:32,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:32,107 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 9 times [2021-08-27 14:36:32,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:32,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946764452] [2021-08-27 14:36:32,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:32,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:32,118 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:36:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:32,129 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:36:32,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:32,130 INFO L82 PathProgramCache]: Analyzing trace with hash -593187128, now seen corresponding path program 1 times [2021-08-27 14:36:32,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:32,130 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724394377] [2021-08-27 14:36:32,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:32,131 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:32,253 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:32,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724394377] [2021-08-27 14:36:32,253 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724394377] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:36:32,253 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315780503] [2021-08-27 14:36:32,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:32,253 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:36:32,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:36:32,260 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-08-27 14:36:32,278 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-08-27 14:36:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:32,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 14:36:32,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:36:32,711 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2021-08-27 14:36:32,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315780503] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:32,712 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 14:36:32,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2021-08-27 14:36:32,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454019995] [2021-08-27 14:36:32,712 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:32,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:32,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 14:36:32,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-08-27 14:36:32,714 INFO L87 Difference]: Start difference. First operand 279 states and 365 transitions. cyclomatic complexity: 88 Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-08-27 14:36:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:32,960 INFO L93 Difference]: Finished difference Result 348 states and 433 transitions. [2021-08-27 14:36:32,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 14:36:32,961 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 348 states and 433 transitions. [2021-08-27 14:36:32,963 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 312 [2021-08-27 14:36:32,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 348 states to 348 states and 433 transitions. [2021-08-27 14:36:32,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 348 [2021-08-27 14:36:32,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 348 [2021-08-27 14:36:32,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 348 states and 433 transitions. [2021-08-27 14:36:32,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:32,966 INFO L681 BuchiCegarLoop]: Abstraction has 348 states and 433 transitions. [2021-08-27 14:36:32,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states and 433 transitions. [2021-08-27 14:36:32,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 292. [2021-08-27 14:36:32,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 292 states have (on average 1.2671232876712328) internal successors, (370), 291 states have internal predecessors, (370), 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-08-27 14:36:32,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 370 transitions. [2021-08-27 14:36:32,971 INFO L704 BuchiCegarLoop]: Abstraction has 292 states and 370 transitions. [2021-08-27 14:36:32,971 INFO L587 BuchiCegarLoop]: Abstraction has 292 states and 370 transitions. [2021-08-27 14:36:32,972 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2021-08-27 14:36:32,972 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 292 states and 370 transitions. [2021-08-27 14:36:32,973 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 256 [2021-08-27 14:36:32,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:32,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:32,974 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:32,974 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 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] [2021-08-27 14:36:32,974 INFO L791 eck$LassoCheckResult]: Stem: 7768#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 7758#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 7750#L51 assume !(0 == mp_add_~a3~0 % 256); 7751#L51-1 mp_add_~nb~0 := 4; 7752#L61 assume !(0 == mp_add_~b3~0 % 256); 7753#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 8017#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8015#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8013#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 8011#L76-2 assume !(1 == mp_add_~i~0 % 256); 8009#L77-1 assume !(2 == mp_add_~i~0 % 256); 8006#L78-1 assume !(3 == mp_add_~i~0 % 256); 7991#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7990#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 7989#L82-2 assume !(1 == mp_add_~i~0 % 256); 7988#L83-1 assume !(2 == mp_add_~i~0 % 256); 7987#L84-1 assume !(3 == mp_add_~i~0 % 256); 7964#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7962#L87-1 [2021-08-27 14:36:32,975 INFO L793 eck$LassoCheckResult]: Loop: 7962#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 7960#L91-1 assume !(1 == mp_add_~i~0 % 256); 7959#L92-1 assume !(2 == mp_add_~i~0 % 256); 7957#L93-1 assume !(3 == mp_add_~i~0 % 256); 7955#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7953#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7952#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 7927#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 7841#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 7842#L87-1 assume !(0 == mp_add_~i~0 % 256); 7835#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 7815#L92-1 assume !(2 == mp_add_~i~0 % 256); 7827#L93-1 assume !(3 == mp_add_~i~0 % 256); 7828#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7817#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7818#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 8030#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8038#L82 assume !(0 == mp_add_~i~0 % 256); 8037#L82-2 assume !(1 == mp_add_~i~0 % 256); 8036#L83-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 7780#L84-1 assume !(3 == mp_add_~i~0 % 256); 7774#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 7759#L87-1 assume !(0 == mp_add_~i~0 % 256); 7760#L91-1 assume !(1 == mp_add_~i~0 % 256); 7821#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 7811#L93-1 assume !(3 == mp_add_~i~0 % 256); 7819#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7785#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7786#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 7918#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7917#L82 assume !(0 == mp_add_~i~0 % 256); 7916#L82-2 assume !(1 == mp_add_~i~0 % 256); 7915#L83-1 assume !(2 == mp_add_~i~0 % 256); 7914#L84-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 7911#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 7826#L87-1 assume !(0 == mp_add_~i~0 % 256); 7813#L91-1 assume !(1 == mp_add_~i~0 % 256); 7809#L92-1 assume !(2 == mp_add_~i~0 % 256); 7805#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 7803#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7800#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7801#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7908#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7909#L76-2 assume !(1 == mp_add_~i~0 % 256); 7986#L77-1 assume !(2 == mp_add_~i~0 % 256); 7985#L78-1 assume !(3 == mp_add_~i~0 % 256); 7984#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7970#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 7981#L82-2 assume !(1 == mp_add_~i~0 % 256); 7979#L83-1 assume !(2 == mp_add_~i~0 % 256); 7968#L84-1 assume !(3 == mp_add_~i~0 % 256); 7966#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 7962#L87-1 [2021-08-27 14:36:32,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:32,975 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 10 times [2021-08-27 14:36:32,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:32,976 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447771844] [2021-08-27 14:36:32,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:32,976 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:32,987 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:36:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:32,999 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:36:33,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:33,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1797868163, now seen corresponding path program 1 times [2021-08-27 14:36:33,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:33,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633225061] [2021-08-27 14:36:33,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:33,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:33,094 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-08-27 14:36:33,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:33,095 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633225061] [2021-08-27 14:36:33,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633225061] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:33,095 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:33,095 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 14:36:33,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657544680] [2021-08-27 14:36:33,096 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:33,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:33,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 14:36:33,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-27 14:36:33,097 INFO L87 Difference]: Start difference. First operand 292 states and 370 transitions. cyclomatic complexity: 80 Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 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-08-27 14:36:33,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:33,561 INFO L93 Difference]: Finished difference Result 588 states and 723 transitions. [2021-08-27 14:36:33,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-27 14:36:33,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 588 states and 723 transitions. [2021-08-27 14:36:33,565 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 461 [2021-08-27 14:36:33,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 588 states to 579 states and 712 transitions. [2021-08-27 14:36:33,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 579 [2021-08-27 14:36:33,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 579 [2021-08-27 14:36:33,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 579 states and 712 transitions. [2021-08-27 14:36:33,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:33,569 INFO L681 BuchiCegarLoop]: Abstraction has 579 states and 712 transitions. [2021-08-27 14:36:33,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states and 712 transitions. [2021-08-27 14:36:33,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 466. [2021-08-27 14:36:33,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 466 states have (on average 1.2489270386266094) internal successors, (582), 465 states have internal predecessors, (582), 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-08-27 14:36:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 582 transitions. [2021-08-27 14:36:33,577 INFO L704 BuchiCegarLoop]: Abstraction has 466 states and 582 transitions. [2021-08-27 14:36:33,577 INFO L587 BuchiCegarLoop]: Abstraction has 466 states and 582 transitions. [2021-08-27 14:36:33,577 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2021-08-27 14:36:33,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 466 states and 582 transitions. [2021-08-27 14:36:33,579 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 392 [2021-08-27 14:36:33,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:33,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:33,580 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:33,580 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:33,581 INFO L791 eck$LassoCheckResult]: Stem: 8666#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 8656#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 8648#L51 assume !(0 == mp_add_~a3~0 % 256); 8649#L51-1 mp_add_~nb~0 := 4; 8650#L61 assume !(0 == mp_add_~b3~0 % 256); 8651#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 9035#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9033#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8684#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 8685#L76-2 assume !(1 == mp_add_~i~0 % 256); 9068#L77-1 assume !(2 == mp_add_~i~0 % 256); 9066#L78-1 assume !(3 == mp_add_~i~0 % 256); 9064#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9022#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 9058#L82-2 assume !(1 == mp_add_~i~0 % 256); 9055#L83-1 assume !(2 == mp_add_~i~0 % 256); 9052#L84-1 assume !(3 == mp_add_~i~0 % 256); 9049#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 9020#L87-1 [2021-08-27 14:36:33,581 INFO L793 eck$LassoCheckResult]: Loop: 9020#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 9017#L91-1 assume !(1 == mp_add_~i~0 % 256); 9014#L92-1 assume !(2 == mp_add_~i~0 % 256); 9010#L93-1 assume !(3 == mp_add_~i~0 % 256); 9006#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9001#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8994#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 8984#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8981#L82 assume !(0 == mp_add_~i~0 % 256); 8979#L82-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 8933#L83-1 assume !(2 == mp_add_~i~0 % 256); 8976#L84-1 assume !(3 == mp_add_~i~0 % 256); 8973#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 8971#L87-1 assume !(0 == mp_add_~i~0 % 256); 8969#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 8889#L92-1 assume !(2 == mp_add_~i~0 % 256); 8964#L93-1 assume !(3 == mp_add_~i~0 % 256); 8961#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8958#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8955#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 8916#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 8726#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 8724#L87-1 assume !(0 == mp_add_~i~0 % 256); 8723#L91-1 assume !(1 == mp_add_~i~0 % 256); 8706#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 8704#L93-1 assume !(3 == mp_add_~i~0 % 256); 8702#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8703#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8751#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8752#L76 assume !(0 == mp_add_~i~0 % 256); 8780#L76-2 assume !(1 == mp_add_~i~0 % 256); 8776#L77-1 assume !(2 == mp_add_~i~0 % 256); 8777#L78-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 8748#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 8730#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 8729#L87-1 assume !(0 == mp_add_~i~0 % 256); 8728#L91-1 assume !(1 == mp_add_~i~0 % 256); 8727#L92-1 assume !(2 == mp_add_~i~0 % 256); 8713#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 8714#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 8709#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8710#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8874#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 8895#L76-2 assume !(1 == mp_add_~i~0 % 256); 9110#L77-1 assume !(2 == mp_add_~i~0 % 256); 9108#L78-1 assume !(3 == mp_add_~i~0 % 256); 9061#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9059#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 9056#L82-2 assume !(1 == mp_add_~i~0 % 256); 9053#L83-1 assume !(2 == mp_add_~i~0 % 256); 9050#L84-1 assume !(3 == mp_add_~i~0 % 256); 9025#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 9020#L87-1 [2021-08-27 14:36:33,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:33,581 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 11 times [2021-08-27 14:36:33,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:33,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831965147] [2021-08-27 14:36:33,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:33,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:33,595 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:36:33,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:33,611 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:36:33,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:33,612 INFO L82 PathProgramCache]: Analyzing trace with hash 302130057, now seen corresponding path program 1 times [2021-08-27 14:36:33,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:33,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840101307] [2021-08-27 14:36:33,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:33,613 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:33,671 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-08-27 14:36:33,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:33,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840101307] [2021-08-27 14:36:33,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840101307] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:36:33,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380633617] [2021-08-27 14:36:33,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:33,672 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:36:33,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:36:33,674 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-08-27 14:36:33,687 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-08-27 14:36:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:33,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:36:33,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:36:34,226 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 51 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-08-27 14:36:34,226 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380633617] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:36:34,226 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:36:34,226 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-08-27 14:36:34,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717003267] [2021-08-27 14:36:34,228 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:34,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:34,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 14:36:34,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 14:36:34,229 INFO L87 Difference]: Start difference. First operand 466 states and 582 transitions. cyclomatic complexity: 119 Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:36:35,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:35,234 INFO L93 Difference]: Finished difference Result 963 states and 1187 transitions. [2021-08-27 14:36:35,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-08-27 14:36:35,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 963 states and 1187 transitions. [2021-08-27 14:36:35,239 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 804 [2021-08-27 14:36:35,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 963 states to 961 states and 1185 transitions. [2021-08-27 14:36:35,244 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 961 [2021-08-27 14:36:35,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 961 [2021-08-27 14:36:35,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 961 states and 1185 transitions. [2021-08-27 14:36:35,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:35,246 INFO L681 BuchiCegarLoop]: Abstraction has 961 states and 1185 transitions. [2021-08-27 14:36:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states and 1185 transitions. [2021-08-27 14:36:35,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 689. [2021-08-27 14:36:35,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 689 states have (on average 1.274310595065312) internal successors, (878), 688 states have internal predecessors, (878), 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-08-27 14:36:35,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 878 transitions. [2021-08-27 14:36:35,256 INFO L704 BuchiCegarLoop]: Abstraction has 689 states and 878 transitions. [2021-08-27 14:36:35,257 INFO L587 BuchiCegarLoop]: Abstraction has 689 states and 878 transitions. [2021-08-27 14:36:35,257 INFO L425 BuchiCegarLoop]: ======== Iteration 19============ [2021-08-27 14:36:35,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 689 states and 878 transitions. [2021-08-27 14:36:35,259 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 615 [2021-08-27 14:36:35,259 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:35,259 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:35,260 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:35,260 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:35,261 INFO L791 eck$LassoCheckResult]: Stem: 10290#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 10279#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 10272#L51 assume !(0 == mp_add_~a3~0 % 256); 10273#L51-1 mp_add_~nb~0 := 4; 10274#L61 assume !(0 == mp_add_~b3~0 % 256); 10275#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 10694#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10695#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10689#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 10690#L76-2 assume !(1 == mp_add_~i~0 % 256); 10673#L77-1 assume !(2 == mp_add_~i~0 % 256); 10674#L78-1 assume !(3 == mp_add_~i~0 % 256); 10651#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 10650#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 10648#L82-2 assume !(1 == mp_add_~i~0 % 256); 10646#L83-1 assume !(2 == mp_add_~i~0 % 256); 10644#L84-1 assume !(3 == mp_add_~i~0 % 256); 10605#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 10601#L87-1 [2021-08-27 14:36:35,261 INFO L793 eck$LassoCheckResult]: Loop: 10601#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 10597#L91-1 assume !(1 == mp_add_~i~0 % 256); 10594#L92-1 assume !(2 == mp_add_~i~0 % 256); 10591#L93-1 assume !(3 == mp_add_~i~0 % 256); 10588#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 10585#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10580#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10576#L76 assume !(0 == mp_add_~i~0 % 256); 10572#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 10541#L77-1 assume !(2 == mp_add_~i~0 % 256); 10567#L78-1 assume !(3 == mp_add_~i~0 % 256); 10563#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 10534#L82 assume !(0 == mp_add_~i~0 % 256); 10532#L82-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 10431#L83-1 assume !(2 == mp_add_~i~0 % 256); 10521#L84-1 assume !(3 == mp_add_~i~0 % 256); 10519#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 10518#L87-1 assume !(0 == mp_add_~i~0 % 256); 10516#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 10515#L92-1 assume !(2 == mp_add_~i~0 % 256); 10514#L93-1 assume !(3 == mp_add_~i~0 % 256); 10512#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 10510#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10507#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10505#L76 assume !(0 == mp_add_~i~0 % 256); 10504#L76-2 assume !(1 == mp_add_~i~0 % 256); 10498#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 10424#L78-1 assume !(3 == mp_add_~i~0 % 256); 10425#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 10418#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 10416#L87-1 assume !(0 == mp_add_~i~0 % 256); 10417#L91-1 assume !(1 == mp_add_~i~0 % 256); 10530#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 10410#L93-1 assume !(3 == mp_add_~i~0 % 256); 10526#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 10524#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10522#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 10523#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 10583#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 10564#L87-1 assume !(0 == mp_add_~i~0 % 256); 10664#L91-1 assume !(1 == mp_add_~i~0 % 256); 10658#L92-1 assume !(2 == mp_add_~i~0 % 256); 10643#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 10490#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 10487#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10483#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10477#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 10478#L76-2 assume !(1 == mp_add_~i~0 % 256); 10654#L77-1 assume !(2 == mp_add_~i~0 % 256); 10653#L78-1 assume !(3 == mp_add_~i~0 % 256); 10652#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 10610#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 10649#L82-2 assume !(1 == mp_add_~i~0 % 256); 10647#L83-1 assume !(2 == mp_add_~i~0 % 256); 10645#L84-1 assume !(3 == mp_add_~i~0 % 256); 10641#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 10601#L87-1 [2021-08-27 14:36:35,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:35,261 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 12 times [2021-08-27 14:36:35,261 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:35,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163418943] [2021-08-27 14:36:35,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:35,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:35,272 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:36:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:35,287 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:36:35,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:35,289 INFO L82 PathProgramCache]: Analyzing trace with hash 2112972027, now seen corresponding path program 1 times [2021-08-27 14:36:35,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:35,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841656449] [2021-08-27 14:36:35,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:35,289 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 19 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:35,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:35,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841656449] [2021-08-27 14:36:35,411 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841656449] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:36:35,411 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737124764] [2021-08-27 14:36:35,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:35,412 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:36:35,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:36:35,414 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-08-27 14:36:35,416 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-08-27 14:36:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:35,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 14:36:35,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:36:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2021-08-27 14:36:36,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737124764] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:36,088 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 14:36:36,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2021-08-27 14:36:36,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475365156] [2021-08-27 14:36:36,090 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:36,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:36,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-27 14:36:36,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-27 14:36:36,091 INFO L87 Difference]: Start difference. First operand 689 states and 878 transitions. cyclomatic complexity: 194 Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-08-27 14:36:36,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:36,385 INFO L93 Difference]: Finished difference Result 785 states and 918 transitions. [2021-08-27 14:36:36,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 14:36:36,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 785 states and 918 transitions. [2021-08-27 14:36:36,389 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 696 [2021-08-27 14:36:36,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 785 states to 738 states and 848 transitions. [2021-08-27 14:36:36,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 738 [2021-08-27 14:36:36,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 738 [2021-08-27 14:36:36,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 738 states and 848 transitions. [2021-08-27 14:36:36,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:36,394 INFO L681 BuchiCegarLoop]: Abstraction has 738 states and 848 transitions. [2021-08-27 14:36:36,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states and 848 transitions. [2021-08-27 14:36:36,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 601. [2021-08-27 14:36:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 601 states have (on average 1.1763727121464227) internal successors, (707), 600 states have internal predecessors, (707), 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-08-27 14:36:36,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 707 transitions. [2021-08-27 14:36:36,403 INFO L704 BuchiCegarLoop]: Abstraction has 601 states and 707 transitions. [2021-08-27 14:36:36,403 INFO L587 BuchiCegarLoop]: Abstraction has 601 states and 707 transitions. [2021-08-27 14:36:36,404 INFO L425 BuchiCegarLoop]: ======== Iteration 20============ [2021-08-27 14:36:36,404 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 601 states and 707 transitions. [2021-08-27 14:36:36,406 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 566 [2021-08-27 14:36:36,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:36,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:36,407 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:36,407 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:36,407 INFO L791 eck$LassoCheckResult]: Stem: 11940#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 11932#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 11924#L51 assume !(0 == mp_add_~a3~0 % 256); 11925#L51-1 mp_add_~nb~0 := 4; 11926#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 11928#L63 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 11929#L65 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 11960#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 12261#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12262#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12255#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 12256#L76-2 assume !(1 == mp_add_~i~0 % 256); 12250#L77-1 assume !(2 == mp_add_~i~0 % 256); 12251#L78-1 assume !(3 == mp_add_~i~0 % 256); 12292#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12178#L81 [2021-08-27 14:36:36,407 INFO L793 eck$LassoCheckResult]: Loop: 12178#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 12149#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 12291#L91-1 assume !(1 == mp_add_~i~0 % 256); 12290#L92-1 assume !(2 == mp_add_~i~0 % 256); 12289#L93-1 assume !(3 == mp_add_~i~0 % 256); 12288#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12287#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12286#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12285#L76 assume !(0 == mp_add_~i~0 % 256); 12284#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 12181#L77-1 assume !(2 == mp_add_~i~0 % 256); 12283#L78-1 assume !(3 == mp_add_~i~0 % 256); 12282#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12114#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 12116#L87-1 assume !(0 == mp_add_~i~0 % 256); 12281#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 12020#L92-1 assume !(2 == mp_add_~i~0 % 256); 12280#L93-1 assume !(3 == mp_add_~i~0 % 256); 12279#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12278#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12277#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12276#L76 assume !(0 == mp_add_~i~0 % 256); 12275#L76-2 assume !(1 == mp_add_~i~0 % 256); 12274#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 12176#L78-1 assume !(3 == mp_add_~i~0 % 256); 12084#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12273#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 12063#L87-1 assume !(0 == mp_add_~i~0 % 256); 12272#L91-1 assume !(1 == mp_add_~i~0 % 256); 12271#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 12124#L93-1 assume !(3 == mp_add_~i~0 % 256); 12270#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12269#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12268#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12267#L76 assume !(0 == mp_add_~i~0 % 256); 12266#L76-2 assume !(1 == mp_add_~i~0 % 256); 12265#L77-1 assume !(2 == mp_add_~i~0 % 256); 12252#L78-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 12047#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12246#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 12211#L87-1 assume !(0 == mp_add_~i~0 % 256); 12242#L91-1 assume !(1 == mp_add_~i~0 % 256); 12240#L92-1 assume !(2 == mp_add_~i~0 % 256); 12226#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 12010#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12011#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11998#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11992#L76 assume !(0 == mp_add_~i~0 % 256); 11989#L76-2 assume !(1 == mp_add_~i~0 % 256); 11985#L77-1 assume !(2 == mp_add_~i~0 % 256); 11986#L78-1 assume !(3 == mp_add_~i~0 % 256); 12203#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12198#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 12192#L87-1 assume !(0 == mp_add_~i~0 % 256); 12142#L91-1 assume !(1 == mp_add_~i~0 % 256); 12140#L92-1 assume !(2 == mp_add_~i~0 % 256); 12121#L93-1 assume !(3 == mp_add_~i~0 % 256); 12099#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12008#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12009#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12184#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 12185#L76-2 assume !(1 == mp_add_~i~0 % 256); 12186#L77-1 assume !(2 == mp_add_~i~0 % 256); 12182#L78-1 assume !(3 == mp_add_~i~0 % 256); 12177#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12178#L81 [2021-08-27 14:36:36,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:36,408 INFO L82 PathProgramCache]: Analyzing trace with hash -890288343, now seen corresponding path program 1 times [2021-08-27 14:36:36,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:36,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591322692] [2021-08-27 14:36:36,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:36,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:36,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:36,526 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:36,526 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591322692] [2021-08-27 14:36:36,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591322692] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:36,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:36,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-27 14:36:36,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107122729] [2021-08-27 14:36:36,527 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:36:36,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:36,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1197554810, now seen corresponding path program 1 times [2021-08-27 14:36:36,527 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:36,527 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787902425] [2021-08-27 14:36:36,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:36,528 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:36,645 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 24 proven. 106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:36,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:36,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787902425] [2021-08-27 14:36:36,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787902425] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:36:36,646 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784499104] [2021-08-27 14:36:36,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:36,647 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:36:36,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:36:36,661 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-08-27 14:36:36,686 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-08-27 14:36:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:36,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 14:36:36,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:36:37,714 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 83 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2021-08-27 14:36:37,714 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784499104] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:36:37,714 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:36:37,714 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2021-08-27 14:36:37,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639591602] [2021-08-27 14:36:37,715 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:37,715 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:37,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 14:36:37,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-08-27 14:36:37,716 INFO L87 Difference]: Start difference. First operand 601 states and 707 transitions. cyclomatic complexity: 111 Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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-08-27 14:36:38,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:38,429 INFO L93 Difference]: Finished difference Result 2371 states and 2782 transitions. [2021-08-27 14:36:38,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-27 14:36:38,433 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2371 states and 2782 transitions. [2021-08-27 14:36:38,445 INFO L131 ngComponentsAnalysis]: Automaton has 20 accepting balls. 2264 [2021-08-27 14:36:38,455 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2371 states to 2371 states and 2782 transitions. [2021-08-27 14:36:38,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2371 [2021-08-27 14:36:38,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2371 [2021-08-27 14:36:38,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2371 states and 2782 transitions. [2021-08-27 14:36:38,459 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:38,459 INFO L681 BuchiCegarLoop]: Abstraction has 2371 states and 2782 transitions. [2021-08-27 14:36:38,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states and 2782 transitions. [2021-08-27 14:36:38,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 593. [2021-08-27 14:36:38,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 593 states have (on average 1.1770657672849916) internal successors, (698), 592 states have internal predecessors, (698), 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-08-27 14:36:38,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 698 transitions. [2021-08-27 14:36:38,475 INFO L704 BuchiCegarLoop]: Abstraction has 593 states and 698 transitions. [2021-08-27 14:36:38,475 INFO L587 BuchiCegarLoop]: Abstraction has 593 states and 698 transitions. [2021-08-27 14:36:38,475 INFO L425 BuchiCegarLoop]: ======== Iteration 21============ [2021-08-27 14:36:38,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 593 states and 698 transitions. [2021-08-27 14:36:38,477 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 566 [2021-08-27 14:36:38,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:38,478 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:38,478 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:38,478 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 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] [2021-08-27 14:36:38,479 INFO L791 eck$LassoCheckResult]: Stem: 15128#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 15119#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 15110#L51 assume !(0 == mp_add_~a3~0 % 256); 15111#L51-1 mp_add_~nb~0 := 4; 15112#L61 assume !(0 == mp_add_~b3~0 % 256); 15113#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 15126#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15484#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15483#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 15482#L76-2 assume !(1 == mp_add_~i~0 % 256); 15481#L77-1 assume !(2 == mp_add_~i~0 % 256); 15480#L78-1 assume !(3 == mp_add_~i~0 % 256); 15478#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15479#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 15699#L82-2 assume !(1 == mp_add_~i~0 % 256); 15698#L83-1 assume !(2 == mp_add_~i~0 % 256); 15697#L84-1 assume !(3 == mp_add_~i~0 % 256); 15696#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 15406#L87-1 [2021-08-27 14:36:38,479 INFO L793 eck$LassoCheckResult]: Loop: 15406#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 15401#L91-1 assume !(1 == mp_add_~i~0 % 256); 15396#L92-1 assume !(2 == mp_add_~i~0 % 256); 15390#L93-1 assume !(3 == mp_add_~i~0 % 256); 15367#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15365#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15361#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15358#L76 assume !(0 == mp_add_~i~0 % 256); 15355#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 15353#L77-1 assume !(2 == mp_add_~i~0 % 256); 15350#L78-1 assume !(3 == mp_add_~i~0 % 256); 15344#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15340#L82 assume !(0 == mp_add_~i~0 % 256); 15338#L82-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 15336#L83-1 assume !(2 == mp_add_~i~0 % 256); 15334#L84-1 assume !(3 == mp_add_~i~0 % 256); 15331#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 15329#L87-1 assume !(0 == mp_add_~i~0 % 256); 15327#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 15323#L92-1 assume !(2 == mp_add_~i~0 % 256); 15319#L93-1 assume !(3 == mp_add_~i~0 % 256); 15316#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15313#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15311#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15287#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 15275#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15272#L87-1 assume !(0 == mp_add_~i~0 % 256); 15270#L91-1 assume !(1 == mp_add_~i~0 % 256); 15266#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 15261#L93-1 assume !(3 == mp_add_~i~0 % 256); 15257#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15253#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15248#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15241#L76 assume !(0 == mp_add_~i~0 % 256); 15236#L76-2 assume !(1 == mp_add_~i~0 % 256); 15231#L77-1 assume !(2 == mp_add_~i~0 % 256); 15226#L78-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 15219#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15217#L82 assume !(0 == mp_add_~i~0 % 256); 15216#L82-2 assume !(1 == mp_add_~i~0 % 256); 15215#L83-1 assume !(2 == mp_add_~i~0 % 256); 15212#L84-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 15213#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 15202#L87-1 assume !(0 == mp_add_~i~0 % 256); 15203#L91-1 assume !(1 == mp_add_~i~0 % 256); 15194#L92-1 assume !(2 == mp_add_~i~0 % 256); 15195#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 15190#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15191#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15185#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 15187#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 15439#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 15438#L87-1 assume !(0 == mp_add_~i~0 % 256); 15437#L91-1 assume !(1 == mp_add_~i~0 % 256); 15436#L92-1 assume !(2 == mp_add_~i~0 % 256); 15260#L93-1 assume !(3 == mp_add_~i~0 % 256); 15256#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15252#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15246#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15239#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 15240#L76-2 assume !(1 == mp_add_~i~0 % 256); 15476#L77-1 assume !(2 == mp_add_~i~0 % 256); 15475#L78-1 assume !(3 == mp_add_~i~0 % 256); 15473#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 15474#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 15477#L82-2 assume !(1 == mp_add_~i~0 % 256); 15451#L83-1 assume !(2 == mp_add_~i~0 % 256); 15412#L84-1 assume !(3 == mp_add_~i~0 % 256); 15409#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 15406#L87-1 [2021-08-27 14:36:38,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:38,479 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 13 times [2021-08-27 14:36:38,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:38,480 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543852178] [2021-08-27 14:36:38,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:38,480 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:38,492 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:36:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:38,506 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:36:38,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:38,507 INFO L82 PathProgramCache]: Analyzing trace with hash -455989548, now seen corresponding path program 1 times [2021-08-27 14:36:38,507 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:38,507 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471112638] [2021-08-27 14:36:38,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:38,507 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2021-08-27 14:36:38,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:38,619 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471112638] [2021-08-27 14:36:38,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471112638] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:38,620 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:38,620 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-27 14:36:38,620 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861475114] [2021-08-27 14:36:38,620 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:38,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:38,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 14:36:38,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-27 14:36:38,621 INFO L87 Difference]: Start difference. First operand 593 states and 698 transitions. cyclomatic complexity: 110 Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 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-08-27 14:36:39,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:39,112 INFO L93 Difference]: Finished difference Result 836 states and 964 transitions. [2021-08-27 14:36:39,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 14:36:39,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 836 states and 964 transitions. [2021-08-27 14:36:39,115 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 753 [2021-08-27 14:36:39,118 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 836 states to 819 states and 945 transitions. [2021-08-27 14:36:39,118 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 819 [2021-08-27 14:36:39,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 819 [2021-08-27 14:36:39,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 819 states and 945 transitions. [2021-08-27 14:36:39,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:39,119 INFO L681 BuchiCegarLoop]: Abstraction has 819 states and 945 transitions. [2021-08-27 14:36:39,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states and 945 transitions. [2021-08-27 14:36:39,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 712. [2021-08-27 14:36:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 712 states have (on average 1.1713483146067416) internal successors, (834), 711 states have internal predecessors, (834), 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-08-27 14:36:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 834 transitions. [2021-08-27 14:36:39,130 INFO L704 BuchiCegarLoop]: Abstraction has 712 states and 834 transitions. [2021-08-27 14:36:39,130 INFO L587 BuchiCegarLoop]: Abstraction has 712 states and 834 transitions. [2021-08-27 14:36:39,130 INFO L425 BuchiCegarLoop]: ======== Iteration 22============ [2021-08-27 14:36:39,130 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 712 states and 834 transitions. [2021-08-27 14:36:39,132 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 685 [2021-08-27 14:36:39,133 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:39,133 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:39,133 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:39,133 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:39,133 INFO L791 eck$LassoCheckResult]: Stem: 16584#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 16576#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 16568#L51 assume !(0 == mp_add_~a3~0 % 256); 16569#L51-1 mp_add_~nb~0 := 4; 16570#L61 assume !(0 == mp_add_~b3~0 % 256); 16571#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 16581#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16854#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16852#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 16853#L76-2 assume !(1 == mp_add_~i~0 % 256); 16848#L77-1 assume !(2 == mp_add_~i~0 % 256); 16849#L78-1 assume !(3 == mp_add_~i~0 % 256); 16842#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 16843#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 16832#L82-2 assume !(1 == mp_add_~i~0 % 256); 16833#L83-1 assume !(2 == mp_add_~i~0 % 256); 16821#L84-1 assume !(3 == mp_add_~i~0 % 256); 16822#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 16799#L87-1 [2021-08-27 14:36:39,133 INFO L793 eck$LassoCheckResult]: Loop: 16799#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 16797#L91-1 assume !(1 == mp_add_~i~0 % 256); 16795#L92-1 assume !(2 == mp_add_~i~0 % 256); 16793#L93-1 assume !(3 == mp_add_~i~0 % 256); 16791#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16789#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16785#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16782#L76 assume !(0 == mp_add_~i~0 % 256); 16779#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 16777#L77-1 assume !(2 == mp_add_~i~0 % 256); 16765#L78-1 assume !(3 == mp_add_~i~0 % 256); 16766#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 16772#L82 assume !(0 == mp_add_~i~0 % 256); 16771#L82-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 16770#L83-1 assume !(2 == mp_add_~i~0 % 256); 16768#L84-1 assume !(3 == mp_add_~i~0 % 256); 16762#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 16759#L87-1 assume !(0 == mp_add_~i~0 % 256); 16756#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 16752#L92-1 assume !(2 == mp_add_~i~0 % 256); 16748#L93-1 assume !(3 == mp_add_~i~0 % 256); 16745#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16742#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16738#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16735#L76 assume !(0 == mp_add_~i~0 % 256); 16731#L76-2 assume !(1 == mp_add_~i~0 % 256); 16727#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 16721#L78-1 assume !(3 == mp_add_~i~0 % 256); 16716#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 16710#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 16708#L87-1 assume !(0 == mp_add_~i~0 % 256); 16706#L91-1 assume !(1 == mp_add_~i~0 % 256); 16694#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 16691#L93-1 assume !(3 == mp_add_~i~0 % 256); 16687#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16683#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16676#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 16677#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 16653#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 16644#L87-1 assume !(0 == mp_add_~i~0 % 256); 16894#L91-1 assume !(1 == mp_add_~i~0 % 256); 16891#L92-1 assume !(2 == mp_add_~i~0 % 256); 16889#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 16874#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16828#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16829#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16869#L76 assume !(0 == mp_add_~i~0 % 256); 16872#L76-2 assume !(1 == mp_add_~i~0 % 256); 16871#L77-1 assume !(2 == mp_add_~i~0 % 256); 16870#L78-1 assume !(3 == mp_add_~i~0 % 256); 16868#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 16861#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 16860#L87-1 assume !(0 == mp_add_~i~0 % 256); 16859#L91-1 assume !(1 == mp_add_~i~0 % 256); 16858#L92-1 assume !(2 == mp_add_~i~0 % 256); 16850#L93-1 assume !(3 == mp_add_~i~0 % 256); 16689#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16685#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16680#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16672#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 16673#L76-2 assume !(1 == mp_add_~i~0 % 256); 16851#L77-1 assume !(2 == mp_add_~i~0 % 256); 16846#L78-1 assume !(3 == mp_add_~i~0 % 256); 16847#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 16838#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 16839#L82-2 assume !(1 == mp_add_~i~0 % 256); 16826#L83-1 assume !(2 == mp_add_~i~0 % 256); 16827#L84-1 assume !(3 == mp_add_~i~0 % 256); 16801#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 16799#L87-1 [2021-08-27 14:36:39,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:39,134 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 14 times [2021-08-27 14:36:39,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:39,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214955206] [2021-08-27 14:36:39,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:39,134 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:39,144 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:36:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:39,154 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:36:39,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:39,155 INFO L82 PathProgramCache]: Analyzing trace with hash 733714482, now seen corresponding path program 2 times [2021-08-27 14:36:39,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:39,155 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789513959] [2021-08-27 14:36:39,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:39,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:39,284 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-08-27 14:36:39,284 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:39,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789513959] [2021-08-27 14:36:39,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789513959] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:36:39,285 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:36:39,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-27 14:36:39,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758869920] [2021-08-27 14:36:39,285 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:39,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:39,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 14:36:39,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-08-27 14:36:39,286 INFO L87 Difference]: Start difference. First operand 712 states and 834 transitions. cyclomatic complexity: 128 Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 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-08-27 14:36:39,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:36:39,918 INFO L93 Difference]: Finished difference Result 936 states and 1081 transitions. [2021-08-27 14:36:39,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-27 14:36:39,919 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 936 states and 1081 transitions. [2021-08-27 14:36:39,922 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 842 [2021-08-27 14:36:39,926 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 936 states to 918 states and 1062 transitions. [2021-08-27 14:36:39,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 918 [2021-08-27 14:36:39,926 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 918 [2021-08-27 14:36:39,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 918 states and 1062 transitions. [2021-08-27 14:36:39,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:36:39,927 INFO L681 BuchiCegarLoop]: Abstraction has 918 states and 1062 transitions. [2021-08-27 14:36:39,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states and 1062 transitions. [2021-08-27 14:36:39,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 829. [2021-08-27 14:36:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 829 states have (on average 1.1700844390832328) internal successors, (970), 828 states have internal predecessors, (970), 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-08-27 14:36:39,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 970 transitions. [2021-08-27 14:36:39,940 INFO L704 BuchiCegarLoop]: Abstraction has 829 states and 970 transitions. [2021-08-27 14:36:39,940 INFO L587 BuchiCegarLoop]: Abstraction has 829 states and 970 transitions. [2021-08-27 14:36:39,940 INFO L425 BuchiCegarLoop]: ======== Iteration 23============ [2021-08-27 14:36:39,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 829 states and 970 transitions. [2021-08-27 14:36:39,943 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 802 [2021-08-27 14:36:39,943 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:36:39,943 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:36:39,943 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:39,943 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:36:39,944 INFO L791 eck$LassoCheckResult]: Stem: 18266#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 18254#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 18244#L51 assume !(0 == mp_add_~a3~0 % 256); 18245#L51-1 mp_add_~nb~0 := 4; 18246#L61 assume !(0 == mp_add_~b3~0 % 256); 18247#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 18262#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18593#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18591#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 18588#L76-2 assume !(1 == mp_add_~i~0 % 256); 18554#L77-1 assume !(2 == mp_add_~i~0 % 256); 18555#L78-1 assume !(3 == mp_add_~i~0 % 256); 18542#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 18543#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 18516#L82-2 assume !(1 == mp_add_~i~0 % 256); 18517#L83-1 assume !(2 == mp_add_~i~0 % 256); 18503#L84-1 assume !(3 == mp_add_~i~0 % 256); 18504#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 18481#L87-1 [2021-08-27 14:36:39,944 INFO L793 eck$LassoCheckResult]: Loop: 18481#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 18479#L91-1 assume !(1 == mp_add_~i~0 % 256); 18477#L92-1 assume !(2 == mp_add_~i~0 % 256); 18475#L93-1 assume !(3 == mp_add_~i~0 % 256); 18473#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18471#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18467#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18464#L76 assume !(0 == mp_add_~i~0 % 256); 18461#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 18459#L77-1 assume !(2 == mp_add_~i~0 % 256); 18455#L78-1 assume !(3 == mp_add_~i~0 % 256); 18448#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 18444#L82 assume !(0 == mp_add_~i~0 % 256); 18440#L82-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 18437#L83-1 assume !(2 == mp_add_~i~0 % 256); 18434#L84-1 assume !(3 == mp_add_~i~0 % 256); 18431#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 18428#L87-1 assume !(0 == mp_add_~i~0 % 256); 18424#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 18421#L92-1 assume !(2 == mp_add_~i~0 % 256); 18417#L93-1 assume !(3 == mp_add_~i~0 % 256); 18414#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18411#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18407#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18405#L76 assume !(0 == mp_add_~i~0 % 256); 18401#L76-2 assume !(1 == mp_add_~i~0 % 256); 18399#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 18396#L78-1 assume !(3 == mp_add_~i~0 % 256); 18392#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 18388#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 18386#L87-1 assume !(0 == mp_add_~i~0 % 256); 18383#L91-1 assume !(1 == mp_add_~i~0 % 256); 18375#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 18372#L93-1 assume !(3 == mp_add_~i~0 % 256); 18368#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18364#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18358#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18353#L76 assume !(0 == mp_add_~i~0 % 256); 18348#L76-2 assume !(1 == mp_add_~i~0 % 256); 18343#L77-1 assume !(2 == mp_add_~i~0 % 256); 18338#L78-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 18334#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 18329#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 18323#L87-1 assume !(0 == mp_add_~i~0 % 256); 18324#L91-1 assume !(1 == mp_add_~i~0 % 256); 18319#L92-1 assume !(2 == mp_add_~i~0 % 256); 18320#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 18315#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18316#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18309#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 18310#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 18599#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 18598#L87-1 assume !(0 == mp_add_~i~0 % 256); 18597#L91-1 assume !(1 == mp_add_~i~0 % 256); 18596#L92-1 assume !(2 == mp_add_~i~0 % 256); 18595#L93-1 assume !(3 == mp_add_~i~0 % 256); 18370#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18366#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18361#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18355#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 18356#L76-2 assume !(1 == mp_add_~i~0 % 256); 18558#L77-1 assume !(2 == mp_add_~i~0 % 256); 18549#L78-1 assume !(3 == mp_add_~i~0 % 256); 18550#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 18535#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 18536#L82-2 assume !(1 == mp_add_~i~0 % 256); 18510#L83-1 assume !(2 == mp_add_~i~0 % 256); 18511#L84-1 assume !(3 == mp_add_~i~0 % 256); 18484#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 18481#L87-1 [2021-08-27 14:36:39,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:39,944 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 15 times [2021-08-27 14:36:39,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:39,944 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101647247] [2021-08-27 14:36:39,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:39,945 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:39,954 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:36:39,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:36:39,965 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:36:39,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:36:39,965 INFO L82 PathProgramCache]: Analyzing trace with hash -382324270, now seen corresponding path program 1 times [2021-08-27 14:36:39,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:36:39,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343183908] [2021-08-27 14:36:39,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:39,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:36:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:40,085 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 25 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:36:40,085 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:36:40,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343183908] [2021-08-27 14:36:40,086 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343183908] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:36:40,086 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235401162] [2021-08-27 14:36:40,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:36:40,086 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:36:40,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:36:40,134 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-08-27 14:36:40,135 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-08-27 14:36:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:36:40,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 14:36:40,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:36:53,739 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 74 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-08-27 14:36:53,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235401162] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:36:53,739 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:36:53,739 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2021-08-27 14:36:53,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209490478] [2021-08-27 14:36:53,741 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:36:53,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:36:53,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 14:36:53,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2021-08-27 14:36:53,742 INFO L87 Difference]: Start difference. First operand 829 states and 970 transitions. cyclomatic complexity: 148 Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 10 states have internal predecessors, (106), 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-08-27 14:37:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:37:41,444 INFO L93 Difference]: Finished difference Result 1188 states and 1357 transitions. [2021-08-27 14:37:41,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-27 14:37:41,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1188 states and 1357 transitions. [2021-08-27 14:37:41,450 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1147 [2021-08-27 14:37:41,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1188 states to 1174 states and 1333 transitions. [2021-08-27 14:37:41,455 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1174 [2021-08-27 14:37:41,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1174 [2021-08-27 14:37:41,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1174 states and 1333 transitions. [2021-08-27 14:37:41,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:37:41,457 INFO L681 BuchiCegarLoop]: Abstraction has 1174 states and 1333 transitions. [2021-08-27 14:37:41,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states and 1333 transitions. [2021-08-27 14:37:41,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1001. [2021-08-27 14:37:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 1001 states have (on average 1.1468531468531469) internal successors, (1148), 1000 states have internal predecessors, (1148), 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-08-27 14:37:41,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1148 transitions. [2021-08-27 14:37:41,473 INFO L704 BuchiCegarLoop]: Abstraction has 1001 states and 1148 transitions. [2021-08-27 14:37:41,473 INFO L587 BuchiCegarLoop]: Abstraction has 1001 states and 1148 transitions. [2021-08-27 14:37:41,473 INFO L425 BuchiCegarLoop]: ======== Iteration 24============ [2021-08-27 14:37:41,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1001 states and 1148 transitions. [2021-08-27 14:37:41,478 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 974 [2021-08-27 14:37:41,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:37:41,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:37:41,480 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:37:41,480 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:37:41,481 INFO L791 eck$LassoCheckResult]: Stem: 20496#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 20487#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 20478#L51 assume !(0 == mp_add_~a3~0 % 256); 20479#L51-1 mp_add_~nb~0 := 4; 20480#L61 assume !(0 == mp_add_~b3~0 % 256); 20481#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 20494#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 20860#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 20857#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 20858#L76-2 assume !(1 == mp_add_~i~0 % 256); 20852#L77-1 assume !(2 == mp_add_~i~0 % 256); 20853#L78-1 assume !(3 == mp_add_~i~0 % 256); 20847#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 20845#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 20843#L82-2 assume !(1 == mp_add_~i~0 % 256); 20842#L83-1 assume !(2 == mp_add_~i~0 % 256); 20840#L84-1 assume !(3 == mp_add_~i~0 % 256); 20828#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 20826#L87-1 [2021-08-27 14:37:41,481 INFO L793 eck$LassoCheckResult]: Loop: 20826#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 20824#L91-1 assume !(1 == mp_add_~i~0 % 256); 20822#L92-1 assume !(2 == mp_add_~i~0 % 256); 20820#L93-1 assume !(3 == mp_add_~i~0 % 256); 20815#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 20816#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 20808#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 20809#L76 assume !(0 == mp_add_~i~0 % 256); 20798#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 20799#L77-1 assume !(2 == mp_add_~i~0 % 256); 20789#L78-1 assume !(3 == mp_add_~i~0 % 256); 20790#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 20814#L82 assume !(0 == mp_add_~i~0 % 256); 20811#L82-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 20807#L83-1 assume !(2 == mp_add_~i~0 % 256); 20800#L84-1 assume !(3 == mp_add_~i~0 % 256); 20795#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 20791#L87-1 assume !(0 == mp_add_~i~0 % 256); 20787#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 20785#L92-1 assume !(2 == mp_add_~i~0 % 256); 20782#L93-1 assume !(3 == mp_add_~i~0 % 256); 20778#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 20776#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 20763#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 20760#L76 assume !(0 == mp_add_~i~0 % 256); 20757#L76-2 assume !(1 == mp_add_~i~0 % 256); 20751#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 20749#L78-1 assume !(3 == mp_add_~i~0 % 256); 20746#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 20744#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 20742#L87-1 assume !(0 == mp_add_~i~0 % 256); 20740#L91-1 assume !(1 == mp_add_~i~0 % 256); 20737#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 20734#L93-1 assume !(3 == mp_add_~i~0 % 256); 20733#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 20731#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 20729#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 20727#L76 assume !(0 == mp_add_~i~0 % 256); 20725#L76-2 assume !(1 == mp_add_~i~0 % 256); 20724#L77-1 assume !(2 == mp_add_~i~0 % 256); 20722#L78-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 20644#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 20640#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 20638#L87-1 assume !(0 == mp_add_~i~0 % 256); 20636#L91-1 assume !(1 == mp_add_~i~0 % 256); 20634#L92-1 assume !(2 == mp_add_~i~0 % 256); 20632#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 20612#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 20608#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 20603#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 20587#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 20584#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 20582#L87-1 assume !(0 == mp_add_~i~0 % 256); 20580#L91-1 assume !(1 == mp_add_~i~0 % 256); 20578#L92-1 assume !(2 == mp_add_~i~0 % 256); 20576#L93-1 assume !(3 == mp_add_~i~0 % 256); 20574#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 20572#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 20569#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 20567#L76 assume !(0 == mp_add_~i~0 % 256); 20565#L76-2 assume !(1 == mp_add_~i~0 % 256); 20563#L77-1 assume !(2 == mp_add_~i~0 % 256); 20561#L78-1 assume !(3 == mp_add_~i~0 % 256); 20559#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 20552#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 20550#L87-1 assume !(0 == mp_add_~i~0 % 256); 20551#L91-1 assume !(1 == mp_add_~i~0 % 256); 20546#L92-1 assume !(2 == mp_add_~i~0 % 256); 20547#L93-1 assume !(3 == mp_add_~i~0 % 256); 20540#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 20541#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 20534#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 20533#L76 assume !(0 == mp_add_~i~0 % 256); 20531#L76-2 assume !(1 == mp_add_~i~0 % 256); 20532#L77-1 assume !(2 == mp_add_~i~0 % 256); 20771#L78-1 assume !(3 == mp_add_~i~0 % 256); 20768#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 20762#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 20759#L87-1 assume !(0 == mp_add_~i~0 % 256); 20756#L91-1 assume !(1 == mp_add_~i~0 % 256); 20755#L92-1 assume !(2 == mp_add_~i~0 % 256); 20754#L93-1 assume !(3 == mp_add_~i~0 % 256); 20542#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 20543#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 20689#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 20683#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 20684#L76-2 assume !(1 == mp_add_~i~0 % 256); 20855#L77-1 assume !(2 == mp_add_~i~0 % 256); 20849#L78-1 assume !(3 == mp_add_~i~0 % 256); 20850#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 20879#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 21474#L82-2 assume !(1 == mp_add_~i~0 % 256); 21473#L83-1 assume !(2 == mp_add_~i~0 % 256); 21472#L84-1 assume !(3 == mp_add_~i~0 % 256); 21471#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 20826#L87-1 [2021-08-27 14:37:41,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:37:41,482 INFO L82 PathProgramCache]: Analyzing trace with hash 389365736, now seen corresponding path program 16 times [2021-08-27 14:37:41,482 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:37:41,482 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626743390] [2021-08-27 14:37:41,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:37:41,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:37:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:37:41,492 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:37:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:37:41,505 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:37:41,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:37:41,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1186296946, now seen corresponding path program 2 times [2021-08-27 14:37:41,506 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:37:41,506 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915888727] [2021-08-27 14:37:41,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:37:41,506 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:37:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:37:41,924 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 192 proven. 9 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2021-08-27 14:37:41,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:37:41,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915888727] [2021-08-27 14:37:41,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915888727] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:37:41,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872814779] [2021-08-27 14:37:41,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 14:37:41,925 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:37:41,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:41,929 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-08-27 14:37:41,930 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-08-27 14:37:42,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 14:37:42,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:37:42,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjunts are in the unsatisfiable core [2021-08-27 14:37:42,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:37:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 103 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2021-08-27 14:37:43,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872814779] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:37:43,702 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:37:43,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-08-27 14:37:43,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139426259] [2021-08-27 14:37:43,703 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-08-27 14:37:43,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:37:43,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 14:37:43,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-08-27 14:37:43,704 INFO L87 Difference]: Start difference. First operand 1001 states and 1148 transitions. cyclomatic complexity: 154 Second operand has 15 states, 15 states have (on average 5.666666666666667) internal successors, (85), 15 states have internal predecessors, (85), 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-08-27 14:37:47,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:37:47,276 INFO L93 Difference]: Finished difference Result 755 states and 807 transitions. [2021-08-27 14:37:47,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-08-27 14:37:47,276 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 755 states and 807 transitions. [2021-08-27 14:37:47,278 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 112 [2021-08-27 14:37:47,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 755 states to 744 states and 791 transitions. [2021-08-27 14:37:47,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 744 [2021-08-27 14:37:47,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 744 [2021-08-27 14:37:47,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 744 states and 791 transitions. [2021-08-27 14:37:47,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:37:47,282 INFO L681 BuchiCegarLoop]: Abstraction has 744 states and 791 transitions. [2021-08-27 14:37:47,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states and 791 transitions. [2021-08-27 14:37:47,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 311. [2021-08-27 14:37:47,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 311 states have (on average 1.1028938906752412) internal successors, (343), 310 states have internal predecessors, (343), 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-08-27 14:37:47,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 343 transitions. [2021-08-27 14:37:47,287 INFO L704 BuchiCegarLoop]: Abstraction has 311 states and 343 transitions. [2021-08-27 14:37:47,287 INFO L587 BuchiCegarLoop]: Abstraction has 311 states and 343 transitions. [2021-08-27 14:37:47,287 INFO L425 BuchiCegarLoop]: ======== Iteration 25============ [2021-08-27 14:37:47,287 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 311 states and 343 transitions. [2021-08-27 14:37:47,288 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 60 [2021-08-27 14:37:47,288 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:37:47,288 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:37:47,289 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] [2021-08-27 14:37:47,289 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:37:47,289 INFO L791 eck$LassoCheckResult]: Stem: 22597#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 22591#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 22585#L51 assume !(0 == mp_add_~a3~0 % 256); 22586#L51-1 mp_add_~nb~0 := 4; 22587#L61 assume !(0 == mp_add_~b3~0 % 256); 22588#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 22596#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22658#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22657#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 22656#L76-2 assume !(1 == mp_add_~i~0 % 256); 22655#L77-1 assume !(2 == mp_add_~i~0 % 256); 22654#L78-1 assume !(3 == mp_add_~i~0 % 256); 22653#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22652#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 22651#L82-2 assume !(1 == mp_add_~i~0 % 256); 22650#L83-1 assume !(2 == mp_add_~i~0 % 256); 22649#L84-1 assume !(3 == mp_add_~i~0 % 256); 22647#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 22648#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 22674#L91-1 assume !(1 == mp_add_~i~0 % 256); 22673#L92-1 assume !(2 == mp_add_~i~0 % 256); 22672#L93-1 assume !(3 == mp_add_~i~0 % 256); 22671#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22670#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22668#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22669#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22865#L82 assume !(0 == mp_add_~i~0 % 256); 22864#L82-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 22863#L83-1 assume !(2 == mp_add_~i~0 % 256); 22862#L84-1 assume !(3 == mp_add_~i~0 % 256); 22860#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 22859#L87-1 assume !(0 == mp_add_~i~0 % 256); 22858#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 22857#L92-1 assume !(2 == mp_add_~i~0 % 256); 22856#L93-1 assume !(3 == mp_add_~i~0 % 256); 22855#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22854#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22853#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22773#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22851#L82 assume !(0 == mp_add_~i~0 % 256); 22850#L82-2 assume !(1 == mp_add_~i~0 % 256); 22849#L83-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 22848#L84-1 assume !(3 == mp_add_~i~0 % 256); 22846#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 22845#L87-1 assume !(0 == mp_add_~i~0 % 256); 22844#L91-1 assume !(1 == mp_add_~i~0 % 256); 22843#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 22842#L93-1 assume !(3 == mp_add_~i~0 % 256); 22841#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22840#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22839#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22718#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 22834#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 22831#L87-1 assume !(0 == mp_add_~i~0 % 256); 22830#L91-1 assume !(1 == mp_add_~i~0 % 256); 22829#L92-1 assume !(2 == mp_add_~i~0 % 256); 22828#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 22595#L94-1 [2021-08-27 14:37:47,289 INFO L793 eck$LassoCheckResult]: Loop: 22595#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22592#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22593#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22608#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22604#L82 assume !(0 == mp_add_~i~0 % 256); 22605#L82-2 assume !(1 == mp_add_~i~0 % 256); 22607#L83-1 assume !(2 == mp_add_~i~0 % 256); 22606#L84-1 assume !(3 == mp_add_~i~0 % 256); 22601#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 22594#L87-1 assume !(0 == mp_add_~i~0 % 256); 22582#L91-1 assume !(1 == mp_add_~i~0 % 256); 22583#L92-1 assume !(2 == mp_add_~i~0 % 256); 22584#L93-1 assume !(3 == mp_add_~i~0 % 256); 22595#L94-1 [2021-08-27 14:37:47,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:37:47,289 INFO L82 PathProgramCache]: Analyzing trace with hash -529922365, now seen corresponding path program 1 times [2021-08-27 14:37:47,289 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:37:47,289 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888832483] [2021-08-27 14:37:47,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:37:47,290 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:37:47,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:37:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 38 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-08-27 14:37:47,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:37:47,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888832483] [2021-08-27 14:37:47,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888832483] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:37:47,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833129193] [2021-08-27 14:37:47,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:37:47,489 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:37:47,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:47,490 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-08-27 14:37:47,492 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-08-27 14:37:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:37:47,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 14:37:47,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:37:48,470 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-08-27 14:37:48,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833129193] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:37:48,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:37:48,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2021-08-27 14:37:48,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585076864] [2021-08-27 14:37:48,470 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:37:48,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:37:48,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1233229496, now seen corresponding path program 1 times [2021-08-27 14:37:48,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:37:48,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401315110] [2021-08-27 14:37:48,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:37:48,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:37:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:37:48,491 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:37:48,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:37:48,493 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:37:48,838 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:37:48,839 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:37:48,839 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:37:48,840 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:37:48,840 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 14:37:48,840 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:48,840 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:37:48,840 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:37:48,840 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration25_Loop [2021-08-27 14:37:48,840 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:37:48,840 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:37:48,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:37:48,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:37:49,354 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:37:49,354 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 14:37:49,355 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:49,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:49,356 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:37:49,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-27 14:37:49,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 14:37:49,362 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:37:49,381 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 14:37:49,382 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~carry~0=0} Honda state: {ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~carry~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 14:37:49,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2021-08-27 14:37:49,399 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:49,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:49,400 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:37:49,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-27 14:37:49,405 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 14:37:49,405 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:37:49,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-27 14:37:49,487 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:49,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:49,490 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:37:49,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 14:37:49,500 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 14:37:49,500 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:37:49,945 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 14:37:49,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2021-08-27 14:37:49,950 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:37:49,950 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:37:49,950 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:37:49,950 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:37:49,950 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:37:49,950 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:49,950 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:37:49,950 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:37:49,951 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration25_Loop [2021-08-27 14:37:49,951 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:37:49,951 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:37:49,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:37:49,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:37:50,535 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:37:50,539 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:37:50,540 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:50,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:50,545 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:37:50,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-27 14:37:50,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:50,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:37:50,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:50,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:50,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:50,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:37:50,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:37:50,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:50,561 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:50,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2021-08-27 14:37:50,579 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:50,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:50,580 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:37:50,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-27 14:37:50,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-08-27 14:37:50,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:37:50,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:50,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:50,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:50,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:37:50,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:37:50,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:50,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:50,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-27 14:37:50,641 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-08-27 14:37:50,641 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:50,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:50,645 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:37:50,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2021-08-27 14:37:50,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:37:50,660 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:37:50,660 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:50,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:50,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:50,661 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:37:50,665 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:37:50,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:50,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:50,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2021-08-27 14:37:50,686 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:50,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:50,687 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:37:50,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2021-08-27 14:37:50,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:50,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:37:50,698 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:50,698 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:50,698 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:50,698 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:37:50,708 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:37:50,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:50,724 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:50,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2021-08-27 14:37:50,751 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-08-27 14:37:50,751 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:50,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:50,752 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:37:50,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:50,774 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:37:50,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:50,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:50,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:50,774 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:37:50,779 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:37:50,780 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:50,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2021-08-27 14:37:50,792 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:50,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2021-08-27 14:37:50,820 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:50,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:50,821 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:37:50,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2021-08-27 14:37:50,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:50,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:37:50,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:50,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:50,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:50,834 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:37:50,845 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:37:50,845 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:50,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:50,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2021-08-27 14:37:50,891 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-08-27 14:37:50,891 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:50,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:50,892 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:37:50,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:50,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:37:50,911 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:50,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:50,912 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:50,912 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:37:50,918 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:37:50,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:50,942 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:50,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2021-08-27 14:37:50,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2021-08-27 14:37:50,970 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:50,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:50,972 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-08-27 14:37:50,973 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-08-27 14:37:50,975 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:50,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:37:50,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:50,986 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:50,986 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:50,986 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:37:50,999 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:37:50,999 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:51,015 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:51,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2021-08-27 14:37:51,044 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-08-27 14:37:51,044 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:51,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:51,046 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-08-27 14:37:51,047 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-08-27 14:37:51,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:51,057 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:51,058 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:37:51,058 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:51,058 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:51,058 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:51,058 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:37:51,062 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:37:51,063 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:51,081 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:51,106 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-08-27 14:37:51,106 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:51,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:51,108 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-08-27 14:37:51,111 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-08-27 14:37:51,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:51,119 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:51,120 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:37:51,120 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:51,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:51,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:51,120 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:37:51,127 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:37:51,127 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:51,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:51,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2021-08-27 14:37:51,167 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-08-27 14:37:51,167 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:51,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:51,168 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-08-27 14:37:51,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-08-27 14:37:51,184 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-08-27 14:37:51,186 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:51,186 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-27 14:37:51,187 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:51,187 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:51,187 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:51,187 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:37:51,194 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:37:51,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:51,215 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:51,239 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-08-27 14:37:51,239 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:51,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:51,240 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-08-27 14:37:51,248 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-08-27 14:37:51,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:51,258 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:51,259 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-27 14:37:51,259 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:51,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:51,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:51,259 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:37:51,272 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:37:51,272 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:51,288 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:51,310 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-08-27 14:37:51,310 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-08-27 14:37:51,310 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:51,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:51,313 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-08-27 14:37:51,314 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-08-27 14:37:51,316 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:51,326 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:51,326 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:37:51,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:51,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:51,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:51,327 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:37:51,339 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:37:51,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:51,358 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:51,384 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-08-27 14:37:51,384 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:51,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:51,389 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-08-27 14:37:51,390 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-08-27 14:37:51,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:51,402 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:51,403 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:37:51,403 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:51,403 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:51,403 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:51,403 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:37:51,418 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:37:51,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:51,446 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:51,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2021-08-27 14:37:51,470 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-08-27 14:37:51,470 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:51,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:51,471 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-08-27 14:37:51,474 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-08-27 14:37:51,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:37:51,484 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:51,484 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:37:51,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:51,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:51,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:51,485 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:37:51,491 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:37:51,491 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:51,524 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:51,550 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-08-27 14:37:51,551 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:51,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:51,552 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-08-27 14:37:51,553 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-08-27 14:37:51,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:51,566 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:51,566 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:37:51,566 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:51,566 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:51,566 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:51,566 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:37:51,577 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:37:51,578 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:51,596 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:51,617 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-08-27 14:37:51,617 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-08-27 14:37:51,617 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:51,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:51,618 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-08-27 14:37:51,618 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-08-27 14:37:51,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:51,628 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:51,629 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:37:51,629 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:51,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:51,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:51,629 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-27 14:37:51,638 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:37:51,638 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:51,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:51,662 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-08-27 14:37:51,663 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:51,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:51,663 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-08-27 14:37:51,664 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-08-27 14:37:51,666 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:51,674 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:51,674 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:37:51,674 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:51,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:51,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:51,674 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-27 14:37:51,689 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:37:51,689 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:51,703 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:51,721 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-08-27 14:37:51,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:37:51,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-27 14:37:51,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-27 14:37:51,723 INFO L87 Difference]: Start difference. First operand 311 states and 343 transitions. cyclomatic complexity: 36 Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 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-08-27 14:37:52,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:37:52,412 INFO L93 Difference]: Finished difference Result 445 states and 473 transitions. [2021-08-27 14:37:52,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 14:37:52,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 445 states and 473 transitions. [2021-08-27 14:37:52,415 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 94 [2021-08-27 14:37:52,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 445 states to 390 states and 417 transitions. [2021-08-27 14:37:52,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 390 [2021-08-27 14:37:52,417 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 390 [2021-08-27 14:37:52,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 390 states and 417 transitions. [2021-08-27 14:37:52,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:37:52,417 INFO L681 BuchiCegarLoop]: Abstraction has 390 states and 417 transitions. [2021-08-27 14:37:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states and 417 transitions. [2021-08-27 14:37:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 327. [2021-08-27 14:37:52,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 327 states have (on average 1.0825688073394495) internal successors, (354), 326 states have internal predecessors, (354), 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-08-27 14:37:52,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 354 transitions. [2021-08-27 14:37:52,422 INFO L704 BuchiCegarLoop]: Abstraction has 327 states and 354 transitions. [2021-08-27 14:37:52,422 INFO L587 BuchiCegarLoop]: Abstraction has 327 states and 354 transitions. [2021-08-27 14:37:52,422 INFO L425 BuchiCegarLoop]: ======== Iteration 26============ [2021-08-27 14:37:52,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 327 states and 354 transitions. [2021-08-27 14:37:52,423 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 77 [2021-08-27 14:37:52,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:37:52,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:37:52,424 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 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-08-27 14:37:52,424 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:37:52,424 INFO L791 eck$LassoCheckResult]: Stem: 23544#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 23535#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 23525#L51 assume !(0 == mp_add_~a3~0 % 256); 23526#L51-1 mp_add_~nb~0 := 4; 23527#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 23529#L63 assume !(0 == mp_add_~b2~0 % 256); 23530#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 23541#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23624#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 23625#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 23620#L76-2 assume !(1 == mp_add_~i~0 % 256); 23621#L77-1 assume !(2 == mp_add_~i~0 % 256); 23616#L78-1 assume !(3 == mp_add_~i~0 % 256); 23617#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 23612#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 23613#L82-2 assume !(1 == mp_add_~i~0 % 256); 23608#L83-1 assume !(2 == mp_add_~i~0 % 256); 23609#L84-1 assume !(3 == mp_add_~i~0 % 256); 23604#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 23605#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 23851#L91-1 assume !(1 == mp_add_~i~0 % 256); 23850#L92-1 assume !(2 == mp_add_~i~0 % 256); 23849#L93-1 assume !(3 == mp_add_~i~0 % 256); 23848#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23847#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23846#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 23845#L76 assume !(0 == mp_add_~i~0 % 256); 23844#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 23843#L77-1 assume !(2 == mp_add_~i~0 % 256); 23842#L78-1 assume !(3 == mp_add_~i~0 % 256); 23840#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 23839#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 23838#L87-1 assume !(0 == mp_add_~i~0 % 256); 23836#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 23835#L92-1 assume !(2 == mp_add_~i~0 % 256); 23834#L93-1 assume !(3 == mp_add_~i~0 % 256); 23832#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23831#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23555#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 23556#L76 assume !(0 == mp_add_~i~0 % 256); 23560#L76-2 assume !(1 == mp_add_~i~0 % 256); 23825#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 23824#L78-1 assume !(3 == mp_add_~i~0 % 256); 23822#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 23820#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 23818#L87-1 assume !(0 == mp_add_~i~0 % 256); 23816#L91-1 assume !(1 == mp_add_~i~0 % 256); 23814#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 23812#L93-1 assume !(3 == mp_add_~i~0 % 256); 23810#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23808#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23806#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 23804#L76 assume !(0 == mp_add_~i~0 % 256); 23802#L76-2 assume !(1 == mp_add_~i~0 % 256); 23800#L77-1 assume !(2 == mp_add_~i~0 % 256); 23798#L78-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 23796#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 23794#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 23793#L87-1 assume !(0 == mp_add_~i~0 % 256); 23792#L91-1 assume !(1 == mp_add_~i~0 % 256); 23791#L92-1 assume !(2 == mp_add_~i~0 % 256); 23790#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 23540#L94-1 [2021-08-27 14:37:52,425 INFO L793 eck$LassoCheckResult]: Loop: 23540#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23536#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 23537#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 23828#L76 assume !(0 == mp_add_~i~0 % 256); 23827#L76-2 assume !(1 == mp_add_~i~0 % 256); 23826#L77-1 assume !(2 == mp_add_~i~0 % 256); 23549#L78-1 assume !(3 == mp_add_~i~0 % 256); 23550#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 23559#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 23841#L87-1 assume !(0 == mp_add_~i~0 % 256); 23532#L91-1 assume !(1 == mp_add_~i~0 % 256); 23533#L92-1 assume !(2 == mp_add_~i~0 % 256); 23534#L93-1 assume !(3 == mp_add_~i~0 % 256); 23540#L94-1 [2021-08-27 14:37:52,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:37:52,425 INFO L82 PathProgramCache]: Analyzing trace with hash -267040966, now seen corresponding path program 1 times [2021-08-27 14:37:52,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:37:52,425 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851892533] [2021-08-27 14:37:52,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:37:52,426 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:37:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:37:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 45 proven. 7 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2021-08-27 14:37:52,693 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:37:52,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851892533] [2021-08-27 14:37:52,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851892533] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:37:52,693 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369261715] [2021-08-27 14:37:52,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:37:52,693 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:37:52,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:52,694 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:37:52,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2021-08-27 14:37:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:37:53,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 29 conjunts are in the unsatisfiable core [2021-08-27 14:37:53,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:37:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 50 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-08-27 14:37:54,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369261715] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:37:54,212 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:37:54,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2021-08-27 14:37:54,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514306362] [2021-08-27 14:37:54,212 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:37:54,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:37:54,213 INFO L82 PathProgramCache]: Analyzing trace with hash 672830572, now seen corresponding path program 1 times [2021-08-27 14:37:54,213 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:37:54,213 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364793573] [2021-08-27 14:37:54,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:37:54,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:37:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:37:54,217 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:37:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:37:54,220 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:37:54,579 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:37:54,579 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:37:54,579 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:37:54,579 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:37:54,579 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 14:37:54,579 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:54,579 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:37:54,579 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:37:54,579 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration26_Loop [2021-08-27 14:37:54,579 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:37:54,579 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:37:54,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:37:54,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:37:55,156 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:37:55,156 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 14:37:55,156 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:55,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:55,161 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-08-27 14:37:55,162 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-08-27 14:37:55,164 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 14:37:55,164 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:37:55,180 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 14:37:55,180 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~carry~0=0} Honda state: {ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~carry~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 14:37:55,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2021-08-27 14:37:55,199 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:55,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:55,199 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-08-27 14:37:55,200 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-08-27 14:37:55,202 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 14:37:55,202 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:37:55,244 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2021-08-27 14:37:55,245 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:55,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:55,246 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-08-27 14:37:55,246 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-08-27 14:37:55,248 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 14:37:55,248 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:37:56,662 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 14:37:56,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2021-08-27 14:37:56,667 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:37:56,667 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:37:56,667 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:37:56,667 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:37:56,668 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:37:56,668 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:56,668 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:37:56,668 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:37:56,668 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration26_Loop [2021-08-27 14:37:56,668 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:37:56,668 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:37:56,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:37:56,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:37:57,143 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:37:57,144 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:37:57,144 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:57,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:57,145 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-08-27 14:37:57,146 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-08-27 14:37:57,148 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:57,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:37:57,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:57,155 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:57,155 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:57,155 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:37:57,157 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:37:57,157 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:57,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:57,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2021-08-27 14:37:57,174 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:57,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:57,175 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-08-27 14:37:57,177 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-08-27 14:37:57,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:57,185 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:37:57,185 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:57,185 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:57,186 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:57,186 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:37:57,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:37:57,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:57,192 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:57,208 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-08-27 14:37:57,208 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-08-27 14:37:57,208 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:57,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:57,209 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-08-27 14:37:57,210 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-08-27 14:37:57,211 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:57,218 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:37:57,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:57,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:57,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:57,219 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:37:57,232 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:37:57,232 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:57,234 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:57,252 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-08-27 14:37:57,253 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:57,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:57,254 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-08-27 14:37:57,254 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-08-27 14:37:57,256 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:57,263 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:37:57,264 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:57,264 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:57,264 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:57,264 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:37:57,273 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:37:57,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:57,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:57,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2021-08-27 14:37:57,306 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-08-27 14:37:57,306 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:57,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:57,307 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-08-27 14:37:57,308 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-08-27 14:37:57,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:37:57,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:37:57,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:57,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:57,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:57,317 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:37:57,321 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:37:57,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:57,356 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:57,372 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-08-27 14:37:57,373 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:57,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:57,373 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:37:57,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2021-08-27 14:37:57,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-08-27 14:37:57,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:37:57,385 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:57,385 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:57,385 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:57,385 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:37:57,393 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:37:57,393 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:57,398 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:57,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2021-08-27 14:37:57,414 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-08-27 14:37:57,414 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:57,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:57,414 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-08-27 14:37:57,415 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-08-27 14:37:57,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:57,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:37:57,425 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:57,425 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:57,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:57,425 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:37:57,431 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:37:57,431 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:57,445 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:57,461 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-08-27 14:37:57,461 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:57,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:57,462 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-08-27 14:37:57,462 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-08-27 14:37:57,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:57,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:37:57,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:57,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:57,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:57,473 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:37:57,482 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:37:57,482 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:57,493 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:57,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2021-08-27 14:37:57,510 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-08-27 14:37:57,510 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:57,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:57,510 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-08-27 14:37:57,511 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-08-27 14:37:57,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:57,521 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:57,521 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:37:57,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:57,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:57,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:57,521 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:37:57,525 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:37:57,526 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:57,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:57,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2021-08-27 14:37:57,549 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:57,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:57,550 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-08-27 14:37:57,550 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-08-27 14:37:57,552 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:57,560 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:57,560 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:37:57,560 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:57,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:57,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:57,560 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:37:57,566 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:37:57,566 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:57,572 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:57,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2021-08-27 14:37:57,588 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-08-27 14:37:57,588 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:57,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:57,589 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-08-27 14:37:57,589 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-08-27 14:37:57,593 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:57,600 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:57,601 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-27 14:37:57,601 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:57,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:57,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:57,601 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:37:57,605 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:37:57,605 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:57,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:57,625 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-08-27 14:37:57,626 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:57,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:57,626 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-08-27 14:37:57,627 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-08-27 14:37:57,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:57,637 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:57,637 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-27 14:37:57,637 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:57,637 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:57,637 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:57,637 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:37:57,646 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:37:57,646 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:57,654 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:57,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2021-08-27 14:37:57,672 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-08-27 14:37:57,673 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:57,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:57,673 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-08-27 14:37:57,674 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-08-27 14:37:57,676 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:37:57,684 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:57,684 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:37:57,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:57,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:57,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:57,685 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:37:57,690 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:37:57,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:57,698 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:57,714 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-08-27 14:37:57,715 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:57,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:57,715 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-08-27 14:37:57,716 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-08-27 14:37:57,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:37:57,727 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:57,727 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:37:57,727 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:57,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:57,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:57,727 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:37:57,739 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:37:57,740 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:57,759 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:57,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2021-08-27 14:37:57,815 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-08-27 14:37:57,815 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:57,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:57,816 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-08-27 14:37:57,822 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:57,831 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:57,831 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:37:57,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:57,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:57,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:57,831 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:37:57,837 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:37:57,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:57,842 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-08-27 14:37:57,848 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:57,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2021-08-27 14:37:57,870 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:57,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:57,870 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-08-27 14:37:57,871 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-08-27 14:37:57,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:57,881 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:57,881 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:37:57,881 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:57,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:57,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:57,881 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:37:57,889 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:37:57,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:57,900 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:57,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2021-08-27 14:37:57,917 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-08-27 14:37:57,917 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:57,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:57,918 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-08-27 14:37:57,919 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-08-27 14:37:57,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:37:57,928 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:57,928 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:37:57,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:57,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:57,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:57,928 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-27 14:37:57,934 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:37:57,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:57,940 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:57,955 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-08-27 14:37:57,955 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:37:57,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:37:57,956 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-08-27 14:37:57,960 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-08-27 14:37:57,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:37:57,969 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:37:57,969 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:37:57,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:37:57,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:37:57,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:37:57,969 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-27 14:37:57,981 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:37:57,981 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:37:58,008 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:37:58,041 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-08-27 14:37:58,041 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:37:58,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-27 14:37:58,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-08-27 14:37:58,042 INFO L87 Difference]: Start difference. First operand 327 states and 354 transitions. cyclomatic complexity: 32 Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 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-08-27 14:38:00,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:38:00,590 INFO L93 Difference]: Finished difference Result 587 states and 628 transitions. [2021-08-27 14:38:00,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-08-27 14:38:00,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 587 states and 628 transitions. [2021-08-27 14:38:00,592 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 124 [2021-08-27 14:38:00,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 587 states to 587 states and 628 transitions. [2021-08-27 14:38:00,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 587 [2021-08-27 14:38:00,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 587 [2021-08-27 14:38:00,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 587 states and 628 transitions. [2021-08-27 14:38:00,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:38:00,594 INFO L681 BuchiCegarLoop]: Abstraction has 587 states and 628 transitions. [2021-08-27 14:38:00,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states and 628 transitions. [2021-08-27 14:38:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 313. [2021-08-27 14:38:00,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 313 states have (on average 1.0766773162939298) internal successors, (337), 312 states have internal predecessors, (337), 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-08-27 14:38:00,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 337 transitions. [2021-08-27 14:38:00,599 INFO L704 BuchiCegarLoop]: Abstraction has 313 states and 337 transitions. [2021-08-27 14:38:00,599 INFO L587 BuchiCegarLoop]: Abstraction has 313 states and 337 transitions. [2021-08-27 14:38:00,599 INFO L425 BuchiCegarLoop]: ======== Iteration 27============ [2021-08-27 14:38:00,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 313 states and 337 transitions. [2021-08-27 14:38:00,600 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 77 [2021-08-27 14:38:00,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:38:00,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:38:00,601 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-08-27 14:38:00,601 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:38:00,601 INFO L791 eck$LassoCheckResult]: Stem: 24692#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 24686#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 24677#L51 assume !(0 == mp_add_~a3~0 % 256); 24678#L51-1 mp_add_~nb~0 := 4; 24679#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 24681#L63 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 24683#L65 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 24707#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 24824#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 24823#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24822#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 24821#L76-2 assume !(1 == mp_add_~i~0 % 256); 24820#L77-1 assume !(2 == mp_add_~i~0 % 256); 24819#L78-1 assume !(3 == mp_add_~i~0 % 256); 24818#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24817#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 24816#L82-2 assume !(1 == mp_add_~i~0 % 256); 24815#L83-1 assume !(2 == mp_add_~i~0 % 256); 24814#L84-1 assume !(3 == mp_add_~i~0 % 256); 24813#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 24812#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 24811#L91-1 assume !(1 == mp_add_~i~0 % 256); 24810#L92-1 assume !(2 == mp_add_~i~0 % 256); 24809#L93-1 assume !(3 == mp_add_~i~0 % 256); 24808#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24807#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 24806#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24805#L76 assume !(0 == mp_add_~i~0 % 256); 24804#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 24803#L77-1 assume !(2 == mp_add_~i~0 % 256); 24802#L78-1 assume !(3 == mp_add_~i~0 % 256); 24801#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 24800#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 24799#L87-1 assume !(0 == mp_add_~i~0 % 256); 24798#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 24797#L92-1 assume !(2 == mp_add_~i~0 % 256); 24796#L93-1 assume !(3 == mp_add_~i~0 % 256); 24795#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24794#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 24793#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24792#L76 assume !(0 == mp_add_~i~0 % 256); 24791#L76-2 assume !(1 == mp_add_~i~0 % 256); 24789#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 24790#L78-1 assume !(3 == mp_add_~i~0 % 256); 24839#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 24838#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 24837#L87-1 assume !(0 == mp_add_~i~0 % 256); 24836#L91-1 assume !(1 == mp_add_~i~0 % 256); 24835#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 24834#L93-1 assume !(3 == mp_add_~i~0 % 256); 24833#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24832#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 24831#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24830#L76 assume !(0 == mp_add_~i~0 % 256); 24829#L76-2 assume !(1 == mp_add_~i~0 % 256); 24828#L77-1 assume !(2 == mp_add_~i~0 % 256); 24825#L78-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 24826#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 24854#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 24852#L87-1 assume !(0 == mp_add_~i~0 % 256); 24850#L91-1 assume !(1 == mp_add_~i~0 % 256); 24848#L92-1 assume !(2 == mp_add_~i~0 % 256); 24846#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 24845#L94-1 [2021-08-27 14:38:00,601 INFO L793 eck$LassoCheckResult]: Loop: 24845#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24844#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 24843#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 24842#L76 assume !(0 == mp_add_~i~0 % 256); 24841#L76-2 assume !(1 == mp_add_~i~0 % 256); 24840#L77-1 assume !(2 == mp_add_~i~0 % 256); 24827#L78-1 assume !(3 == mp_add_~i~0 % 256); 24704#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 24705#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 24853#L87-1 assume !(0 == mp_add_~i~0 % 256); 24851#L91-1 assume !(1 == mp_add_~i~0 % 256); 24849#L92-1 assume !(2 == mp_add_~i~0 % 256); 24847#L93-1 assume !(3 == mp_add_~i~0 % 256); 24845#L94-1 [2021-08-27 14:38:00,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:00,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1728940926, now seen corresponding path program 1 times [2021-08-27 14:38:00,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:00,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729208566] [2021-08-27 14:38:00,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:00,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:00,621 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:00,644 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:00,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:00,644 INFO L82 PathProgramCache]: Analyzing trace with hash 672830572, now seen corresponding path program 2 times [2021-08-27 14:38:00,645 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:00,645 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943933176] [2021-08-27 14:38:00,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:00,645 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:00,649 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:00,652 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:00,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:00,652 INFO L82 PathProgramCache]: Analyzing trace with hash 334650383, now seen corresponding path program 2 times [2021-08-27 14:38:00,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:00,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284003870] [2021-08-27 14:38:00,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:00,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 40 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:38:01,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:38:01,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284003870] [2021-08-27 14:38:01,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284003870] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:01,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920911357] [2021-08-27 14:38:01,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 14:38:01,013 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:38:01,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:01,017 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:38:01,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2021-08-27 14:38:01,639 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-08-27 14:38:01,639 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:38:01,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 7 conjunts are in the unsatisfiable core [2021-08-27 14:38:01,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:38:02,989 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2021-08-27 14:38:02,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920911357] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:02,990 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:38:02,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2021-08-27 14:38:02,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298059987] [2021-08-27 14:38:03,357 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:38:03,357 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:38:03,357 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:38:03,357 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:38:03,357 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 14:38:03,357 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:03,357 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:38:03,357 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:38:03,357 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration27_Loop [2021-08-27 14:38:03,357 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:38:03,357 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:38:03,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:03,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:03,997 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:38:03,997 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 14:38:03,997 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:03,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:03,998 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-08-27 14:38:03,999 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-08-27 14:38:04,000 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 14:38:04,000 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:38:04,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Ended with exit code 0 [2021-08-27 14:38:04,041 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:04,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:04,043 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-08-27 14:38:04,044 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-08-27 14:38:04,046 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 14:38:04,046 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:38:04,627 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 14:38:04,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Ended with exit code 0 [2021-08-27 14:38:04,632 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:38:04,632 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:38:04,632 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:38:04,632 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:38:04,632 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:38:04,632 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:04,632 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:38:04,632 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:38:04,632 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration27_Loop [2021-08-27 14:38:04,632 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:38:04,632 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:38:04,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:04,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:05,131 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:38:05,131 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:38:05,131 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:05,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:05,132 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-08-27 14:38:05,132 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-08-27 14:38:05,135 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:05,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:05,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:05,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:05,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:05,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:05,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:05,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:05,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:05,197 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-08-27 14:38:05,197 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:05,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:05,198 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-08-27 14:38:05,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:05,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:05,222 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:05,222 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:05,222 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:05,222 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:05,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:05,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:05,227 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-08-27 14:38:05,236 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:05,259 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-08-27 14:38:05,259 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-08-27 14:38:05,259 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:05,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:05,260 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-08-27 14:38:05,261 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-08-27 14:38:05,263 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:05,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:05,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:05,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:05,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:05,272 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:05,280 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:05,280 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:05,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:05,319 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-08-27 14:38:05,320 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:05,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:05,321 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-08-27 14:38:05,322 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-08-27 14:38:05,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:05,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:05,333 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:05,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:05,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:05,333 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:05,337 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:05,337 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:05,349 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:05,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:05,373 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-08-27 14:38:05,373 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:05,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:05,374 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-08-27 14:38:05,376 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-08-27 14:38:05,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-08-27 14:38:05,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:05,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:05,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:05,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:05,390 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:05,400 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:05,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:05,412 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:05,436 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-08-27 14:38:05,437 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:05,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:05,441 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-08-27 14:38:05,442 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-08-27 14:38:05,444 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:05,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:05,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:05,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:05,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:05,453 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:05,458 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:05,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:05,476 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:05,493 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-08-27 14:38:05,493 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-08-27 14:38:05,493 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:05,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:05,494 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-08-27 14:38:05,495 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-08-27 14:38:05,496 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:05,504 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:05,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:05,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:05,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:05,505 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:05,514 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:05,514 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:05,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:05,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2021-08-27 14:38:05,536 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:05,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:05,537 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-08-27 14:38:05,537 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-08-27 14:38:05,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:05,547 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:05,548 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:05,548 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:05,548 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:05,548 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:05,552 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:05,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:05,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:05,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Ended with exit code 0 [2021-08-27 14:38:05,572 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-08-27 14:38:05,572 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:05,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:05,573 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-08-27 14:38:05,574 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-08-27 14:38:05,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:05,583 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:05,583 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:05,584 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:05,584 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:05,584 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:05,584 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:05,591 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:05,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:05,617 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:05,640 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-08-27 14:38:05,641 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:05,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:05,642 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-08-27 14:38:05,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:05,667 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:05,667 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:05,667 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:05,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:05,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:05,667 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:05,671 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:05,671 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:05,676 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-08-27 14:38:05,684 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:05,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Ended with exit code 0 [2021-08-27 14:38:05,708 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-08-27 14:38:05,708 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:05,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:05,709 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-08-27 14:38:05,718 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:05,731 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:05,731 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-27 14:38:05,731 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:05,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:05,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:05,732 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:05,743 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:05,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:05,743 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-08-27 14:38:05,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:05,779 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-08-27 14:38:05,780 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:05,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:05,781 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-08-27 14:38:05,782 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-08-27 14:38:05,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-08-27 14:38:05,793 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:05,793 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-27 14:38:05,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:05,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:05,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:05,794 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:05,799 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:05,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:05,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:05,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:05,841 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-08-27 14:38:05,841 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:05,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:05,842 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-08-27 14:38:05,849 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:05,860 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:05,860 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:05,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:05,860 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:05,860 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:05,860 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:05,871 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-08-27 14:38:05,875 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:05,875 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:05,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:05,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:05,910 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:05,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:05,910 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-08-27 14:38:05,911 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-08-27 14:38:05,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:05,921 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:05,921 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:05,921 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:05,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:05,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:05,921 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:05,926 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:05,926 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:05,933 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:05,949 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-08-27 14:38:05,950 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-08-27 14:38:05,950 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:05,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:05,950 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-08-27 14:38:05,951 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-08-27 14:38:05,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-08-27 14:38:05,960 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:05,960 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:05,960 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:05,960 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:05,960 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:05,960 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:05,970 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:05,970 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:05,977 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:05,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Ended with exit code 0 [2021-08-27 14:38:05,993 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:05,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:05,994 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-08-27 14:38:05,994 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-08-27 14:38:05,996 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:06,004 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:06,004 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:06,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:06,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:06,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:06,004 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:06,008 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:06,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:06,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:06,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Ended with exit code 0 [2021-08-27 14:38:06,027 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-08-27 14:38:06,027 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:06,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:06,028 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-08-27 14:38:06,029 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-08-27 14:38:06,032 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:06,040 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:06,041 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:06,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:06,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:06,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:06,041 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-27 14:38:06,052 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:06,052 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:06,061 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:06,077 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-08-27 14:38:06,078 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:06,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:06,078 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-08-27 14:38:06,081 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-08-27 14:38:06,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:06,089 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:06,089 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:06,090 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:06,090 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:06,090 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:06,090 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-27 14:38:06,095 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:06,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:06,101 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:06,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Ended with exit code 0 [2021-08-27 14:38:06,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:38:06,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 14:38:06,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2021-08-27 14:38:06,118 INFO L87 Difference]: Start difference. First operand 313 states and 337 transitions. cyclomatic complexity: 29 Second operand has 13 states, 13 states have (on average 8.307692307692308) internal successors, (108), 13 states have internal predecessors, (108), 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-08-27 14:38:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:38:08,079 INFO L93 Difference]: Finished difference Result 282 states and 298 transitions. [2021-08-27 14:38:08,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 14:38:08,079 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 282 states and 298 transitions. [2021-08-27 14:38:08,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-08-27 14:38:08,081 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 282 states to 177 states and 189 transitions. [2021-08-27 14:38:08,081 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 177 [2021-08-27 14:38:08,081 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 177 [2021-08-27 14:38:08,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 177 states and 189 transitions. [2021-08-27 14:38:08,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:38:08,081 INFO L681 BuchiCegarLoop]: Abstraction has 177 states and 189 transitions. [2021-08-27 14:38:08,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states and 189 transitions. [2021-08-27 14:38:08,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 122. [2021-08-27 14:38:08,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.0901639344262295) internal successors, (133), 121 states have internal predecessors, (133), 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-08-27 14:38:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 133 transitions. [2021-08-27 14:38:08,083 INFO L704 BuchiCegarLoop]: Abstraction has 122 states and 133 transitions. [2021-08-27 14:38:08,083 INFO L587 BuchiCegarLoop]: Abstraction has 122 states and 133 transitions. [2021-08-27 14:38:08,083 INFO L425 BuchiCegarLoop]: ======== Iteration 28============ [2021-08-27 14:38:08,084 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 133 transitions. [2021-08-27 14:38:08,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-08-27 14:38:08,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:38:08,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:38:08,085 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 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] [2021-08-27 14:38:08,085 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:38:08,085 INFO L791 eck$LassoCheckResult]: Stem: 25545#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 25541#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 25533#L51 assume !(0 == mp_add_~a3~0 % 256); 25534#L51-1 mp_add_~nb~0 := 4; 25535#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 25536#L63 assume !(0 == mp_add_~b2~0 % 256); 25537#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 25544#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25607#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25606#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 25603#L76-2 assume !(1 == mp_add_~i~0 % 256); 25600#L77-1 assume !(2 == mp_add_~i~0 % 256); 25599#L78-1 assume !(3 == mp_add_~i~0 % 256); 25598#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25597#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 25596#L82-2 assume !(1 == mp_add_~i~0 % 256); 25595#L83-1 assume !(2 == mp_add_~i~0 % 256); 25594#L84-1 assume !(3 == mp_add_~i~0 % 256); 25593#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 25592#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 25591#L91-1 assume !(1 == mp_add_~i~0 % 256); 25590#L92-1 assume !(2 == mp_add_~i~0 % 256); 25589#L93-1 assume !(3 == mp_add_~i~0 % 256); 25588#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25587#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25586#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25585#L76 assume !(0 == mp_add_~i~0 % 256); 25584#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 25583#L77-1 assume !(2 == mp_add_~i~0 % 256); 25582#L78-1 assume !(3 == mp_add_~i~0 % 256); 25581#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25580#L82 assume !(0 == mp_add_~i~0 % 256); 25579#L82-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 25578#L83-1 assume !(2 == mp_add_~i~0 % 256); 25577#L84-1 assume !(3 == mp_add_~i~0 % 256); 25575#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 25576#L87-1 assume !(0 == mp_add_~i~0 % 256); 25630#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 25629#L92-1 assume !(2 == mp_add_~i~0 % 256); 25628#L93-1 assume !(3 == mp_add_~i~0 % 256); 25627#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25626#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25625#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25624#L76 assume !(0 == mp_add_~i~0 % 256); 25623#L76-2 assume !(1 == mp_add_~i~0 % 256); 25622#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 25621#L78-1 assume !(3 == mp_add_~i~0 % 256); 25620#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 25618#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 25619#L87-1 assume !(0 == mp_add_~i~0 % 256); 25614#L91-1 assume !(1 == mp_add_~i~0 % 256); 25615#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 25610#L93-1 assume !(3 == mp_add_~i~0 % 256); 25611#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25604#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25605#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 25557#L76 assume !(0 == mp_add_~i~0 % 256); 25546#L76-2 assume !(1 == mp_add_~i~0 % 256); 25547#L77-1 assume !(2 == mp_add_~i~0 % 256); 25548#L78-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 25640#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 25636#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 25637#L87-1 assume !(0 == mp_add_~i~0 % 256); 25651#L91-1 assume !(1 == mp_add_~i~0 % 256); 25650#L92-1 assume !(2 == mp_add_~i~0 % 256); 25631#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 25543#L94-1 [2021-08-27 14:38:08,085 INFO L793 eck$LassoCheckResult]: Loop: 25543#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25539#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25540#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25555#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25552#L82 assume !(0 == mp_add_~i~0 % 256); 25553#L82-2 assume !(1 == mp_add_~i~0 % 256); 25556#L83-1 assume !(2 == mp_add_~i~0 % 256); 25554#L84-1 assume !(3 == mp_add_~i~0 % 256); 25549#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 25542#L87-1 assume !(0 == mp_add_~i~0 % 256); 25530#L91-1 assume !(1 == mp_add_~i~0 % 256); 25531#L92-1 assume !(2 == mp_add_~i~0 % 256); 25532#L93-1 assume !(3 == mp_add_~i~0 % 256); 25543#L94-1 [2021-08-27 14:38:08,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:08,086 INFO L82 PathProgramCache]: Analyzing trace with hash 544159432, now seen corresponding path program 1 times [2021-08-27 14:38:08,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:08,086 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889167187] [2021-08-27 14:38:08,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:08,086 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:08,539 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 43 proven. 31 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-08-27 14:38:08,539 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:38:08,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889167187] [2021-08-27 14:38:08,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889167187] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:08,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597584235] [2021-08-27 14:38:08,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:08,540 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:38:08,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:08,543 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:38:08,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2021-08-27 14:38:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:09,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-27 14:38:09,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:38:10,889 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 48 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-08-27 14:38:10,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597584235] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:10,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:38:10,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 13 [2021-08-27 14:38:10,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714359650] [2021-08-27 14:38:10,890 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:38:10,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:10,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1233229496, now seen corresponding path program 2 times [2021-08-27 14:38:10,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:10,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745447391] [2021-08-27 14:38:10,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:10,891 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:10,896 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:10,898 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:11,175 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:38:11,175 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:38:11,175 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:38:11,175 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:38:11,175 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 14:38:11,175 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:11,175 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:38:11,175 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:38:11,175 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration28_Loop [2021-08-27 14:38:11,175 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:38:11,175 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:38:11,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:11,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:11,863 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:38:11,863 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 14:38:11,863 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:11,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:11,864 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-08-27 14:38:11,865 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-08-27 14:38:11,866 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 14:38:11,866 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:38:11,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:11,919 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:11,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:11,920 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-08-27 14:38:11,921 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-08-27 14:38:11,922 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 14:38:11,922 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:38:13,345 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 14:38:13,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:13,350 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:38:13,350 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:38:13,350 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:38:13,350 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:38:13,350 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:38:13,350 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:13,350 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:38:13,350 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:38:13,350 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration28_Loop [2021-08-27 14:38:13,350 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:38:13,350 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:38:13,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:13,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-08-27 14:38:13,974 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:38:13,974 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:38:13,974 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:13,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:13,981 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-08-27 14:38:13,982 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-08-27 14:38:13,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:13,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:13,990 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:13,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:13,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:13,991 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:13,992 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:13,992 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:13,994 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:14,009 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-08-27 14:38:14,010 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:14,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:14,010 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-08-27 14:38:14,011 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-08-27 14:38:14,013 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:14,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:14,020 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:14,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:14,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:14,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:14,024 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:14,024 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:14,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:14,042 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-08-27 14:38:14,042 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-08-27 14:38:14,043 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:14,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:14,043 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-08-27 14:38:14,044 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-08-27 14:38:14,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:14,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:14,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:14,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:14,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:14,053 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:14,056 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:14,056 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:14,058 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:14,073 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-08-27 14:38:14,074 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:14,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:14,074 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-08-27 14:38:14,075 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-08-27 14:38:14,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-08-27 14:38:14,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:14,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:14,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:14,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:14,085 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:14,090 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:14,091 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:14,094 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:14,109 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-08-27 14:38:14,110 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-08-27 14:38:14,110 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:14,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:14,111 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-08-27 14:38:14,111 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-08-27 14:38:14,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:14,121 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:14,121 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:14,121 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:14,121 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:14,121 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:14,125 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:14,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:14,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:14,143 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-08-27 14:38:14,143 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:14,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:14,144 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-08-27 14:38:14,145 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-08-27 14:38:14,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:14,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:14,154 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:14,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:14,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:14,154 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:14,161 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:14,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:14,166 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:14,181 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-08-27 14:38:14,181 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-08-27 14:38:14,181 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:14,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:14,182 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-08-27 14:38:14,191 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-08-27 14:38:14,192 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:14,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:14,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:14,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:14,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:14,199 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:14,203 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:14,203 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:14,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:14,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (84)] Ended with exit code 0 [2021-08-27 14:38:14,222 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:14,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:14,223 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-08-27 14:38:14,224 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-08-27 14:38:14,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:14,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:14,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:14,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:14,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:14,233 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:14,242 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:14,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:14,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:14,263 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-08-27 14:38:14,263 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-08-27 14:38:14,263 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:14,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:14,264 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-08-27 14:38:14,265 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-08-27 14:38:14,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:14,273 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:14,273 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:14,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:14,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:14,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:14,274 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:14,276 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:14,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:14,280 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:14,295 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-08-27 14:38:14,297 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:14,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:14,297 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-08-27 14:38:14,298 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-08-27 14:38:14,300 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:14,306 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:14,306 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:14,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:14,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:14,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:14,307 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:14,312 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:14,312 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:14,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:14,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (87)] Ended with exit code 0 [2021-08-27 14:38:14,333 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-08-27 14:38:14,333 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:14,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:14,334 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-08-27 14:38:14,335 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-08-27 14:38:14,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:14,343 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:14,343 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-27 14:38:14,343 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:14,343 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:14,343 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:14,344 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:14,348 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:14,349 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:14,354 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:14,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (88)] Ended with exit code 0 [2021-08-27 14:38:14,370 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:14,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:14,370 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-08-27 14:38:14,372 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-08-27 14:38:14,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:14,380 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:14,380 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-27 14:38:14,380 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:14,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:14,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:14,380 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:14,388 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:14,389 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:14,397 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:14,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (89)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:14,413 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-08-27 14:38:14,413 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:14,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:14,413 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-08-27 14:38:14,414 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-08-27 14:38:14,416 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:14,423 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:14,423 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:14,423 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:14,423 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:14,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:14,423 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:14,428 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:14,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:14,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:14,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (90)] Ended with exit code 0 [2021-08-27 14:38:14,451 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:14,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:14,451 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-08-27 14:38:14,452 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-08-27 14:38:14,453 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:14,461 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:14,461 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:14,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:14,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:14,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:14,462 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:14,472 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:14,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:14,485 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:14,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (91)] Ended with exit code 0 [2021-08-27 14:38:14,502 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-08-27 14:38:14,502 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:14,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:14,502 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-08-27 14:38:14,503 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-08-27 14:38:14,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:14,512 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:14,512 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:14,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:14,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:14,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:14,513 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:14,516 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:14,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:14,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:14,535 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (92)] Ended with exit code 0 [2021-08-27 14:38:14,535 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:14,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:14,536 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-08-27 14:38:14,536 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-08-27 14:38:14,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:14,546 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:14,546 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:14,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:14,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:14,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:14,546 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:14,553 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:14,553 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:14,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:14,574 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-08-27 14:38:14,575 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-08-27 14:38:14,575 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:14,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:14,575 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-08-27 14:38:14,576 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-08-27 14:38:14,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:14,585 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:14,585 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:14,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:14,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:14,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:14,586 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-27 14:38:14,591 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:14,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:14,597 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:14,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (94)] Ended with exit code 0 [2021-08-27 14:38:14,612 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:14,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:14,614 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-08-27 14:38:14,615 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-08-27 14:38:14,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:14,624 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:14,624 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:14,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:14,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:14,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:14,624 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-27 14:38:14,635 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:14,636 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:14,644 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:14,659 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-08-27 14:38:14,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:38:14,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-27 14:38:14,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-08-27 14:38:14,660 INFO L87 Difference]: Start difference. First operand 122 states and 133 transitions. cyclomatic complexity: 12 Second operand has 13 states, 13 states have (on average 7.461538461538462) internal successors, (97), 13 states have internal predecessors, (97), 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-08-27 14:38:15,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:38:15,910 INFO L93 Difference]: Finished difference Result 317 states and 339 transitions. [2021-08-27 14:38:15,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-27 14:38:15,911 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 317 states and 339 transitions. [2021-08-27 14:38:15,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2021-08-27 14:38:15,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 317 states to 200 states and 216 transitions. [2021-08-27 14:38:15,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 200 [2021-08-27 14:38:15,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 200 [2021-08-27 14:38:15,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 200 states and 216 transitions. [2021-08-27 14:38:15,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:38:15,913 INFO L681 BuchiCegarLoop]: Abstraction has 200 states and 216 transitions. [2021-08-27 14:38:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states and 216 transitions. [2021-08-27 14:38:15,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 122. [2021-08-27 14:38:15,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.0819672131147542) internal successors, (132), 121 states have internal predecessors, (132), 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-08-27 14:38:15,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2021-08-27 14:38:15,915 INFO L704 BuchiCegarLoop]: Abstraction has 122 states and 132 transitions. [2021-08-27 14:38:15,916 INFO L587 BuchiCegarLoop]: Abstraction has 122 states and 132 transitions. [2021-08-27 14:38:15,916 INFO L425 BuchiCegarLoop]: ======== Iteration 29============ [2021-08-27 14:38:15,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 122 states and 132 transitions. [2021-08-27 14:38:15,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-08-27 14:38:15,916 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:38:15,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:38:15,917 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 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] [2021-08-27 14:38:15,917 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:38:15,917 INFO L791 eck$LassoCheckResult]: Stem: 26204#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 26198#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 26191#L51 assume !(0 == mp_add_~a3~0 % 256); 26192#L51-1 mp_add_~nb~0 := 4; 26193#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 26194#L63 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 26195#L65 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 26201#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 26202#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26277#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 26276#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 26275#L76-2 assume !(1 == mp_add_~i~0 % 256); 26274#L77-1 assume !(2 == mp_add_~i~0 % 256); 26273#L78-1 assume !(3 == mp_add_~i~0 % 256); 26272#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26271#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 26270#L82-2 assume !(1 == mp_add_~i~0 % 256); 26269#L83-1 assume !(2 == mp_add_~i~0 % 256); 26268#L84-1 assume !(3 == mp_add_~i~0 % 256); 26267#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 26266#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 26265#L91-1 assume !(1 == mp_add_~i~0 % 256); 26264#L92-1 assume !(2 == mp_add_~i~0 % 256); 26263#L93-1 assume !(3 == mp_add_~i~0 % 256); 26262#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26261#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26260#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 26259#L76 assume !(0 == mp_add_~i~0 % 256); 26258#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 26257#L77-1 assume !(2 == mp_add_~i~0 % 256); 26256#L78-1 assume !(3 == mp_add_~i~0 % 256); 26255#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26254#L82 assume !(0 == mp_add_~i~0 % 256); 26253#L82-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 26252#L83-1 assume !(2 == mp_add_~i~0 % 256); 26251#L84-1 assume !(3 == mp_add_~i~0 % 256); 26249#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 26250#L87-1 assume !(0 == mp_add_~i~0 % 256); 26245#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 26246#L92-1 assume !(2 == mp_add_~i~0 % 256); 26241#L93-1 assume !(3 == mp_add_~i~0 % 256); 26242#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26237#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26238#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 26233#L76 assume !(0 == mp_add_~i~0 % 256); 26234#L76-2 assume !(1 == mp_add_~i~0 % 256); 26229#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 26230#L78-1 assume !(3 == mp_add_~i~0 % 256); 26225#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 26226#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 26285#L87-1 assume !(0 == mp_add_~i~0 % 256); 26309#L91-1 assume !(1 == mp_add_~i~0 % 256); 26308#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 26307#L93-1 assume !(3 == mp_add_~i~0 % 256); 26306#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26305#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26304#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 26303#L76 assume !(0 == mp_add_~i~0 % 256); 26302#L76-2 assume !(1 == mp_add_~i~0 % 256); 26301#L77-1 assume !(2 == mp_add_~i~0 % 256); 26300#L78-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 26299#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 26213#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 26199#L87-1 assume !(0 == mp_add_~i~0 % 256); 26190#L91-1 assume !(1 == mp_add_~i~0 % 256); 26188#L92-1 assume !(2 == mp_add_~i~0 % 256); 26189#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 26200#L94-1 [2021-08-27 14:38:15,917 INFO L793 eck$LassoCheckResult]: Loop: 26200#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26196#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26197#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 26214#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26209#L82 assume !(0 == mp_add_~i~0 % 256); 26210#L82-2 assume !(1 == mp_add_~i~0 % 256); 26218#L83-1 assume !(2 == mp_add_~i~0 % 256); 26219#L84-1 assume !(3 == mp_add_~i~0 % 256); 26290#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 26289#L87-1 assume !(0 == mp_add_~i~0 % 256); 26288#L91-1 assume !(1 == mp_add_~i~0 % 256); 26287#L92-1 assume !(2 == mp_add_~i~0 % 256); 26203#L93-1 assume !(3 == mp_add_~i~0 % 256); 26200#L94-1 [2021-08-27 14:38:15,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:15,918 INFO L82 PathProgramCache]: Analyzing trace with hash -820936562, now seen corresponding path program 1 times [2021-08-27 14:38:15,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:15,918 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912892882] [2021-08-27 14:38:15,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:15,918 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:16,250 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 47 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2021-08-27 14:38:16,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:38:16,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912892882] [2021-08-27 14:38:16,250 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912892882] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:16,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068729873] [2021-08-27 14:38:16,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:16,251 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:38:16,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:16,253 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:38:16,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2021-08-27 14:38:17,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:17,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 22 conjunts are in the unsatisfiable core [2021-08-27 14:38:17,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:38:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 46 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2021-08-27 14:38:18,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068729873] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:18,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:38:18,498 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2021-08-27 14:38:18,498 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74405858] [2021-08-27 14:38:18,498 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:38:18,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:18,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1233229496, now seen corresponding path program 3 times [2021-08-27 14:38:18,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:18,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912168968] [2021-08-27 14:38:18,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:18,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:18,505 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:18,511 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:18,911 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:38:18,912 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:38:18,912 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:38:18,912 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:38:18,912 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 14:38:18,912 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:18,912 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:38:18,912 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:38:18,912 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration29_Loop [2021-08-27 14:38:18,912 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:38:18,912 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:38:18,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:18,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:19,532 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:38:19,533 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 14:38:19,533 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:19,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:19,535 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-08-27 14:38:19,536 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-08-27 14:38:19,537 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 14:38:19,537 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:38:19,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (97)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:19,579 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:19,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:19,580 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:19,581 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-08-27 14:38:19,583 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 14:38:19,583 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:38:20,738 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 14:38:20,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (98)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:20,743 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:38:20,743 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:38:20,743 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:38:20,743 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:38:20,743 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:38:20,743 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:20,743 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:38:20,743 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:38:20,743 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration29_Loop [2021-08-27 14:38:20,743 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:38:20,743 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:38:20,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:20,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:21,242 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:38:21,242 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:38:21,243 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:21,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:21,244 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-08-27 14:38:21,245 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-08-27 14:38:21,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:21,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:21,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:21,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:21,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:21,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:21,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:21,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:21,259 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:21,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (99)] Ended with exit code 0 [2021-08-27 14:38:21,275 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:21,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:21,276 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-08-27 14:38:21,276 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-08-27 14:38:21,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:21,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:21,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:21,285 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:21,285 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:21,285 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:21,287 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:21,287 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:21,289 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:21,305 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-08-27 14:38:21,305 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-08-27 14:38:21,305 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:21,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:21,306 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-08-27 14:38:21,306 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-08-27 14:38:21,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:21,314 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:21,315 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:21,315 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:21,315 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:21,315 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:21,320 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:21,320 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:21,324 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:21,339 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-08-27 14:38:21,339 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:21,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:21,340 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-08-27 14:38:21,341 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-08-27 14:38:21,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:21,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:21,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:21,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:21,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:21,349 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:21,351 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:21,351 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:21,354 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:21,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (102)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:21,369 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-08-27 14:38:21,369 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:21,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:21,370 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-08-27 14:38:21,370 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-08-27 14:38:21,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:21,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:21,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:21,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:21,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:21,379 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:21,387 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:21,387 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:21,391 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:21,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (103)] Ended with exit code 0 [2021-08-27 14:38:21,406 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:21,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:21,407 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:38:21,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Waiting until timeout for monitored process [2021-08-27 14:38:21,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:21,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:21,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:21,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:21,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:21,416 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:21,420 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:21,420 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:21,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:21,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (104)] Ended with exit code 0 [2021-08-27 14:38:21,438 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-08-27 14:38:21,438 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:21,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:21,439 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-08-27 14:38:21,439 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-08-27 14:38:21,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:21,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:21,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:21,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:21,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:21,449 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:21,458 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:21,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:21,463 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:21,479 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-08-27 14:38:21,479 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:21,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:21,480 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-08-27 14:38:21,480 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-08-27 14:38:21,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:21,490 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:21,490 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:21,490 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:21,490 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:21,490 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:21,496 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:21,496 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:21,513 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:21,535 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-08-27 14:38:21,535 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-08-27 14:38:21,536 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:21,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:21,536 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-08-27 14:38:21,537 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-08-27 14:38:21,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:21,545 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:21,545 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:21,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:21,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:21,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:21,545 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:21,551 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:21,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:21,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:21,610 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-08-27 14:38:21,610 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:21,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:21,611 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-08-27 14:38:21,611 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-08-27 14:38:21,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-08-27 14:38:21,620 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:21,620 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:21,620 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:21,620 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:21,620 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:21,620 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:21,623 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:21,623 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:21,626 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:21,641 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-08-27 14:38:21,641 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-08-27 14:38:21,642 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:21,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:21,642 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-08-27 14:38:21,643 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-08-27 14:38:21,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-08-27 14:38:21,652 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:21,652 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-27 14:38:21,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:21,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:21,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:21,652 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:21,660 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:21,660 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:21,668 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:21,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (109)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:21,684 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:21,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:21,685 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-08-27 14:38:21,685 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-08-27 14:38:21,687 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:21,694 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:21,694 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-27 14:38:21,694 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:21,694 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:21,694 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:21,694 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:21,699 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:21,699 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:21,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:21,720 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-08-27 14:38:21,721 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-08-27 14:38:21,721 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:21,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:21,721 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-08-27 14:38:21,722 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-08-27 14:38:21,724 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:21,732 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:21,732 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:21,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:21,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:21,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:21,732 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:21,743 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:21,743 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:21,757 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:21,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (111)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:21,773 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:21,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:21,774 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-08-27 14:38:21,774 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-08-27 14:38:21,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:21,783 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:21,783 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:21,783 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:21,784 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:21,784 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:21,784 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:21,789 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:21,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:21,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:21,813 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-08-27 14:38:21,813 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-08-27 14:38:21,813 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:21,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:21,814 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-08-27 14:38:21,815 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-08-27 14:38:21,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:21,823 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:21,823 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:21,823 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:21,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:21,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:21,823 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:21,831 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:21,831 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:21,836 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:21,853 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-08-27 14:38:21,853 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:21,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:21,854 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-08-27 14:38:21,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:21,874 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:21,874 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:21,874 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:21,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:21,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:21,875 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:21,879 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:21,880 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:21,885 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-08-27 14:38:21,890 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:21,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (114)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:21,913 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-08-27 14:38:21,913 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:21,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:21,914 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-08-27 14:38:21,915 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-08-27 14:38:21,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:21,927 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:21,927 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:21,927 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:21,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:21,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:21,927 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-27 14:38:21,943 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:21,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:21,962 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:21,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (115)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:21,999 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:21,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:22,000 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-08-27 14:38:22,001 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-08-27 14:38:22,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-08-27 14:38:22,042 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:22,042 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:22,043 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:22,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:22,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:22,043 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-27 14:38:22,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:22,050 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:22,065 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:22,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (116)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:22,081 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:38:22,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-08-27 14:38:22,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2021-08-27 14:38:22,082 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. cyclomatic complexity: 11 Second operand has 15 states, 15 states have (on average 6.266666666666667) internal successors, (94), 15 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-08-27 14:38:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:38:24,038 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2021-08-27 14:38:24,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-27 14:38:24,039 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 157 states and 162 transitions. [2021-08-27 14:38:24,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-08-27 14:38:24,040 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 157 states to 120 states and 125 transitions. [2021-08-27 14:38:24,040 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 120 [2021-08-27 14:38:24,040 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 120 [2021-08-27 14:38:24,040 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 125 transitions. [2021-08-27 14:38:24,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:38:24,040 INFO L681 BuchiCegarLoop]: Abstraction has 120 states and 125 transitions. [2021-08-27 14:38:24,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 125 transitions. [2021-08-27 14:38:24,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2021-08-27 14:38:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 114 states have (on average 1.043859649122807) internal successors, (119), 113 states have internal predecessors, (119), 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-08-27 14:38:24,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2021-08-27 14:38:24,042 INFO L704 BuchiCegarLoop]: Abstraction has 114 states and 119 transitions. [2021-08-27 14:38:24,042 INFO L587 BuchiCegarLoop]: Abstraction has 114 states and 119 transitions. [2021-08-27 14:38:24,042 INFO L425 BuchiCegarLoop]: ======== Iteration 30============ [2021-08-27 14:38:24,042 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 114 states and 119 transitions. [2021-08-27 14:38:24,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-08-27 14:38:24,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:38:24,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:38:24,043 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 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] [2021-08-27 14:38:24,044 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:38:24,044 INFO L791 eck$LassoCheckResult]: Stem: 26723#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 26717#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 26710#L51 assume !(0 == mp_add_~a3~0 % 256); 26711#L51-1 mp_add_~nb~0 := 4; 26712#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 26713#L63 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 26714#L65 assume !(0 == mp_add_~b1~0 % 256); 26720#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 26721#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26765#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 26764#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 26763#L76-2 assume !(1 == mp_add_~i~0 % 256); 26762#L77-1 assume !(2 == mp_add_~i~0 % 256); 26761#L78-1 assume !(3 == mp_add_~i~0 % 256); 26760#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26731#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 26732#L82-2 assume !(1 == mp_add_~i~0 % 256); 26757#L83-1 assume !(2 == mp_add_~i~0 % 256); 26756#L84-1 assume !(3 == mp_add_~i~0 % 256); 26755#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 26754#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 26753#L91-1 assume !(1 == mp_add_~i~0 % 256); 26752#L92-1 assume !(2 == mp_add_~i~0 % 256); 26751#L93-1 assume !(3 == mp_add_~i~0 % 256); 26750#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26749#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26748#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 26747#L76 assume !(0 == mp_add_~i~0 % 256); 26746#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 26745#L77-1 assume !(2 == mp_add_~i~0 % 256); 26744#L78-1 assume !(3 == mp_add_~i~0 % 256); 26743#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26742#L82 assume !(0 == mp_add_~i~0 % 256); 26741#L82-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 26739#L83-1 assume !(2 == mp_add_~i~0 % 256); 26740#L84-1 assume !(3 == mp_add_~i~0 % 256); 26728#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 26729#L87-1 assume !(0 == mp_add_~i~0 % 256); 26816#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 26815#L92-1 assume !(2 == mp_add_~i~0 % 256); 26814#L93-1 assume !(3 == mp_add_~i~0 % 256); 26719#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26715#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26716#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 26735#L76 assume !(0 == mp_add_~i~0 % 256); 26724#L76-2 assume !(1 == mp_add_~i~0 % 256); 26725#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 26809#L78-1 assume !(3 == mp_add_~i~0 % 256); 26808#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 26807#L81 assume mp_add_~partial_sum~0 % 65536 > 255;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 26805#L87-1 assume !(0 == mp_add_~i~0 % 256); 26803#L91-1 assume !(1 == mp_add_~i~0 % 256); 26801#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 26799#L93-1 assume !(3 == mp_add_~i~0 % 256); 26797#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26795#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26793#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 26791#L76 assume !(0 == mp_add_~i~0 % 256); 26789#L76-2 assume !(1 == mp_add_~i~0 % 256); 26787#L77-1 assume !(2 == mp_add_~i~0 % 256); 26785#L78-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 26783#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 26780#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 26781#L87-1 assume !(0 == mp_add_~i~0 % 256); 26820#L91-1 assume !(1 == mp_add_~i~0 % 256); 26819#L92-1 assume !(2 == mp_add_~i~0 % 256); 26770#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 26771#L94-1 [2021-08-27 14:38:24,044 INFO L793 eck$LassoCheckResult]: Loop: 26771#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 26818#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 26817#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 26758#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 26759#L82 assume !(0 == mp_add_~i~0 % 256); 26736#L82-2 assume !(1 == mp_add_~i~0 % 256); 26737#L83-1 assume !(2 == mp_add_~i~0 % 256); 26733#L84-1 assume !(3 == mp_add_~i~0 % 256); 26734#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 26779#L87-1 assume !(0 == mp_add_~i~0 % 256); 26777#L91-1 assume !(1 == mp_add_~i~0 % 256); 26775#L92-1 assume !(2 == mp_add_~i~0 % 256); 26772#L93-1 assume !(3 == mp_add_~i~0 % 256); 26771#L94-1 [2021-08-27 14:38:24,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:24,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1140638096, now seen corresponding path program 1 times [2021-08-27 14:38:24,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:24,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75166929] [2021-08-27 14:38:24,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:24,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-27 14:38:24,256 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:38:24,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75166929] [2021-08-27 14:38:24,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75166929] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:24,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104918910] [2021-08-27 14:38:24,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:24,256 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:38:24,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:24,258 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:38:24,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2021-08-27 14:38:25,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:25,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 15 conjunts are in the unsatisfiable core [2021-08-27 14:38:25,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:38:25,944 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 57 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2021-08-27 14:38:25,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104918910] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:25,944 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:38:25,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2021-08-27 14:38:25,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329044507] [2021-08-27 14:38:25,946 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:38:25,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:25,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1233229496, now seen corresponding path program 4 times [2021-08-27 14:38:25,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:25,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372100017] [2021-08-27 14:38:25,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:25,947 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:25,959 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:25,984 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:26,332 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:38:26,332 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:38:26,332 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:38:26,332 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:38:26,332 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 14:38:26,332 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:26,332 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:38:26,332 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:38:26,332 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration30_Loop [2021-08-27 14:38:26,333 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:38:26,333 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:38:26,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:26,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:26,834 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:38:26,834 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 14:38:26,835 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:26,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:26,836 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-08-27 14:38:26,836 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-08-27 14:38:26,838 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 14:38:26,838 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:38:26,879 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-08-27 14:38:26,880 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:26,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:26,880 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-08-27 14:38:26,881 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-08-27 14:38:26,883 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 14:38:26,883 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:38:28,172 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 14:38:28,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (119)] Ended with exit code 0 [2021-08-27 14:38:28,177 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:38:28,177 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:38:28,177 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:38:28,177 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:38:28,177 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:38:28,177 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:28,177 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:38:28,177 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:38:28,177 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration30_Loop [2021-08-27 14:38:28,177 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:38:28,177 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:38:28,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:28,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-08-27 14:38:28,658 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:38:28,658 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:38:28,658 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:28,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:28,660 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-08-27 14:38:28,661 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-08-27 14:38:28,663 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:28,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:28,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:28,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:28,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:28,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:28,673 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:28,673 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:28,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:28,691 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-08-27 14:38:28,692 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:28,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:28,692 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-08-27 14:38:28,693 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-08-27 14:38:28,695 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:28,700 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:28,701 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:28,701 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:28,701 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:28,701 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:28,703 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:28,703 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:28,708 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:28,723 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-08-27 14:38:28,724 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-08-27 14:38:28,724 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:28,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:28,724 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-08-27 14:38:28,725 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-08-27 14:38:28,727 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:28,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:28,733 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:28,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:28,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:28,733 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:28,739 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:28,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:28,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:28,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (122)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:28,764 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:28,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:28,765 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-08-27 14:38:28,765 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-08-27 14:38:28,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:28,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:28,774 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:28,774 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:28,774 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:28,774 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:28,777 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:28,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:28,780 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:28,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (123)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:28,795 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-08-27 14:38:28,795 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:28,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:28,795 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-08-27 14:38:28,796 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-08-27 14:38:28,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:28,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:28,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:28,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:28,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:28,805 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:28,812 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:28,812 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:28,817 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:28,832 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-08-27 14:38:28,833 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:28,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:28,833 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-08-27 14:38:28,834 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-08-27 14:38:28,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:28,842 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:28,842 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:28,842 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:28,842 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:28,842 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:28,846 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:28,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:28,849 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:28,865 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-08-27 14:38:28,865 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-08-27 14:38:28,865 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:28,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:28,866 INFO L229 MonitoredProcess]: Starting monitored process 126 with /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-08-27 14:38:28,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Waiting until timeout for monitored process [2021-08-27 14:38:28,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:28,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:28,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:28,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:28,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:28,877 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:28,886 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:28,886 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:28,892 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:28,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (126)] Ended with exit code 0 [2021-08-27 14:38:28,907 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:28,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:28,908 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-08-27 14:38:28,909 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-08-27 14:38:28,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:28,918 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:28,918 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:28,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:28,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:28,919 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:28,923 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:28,923 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:28,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:28,941 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-08-27 14:38:28,942 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-08-27 14:38:28,942 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:28,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:28,943 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-08-27 14:38:28,945 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-08-27 14:38:28,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-08-27 14:38:28,954 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:28,954 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:28,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:28,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:28,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:28,954 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:28,960 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:28,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:28,966 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:28,981 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-08-27 14:38:28,981 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:28,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:28,982 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-08-27 14:38:28,982 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-08-27 14:38:28,984 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:28,991 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:28,991 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:28,991 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:28,991 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:28,991 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:28,991 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:28,994 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:28,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:28,997 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:29,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (129)] Ended with exit code 0 [2021-08-27 14:38:29,013 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-08-27 14:38:29,013 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:29,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:29,014 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-08-27 14:38:29,014 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-08-27 14:38:29,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:29,059 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:29,059 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-27 14:38:29,059 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:29,059 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:29,059 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:29,059 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:29,067 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:29,067 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:29,076 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:29,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (130)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:29,091 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:29,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:29,092 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-08-27 14:38:29,092 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-08-27 14:38:29,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:29,102 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:29,102 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-27 14:38:29,102 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:29,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:29,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:29,103 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:29,106 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:29,106 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:29,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:29,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (131)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:29,127 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-08-27 14:38:29,127 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:29,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:29,127 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-08-27 14:38:29,128 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-08-27 14:38:29,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:29,138 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:29,139 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:29,139 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:29,139 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:29,139 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:29,139 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:29,161 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:29,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:29,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:29,211 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-08-27 14:38:29,211 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:29,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:29,212 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-08-27 14:38:29,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:29,236 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:29,236 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:29,236 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:29,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:29,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:29,236 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:29,243 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:29,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:29,248 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-08-27 14:38:29,268 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:29,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (133)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:29,301 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-08-27 14:38:29,301 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:29,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:29,302 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-08-27 14:38:29,303 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-08-27 14:38:29,304 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:29,313 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:29,314 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:29,314 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:29,314 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:29,314 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:29,314 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:29,324 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:29,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:29,340 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:29,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (134)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:29,364 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:29,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:29,365 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-08-27 14:38:29,366 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-08-27 14:38:29,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:29,375 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:29,375 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:29,375 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:29,375 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:29,375 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:29,375 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:29,379 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:29,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:29,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:29,398 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-08-27 14:38:29,398 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-08-27 14:38:29,398 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:29,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:29,399 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-08-27 14:38:29,405 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-08-27 14:38:29,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:29,414 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:29,414 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:29,414 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:29,414 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:29,414 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:29,414 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-27 14:38:29,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:29,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:29,433 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:29,448 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-08-27 14:38:29,449 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:29,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:29,449 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-08-27 14:38:29,450 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-08-27 14:38:29,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-08-27 14:38:29,459 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:29,459 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:29,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:29,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:29,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:29,459 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-27 14:38:29,465 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:29,465 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:29,470 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:29,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (137)] Ended with exit code 0 [2021-08-27 14:38:29,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:38:29,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-27 14:38:29,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-08-27 14:38:29,486 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. cyclomatic complexity: 6 Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 10 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:38:29,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:38:29,714 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2021-08-27 14:38:29,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-27 14:38:29,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 110 transitions. [2021-08-27 14:38:29,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-08-27 14:38:29,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 108 states and 110 transitions. [2021-08-27 14:38:29,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 108 [2021-08-27 14:38:29,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 108 [2021-08-27 14:38:29,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 110 transitions. [2021-08-27 14:38:29,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:38:29,715 INFO L681 BuchiCegarLoop]: Abstraction has 108 states and 110 transitions. [2021-08-27 14:38:29,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 110 transitions. [2021-08-27 14:38:29,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 80. [2021-08-27 14:38:29,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.025) internal successors, (82), 79 states have internal predecessors, (82), 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-08-27 14:38:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2021-08-27 14:38:29,717 INFO L704 BuchiCegarLoop]: Abstraction has 80 states and 82 transitions. [2021-08-27 14:38:29,717 INFO L587 BuchiCegarLoop]: Abstraction has 80 states and 82 transitions. [2021-08-27 14:38:29,717 INFO L425 BuchiCegarLoop]: ======== Iteration 31============ [2021-08-27 14:38:29,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 82 transitions. [2021-08-27 14:38:29,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2021-08-27 14:38:29,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:38:29,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:38:29,717 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:38:29,717 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:38:29,718 INFO L791 eck$LassoCheckResult]: Stem: 27159#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(15); 27152#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~ret4, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~b~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~a~0 := 234770789;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 27147#L51 assume !(0 == mp_add_~a3~0 % 256); 27148#L51-1 mp_add_~nb~0 := 4; 27149#L61 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 27150#L63 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 27151#L65 assume !(0 == mp_add_~b1~0 % 256); 27157#L61-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 27158#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27183#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27182#L76 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 27181#L76-2 assume !(1 == mp_add_~i~0 % 256); 27180#L77-1 assume !(2 == mp_add_~i~0 % 256); 27179#L78-1 assume !(3 == mp_add_~i~0 % 256); 27178#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27177#L82 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 27168#L82-2 assume !(1 == mp_add_~i~0 % 256); 27169#L83-1 assume !(2 == mp_add_~i~0 % 256); 27167#L84-1 assume !(3 == mp_add_~i~0 % 256); 27163#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 27155#L87-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 27144#L91-1 assume !(1 == mp_add_~i~0 % 256); 27145#L92-1 assume !(2 == mp_add_~i~0 % 256); 27146#L93-1 assume !(3 == mp_add_~i~0 % 256); 27156#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27153#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27154#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27170#L76 assume !(0 == mp_add_~i~0 % 256); 27189#L76-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 27187#L77-1 assume !(2 == mp_add_~i~0 % 256); 27184#L78-1 assume !(3 == mp_add_~i~0 % 256); 27185#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27165#L82 assume !(0 == mp_add_~i~0 % 256); 27166#L82-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 27172#L83-1 assume !(2 == mp_add_~i~0 % 256); 27173#L84-1 assume !(3 == mp_add_~i~0 % 256); 27223#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 27222#L87-1 assume !(0 == mp_add_~i~0 % 256); 27221#L91-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 27220#L92-1 assume !(2 == mp_add_~i~0 % 256); 27219#L93-1 assume !(3 == mp_add_~i~0 % 256); 27217#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27215#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27213#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27174#L76 assume !(0 == mp_add_~i~0 % 256); 27160#L76-2 assume !(1 == mp_add_~i~0 % 256); 27161#L77-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 27162#L78-1 assume !(3 == mp_add_~i~0 % 256); 27164#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 27171#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 27218#L87-1 assume !(0 == mp_add_~i~0 % 256); 27216#L91-1 assume !(1 == mp_add_~i~0 % 256); 27214#L92-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 27212#L93-1 assume !(3 == mp_add_~i~0 % 256); 27211#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27210#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27209#L75 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27208#L76 assume !(0 == mp_add_~i~0 % 256); 27207#L76-2 assume !(1 == mp_add_~i~0 % 256); 27205#L77-1 assume !(2 == mp_add_~i~0 % 256); 27203#L78-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 27201#L75-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 27199#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 27197#L87-1 assume !(0 == mp_add_~i~0 % 256); 27195#L91-1 assume !(1 == mp_add_~i~0 % 256); 27193#L92-1 assume !(2 == mp_add_~i~0 % 256); 27191#L93-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 27190#L94-1 [2021-08-27 14:38:29,718 INFO L793 eck$LassoCheckResult]: Loop: 27190#L94-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27188#L72-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27186#L75 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 27175#L75-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 27176#L82 assume !(0 == mp_add_~i~0 % 256); 27206#L82-2 assume !(1 == mp_add_~i~0 % 256); 27204#L83-1 assume !(2 == mp_add_~i~0 % 256); 27202#L84-1 assume !(3 == mp_add_~i~0 % 256); 27200#L81 assume !(mp_add_~partial_sum~0 % 65536 > 255); 27198#L87-1 assume !(0 == mp_add_~i~0 % 256); 27196#L91-1 assume !(1 == mp_add_~i~0 % 256); 27194#L92-1 assume !(2 == mp_add_~i~0 % 256); 27192#L93-1 assume !(3 == mp_add_~i~0 % 256); 27190#L94-1 [2021-08-27 14:38:29,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:29,718 INFO L82 PathProgramCache]: Analyzing trace with hash -151906736, now seen corresponding path program 1 times [2021-08-27 14:38:29,718 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:29,718 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308882575] [2021-08-27 14:38:29,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:29,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:29,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:29,736 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:29,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:29,762 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:29,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:29,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1233229496, now seen corresponding path program 5 times [2021-08-27 14:38:29,763 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:29,763 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354350958] [2021-08-27 14:38:29,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:29,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:29,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:29,768 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:38:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:38:29,783 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:38:29,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:38:29,783 INFO L82 PathProgramCache]: Analyzing trace with hash -611234983, now seen corresponding path program 1 times [2021-08-27 14:38:29,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:38:29,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490334675] [2021-08-27 14:38:29,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:29,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:38:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 83 proven. 12 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-27 14:38:30,127 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:38:30,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490334675] [2021-08-27 14:38:30,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490334675] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:30,127 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302826314] [2021-08-27 14:38:30,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:38:30,128 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:38:30,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:30,129 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:38:30,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process [2021-08-27 14:38:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:38:31,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 14:38:31,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:38:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 91 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-27 14:38:32,082 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302826314] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:38:32,082 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:38:32,082 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2021-08-27 14:38:32,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272175390] [2021-08-27 14:38:32,556 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:38:32,556 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:38:32,557 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:38:32,557 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:38:32,557 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-08-27 14:38:32,557 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:32,557 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:38:32,557 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:38:32,557 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration31_Loop [2021-08-27 14:38:32,557 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:38:32,557 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:38:32,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-08-27 14:38:32,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:33,171 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:38:33,171 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-08-27 14:38:33,171 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:33,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:33,172 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-08-27 14:38:33,173 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-08-27 14:38:33,174 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 14:38:33,174 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:38:33,187 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2021-08-27 14:38:33,187 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~carry~0=0} Honda state: {ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~carry~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2021-08-27 14:38:33,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (139)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:33,202 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:33,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:33,202 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-08-27 14:38:33,203 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-08-27 14:38:33,205 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-08-27 14:38:33,205 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:38:33,254 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-08-27 14:38:33,254 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:33,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:33,255 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-08-27 14:38:33,255 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-08-27 14:38:33,257 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-08-27 14:38:33,257 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-08-27 14:38:34,854 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-08-27 14:38:34,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (141)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:34,859 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:38:34,859 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:38:34,859 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:38:34,859 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:38:34,859 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:38:34,859 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:34,859 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:38:34,859 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:38:34,859 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration31_Loop [2021-08-27 14:38:34,859 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:38:34,859 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:38:34,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:34,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:38:35,343 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:38:35,343 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:38:35,343 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:35,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:35,345 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-08-27 14:38:35,345 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-08-27 14:38:35,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:35,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:35,354 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:35,354 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:35,354 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:35,354 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:35,358 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:35,358 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:35,360 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:35,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (142)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:35,376 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:35,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:35,377 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-08-27 14:38:35,377 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-08-27 14:38:35,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:35,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:35,386 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:35,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:35,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:35,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:38:35,388 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:38:35,388 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:35,390 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:35,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (143)] Ended with exit code 0 [2021-08-27 14:38:35,405 INFO L490 LassoAnalysis]: Using template '2-nested'. [2021-08-27 14:38:35,406 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:35,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:35,406 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-08-27 14:38:35,407 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-08-27 14:38:35,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:35,416 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:35,416 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:35,416 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:35,416 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:35,416 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:35,422 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:35,422 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:35,425 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:35,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (144)] Ended with exit code 0 [2021-08-27 14:38:35,443 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:35,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:35,444 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-08-27 14:38:35,445 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-08-27 14:38:35,446 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:35,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:35,453 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:35,454 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:35,454 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:35,454 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:35,456 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:35,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:35,459 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:35,475 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-08-27 14:38:35,475 INFO L490 LassoAnalysis]: Using template '3-nested'. [2021-08-27 14:38:35,475 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:35,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:35,476 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-08-27 14:38:35,476 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-08-27 14:38:35,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:35,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:35,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:35,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:35,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:35,486 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:35,494 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:35,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:35,498 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:35,514 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-08-27 14:38:35,514 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:35,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:35,515 INFO L229 MonitoredProcess]: Starting monitored process 147 with /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-08-27 14:38:35,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Waiting until timeout for monitored process [2021-08-27 14:38:35,517 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:35,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:35,525 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:35,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:35,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:35,525 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:35,528 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:35,528 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:35,531 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:35,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (147)] Ended with exit code 0 [2021-08-27 14:38:35,547 INFO L490 LassoAnalysis]: Using template '4-nested'. [2021-08-27 14:38:35,547 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:35,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:35,548 INFO L229 MonitoredProcess]: Starting monitored process 148 with /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-08-27 14:38:35,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Waiting until timeout for monitored process [2021-08-27 14:38:35,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:35,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:35,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:35,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:35,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:35,559 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:35,568 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:35,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:35,574 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:35,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (148)] Ended with exit code 0 [2021-08-27 14:38:35,589 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:35,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:35,590 INFO L229 MonitoredProcess]: Starting monitored process 149 with /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-08-27 14:38:35,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Waiting until timeout for monitored process [2021-08-27 14:38:35,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:35,600 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:38:35,600 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:35,600 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:35,600 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:35,600 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:35,604 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:35,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:35,608 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:35,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (149)] Ended with exit code 0 [2021-08-27 14:38:35,624 INFO L490 LassoAnalysis]: Using template '2-phase'. [2021-08-27 14:38:35,624 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:35,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:35,625 INFO L229 MonitoredProcess]: Starting monitored process 150 with /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-08-27 14:38:35,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Waiting until timeout for monitored process [2021-08-27 14:38:35,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:35,634 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:35,634 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:35,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:35,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:35,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:35,635 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:35,640 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:35,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:35,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:35,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (150)] Ended with exit code 0 [2021-08-27 14:38:35,661 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:35,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:35,662 INFO L229 MonitoredProcess]: Starting monitored process 151 with /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-08-27 14:38:35,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Waiting until timeout for monitored process [2021-08-27 14:38:35,664 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:35,672 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:35,672 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:35,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:35,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:35,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:35,672 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2021-08-27 14:38:35,675 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2021-08-27 14:38:35,675 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:35,678 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:35,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (151)] Ended with exit code 0 [2021-08-27 14:38:35,696 INFO L490 LassoAnalysis]: Using template '3-phase'. [2021-08-27 14:38:35,696 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:35,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:35,697 INFO L229 MonitoredProcess]: Starting monitored process 152 with /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-08-27 14:38:35,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Waiting until timeout for monitored process [2021-08-27 14:38:35,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-08-27 14:38:35,707 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:35,707 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-27 14:38:35,707 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:35,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:35,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:35,707 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:35,715 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:35,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:35,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:35,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (152)] Ended with exit code 0 [2021-08-27 14:38:35,738 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:35,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:35,739 INFO L229 MonitoredProcess]: Starting monitored process 153 with /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-08-27 14:38:35,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Waiting until timeout for monitored process [2021-08-27 14:38:35,741 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:35,749 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:35,749 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2021-08-27 14:38:35,749 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:35,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:35,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:35,749 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:35,753 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:35,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:35,758 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:35,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (153)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:35,773 INFO L490 LassoAnalysis]: Using template '4-phase'. [2021-08-27 14:38:35,773 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:35,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:35,774 INFO L229 MonitoredProcess]: Starting monitored process 154 with /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-08-27 14:38:35,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Waiting until timeout for monitored process [2021-08-27 14:38:35,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:35,784 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:35,784 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:35,785 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:35,785 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:35,785 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:35,785 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:35,794 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:35,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:35,808 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:35,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (154)] Ended with exit code 0 [2021-08-27 14:38:35,823 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:35,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:35,824 INFO L229 MonitoredProcess]: Starting monitored process 155 with /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-08-27 14:38:35,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Waiting until timeout for monitored process [2021-08-27 14:38:35,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:35,834 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:35,834 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:35,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:35,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:35,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:35,834 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2021-08-27 14:38:35,839 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2021-08-27 14:38:35,839 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:35,846 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:35,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (155)] Ended with exit code 0 [2021-08-27 14:38:35,861 INFO L490 LassoAnalysis]: Using template '2-lex'. [2021-08-27 14:38:35,861 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:35,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:35,862 INFO L229 MonitoredProcess]: Starting monitored process 156 with /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-08-27 14:38:35,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Waiting until timeout for monitored process [2021-08-27 14:38:35,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:35,871 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:35,871 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:35,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:35,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:35,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:35,871 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:35,883 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:35,883 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:35,893 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:35,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (156)] Ended with exit code 0 [2021-08-27 14:38:35,909 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:35,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:35,909 INFO L229 MonitoredProcess]: Starting monitored process 157 with /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-08-27 14:38:35,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Waiting until timeout for monitored process [2021-08-27 14:38:35,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:35,918 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:35,919 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2021-08-27 14:38:35,919 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:35,919 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:35,919 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:35,919 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2021-08-27 14:38:35,922 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-08-27 14:38:35,922 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:35,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:35,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (157)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:35,941 INFO L490 LassoAnalysis]: Using template '3-lex'. [2021-08-27 14:38:35,941 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:35,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:35,942 INFO L229 MonitoredProcess]: Starting monitored process 158 with /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-08-27 14:38:35,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Waiting until timeout for monitored process [2021-08-27 14:38:35,944 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:38:35,951 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:35,951 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:35,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:35,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:35,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:35,952 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-27 14:38:35,963 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:35,963 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:35,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:35,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (158)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:35,986 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:38:35,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:38:35,987 INFO L229 MonitoredProcess]: Starting monitored process 159 with /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-08-27 14:38:35,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Waiting until timeout for monitored process [2021-08-27 14:38:35,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of 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-08-27 14:38:35,997 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2021-08-27 14:38:35,997 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2021-08-27 14:38:35,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:38:35,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:38:35,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:38:35,998 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2021-08-27 14:38:36,006 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:38:36,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:38:36,030 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:38:36,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (159)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:36,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:38:36,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-27 14:38:36,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-08-27 14:38:36,046 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. cyclomatic complexity: 3 Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 12 states have internal predecessors, (82), 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-08-27 14:38:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:38:37,167 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2021-08-27 14:38:37,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-27 14:38:37,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 72 transitions. [2021-08-27 14:38:37,167 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 14:38:37,167 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 0 states and 0 transitions. [2021-08-27 14:38:37,167 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 14:38:37,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 14:38:37,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 14:38:37,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:38:37,167 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 14:38:37,167 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 14:38:37,167 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 14:38:37,167 INFO L425 BuchiCegarLoop]: ======== Iteration 32============ [2021-08-27 14:38:37,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 14:38:37,168 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 14:38:37,168 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 14:38:37,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 02:38:37 BoogieIcfgContainer [2021-08-27 14:38:37,172 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 14:38:37,172 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 14:38:37,172 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 14:38:37,173 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 14:38:37,173 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:36:24" (3/4) ... [2021-08-27 14:38:37,174 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 14:38:37,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 14:38:37,176 INFO L168 Benchmark]: Toolchain (without parser) took 133394.61 ms. Allocated memory was 62.9 MB in the beginning and 247.5 MB in the end (delta: 184.5 MB). Free memory was 43.5 MB in the beginning and 74.4 MB in the end (delta: -31.0 MB). Peak memory consumption was 152.5 MB. Max. memory is 16.1 GB. [2021-08-27 14:38:37,176 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 62.9 MB. Free memory was 45.3 MB in the beginning and 45.2 MB in the end (delta: 84.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:38:37,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.96 ms. Allocated memory is still 62.9 MB. Free memory was 43.3 MB in the beginning and 45.6 MB in the end (delta: -2.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 14:38:37,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.40 ms. Allocated memory is still 62.9 MB. Free memory was 45.3 MB in the beginning and 43.7 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:38:37,177 INFO L168 Benchmark]: Boogie Preprocessor took 49.18 ms. Allocated memory is still 62.9 MB. Free memory was 43.7 MB in the beginning and 42.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:38:37,177 INFO L168 Benchmark]: RCFGBuilder took 495.91 ms. Allocated memory was 62.9 MB in the beginning and 75.5 MB in the end (delta: 12.6 MB). Free memory was 42.3 MB in the beginning and 51.5 MB in the end (delta: -9.2 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. [2021-08-27 14:38:37,177 INFO L168 Benchmark]: BuchiAutomizer took 132537.22 ms. Allocated memory was 75.5 MB in the beginning and 247.5 MB in the end (delta: 172.0 MB). Free memory was 51.5 MB in the beginning and 75.5 MB in the end (delta: -24.0 MB). Peak memory consumption was 147.7 MB. Max. memory is 16.1 GB. [2021-08-27 14:38:37,177 INFO L168 Benchmark]: Witness Printer took 2.20 ms. Allocated memory is still 247.5 MB. Free memory was 75.5 MB in the beginning and 74.4 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:38:37,179 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 62.9 MB. Free memory was 45.3 MB in the beginning and 45.2 MB in the end (delta: 84.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 262.96 ms. Allocated memory is still 62.9 MB. Free memory was 43.3 MB in the beginning and 45.6 MB in the end (delta: -2.3 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 42.40 ms. Allocated memory is still 62.9 MB. Free memory was 45.3 MB in the beginning and 43.7 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.18 ms. Allocated memory is still 62.9 MB. Free memory was 43.7 MB in the beginning and 42.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 495.91 ms. Allocated memory was 62.9 MB in the beginning and 75.5 MB in the end (delta: 12.6 MB). Free memory was 42.3 MB in the beginning and 51.5 MB in the end (delta: -9.2 MB). Peak memory consumption was 16.5 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 132537.22 ms. Allocated memory was 75.5 MB in the beginning and 247.5 MB in the end (delta: 172.0 MB). Free memory was 51.5 MB in the beginning and 75.5 MB in the end (delta: -24.0 MB). Peak memory consumption was 147.7 MB. Max. memory is 16.1 GB. * Witness Printer took 2.20 ms. Allocated memory is still 247.5 MB. Free memory was 75.5 MB in the beginning and 74.4 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 31 terminating modules (31 trivial, 0 deterministic, 0 nondeterministic). 31 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 132.4s and 32 iterations. TraceHistogramMax:7. Analysis of lassos took 63.1s. Construction of modules took 58.5s. Büchi inclusion checks took 10.2s. Highest rank in rank-based complementation 0. Minimization of det autom 31. Minimization of nondet autom 0. Automata minimization 204.1ms AutomataMinimizationTime, 30 MinimizatonAttempts, 4534 StatesRemovedByMinimization, 29 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 1001 states and ocurred in iteration 23. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1304 SDtfs, 4037 SDslu, 2459 SDs, 0 SdLazy, 8610 SolverSat, 552 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 58566.8ms Time LassoAnalysisResults: nont0 unkn0 SFLI17 SFLT0 conc2 concLT0 SILN0 SILU5 SILI7 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital58 mio100 ax100 hnf100 lsp81 ukn100 mio100 lsp100 div393 bol100 ite100 ukn100 eq146 hnf47 smp69 dnf100 smp100 tf102 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 28ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 8.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-08-27 14:38:37,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:37,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Ended with exit code 0 [2021-08-27 14:38:37,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Ended with exit code 0 [2021-08-27 14:38:37,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2021-08-27 14:38:38,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:38,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:38,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2021-08-27 14:38:38,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:38,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:39,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2021-08-27 14:38:39,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:39,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:39,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-08-27 14:38:39,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2021-08-27 14:38:40,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-08-27 14:38:40,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...